You are here: University of Sydney / Engineering & IT / About us / Our people / Professor Seok Hong 

Professor Seok Hong

M Sc PhD Ewha University, Seoul, Korea
2013 - 2016 ARC Future Fellowship (FT3)
School of Information Technologies

J12 - The School of Information Technologies
The University of Sydney

Telephone +61 2 9036 9710
Fax +61 2 9351 3838
Curriculum vitae Curriculum vitae

Biographical details

Professor Seok Hong is developing new, scalable algorithms to address information visualisation of massive complex networks. "These algorithms will enable security analysts to detect fraud, biologists to understand protein-protein interaction networks and give engineers new ways of understanding large software systems. My students learn the basic techniques and fundamental algorithms to create good visualisations of abstract information."

Back to Top

Awards and honours

Back to Top

Selected grants

2012

  • Algorithmics for Visual Analytics of Massive Complex Networks; Hong S; Australian Research Council (ARC)/Future Fellowships (FT).

2011

  • Visual Interaction Methods for Clustered Graphs; Eades P, Takatsuka M, Hong S; Australian Research Council (ARC)/Linkage Projects (LP).
  • LNK: 2011/Round1/ARC Linkage Project LP110100519 Visual Interaction Methods for Clustered Graphs; Hong S, Takatsuka M, Hirshorn J, Eades P; Tom Sawyer Software (USA)/Project Support.

2009

  • Scalable Visual Analytics for Uncertain Dynamic Networks; Eades P, Hong S; Australian Research Council/Discovery Projects (DP).

2008

  • Algorithmics for Interactive 2.5D Graph Drawing; Hong S; Australian Research Council (ARC)/Discovery Project.

2005

  • Topological approaches for three dimensional graph drawing; Eades P, Hong S; Australian Research Council (ARC)/Discovery Project.

2004

  • New Methods for Interactive Visualization of Large Microarray Data Sets; Eades P, Hong S; Australian Research Council (ARC)/Linkage (APAI only).
Back to Top

Selected publications

Download citations: PDF RTF Endnote

Book Chapters

  • Hong, S. (2011). Detection and Display of Symmetries. In Roberto Tamassia (Eds.), Handbook of Graph Drawing and Visualization. CRC Press.
  • Eades, P., Gutwenger, C., Hong, S., Mutzel, P. (2010). Graph Drawing Algorithms. In Mikhail J Atallah and Marina Blanton (Eds.), Algorithms and Theory of Computation Handbook: Special Topics and Techniques (2nd Ed). United States: CRC Press.
  • Ahmed, A., Fu, X., Hong, S., Nguyen, Q., Xu, K. (2010). Visual Analysis of History of World Cup: A Dynamic Network with Dynamic Hierarchy and Geographic Clustering. In Mao Lin Huang, Quang Vinh Nguyen, Kang Zhang (Eds.), Visual Information Communication, (pp. 25-39). New York: Springer.
  • Eades, P., Hong, S., Nesbitt, K., Takatsuka, M. (2006). Information Display. In Albert Y Zomaya (Eds.), Handbook of Nature-Inspired and Innovative Computing, (pp. 633-655). New York: Springer Science + Business Media.
  • Hong, S. (2004). Drawing Graphs. In D. Mehta and S. Sahni (Eds.), Handbook of Data Structures and Applications. CRC Press.
  • Hong, S., Buchheim, C. (2002). Crossing Minimization for Symmetries. In Prosenjit Bose Pat Morin (Eds.), Algorithms and Computation, (pp. 563-574). Berlin: Springer.
  • Hong, S., Eades, P. (2001). An Algorithm for Finding Three Dimensional Symmetry in Trees. In Patrick Healy & Nikola S Nikolov (Eds.), Graph Drawing: 13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, (pp. 360-371). United States: Springer.

