-
Prof. Seokhee Hong, BDVA 2015, “Big Data Visual Analytics”, Tasmania, Australia, 2015, September.
-
Prof. Peter Eades, VINCI 2014, “Applying the weighted barycentre method to interactive graph visualization”, Sydney, Australia, 2014, August.
-
Prof. Peter Eades, VL/HCC 2014, “What is a Good Diagram?”, Melbourne, Australia, 2014, August.
-
Prof. Seokhee Hong, CGIV 2013, “Visual Analytics for Massive Complex Networks”, University of Macau, Macau, 2013, August.
-
Prof. Seokhee Hong, PacificVAST 2013, “Visual Analytics for Massive Complex Networks”, University of Sydney, Sydney, 2013, February.
-
A/Prof. Seokhee Hong, 2011 Winter School on Mathematical and Computational Biology, “Visualising and Analysing Massive Networks”, University of Queensland, Brisbane, 2011, July.
-
Prof. Peter Eades , The 18th International Symposium on Graph Drawing (GD2010), Konstanz, Germany.
-
A/Prof. Seokhee Hong, KOFST (Korean Federation of Science and Technology Societies) ULTRA (Universal Linkage for Top Research Advice) Workshop 2009, “Visualisation and Analysis of Large and Complex Networks”, Seoul, Korea, December. 2009.
-
A/Prof. Seokhee Hong, KOFST (Korean Federation of Science and Technology Societies) ULTRA (Universal Linkage for Top Research Advice) Program 2009 ¨C IT & Communication, “Visualisation and Analysis of Large and Complex Networks”, Sydney, October. 2009.
-
A/Prof. Seokhee Hong, 2009 Winter School on Mathematical and Computational Biology, “Visualisation and Analysis of Large and Complex Biological Networks”, University of Queensland, Brisbane, 2009, July.
-
Prof. Peter Eades, ISAAC 2009 (International Symposium on Algorithms and Computation), Gold Coast, Australia.
-
A/Prof. Seokhee Hong, 2008 RIMS Workshop on Acceleration and Visualisation of Computation for Enumeration Problems, “Visualisation and Analysis of Large and Complex Networks”, RIMS, Kyoto, Japan, 2008, September.
-
A/Prof. Seokhee Hong, IWAAG 2007, The International Workshop on Algorithms and Graphs, “Star-shaped Drawings of Graphs with Minimum Concave Corners”, Sendai, Japan, 2007, December.
-
A/Prof. Seokhee Hong, AWOCA 2006, “Theory and Practice of Graph Drawing”, 2006 July.
-
Prof. Peter Eades, IEEE InfoVis 2006 (IEEE Symposium on Information Visualisation), Baltimore&Maryland, USA.
-
A/Prof. Seokhee Hong, ACAL 2005, “Visualisation and Analysis of Large and Complex Networks”, 2005 December.
|
-
KAIST, Korea, “Theory and Practice of Graph Drawing: Visual Analytics of Massive Complex Networks”, 2013 Dec.
-
University of Konstanz, “Generalisation of Steinitz’s Theorem, Tutte Theorem and Fary’s Theorem”, 2013 Oct.
-
Technical University Dortmund, “Generalisation of Steinitz’s Theorem, Tutte’s Theorem and Fary’s Theorem”, 2013 June.
-
KAIST, Korea, “Recent Advances in Graph Drawing: Extending Steinitz’s Theorem, Fary’s Theorem and Tutte’s Barycenter Theorem”, 2012 Jan.
-
Seoul National University, Korea, “Recent Advances in Graph Drawing: Extending Steinitz’s Theorem, Fary’s Theorem and Tutte’s Barycenter Theorem”, 2012 Jan.
-
National Tshing Hua University, Taiwan, “Symmetric Drawings of Series Parallel Digraphs in Three Dimensions”, 2011, December.
-
KAIST, Korea, “Graph-theoretic Characterisation of Non-convex Polyhedra”, 2010 Jan.
-
Seoul National University, Korea, “Visualisation and Analysis of Large and Complex Networks”, 2010 Jan.
-
CYRAM, Korea, “Visualisation and Analysis of Large and Complex Networks”, 2010 Jan.
-
Postech, Korea, “Visualisation and Analysis of Large and Complex Networks”, 2009 Dec.
-
Yonsei University, Korea, “Visualisation and Analysis of Large and Complex Networks”, 2009 Dec.
-
University of Rome Tre, Italy, “Extending Convex Drawings of Graphs”, 2009, Oct.
-
National Taiwan University, Taiwan, “Visualisation and Analysis of Large and Complex Networks”, 2009, April.
-
National Taiwan University, Taiwan, “Extending Convex Drawings of Graphs”, 2009, April.
-
ACADEMIA SINICA, Taiwan, “Extending Convex Drawings of Graphs”, 2009, April.
-
National Tshing Hua University, Taiwan, “Visualisation and Analysis of Large and Complex Networks”, 2009, April.
-
KAIST, Korea, “Extending Convex Drawings of Graphs”, 2009, Jan.
-
Seoul National University, Korea, Extending Convex Drawings of Graphs”, 2009, Jan.
-
Ewha University, Korea, “Visualisation and Analysis of Large and Complex Networks”, 2009, Jan.
-
Kyoto University, Japan, “Extending Convex Drawings of Graphs”, 2008, Oct.
-
JAIST, Japan, “Visualisation and Analysis of Large and Complex Networks”, 2007, Nov.
-
JAIST, Japan, “Theory and Practice of 2.5D Graph Drawing”, 2007, Nov.
-
Kyoto University, Japan, “Theory and Practice of 2.5D Graph Drawing”, 2007, March.
-
Kyoto University, Japan, “Visualisation and Analysis of Large and Complex Networks”, 2007, March.
-
Tohoku University, Japan, “Theory and Practice of Graph Drawing: Visualisation and Analysis of Large and Complex Networks”, 2007, Jan.
-
KAIST, Korea, “Theory and Practice of Graph Drawing: Visualisation and Analysis of Large and Complex Networks”, 2007, Jan.
-
Seoul National University, Korea, “Theory and Practice of Graph Drawing: Visualisation and Analysis of Large and Complex Networks”, 2007, Jan.
-
CYRAM, Korea, “Visualisation and Analysis of Large and Complex Networks”, 2007, Jan.
-
IPK, Germany, “Visualisation and Analysis of Large and Complex Networks”, 2006 September.
-
University of Queensland, IMB, “Visualisation and Analysis of Large and Complex Networks”, 2006 June.
-
Charles Darwin University, “Theory and Practice of Graph Drawing”, 2006 June.
-
CORE Chrice Wallace Seminar, University of Sydney, “Theory and Practice of Graph Drawing”, 2006 April.
-
DSTO (Defence Science and Technology Organisation) Adelaide, “Visualisation and Analysis of Large and Complex Networks”, 2006 February.
-
Dagstuhl Seminar on Algorithmic Aspects of Large and Complex Networks, “Visualisation and Analysis of Large and Complex Scale-free Networks”, September, 2005.
-
University of Sydney, Basser Seminar Series, June, 2005, “Visualisation and Analysis of Large and Complex Networks”
-
Dagstuhl Seminar on Graph Drawing, “Visualisation and Analysis of Large and Complex Networks”, May, 2005.
-
Kyoto University, Japan, “Symmetric Graph Drawing: an overview”, March 2005.
-
Telstra Research Lab, Melbourne, “Visualisation and Analysis of Large and Complex Networks”, December 2004.
-
University of NSW, “Visualisation and Analysis of Large and Complex Networks”, November 2004.
-
Netmap Analytics, Sydney, “Visualisation and Analysis of Large and Complex Networks”, October 2004.
-
University of Karlsruhe, Germany, “The Metro Map Layout Problem”, May 2004.
-
University of Konstanz, Germany, “Symmetric Graph Drawing in Three Dimensions”, May 2004.
-
University of Lethbridge, Canada, “Symmetric Graph Drawing: a survey”, February 2004.
-
University of Victoria, Canada, “Symmetric Graph Drawing: a survey”, January, 2004.
-
JAIST, Japan, “Symmetric Graph Drawing in Two Dimensions”, February, 2003.
-
JAIST, Japan, “Symmetric Graph Drawing: a survey”, January, 2003.
-
KAIST, Korea, “Symmetric Graph Drawing”, January, 2003.
-
Seoul National University, Korea, “Graph Drawing and Information Visualisation”, January, 2003.
-
Brown University, USA, Department of Computer Science Seminar, “Drawing Planar Graphs Symmetrically”, March 19, 2001.
-
National Taiwan University, Taiwan, Department of Electrical Engineering Seminar, “Drawing Planar Graphs Symmetrically”, December 21, 2000.
-
University of Queensland, School of Computer Science and Electrical Engineering Seminar, “Algorithms for Finding Planar Geometric Automorphisms in Planar Graphs”, April 7, 2000.
-
Australian National University, Department of Computer Science Seminar, “Algorithms for Finding Planar Geometric Automorphisms in Planar Graphs”, March 29, 2000.
-
University of Western Australia, Department of Mathematics, Pure Mathematics Seminar, “Algorithms for Finding Planar Geometric Automorphisms in Planar Graphs”, March 22, 2000.
-
University of Cologne, Germany, “Drawing Series Parallel Digraphs Symmetrically”, February 1999.
-
Max-Planck-Institut fur Informatik, Saarbrucken, Germany, 1999. “Drawing Series Parallel Digraphs Symmetrically”, February 1999.
|