Journals

  • Hong, S., Nagamochi, H. (2012). A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. Algorithmica: an international journal in computer science, 62(3-4), 1122-1158.
  • Di Giacomo, E., Didimo, W., Eades, P., Hong, S., Liotta, G. (2012). Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics, 160(1-2), 132-139.
  • Hong, S., Eades, P., Liotta, G., Poon, S. (2012). Fary's theorem for 1-planar graphs. Lecture Notes in Computer Science (LNCS), 7434, 335-346.
  • Hong, S., Nagamochi, H. (2012). Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. Theoretical Computer Science, 445(August), 36-51.
  • Hong, S., Nagamochi, H. (2012). Special Issue from ISAAC 2008. International Journal of Computational Geometry and Applications, 21(3), 251-252.
  • Brandes, U., Erten, C., Estrella-Balderrama, A., Fowler, J., Frati, F., Geyer, M., Gutwenger, C., Hong, S., Kaufmann, M., Kobourov, S., et al (2011). Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica: an international journal in computer science, 60(3), 569-592.
  • Hong, S., Nagamochi, H. (2011). Editorial: ISAAC 2008 Special Issue. Algorithmica: an international journal in computer science, 61(4), 777-778.
  • Hong, S., Nagamochi, H. (2011). Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. Algorithmica: an international journal in computer science, 61(4), 1022-1076.
  • Nguyen, Q., Eades, P., Hong, S., Huang, W. (2011). Large crossing angles in circular layouts. Lecture Notes in Computer Science (LNCS), 6502, 397-399.
  • Hong, S., Nagamochi, H. (2010). A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. Algorithmica: an international journal in computer science, 58(2), 433-460.
  • Hong, S., Nagamochi, H. (2010). An algorithm for constructing star-shaped drawings of plane graphs. Computational Geometry, 43(2), 191-206.
  • Hong, S., Nagamochi, H. (2010). Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. Algorithmica: an international journal in computer science, 58(2), 478-497.
  • Hong, S., Nagamochi, H. (2010). Convex drawings of hierarchical planar graphs and clustered planar graphs. Journal of Discrete Algorithms (Amsterdam), 8(3), 282-295.
  • Bachmaier, C., Buchner, H., Forster, M., Hong, S. (2010). Crossing minimization in extended level drawings of graphs. Discrete Applied Mathematics, 158(3), 159-179.
  • Grilli, L., Hong, S., Liotta, G., Meijer, H., Wismath, S. (2010). Matched drawability of graph pairs and of graph triples. Computational Geometry, 43(6-7), 611-634.
  • Fung, D., Wilkins, M., Hart, D., Hong, S. (2010). Using the clustered circular layout as an informative method for visualizing protein-protein interaction networks. Proteomics, 10(14), 2723-2727.
  • Hong, S., Mader, M. (2009). Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints. Lecture Notes in Computer Science (LNCS), 5417, 936-283.
  • Shen, X., Vande Moere, A., Eades, P., Hong, S. (2009). Issues for the Evaluation of Ambient Displays. International Journal of Ambient Computing and Intelligence, 1(2 (April- June)), 59-69.
  • Huang, W., Eades, P., Hong, S. (2009). Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization, 8(3), L169-152.
  • Hong, S., Nagamochi, H. (2009). New Approximation to the One-sided Radial Crossing Minimization. Journal of Graph Algorithms and Applications, 13(2), 179-196.
  • Imamichi, T., Arahori, Y., Gim, J., Hong, S., Nagamochi, H. (2009). Removing Node Overlaps Using Multi-sphere Scheme. Lecture Notes in Computer Science (LNCS), 5417, 296-301.
  • Hong, S., Nishizeki, T. (2009). Special Issue from GD 2007. Journal of Graph Algorithms and Applications, 13(3), 285-287.
  • Fung, D., Hong, S., Koschutzki, D., Schreiber, F., Xu, K. (2008). 2.5D Visualisation of Overlapping Biological Networks. Journal of Integrative Bioinformatics, 5(1), 1 doi:10.2390/biecoll-jib-2008-90-17.
  • Hong, S., Nagamochi, H. (2008). Convex drawings of graphs with non-convex boundary constraints. Discrete Applied Mathematics, 156(12), 2368-2380.
  • Hong, S. (2008). Special Issue on Selected Papers from the 6th Asia-Paci�?c Symposium on Visualisation APVIS 2007. Journal of Graph Algorithms and Applications, 12(3), 265-266.
  • Buchheim, C., Hong, S. (2008). Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica: an international journal in computer science, 52(4), 448-465.
  • Hong, S., Nikolov, N., Tarassov, A. (2007). A 2.5D Hierarchical Drawing of Directed Graphs. Journal of Graph Algorithms and Applications, 11(2), 371-396.
  • Huang, W., Hong, S., Eades, P. (2007). Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualisation. Journal of Graph Algorithms and Applications, 11(2), 397-429.
  • Abelson, D., Hong, S., Taylor, D. (2007). Geometric automorphism groups of graphs. Discrete Applied Mathematics, 155(17), 2211-2226.
  • Hong, S., McKay, B., Eades, P. (2006). A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs. Discrete and Computational Geometry, 36(2), 283-311.
  • Hong, S., Merrick, D., do Nascimento, H. (2006). Automatic visualisation of metro maps. Journal of Visual Languages and Computing, 17(3), 203-224.
  • Ho, J., Hong, S. (2006). Drawing Clustered Graphs in Three Dimensions. Lecture Notes in Computer Science (LNCS), 3843, 492-502.
  • Hong, S., Eades, P. (2006). Drawing planar graphs symmetrically, III: Oneconnected planar graphs. Algorithmica: an international journal in computer science, 44(1), 67-100.
  • Hong, S., Nikolov, N. (2006). Hierarchical Layouts of Directed Graphs in Three Dimensions. Lecture Notes in Computer Science (LNCS), 3843, 251-261.
  • Huang, W., Hong, S., Eades, P. (2006). Layout effects on sociogram perception. Lecture Notes in Computer Science (LNCS), 3843, 262-273.
  • Hong, S., Yen, H. (2006). Special issue Graph Drawing. International Journal of Foundations of Computer Science, 17(5), 1003-1004.
  • Hong, S., Eades, P. (2005). A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Lecture Notes in Computer Science (LNCS), 3383, 307-317.
  • Buchheim, C., Hong, S. (2005). Crossing Minimization for Symmetries. Theory of Computing Systems, 38(3), 293-311.
  • Hong, S., Eades, P. (2005). Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica: an international journal in computer science, 42(2), 159-197.
  • Hong, S., Eades, P., Hillman, J. (2004). Linkless Symmetric Drawings Of Series Parallel Digraphs. Computational Geometry, 29(3), 191-221.
  • Hong, S., Eades, P. (2003). Drawing trees symmetrically in three dimensions. Algorithmica: an international journal in computer science, 36(2), 153-178.
  • Hong, S. (2002). Drawing Graphs Symmetrically in Three Dimensions. Lecture Notes in Computer Science (LNCS), 2265, 106-108.

Edited Journals

  • Hong, S. (2008). Special Issue on Selected Papers from 6th Asis-Pacific Symposium on Visualisation, APVIS 2007. Journal of Graph Algorithms and Applications, 12(3).

Conferences

  • Nguyen, Q., Eades, P., Hong, S. (2013). On the Faithfulness of Graph Visualizations. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer.
  • Angelini, P., Di Battista, G., Didimo, W., Frati, F., Hong, S., Kaufmann, M., Liotta, G., Lubiw, A. (2012). Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. XIV Spanish Meeting on Computational Geometry, Heidelberg: Springer.
  • Nguyen, Q., Eades, P., Hong, S. (2012). On the Faithfulness of Graph Visualizations. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer.
  • Hong, S. (2012). Reconstruction and analysis of biological networks based on large scale data from the NF-κB pathway. 7th International Symposium on Integrative Bioinformatics (IB 2011), Not knonw.
  • Nguyen, Q., Eades, P., Hong, S. (2012). StreamEB: Stream Edge Bundling. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer.
  • Nguyen, Q., Hong, S., Eades, P. (2012). TGI-EB: A New Framework for Edge Bundling integrating Topology, Geometry and Importance. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer Verlag.
  • Dwyer, T., Frati, F., Hong, S., Klein, K. (2012). Theory and Practice of Graph Drawing. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer.
  • Liu, H., Eades, P., Hong, S. (2012). Visualizing Dynamic Trajectories in Social Networks. 2012 IEEE Symposium on Visual Languages and Human-Centric Computing, Piscataway: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2010). Effectiveness of Sample Poset Based Visual Classifier for Data Sets Conceptualized by the Number of Attributes. The 13th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2010).
  • Huang, W., Eades, P., Hong, S., Lin, C. (2010). Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. 2010 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2010), USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Haraguchi, K., Hong, S., Nagamochi, H. (2010). Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. 4th International Conference on Learning and Intelligent Optimization (LION 4), Germany: Springer.
  • Eades, P., Hong, S., Poon, S. (2010). On Rectilinear Drawing of Graphs. 17th International Symposium on Graph Drawing (GD 2009), Germany: Springer.
  • Xu, K., Williams, R., Hong, S., Liu, Q., Zhang, J. (2010). Semi-bipartite Graph Visualization for Gene Ontology Networks. 17th International Symposium on Graph Drawing (GD 2009), Germany: Springer.
  • Haraguchi, K., Hong, S., Nagamochi, H. (2010). Visualization Can Improve Multiple Decision Table Classifiers. 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009), Heidelberg: Springer.
  • Huang, W., Eades, P., Hong, S. (2009). A Graph Reading Behavior: Geodesic-Path Tendency. IEEE Pacific Visualization Symposium - PacificVis 2009, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Haraguchi, K., Hong, S., Nagamochi, H. (2009). Bipartite Graph Representation of Multiple Decision Table Classifiers. 5th Symposium on Stochastic Algorithms, Foundations and Applications SAGA 2009, Germany: Springer.
  • Hong, S. (2009). Classification by Ordering Data Samples. Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems 2008, Online: RIMS.
  • Ho, J., Hong, S. (2009). Drawing Clustered Graphs in Three Dimensions. Graph Drawing 13th International Symposium, GD 2005, Berlin: Springer.
  • Grilli, L., Hong, S., Liotta, G., Meijer, H., Wismath, S. (2009). Matched Drawability of Graph Pairs and of Graph Triples. 3rd Annual Workshop on Algorithms and Computation WALCOM 2009, Germany: Springer.
  • Hong, S. (2009). MultiPlane Framework for Visualisation and Analysis of Large and Complex Networks. Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems 2008, Online: RIMS.
  • Hong, S. (2009). Toward Characterisation of Vertex-Edge Graphs of Three-Dimensional Nonconvex Polyhedra. 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Online.
  • Hong, S., Nagamochi, H. (2009). Upward Star-Shaped Polyhedral Graphs. 20th International Symposium on Algorithms and Computation ISAAC 2009, Germany: Springer.
  • Fung, D., Hong, S., Koschutzki, D., Schreiber, F., Xu, K. (2009). Visual Analysis of Overlapping Biological Networks. 13th International Conference Information Visualisation IV 2009, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2009). Visualized multiple decision table classifiers without discretization. 4th Korea-Japan Workshop on Operations Research in Service Science.
  • Hong, S., Nagamochi, H., Fukunaga, T. (2008). Algorithms and Computation. 19th International Symposium on Algorithms and Computation ISAAC 2008, Germany: Springer.
  • Hong, S., Nagamochi, H. (2008). Approximating Crossing Minimization in Radial Layouts. 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Germany: Springer.
  • Huang, W., Eades, P., Hong, S. (2008). Beyond Time and Error: A Cognitive Approach to the Evaluation of Graph Drawings. 2008 Conference on BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM).
  • Huang, W., Hong, S., Eades, P. (2008). Effects of Crossing Angles. IEEE Pacific Visualization Symposium 2008, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Nishizeki, T., Quan, W. (2008). Graph Drawing - 15th International Symposium, GD 2007 Revised Papers. 15th International Symposium on Graph Drawing. Springer.
  • Grilli, L., Hong, S., Symvonis, A., Wormser, C. (2008). Locally Delaunay Realizability of Regular Series-Parallel Graphs. The Sixth International Conference on Computational Science and Applications (ICCSA 2008), USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Gim, J., Arahori, Y., Imamichi, T., Hong, S., Nagamochi, H. (2008). Overlap Removal in Label Layouts by Multi-sphere Scheme. IEEE Pacific Visualization Symposium 2008, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Nagamochi, H. (2008). Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. 14th Annual International Conference on Computing and Combinatorics (COCOON 2008), Germany: Springer.
  • Shen, X., Vande Moere, A., Eades, P., Hong, S. (2008). The Long-Term Evaluation of Fisherman in a Partial-Attention Environment. 2008 Conference on BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM).
  • Haraguchi, K., Hong, S., Nagamochi, H. (2008). Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimal Occlusion. IEEE Pacific Visualization Symposium 2008, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Fung, D., Hong, S., Xu, K., Hart, D. (2008). Visualizing the Gene Ontology-Annotated Clusters of Co-expressed Genes: A Two-Design Study. Fifth International Conference BioMedical Visualization: Information Visualization in Medical and Biomedical Informatics (MEDIVIS 08), USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2007). A Linear Time Algorithm for Symmetric Convex Drawings of Triconnected Planar Graphs. Computational Geometry and Graph Theory (CGGT 2007) International Conference, Kyoto, Germany: Springer.
  • Hong, S. (2007). Centrality-Based Planarisation and Thickness. The 10th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2007).
  • Brandes, U., Erten, C., Fowler, J., Frati, F., Geyer, M., Gutwenger, C., Hong, S., Kaufmann, M., Kobourov, S., Liotta, G., et al (2007). Colored Simultaneous Geometric Embeddings. 13th Annual International Conference on Computing and Combinatorics (COCOON 2007), Berlin, Germany: Springer.
  • Hong, S. (2007). Convex Drawings of Clustered Planar Graphs. The 10th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2007).
  • Xu, K., Cunningham, A., Hong, S., Thomas, B. (2007). GraphScape: Integrated Multivariate Network Visualization. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Shen, X., Eades, P., Hong, S., Vande Moere, A. (2007). Intrusive and Non-intrusive Evaluation of Ambient Displays. 1st International Workshop at Pervasive 2007 on Designing and Evaluating Ambient Information Systems, The 5th International Conference on Pervasive Computing, online: CEUR-WS.
  • Ahmed, A., Hong, S. (2007). Navigation Techniques for 2.5D Graph Layout. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2007). Star-shaped Drawings of Planar Graphs. 18th International Workshop on Combinatorial Algorithms (IWOCA 2007), United Kingdom: College Publications.
  • Ahmed, A., Batagelj, V., Fu, X., Hong, S., Merrick, D., Mrvar, A. (2007). Visualisation and Analysis of the Internet Movie Database. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Fu, X., Hong, S., Nikolov, N., Shen, X., Wu, Y., Xu, K. (2007). Visualization and Analysis of Email Networks. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Nagamochi, H. (2006). Convex Drawings of Graphs with Non-convex Boundary*. 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), Germany: Springer.
  • Hong, S. (2006). Convex Drawings of Hierarchical Plane Graphs. AWOCA 2006: 17th Australasian Workshop on Combinatorial Algorithms.
  • Huang, W., Hong, S., Eades, P. (2006). How People Read Sociograms: A Questionnaire Study. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Huang, W., Hong, S., Eades, P. (2006). Layout effects on sociogram perception. Graph Drawing 13th International Symposium, GD 2005, Berlin: Springer.
  • Ho, J., Manwaring, T., Hong, S., Roehm, U., Fung, D., Xu, K., Kraska, T., Hart, D. (2006). PathBank: Web-based Querying and Visualization of an Integrated Biological Pathway Database. Computer Graphics, Imaging and Visualisation 2006 - Techniques and Applications -, Los Alamitos, California, Washington • Tokyo: (IEEE) Institute of Electrical and Electronics Engineers.
  • Huang, W., Hong, S., Eades, P. (2006). Predicting Graph Reading Performance: A Cognitive Approach. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Dwyer, T., Hong, S., Koschuetzki, D., Schreiber, F., Xu, K. (2006). Visual Analysis of Network Centralities. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Li, W., Hong, S., Eades, P. (2005). A Framework for Visualising Large Graphs. Ninth International Conference on Information Visualisation (IV05), Piscataway NJ: (IEEE) Institute of Electrical and Electronics Engineers.
  • Ahmed, A., Dwyer, T., Forster, M., Fu, X., Ho, J., Hong, S., Koschuetzki, D., Murray, C., Nikolov, N., Taib, R., et al (2005). GEOMI: GEOmetry for Maximum Insight. 13th International Symposium on Graph Drawing, GD 2005. Springer.
  • Hong, S., Nikolov, N. (2005). Hierarchical Layouts of Directed Graphs in Three Dimensions. 13th International Symposium on Graph Drawing, GD 2005. Springer.
  • Hong, S., Nikolov, N. (2005). Layered Drawings of Directed Graphs in Three Dimensions. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Hong, S. (2005). MultiPlane: A new framework for drawing graphs in three dimensions. 13th International Symposium on Graph Drawing, GD 2005. Springer.
  • Li, W., Eades, P., Hong, S. (2005). Navigating Software Architectures with Constant Visual Complexity. 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC05), California, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2005). Network analysis and visualisation. 13th International Symposium on Graph Drawing, GD 2005. Springer.
  • Hong, S. (2005). Proceedings of APVIS 2005. Asia Pacific Symposium on Information Visualisation, Sydney: Australian Computer Society.
  • Sugiyama, K., Osawa, R., Hong, S. (2005). Puzzle Generators and Symmetric Puzzle Layout. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Ahmed, A., Dwyer, T., Hong, S., Murray, C., Song, L., Wu, Y. (2005). Visualisation and Analysis of Large and Complex Scale-free Networks. EUROVIS 2005 Eurographics / IEEE VGTC Symposium on Visualization, Germany: Eurographics Association.
  • Hong, S. (2004). Proceedings of AWOCA 2004. AWOCA 2004 Fifteenth Australasian Workshop on Combinatorial Algorithms, NSW: Alexandria Publishing.
  • Hong, S., Merrick, D., do Nascimento, H. (2004). The Metro Map Layout Problem. Australasian Symposium on Information Visualisation (InVis.au 2004), Darlinghurst, Australia: Australian Computer Society.
  • Hong, S., Sugiyama, K., Maeda, A. (2004). The Puzzle Layout Problem. 11th International Symposium, GD 2003, Berlin: Springer.
  • Hong, S., Murtagh, T. (2004). Visualisation of Large and Complex Networks Using PolyPlane. 12th International Symposium, GD 2004, New York: Springer.
  • Murtagh, T., Hong, S. (2003). 3DTreeDraw: a three dimensional tree drawing system. 19th Annual Symposium on Computational Geometry (SCG'03), USA: Association for Computing Machinery (ACM).
  • Hong, S., Eades, P. (2003). Drawing disconnected graphs symmetrically. Japan-Korea Joint Workshop on Algorithms and Computations (WACC), Japan: National University of Singapore.
  • Hong, S., Eades, P. (2003). Symmetric layout of disconnected graphs. 14th Annual International Symposium on Algorithms and Computation ISAAC 2003. Springer.
  • Hong, S. (2003). The rectilinear symmetric crossing minimization problem. 14th Australiasian Workshop on Combinatorial Algorithms (AWOCA 2003), Korea: Seoul National University.
  • Abelson, D., Hong, S., Taylor, D. (2002). A group-theoretic method for drawing graphs symmetrically. 10th International Symposium, Graph Drawing, Berlin: Springer.
  • Hong, S., McKay, B., Eades, P. (2002). Symmetric drawings of triconnected planar graphs. thirteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia: Society for Industrial and Applied Mathematics (SIAM).
  • Hong, S. (2001). Visualisation of Symmetry in Graphs. Pan Sydney Workshop on Visual Information Processing, : UNSW Australian Defence Force Academy.

2013

  • Nguyen, Q., Eades, P., Hong, S. (2013). On the Faithfulness of Graph Visualizations. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer.

2012

  • Hong, S., Nagamochi, H. (2012). A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. Algorithmica: an international journal in computer science, 62(3-4), 1122-1158.
  • Di Giacomo, E., Didimo, W., Eades, P., Hong, S., Liotta, G. (2012). Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics, 160(1-2), 132-139.
  • Hong, S., Eades, P., Liotta, G., Poon, S. (2012). Fary's theorem for 1-planar graphs. Lecture Notes in Computer Science (LNCS), 7434, 335-346.
  • Angelini, P., Di Battista, G., Didimo, W., Frati, F., Hong, S., Kaufmann, M., Liotta, G., Lubiw, A. (2012). Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. XIV Spanish Meeting on Computational Geometry, Heidelberg: Springer.
  • Hong, S., Nagamochi, H. (2012). Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. Theoretical Computer Science, 445(August), 36-51.
  • Nguyen, Q., Eades, P., Hong, S. (2012). On the Faithfulness of Graph Visualizations. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer.
  • Hong, S. (2012). Reconstruction and analysis of biological networks based on large scale data from the NF-κB pathway. 7th International Symposium on Integrative Bioinformatics (IB 2011), Not knonw.
  • Hong, S., Nagamochi, H. (2012). Special Issue from ISAAC 2008. International Journal of Computational Geometry and Applications, 21(3), 251-252.
  • Nguyen, Q., Eades, P., Hong, S. (2012). StreamEB: Stream Edge Bundling. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer.
  • Nguyen, Q., Hong, S., Eades, P. (2012). TGI-EB: A New Framework for Edge Bundling integrating Topology, Geometry and Importance. 19th International Symposium on Graph Drawing, GD 2011, Heidelberg, Germany: Springer Verlag.
  • Dwyer, T., Frati, F., Hong, S., Klein, K. (2012). Theory and Practice of Graph Drawing. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer.
  • Liu, H., Eades, P., Hong, S. (2012). Visualizing Dynamic Trajectories in Social Networks. 2012 IEEE Symposium on Visual Languages and Human-Centric Computing, Piscataway: (IEEE) Institute of Electrical and Electronics Engineers.

2011

  • Brandes, U., Erten, C., Estrella-Balderrama, A., Fowler, J., Frati, F., Geyer, M., Gutwenger, C., Hong, S., Kaufmann, M., Kobourov, S., et al (2011). Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica: an international journal in computer science, 60(3), 569-592.
  • Hong, S. (2011). Detection and Display of Symmetries. In Roberto Tamassia (Eds.), Handbook of Graph Drawing and Visualization. CRC Press.
  • Hong, S., Nagamochi, H. (2011). Editorial: ISAAC 2008 Special Issue. Algorithmica: an international journal in computer science, 61(4), 777-778.
  • Hong, S., Nagamochi, H. (2011). Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. Algorithmica: an international journal in computer science, 61(4), 1022-1076.
  • Nguyen, Q., Eades, P., Hong, S., Huang, W. (2011). Large crossing angles in circular layouts. Lecture Notes in Computer Science (LNCS), 6502, 397-399.

2010

  • Hong, S., Nagamochi, H. (2010). A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. Algorithmica: an international journal in computer science, 58(2), 433-460.
  • Hong, S., Nagamochi, H. (2010). An algorithm for constructing star-shaped drawings of plane graphs. Computational Geometry, 43(2), 191-206.
  • Hong, S., Nagamochi, H. (2010). Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. Algorithmica: an international journal in computer science, 58(2), 478-497.
  • Hong, S., Nagamochi, H. (2010). Convex drawings of hierarchical planar graphs and clustered planar graphs. Journal of Discrete Algorithms (Amsterdam), 8(3), 282-295.
  • Bachmaier, C., Buchner, H., Forster, M., Hong, S. (2010). Crossing minimization in extended level drawings of graphs. Discrete Applied Mathematics, 158(3), 159-179.
  • Hong, S. (2010). Effectiveness of Sample Poset Based Visual Classifier for Data Sets Conceptualized by the Number of Attributes. The 13th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2010).
  • Eades, P., Gutwenger, C., Hong, S., Mutzel, P. (2010). Graph Drawing Algorithms. In Mikhail J Atallah and Marina Blanton (Eds.), Algorithms and Theory of Computation Handbook: Special Topics and Techniques (2nd Ed). United States: CRC Press.
  • Huang, W., Eades, P., Hong, S., Lin, C. (2010). Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. 2010 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2010), USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Grilli, L., Hong, S., Liotta, G., Meijer, H., Wismath, S. (2010). Matched drawability of graph pairs and of graph triples. Computational Geometry, 43(6-7), 611-634.
  • Haraguchi, K., Hong, S., Nagamochi, H. (2010). Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. 4th International Conference on Learning and Intelligent Optimization (LION 4), Germany: Springer.
  • Eades, P., Hong, S., Poon, S. (2010). On Rectilinear Drawing of Graphs. 17th International Symposium on Graph Drawing (GD 2009), Germany: Springer.
  • Xu, K., Williams, R., Hong, S., Liu, Q., Zhang, J. (2010). Semi-bipartite Graph Visualization for Gene Ontology Networks. 17th International Symposium on Graph Drawing (GD 2009), Germany: Springer.
  • Fung, D., Wilkins, M., Hart, D., Hong, S. (2010). Using the clustered circular layout as an informative method for visualizing protein-protein interaction networks. Proteomics, 10(14), 2723-2727.
  • Ahmed, A., Fu, X., Hong, S., Nguyen, Q., Xu, K. (2010). Visual Analysis of History of World Cup: A Dynamic Network with Dynamic Hierarchy and Geographic Clustering. In Mao Lin Huang, Quang Vinh Nguyen, Kang Zhang (Eds.), Visual Information Communication, (pp. 25-39). New York: Springer.
  • Haraguchi, K., Hong, S., Nagamochi, H. (2010). Visualization Can Improve Multiple Decision Table Classifiers. 6th International Conference on Modeling Decisions for Artificial Intelligence (MDAI 2009), Heidelberg: Springer.

2009

  • Huang, W., Eades, P., Hong, S. (2009). A Graph Reading Behavior: Geodesic-Path Tendency. IEEE Pacific Visualization Symposium - PacificVis 2009, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Haraguchi, K., Hong, S., Nagamochi, H. (2009). Bipartite Graph Representation of Multiple Decision Table Classifiers. 5th Symposium on Stochastic Algorithms, Foundations and Applications SAGA 2009, Germany: Springer.
  • Hong, S. (2009). Classification by Ordering Data Samples. Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems 2008, Online: RIMS.
  • Ho, J., Hong, S. (2009). Drawing Clustered Graphs in Three Dimensions. Graph Drawing 13th International Symposium, GD 2005, Berlin: Springer.
  • Hong, S., Mader, M. (2009). Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints. Lecture Notes in Computer Science (LNCS), 5417, 936-283.
  • Shen, X., Vande Moere, A., Eades, P., Hong, S. (2009). Issues for the Evaluation of Ambient Displays. International Journal of Ambient Computing and Intelligence, 1(2 (April- June)), 59-69.
  • Grilli, L., Hong, S., Liotta, G., Meijer, H., Wismath, S. (2009). Matched Drawability of Graph Pairs and of Graph Triples. 3rd Annual Workshop on Algorithms and Computation WALCOM 2009, Germany: Springer.
  • Huang, W., Eades, P., Hong, S. (2009). Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization, 8(3), L169-152.
  • Hong, S. (2009). MultiPlane Framework for Visualisation and Analysis of Large and Complex Networks. Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems 2008, Online: RIMS.
  • Hong, S., Nagamochi, H. (2009). New Approximation to the One-sided Radial Crossing Minimization. Journal of Graph Algorithms and Applications, 13(2), 179-196.
  • Imamichi, T., Arahori, Y., Gim, J., Hong, S., Nagamochi, H. (2009). Removing Node Overlaps Using Multi-sphere Scheme. Lecture Notes in Computer Science (LNCS), 5417, 296-301.
  • Hong, S., Nishizeki, T. (2009). Special Issue from GD 2007. Journal of Graph Algorithms and Applications, 13(3), 285-287.
  • Hong, S. (2009). Toward Characterisation of Vertex-Edge Graphs of Three-Dimensional Nonconvex Polyhedra. 6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Online.
  • Hong, S., Nagamochi, H. (2009). Upward Star-Shaped Polyhedral Graphs. 20th International Symposium on Algorithms and Computation ISAAC 2009, Germany: Springer.
  • Fung, D., Hong, S., Koschutzki, D., Schreiber, F., Xu, K. (2009). Visual Analysis of Overlapping Biological Networks. 13th International Conference Information Visualisation IV 2009, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2009). Visualized multiple decision table classifiers without discretization. 4th Korea-Japan Workshop on Operations Research in Service Science.

2008

  • Fung, D., Hong, S., Koschutzki, D., Schreiber, F., Xu, K. (2008). 2.5D Visualisation of Overlapping Biological Networks. Journal of Integrative Bioinformatics, 5(1), 1 doi:10.2390/biecoll-jib-2008-90-17.
  • Hong, S., Nagamochi, H., Fukunaga, T. (2008). Algorithms and Computation. 19th International Symposium on Algorithms and Computation ISAAC 2008, Germany: Springer.
  • Hong, S., Nagamochi, H. (2008). Approximating Crossing Minimization in Radial Layouts. 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Germany: Springer.
  • Huang, W., Eades, P., Hong, S. (2008). Beyond Time and Error: A Cognitive Approach to the Evaluation of Graph Drawings. 2008 Conference on BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM).
  • Hong, S., Nagamochi, H. (2008). Convex drawings of graphs with non-convex boundary constraints. Discrete Applied Mathematics, 156(12), 2368-2380.
  • Huang, W., Hong, S., Eades, P. (2008). Effects of Crossing Angles. IEEE Pacific Visualization Symposium 2008, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Nishizeki, T., Quan, W. (2008). Graph Drawing - 15th International Symposium, GD 2007 Revised Papers. 15th International Symposium on Graph Drawing. Springer.
  • Grilli, L., Hong, S., Symvonis, A., Wormser, C. (2008). Locally Delaunay Realizability of Regular Series-Parallel Graphs. The Sixth International Conference on Computational Science and Applications (ICCSA 2008), USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Gim, J., Arahori, Y., Imamichi, T., Hong, S., Nagamochi, H. (2008). Overlap Removal in Label Layouts by Multi-sphere Scheme. IEEE Pacific Visualization Symposium 2008, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2008). Special Issue on Selected Papers from 6th Asis-Pacific Symposium on Visualisation, APVIS 2007. Journal of Graph Algorithms and Applications, 12(3).
  • Hong, S. (2008). Special Issue on Selected Papers from the 6th Asia-Paci�?c Symposium on Visualisation APVIS 2007. Journal of Graph Algorithms and Applications, 12(3), 265-266.
  • Hong, S., Nagamochi, H. (2008). Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. 14th Annual International Conference on Computing and Combinatorics (COCOON 2008), Germany: Springer.
  • Buchheim, C., Hong, S. (2008). Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica: an international journal in computer science, 52(4), 448-465.
  • Shen, X., Vande Moere, A., Eades, P., Hong, S. (2008). The Long-Term Evaluation of Fisherman in a Partial-Attention Environment. 2008 Conference on BEyond time and errors: novel evaLuation methods for Information Visualization (BELIV'08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM).
  • Haraguchi, K., Hong, S., Nagamochi, H. (2008). Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimal Occlusion. IEEE Pacific Visualization Symposium 2008, United States: (IEEE) Institute of Electrical and Electronics Engineers.
  • Fung, D., Hong, S., Xu, K., Hart, D. (2008). Visualizing the Gene Ontology-Annotated Clusters of Co-expressed Genes: A Two-Design Study. Fifth International Conference BioMedical Visualization: Information Visualization in Medical and Biomedical Informatics (MEDIVIS 08), USA: (IEEE) Institute of Electrical and Electronics Engineers.

2007

  • Hong, S., Nikolov, N., Tarassov, A. (2007). A 2.5D Hierarchical Drawing of Directed Graphs. Journal of Graph Algorithms and Applications, 11(2), 371-396.
  • Hong, S. (2007). A Linear Time Algorithm for Symmetric Convex Drawings of Triconnected Planar Graphs. Computational Geometry and Graph Theory (CGGT 2007) International Conference, Kyoto, Germany: Springer.
  • Hong, S. (2007). Centrality-Based Planarisation and Thickness. The 10th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2007).
  • Brandes, U., Erten, C., Fowler, J., Frati, F., Geyer, M., Gutwenger, C., Hong, S., Kaufmann, M., Kobourov, S., Liotta, G., et al (2007). Colored Simultaneous Geometric Embeddings. 13th Annual International Conference on Computing and Combinatorics (COCOON 2007), Berlin, Germany: Springer.
  • Hong, S. (2007). Convex Drawings of Clustered Planar Graphs. The 10th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2007).
  • Huang, W., Hong, S., Eades, P. (2007). Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualisation. Journal of Graph Algorithms and Applications, 11(2), 397-429.
  • Abelson, D., Hong, S., Taylor, D. (2007). Geometric automorphism groups of graphs. Discrete Applied Mathematics, 155(17), 2211-2226.
  • Xu, K., Cunningham, A., Hong, S., Thomas, B. (2007). GraphScape: Integrated Multivariate Network Visualization. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Shen, X., Eades, P., Hong, S., Vande Moere, A. (2007). Intrusive and Non-intrusive Evaluation of Ambient Displays. 1st International Workshop at Pervasive 2007 on Designing and Evaluating Ambient Information Systems, The 5th International Conference on Pervasive Computing, online: CEUR-WS.
  • Ahmed, A., Hong, S. (2007). Navigation Techniques for 2.5D Graph Layout. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2007). Star-shaped Drawings of Planar Graphs. 18th International Workshop on Combinatorial Algorithms (IWOCA 2007), United Kingdom: College Publications.
  • Ahmed, A., Batagelj, V., Fu, X., Hong, S., Merrick, D., Mrvar, A. (2007). Visualisation and Analysis of the Internet Movie Database. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Fu, X., Hong, S., Nikolov, N., Shen, X., Wu, Y., Xu, K. (2007). Visualization and Analysis of Email Networks. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: (IEEE) Institute of Electrical and Electronics Engineers.

2006

  • Hong, S., McKay, B., Eades, P. (2006). A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs. Discrete and Computational Geometry, 36(2), 283-311.
  • Hong, S., Merrick, D., do Nascimento, H. (2006). Automatic visualisation of metro maps. Journal of Visual Languages and Computing, 17(3), 203-224.
  • Hong, S., Nagamochi, H. (2006). Convex Drawings of Graphs with Non-convex Boundary*. 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), Germany: Springer.
  • Hong, S. (2006). Convex Drawings of Hierarchical Plane Graphs. AWOCA 2006: 17th Australasian Workshop on Combinatorial Algorithms.
  • Ho, J., Hong, S. (2006). Drawing Clustered Graphs in Three Dimensions. Lecture Notes in Computer Science (LNCS), 3843, 492-502.
  • Hong, S., Eades, P. (2006). Drawing planar graphs symmetrically, III: Oneconnected planar graphs. Algorithmica: an international journal in computer science, 44(1), 67-100.
  • Hong, S., Nikolov, N. (2006). Hierarchical Layouts of Directed Graphs in Three Dimensions. Lecture Notes in Computer Science (LNCS), 3843, 251-261.
  • Huang, W., Hong, S., Eades, P. (2006). How People Read Sociograms: A Questionnaire Study. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Eades, P., Hong, S., Nesbitt, K., Takatsuka, M. (2006). Information Display. In Albert Y Zomaya (Eds.), Handbook of Nature-Inspired and Innovative Computing, (pp. 633-655). New York: Springer Science + Business Media.
  • Huang, W., Hong, S., Eades, P. (2006). Layout effects on sociogram perception. Lecture Notes in Computer Science (LNCS), 3843, 262-273.
  • Huang, W., Hong, S., Eades, P. (2006). Layout effects on sociogram perception. Graph Drawing 13th International Symposium, GD 2005, Berlin: Springer.
  • Ho, J., Manwaring, T., Hong, S., Roehm, U., Fung, D., Xu, K., Kraska, T., Hart, D. (2006). PathBank: Web-based Querying and Visualization of an Integrated Biological Pathway Database. Computer Graphics, Imaging and Visualisation 2006 - Techniques and Applications -, Los Alamitos, California, Washington • Tokyo: (IEEE) Institute of Electrical and Electronics Engineers.
  • Huang, W., Hong, S., Eades, P. (2006). Predicting Graph Reading Performance: A Cognitive Approach. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.
  • Hong, S., Yen, H. (2006). Special issue Graph Drawing. International Journal of Foundations of Computer Science, 17(5), 1003-1004.
  • Dwyer, T., Hong, S., Koschuetzki, D., Schreiber, F., Xu, K. (2006). Visual Analysis of Network Centralities. Asia Pacific Symposium on Information Visualization APVIS 2006, Australia: Australian Computer Society.

2005

  • Li, W., Hong, S., Eades, P. (2005). A Framework for Visualising Large Graphs. Ninth International Conference on Information Visualisation (IV05), Piscataway NJ: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S., Eades, P. (2005). A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Lecture Notes in Computer Science (LNCS), 3383, 307-317.
  • Buchheim, C., Hong, S. (2005). Crossing Minimization for Symmetries. Theory of Computing Systems, 38(3), 293-311.
  • Hong, S., Eades, P. (2005). Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica: an international journal in computer science, 42(2), 159-197.
  • Ahmed, A., Dwyer, T., Forster, M., Fu, X., Ho, J., Hong, S., Koschuetzki, D., Murray, C., Nikolov, N., Taib, R., et al (2005). GEOMI: GEOmetry for Maximum Insight. 13th International Symposium on Graph Drawing, GD 2005. Springer.
  • Hong, S., Nikolov, N. (2005). Hierarchical Layouts of Directed Graphs in Three Dimensions. 13th International Symposium on Graph Drawing, GD 2005. Springer.
  • Hong, S., Nikolov, N. (2005). Layered Drawings of Directed Graphs in Three Dimensions. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Hong, S. (2005). MultiPlane: A new framework for drawing graphs in three dimensions. 13th International Symposium on Graph Drawing, GD 2005. Springer.
  • Li, W., Eades, P., Hong, S. (2005). Navigating Software Architectures with Constant Visual Complexity. 2005 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC05), California, USA: (IEEE) Institute of Electrical and Electronics Engineers.
  • Hong, S. (2005). Network analysis and visualisation. 13th International Symposium on Graph Drawing, GD 2005. Springer.
  • Hong, S. (2005). Proceedings of APVIS 2005. Asia Pacific Symposium on Information Visualisation, Sydney: Australian Computer Society.
  • Sugiyama, K., Osawa, R., Hong, S. (2005). Puzzle Generators and Symmetric Puzzle Layout. Information Visualisation 2005 Asia-Pacific Symposium on Information Visualisation (APVIS 2005), Australia: Association for Computing Machinery (ACM).
  • Ahmed, A., Dwyer, T., Hong, S., Murray, C., Song, L., Wu, Y. (2005). Visualisation and Analysis of Large and Complex Scale-free Networks. EUROVIS 2005 Eurographics / IEEE VGTC Symposium on Visualization, Germany: Eurographics Association.

2004

  • Hong, S. (2004). Drawing Graphs. In D. Mehta and S. Sahni (Eds.), Handbook of Data Structures and Applications. CRC Press.
  • Hong, S., Eades, P., Hillman, J. (2004). Linkless Symmetric Drawings Of Series Parallel Digraphs. Computational Geometry, 29(3), 191-221.
  • Hong, S. (2004). Proceedings of AWOCA 2004. AWOCA 2004 Fifteenth Australasian Workshop on Combinatorial Algorithms, NSW: Alexandria Publishing.
  • Hong, S., Merrick, D., do Nascimento, H. (2004). The Metro Map Layout Problem. Australasian Symposium on Information Visualisation (InVis.au 2004), Darlinghurst, Australia: Australian Computer Society.
  • Hong, S., Sugiyama, K., Maeda, A. (2004). The Puzzle Layout Problem. 11th International Symposium, GD 2003, Berlin: Springer.
  • Hong, S., Murtagh, T. (2004). Visualisation of Large and Complex Networks Using PolyPlane. 12th International Symposium, GD 2004, New York: Springer.

2003

  • Murtagh, T., Hong, S. (2003). 3DTreeDraw: a three dimensional tree drawing system. 19th Annual Symposium on Computational Geometry (SCG'03), USA: Association for Computing Machinery (ACM).
  • Hong, S., Eades, P. (2003). Drawing disconnected graphs symmetrically. Japan-Korea Joint Workshop on Algorithms and Computations (WACC), Japan: National University of Singapore.
  • Hong, S., Eades, P. (2003). Drawing trees symmetrically in three dimensions. Algorithmica: an international journal in computer science, 36(2), 153-178.
  • Hong, S., Eades, P. (2003). Symmetric layout of disconnected graphs. 14th Annual International Symposium on Algorithms and Computation ISAAC 2003. Springer.
  • Hong, S. (2003). The rectilinear symmetric crossing minimization problem. 14th Australiasian Workshop on Combinatorial Algorithms (AWOCA 2003), Korea: Seoul National University.

2002

  • Abelson, D., Hong, S., Taylor, D. (2002). A group-theoretic method for drawing graphs symmetrically. 10th International Symposium, Graph Drawing, Berlin: Springer.
  • Hong, S., Buchheim, C. (2002). Crossing Minimization for Symmetries. In Prosenjit Bose Pat Morin (Eds.), Algorithms and Computation, (pp. 563-574). Berlin: Springer.
  • Hong, S. (2002). Drawing Graphs Symmetrically in Three Dimensions. Lecture Notes in Computer Science (LNCS), 2265, 106-108.
  • Hong, S., McKay, B., Eades, P. (2002). Symmetric drawings of triconnected planar graphs. thirteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia: Society for Industrial and Applied Mathematics (SIAM).

2001

  • Hong, S., Eades, P. (2001). An Algorithm for Finding Three Dimensional Symmetry in Trees. In Patrick Healy & Nikola S Nikolov (Eds.), Graph Drawing: 13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, (pp. 360-371). United States: Springer.
  • Hong, S. (2001). Visualisation of Symmetry in Graphs. Pan Sydney Workshop on Visual Information Processing, : UNSW Australian Defence Force Academy.
Back to Top

For support on your academic profile contact Research Support.