Research Publication List in pdf

  Some of my publications are available from VALACON (Visualisation and Analysis of Large and Complex Networks) Project Publication Page.


  Headlines


  Edited Books/proceedings

  1. S. Carpendale, W. Chen and S. Hong, Proceedings of IEEE Pacificvis 2013, IEEE TVCG 2013.

  2. S. Hong, H. Nagamochi and T. Fukunaga, Proceedings of ISAAC 2008 (International Symposium on Algorithms and Computation), Lecture Notes in Computer Science, Springer, 2008.

  3. Seok-Hee Hong, Takao Nishizeki and Wu Quan, Proceedings of GD 2007 (International Symposium on Graph Drawing), Lecture Notes in Computer Science, Springer, 4875, 2008.

  4. Seok-Hee Hong and Kwan-Liu Ma, Proceedings of APVIS 2007 (Asia Pacific Symposium on Visualisation), IEEE, 2007.

  5. Seok-Hee Hong, Proceedings of APVIS 2005 (Asia Pacific Symposium on Information Visualisation), Vol. 45, CRPIT, 2005.

  6. Seok-Hee Hong, Proceedings of AWOCA 2004 (Australasian Workshop on Combinatorial Algorithms), 2004.

  Guest Editorial (journal)

  1. S. Hong, S. Carpendale and W. Chen, Guest editor, IEEE Transactions on Visualization & Computer Graphics. 20(8), Special Section on the IEEE Pacific Visualization Symposium, 2014.

  2. S. Hong and H. Nagamochi, Guest editor, Algorithmica, Special Issue from ISAAC 2008, Algorithmica 61(4), 2011.

  3. S. Hong and H. Nagamochi, Guest editor, IJCGA (International Journal on Computational Geometry and Applications), Special Issue from ISAAC 2008, World Scientific, 21(3), 2011.

  4. S. Hong and T. Nishizeki, Guest editor, JGAA (Journal of Graph Algorithms and Applications), Special Issue from GD 2007, 13(3), 2009.

  5. S. Hong, Guest editor, JGAA (Journal of Graph Algorithms and Applications), Issue from APVIS 2007, 12(3), 2008.

  6. S. Hong and H-C. Yen, Guest editor, IJFCS (International Journal of Foundations of Computer Science), Special issue on Graph Drawing, 17(5), 2006.

  Book Chapter

  1. S. Hong, "Graph Algorithms in Network Analysis", Encyclopedia on Systems Biology, Springer, pp 853-861, 2013.

  2. Peter Eades and Seok-Hee Hong, Detection and Display of Symmetries, Chapter 5 of Handbook of Graph Drawing and Visualisation, R. Tamassia (editor), CRC Press, 2013.

  3. P. Eades and S. Hong, "How to Draw Graphs: revisited", Expanding the Frontiers of Visual Analytics and Visualization, J. Dill, R.A. Earnshaw, D. J. Kasik, J.A. Vince, P.C. Wong, Guest Editors, Springer, 2012.

  4. A. Ahmed, X. Fu, S. Hong, Q. Nguyen and K. Xu, "Visual Analysis of History of World Cup: A Dynamic Network with Dynamic Hierarchy and Geographic Clustering", Visual Information Communication (Proceedings of VINCI'09), Springer, pp. 25-39, 2010.

  5. Peter Eades, Carsten Gutwenger, Seok-Hee Hong and Petra Mutzel, Graph Drawing Algorithms, Chapter 9 of the Handbook on Algorithms and Theory of Computation (Ed. M. Attallah), CRC Press, 2009.

  6. Peter Eades, Seok-Hee Hong, Keith Nesbitt and Masahiro Takatsuka, Visualization, Chapter 20 of Handbook of Innovative Computing, A. Zomaya et al. (editor), Springer Verlag, pp. 633-655, 2005.

  7. Peter Eades and Seok-Hee Hong, Drawing Graphs, Chapter 46 of Handbook of Data Structures and Applications, D. Mehta and S. Sahni (editors), 46:1-22, CRC Press, 2004.

  Refereed Journal Articles

  1. S. Hong, P. Eades, N. Katoh, G. Liotta, P. Schweitzer and Y. Suzuki, "A Linear-Time Algorithm for Testing Outer-1-Planarity", Algorithmica, DOI 10.1007/s00453-014-9890-8, Springer, 2014 .

  2. W. Huang, P. Eades and S. Hong, "Larger Crossing Angles Make Graphs Easier to Read", Journal of Visual Languages and Computing 25(4), pp. 452-465, Elsevier, 2014 .

  3. J. Kim, P. Eades, R. Fleischer, S. Hong, C. Iliopoulos, K. Park, S. Puglisi and T. Tokuyama, "Order Preserving Matching", Theoretical Computer Science 525, pp. 68-79, Elsevier, 2014 .

  4. P. Eades, S. Hong, N. Katoh, G. Liotta, P. Schweitzer and Y. Suzuki, "A Linear Time Algorithm for Testing Maximal 1-planarity of Graphs with a Rotation System", Theoretical Computer Science, 513, pp. 65-76, 2013, Elsevier .

  5. W. Huang, P. Eades, S. Hong and C. Lin, "Improving Multiple Aesthetics Produces Better Graph Drawings", Journal of Visual Languages and Computing, 24(4), pp. 262-272, 2013, Elsevier .

  6. S. Hong and H. Nagamochi, "Star-shaped Drawings of Plane Graphs with a Cost Function on Concave Corners", Theoretical Computer Science, Vol 445, pp. 36-51, 2012, Elsevier .

  7. D. Fung, S. Li, A. Goel, S. Hong and M. Wilkins, "Visualization of the Interactome: what are we looking at?", Proteomics, Vol 12, issue 10, pp. 1669-1686, 2012 .

  8. W. Didimo, E. di Giacomo, P. Eades, S. Hong and G. Liotta, "Bounds on the Crossing Resolution of Complete Geometric Graphs", Discrete Applied Mathematics, 160 (1-2), pp. 132-139, 2012.

  9. S. Hong and H. Nagamochi, "A Linear Time Algorithm for Constructing a Star-shaped Drawing of Planar Graphs with the Minimum Number of Concave Corners", Algorithmica, 62(3-4), pp. 1122-1158, 2012.

  10. S. Hong and H. Nagamochi, "Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra", Algorithmica, Volume 61, Number 4, pp. 1022-1076, 2011.

  11. U. Brandes, C. Erten, A. Estrella-Balderrama, J. Fowler, F. Frati, M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S. Kobourov, G. Liotta, P. Mutzel, A. Symvonis, "Colored Simultaneous Geometric Embeddings and Universal Pointsets", Algorithmica, Springer, Volume 60, Number 3, pp. 569-592, 2011.

  12. D. Fung, M. Wilkins, D. Hart and S. Hong, "Using the Clustered Circular Layout as an Informative Method for Visualizing Protein-protein Interaction Networks", Proteomics, Volume 10, Issue 14, No. 14, July 2010, pp. 2723-2727, 2010.

  13. S. Hong and H. Nagamochi, "Approximation Algorithms for Crossing Minimisation in Radial Layouts", Algorithmica, Springer, Volume 58, Number 2, pp. 478-497, 2010.

  14. S. Hong and H. Nagamochi, "Linear time algorithm for Symmetric Convex Drawings of Planar Graphs", Algorithmica, Springer, Volume 58, Number 2, pp. 433-460, 2010.

  15. S. Hong and H. Nagamochi, "Convex Drawings of Hierarchical Planar Graphs and Clustered Planar Graphs", Journal of Discrete Algorithm, Elsevier, 8(3), pp. 282-295, 2010.

  16. L. Grilli, S. Hong, G. Liotta, H. Meijer and S. Wismath, "Matched Drawability of Graph Pairs and of Graph Triples", Computational Geometry: Theory and Applications, Volume 43, Issues 6-7, August 2010, pp. 611-634, 2010, Elsevier.

  17. S. Hong and H. Nagamochi, "An Algorithm for Constructing Star-shaped Drawing of Planar Graphs", Computational Geometry: Theory and Applications, Volume 43, Issue 2, February 2010, pp. 191-206, 2010, Elsevier.

  18. C. Bachmaier, H. Buchner, M. Forster and S. Hong, "Crossing minimization in Extended Level Drawings of Graphs", Discrete Applied Mathematics, 158(3), pp. 159-179, 2010, Elsevier.

  19. S. Hong and H. Nagamochi, "New Approximation to the Radial Crossing Minimisation", Journal of Graph Algorithms and Applications, Vol. 13, no. 2, 179-196, 2009.

  20. W. Huang, S. Hong and P. Eades, "Measuring Effectiveness of Graph Visualizations: A Cognitive Load Perspective", Information Visualisation, Vol. 8, Issue 3, 139-152, 2009.

  21. X. Shen, A. Vande Moere, P. Eades and S. Hong, "Issues for the Evaluation of Ambient Displays", IJACI (International Journal of Ambient Computing and Intelligence), Vol 1, Issue 2, 2009.

  22. D. Fung, S. Hong, D. Koschutzki, F. Schreiber and K. Xu, "2.5D Visualisation of Overlapping Biological Networks", Journal of Integrative Bioinformatics, 5(1), 2008.

  23. S. Hong and H. Nagamochi, "Convex Drawings of Graphs with Non-convex Boundary Constraints", Discrete Applied Mathematics, 156(12), pp. 2368-2380, Elsevier, 2008.

  24. C. Buchheim and S. Hong, "Testing Planarity of Symmetries in Linear Time", Algorithmica, 52(4), pp. 448-465, Springer, 2008.

  25. S. Hong, N. Nikolov, and A. Tarassov, "A 2.5D Hierarchical Drawing of Directed Graphs", Journal of Graph Algorithms and Applications, Vol. 11, no. 2, pp. 371-396, 2007.

  26. Wei-Dong Huang, Seok-Hee Hong and Peter Eades, Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization, Journal of Graph Algorithms and Applications, Special issue from GD 2005, Vol. 11, no. 2, pp. 397-429, 2007.

  27. David Abelson, Seok-Hee Hong and Don E. Taylor, Geometric Automorphism Groups of Graphs, Discrete Applied Mathematics, 155(17), pp. 2211-2226, 2007, Elsevier.

  28. Seok-Hee Hong, Brendan McKay and Peter Eades, A Linear Time Algorithm for Constructing Maximally Symmetric Straight-line Drawings of Triconnected Planar Graphs, Discrete and Computational Geometry, 36 (2), pp. 283-311, 2006, Springer.

  29. Seok-Hee Hong, Damian. Merrick and Hugo do Nascimento, The Metro Map Layout Problem, Journal of Visual Language and Computing, 17(3), pp. 203-224, 2006, Elsevier.

  30. Seok-Hee Hong and Peter Eades, Drawing Oneconnected Planar Graphs Symmetrically, Algorithmica, 44 (1), pp. 67-100, 2006, Springer.

  31. Seok-Hee Hong and Peter Eades, Drawing Biconnected Planar Graphs Symmetrically, Algorithmica, 42(2), pp. 159-197, 2005, Springer.

  32. Christoph Buchheim and Seok-Hee Hong, Crossing Minimization for Symmetries, Theory of Computing Systems, 38 (3), pp. 293-311, 2005, Special issue from ISAAC 2002, Springer.

  33. Seok-Hee Hong, Peter Eades and Jonathan Hillman, Linkless Symmetric Drawings of Series Parallel Digraphs,Computational Geometry: Theory and Applications, 29(3), pp. 191-222, 2004, Elsevier.

  34. Seok-Hee Hong and Peter Eades, Drawing Trees Symmetrically in Three Dimensions, Algorithmica, Vol. 36, No. 2, pp. 153-178, 2003.

  35. Seok-Hee Hong, Peter Eades and Sang-Ho Lee, Drawing Series Parallel Digraphs Symmetrically, Computational Geometry: Theory and Applications, Vol. 17, Issue 3-4, pp. 165-188, 2000.

  36. Yun-Hee Lee, Seok-Hee Hong and Sang-Ho Lee, Symmetry Analysis on Interconnection Networks and its Drawing System, Journal of Korea Information Science Society(A), Vol 26, No 11, 1999.

  37. Seok-Hee Hong and Sang-Ho Lee,An Algorithm for Detecting Geometric Symmetry in a Planar Graph, Journal of Korea Information Science Society(A), Vol 26, No 1, 1999.

  38. Hye-Ryon Park, Seok-Hee Hong and Sang-Ho Lee, Algorithms for Detecting the Geometric Symmetry of a Series-Parallel Digraph and its Drawing, Journal of Korea Information Science and Society(A), Vol 25, No 5, pp.481-49 1, 1998.

  39. Mi-Hye Cho, Seok-Hee Hong, Joo-Hee Lee and Sang-Ho Lee, Algorithms for Drawing 6-Planar Graphs in Triangular Grids, Journal of Korea Information Science Society(A), Vol 24, No 2, 1997.

  40. Eun-Sook Oh, Seok-Hee Hong and Sang-Ho Lee, Algorithms for Embedding Mesh of Trees into Star Graphs, Journal of Korea Information Science Society(A), Vol 23, No 8, 1996.

  Refereed Conference Papers

  1. A. Meidiana and S. Hong, "MultiStory: Visual Analytics of Dynamic Multi-Relational Networks", Proceedings of IEEE PacificVis 2015, IEEE, to appear 2015, accepted 2014 Dec.

  2. P. Angelini, G. Da Lozzo, M. Di Bartolomeo, G. Di Battista, S. Hong, M. Patrignani and V. Roselli, "Anchored Drawings of Planar Graphs", Proceedings of Graph Drawing 2014, pp. 404-415, LNCS, Springer, 2014.

  3. M. A. Bekos, S. Cornelsen, L. Grilli, S. Hong and M. Kaufmann, "On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs", Proceedings of Graph Drawing 2014, pp. 198-209, LNCS, Springer, 2014.

  4. M. R. Marner, R. T. Smith, B. H. Thomas, K. Klein, P. Eades and S. Hong, "GION: Interactively Untangling Large Graphs on Wall-Sized Displays", Proceedings of Graph Drawing 2014, 113-124, LNCS, Springer, 2014.

  5. L. Grilli, S. Hong, J. Kratochvil and I. Rutter, "Drawing Simultaneously Embedded Graphs with Few Bends", Proceedings of Graph Drawing 2014, pp. 40-51, LNCS, Springer, 2014.

  6. S. Hong and H. Nagamochi, "Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs", Proceedings of COCOON 2014, pp. 477-488, LNCS, Springer, 2014.

  7. S. Hong, W. Huang, K. Misue and W. Quan, "A Framework for Visual Analytics of Massive Complex Networks", Proceedings of BigCOMP 2014, IEEE, pp.22-28, 2014.

  8. S. Hong, P. Eades, N. Katoh, G. Liotta, P. Schweitzer and Y. Suzuki, "A Linear-Time Algorithm for Testing Outer-1-Planarity", Proceedings of GD 2013, pp. 71-82, Lecture Notes in Computer Science, Springer, 2014.

  9. M. Bekos, S. Cornelsen, M. Fink, S. Hong, M. Kaufmann, M. Nollenburg, I. Rutter and A. Symbonis, "Many-to-One Boundary Labeling with Backbones", Proceedings of GD 2013, pp. 244-255, Lecture Notes in Computer Science, Springer, 2014.

  10. S. Bereg, S. Hong, N. Katoh, S Poon and S. Tanigawa, "On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs", Proceedings of ISAAC 2013, pp. 33-43, Lecture Notes in Computer Science, Springer, 2013.

  11. Q. Nguyen, P. Eades and S. Hong, "On the Faithfulness of Graph Visualizations", Proceedings of PacificVis 2013, pp. 209-216, IEEE, 2013.

  12. H. Dehkordi, Q. Nguyen, P. Eades, S. Hong, "Circular Graph Drawings with Large Crossing Angles", Proceedings of WALCOM 2013, pp. 298-309, Lecture Notes in Computer Science, Springer, 2013.

  13. Q. Nguyen, P. Eades and S. Hong, "StreamEB: Stream Edge Bundling, Proceedings of GD 2012, pp. 400-413, Lecture Notes in Computer Science, Springer, 2013.

  14. P. Eades, S. Hong, N. Katoh, G. Liotta, P. Schweitzer and Y. Suzuki, "Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time", Proceedings of GD 2012, pp. 339-345, Lecture Notes in Computer Science, Springer, 2013.

  15. Y. Higashikawa, N. Katoh and S. Hong, "Online TSP in a Maximal 1-Plane Geometric Graph", Proceedings of WAAC 2012, 2012.

  16. H. Liu, P. Eades, S. Hong, "Visualizing Dynamic Trajectories in Social Networks", Proceedings of VL/HCC 2012, pp 197-204, IEEE, 2012.

  17. S. Hong, P. Eades, G. Liotta and S. Poon, "Fary's Theorem for 1-planar Graphs", Proceedings of COCOON 2012, LNCS, pp. 335-346, Lecture Notes in Computer Science, Springer, 2012.

  18. Q. Nguyen, S. Hong and P. Eades, "TGI-EB: A New Framework for Edge Bundling integrating Topology, Geometry and Importance", Proceedings of Graph Drawing 2011, pp. 123-135, Lecture Notes in Computer Science, Springer, 2012.

  19. A. Lubiw, M. Kaufmann, S. Hong, G. Liotta, Giuseppe, W. Didimo, F. Frati, G. Di Battista, "Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area", Computational Geometry, Proceedings of XIV Spanish Meeting on Computational Geometry 2011, Lecture Notes in Computer Science Volume 7579, pp 200-209, 2012.

  20. Q. Nguyen, P. Eades, S. Hong and W. Huang, "Large Crossing Angles in Circular Layouts", Proceedings of Graph Drawing 2010, LNCS, pp. 397-399, 2011.

  21. W. Huang, P. Eades, S. Hong and C. Lin, "Improving Effectiveness of Graph Drawing Algorithms by Making Compromises between Aesthetics", Proceedings of VL/HCC 2010, pp. 176-183, IEEE, 2010.

  22. K. Haraguchi, S. Hong and H. Nagamochi, "Effectiveness of Sample Poset Based Visual Classifier for Data Sets Conceptualized by the Number of Attributes", Proceedings of WAAC 2010 (Japan-Korea Workshop on Algorithms and Computations), 2010.

  23. K. Haraguchi, S. Hong and H. Nagamochi, "Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables", Proceedings of Learning and Intelligent Optimization (LION 2010), LNCS 6073, pp. 169-183, Springer, 2010.

  24. K. Xu, R. Williams, S. Hong, Q. Liu and J. Zhang, "Semi-Bipartite Graph Visualization for Gene Ontology Networks", Proceedings of Graph Drawing 2009, LNCS, Springer, pp. 244-255, Springer, 2010

  25. P. Eades, S. Hong and S. Poon, "On Rectilinear Drawing of Graphs", Proceedings of Graph Drawing 2009, LNCS, Springer, pp. 232-243, Springer, 2010.

  26. S. Hong and H. Nagamochi, "Upward Star-shaped Polyhedral Graphs", Proceedings of International Symposium on Algorithms and Computation (ISAAC 2009), Lecture Notes in Computer Science, Springer, pp. 913-922, 2009.

  27. K. Haraguchi, S. Hong and H. Nagamochi, "Visualization can improve multiple decision table classifiers," Proceedings of Modeling Decisions for Artificial Intelligence (MDAI 2009), IEEE, pp. 41-52, 2009.

  28. K. Haraguchi, S. Hong and H. Nagamochi, "Bipartite Graph Representation of Multiple Decision Table Classifiers", Proceedings of Stochastic Algorithms: Foundations and Applications (SAGA 2009), Lecture Notes in Computer Science 5792, pp. 46-60, Springer, 2009.

  29. K. Haraguchi, S. Hong and H. Nagamochi, "Visualized Multiple Decision Table Classifiers without Discretization", Proceedings of the 4th Korea-Japan Workshop on Operations Research in Service Science, pp. 19-28, 2009.

  30. S. Hong and H. Nagamochi, "Toward Characterisation of Vertex-Edge Graphs of Three-Dimensional Nonconvex Polyhedra", Proceedings of JH 2009 (Japanese-Hungarian Workshop on Discrete Mathematics and Its Applications), pp. 256-273, 2009.

  31. D. Fung, S. Hong, D. Koschutzki, F. Schreiber and K. Xu, "Visual Analysis of Overlapping Biological Networks", Proceedings of International Conference on Information Visualisation (IV 2009), IEEE Computer Society 2009, pp. 337-342, 2009.

  32. W. Huang, P. Eades and S. Hong, "A Graph Reading Behaviour: Geodesic Path Tendency", Proceedings of IEEE Pacific Visualization Symposium (PacificVis 2009), IEEE, 137-144, 2009.

  33. L. Grilli, S. Hong, G. Liotta, H. Meijer and S. Wismath, "Matched Drawability of Graph Pairs and of Graph Triples", Proceedings of Workshop on Algorithms and Computation, WALCOM 2009, pp. 322-333, LNCS 5431, Springer, 2009.

  34. S. Hong, "MultiPlane Framework for Visualisation and Analysis of Large and Complex Networks", Proceedings of 2008 RIMS Workshop on Acceleration and Visualisation of Computation for Enumeration Problems, pp. 1-11, 2009.

  35. K. Haraguchi, S. Hong and H. Nagamochi, "Classification by Ordering Data Samples", Proceedings of 2008 RIMS Workshop on Acceleration and Visualisation of Computation for Enumeration Problems, pp. 20-34, 2009.

  36. T. Imamichi, J. Gim, Y. Arahori, S. Hong and H. Nagamochi, "Removing Overlaps in Label Layouts using a Multi-sphere Scheme", Proceedings of Graph Drawing 2008, pp. 296-301, LNCS, Springer 2009.

  37. S Hong and M. Mader, "Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints", Proceedings of Graph Drawing 2008, pp. 278-283, LNCS, Springer 2009.

  38. S. Hong and H. Nagamochi, "Star-shaped Drawing of Planar Graphs with Fixed Embedding and Concave Corner Constraints", Proceedings of COCOON 2008, LNCS, Springer, pp. 405-414, 2008.

  39. L. Grilli, S. Hong, A. Symvonis and C. Wormser, "Locally Delaunay Realizability of Regular Series-Parallel Graphs", Proceedings of CGA (International Workshop on Computational Geometry and Applications) 2008, IEEE, pp. 461-467, 2008.

  40. Seok-Hee Hong and Hiroshi Nagamochi, Approximating Crossing Minimization in Radial Layouts, Proceedings of LATIN 2008 (Latin American Theoretical Informatics Symposium), LNCS 4957, pp. 461-472, 2008.

  41. D. Fung, S. Hong, D. Hart, K. Xu, Visualizing the Gene Ontology-Annotated Clusters of Co-expressed Genes: A Two-Design Study, Proceedings of IV (Information Visualisation) 2008, IEEE, pp. 9-14, 2008.

  42. W. Huang, S. Hong and P. Eades, "Effects of Crossing Angles", Proceedings of IEEE Pacific Visualization Symposium (PacificVis 2008), IEEE, pp. 41-46, 2008.

  43. W. Huang, S. Hong and P. Eades, "A Cognitive Approach to the Evaluation of Graph Visualizations", Proceedings of BELIV'08 workshop, ACM, 3, 2008.

  44. X. Shen, A. Vande Moere, P. Eades and S. Hong, "An Evaluation of Fisherman in a Partial-Attention Environment, Proceedings of BELIV'08 workshop, ACM, 10, 2008.

  45. S. Hong and H. Nagamochi, "Star-shaped Drawings of Planar Graphs", Proceedings of IWOCA 2007 (International Workshop on Combinatorial Algorithm), pp. 78-92, College Publications, 2008.

  46. S. Hong and H. Nagamochi, "Convex Drawings of Clustered Planar Graphs", Proceedings of WAAC 2007 (Korea-Japan Workshop on Algorithms and Computations), pp. 32-39, 2007.

  47. S. Hong and H. Nagamochi, "A Linear Time Algorithm for Symmetric Convex Drawings of Triconnected Planar Graphs", Proceedings of Kyoto CGGT 2007 (Kyoto International Conference on Computational Geometry and Graph Theory), 2007.

  48. Ulrik Brandes, Cesim Erten, J. Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis, Colored Simultaneous Geometric Embeddings", Proceedings of COCOON 2007 (Computing and Combinatorics), Lecture Notes in Computer Science 4598, pp. 254-263, 2007.

  49. Kai Xu, Andrew Cunningham, Seok-Hee Hong and Bruce Thomas, GraphScape: Integrated Multivariate Network Visualization, Proceedings of APVIS (Asia-Pacific Symposium on Visualisation) 2007, IEEE, pp. 33-40, 2007.

  50. Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-Hee Hong, Damina Merrick and Andrej Mrvar, Visualisation and Analysis of the Internet Movie Database, Proceedings of APVIS (Asia-Pacific Symposium on Visualisation) 2007, IEEE, pp. 17-24, 2007.

  51. Xiaoyan Fu, Seok-Hee Hong, Nikola S. Nikolov, Xiaobin Shen, Ying Xin Wu and Kai Xu, Visualization and Analysis of Email Networks, Proceedings of APVIS (Asia-Pacific Symposium on Visualisation) 2007, IEEE, pp.1-8, 2007.

  52. Adel Ahmed and S. Hong, Navigation Techniques for 2.5D Graph Layout, Proceedings of APVIS (Asia-Pacific Symposium on Visualisation) 2007, IEEE, pp. 81-84, 2007.

  53. Xiaobin Shen, Peter Eades, Seok-Hee Hong and Andrew Vande Moere, Intrusive and Non-intrusive Evaluation of Ambient Displays, Issues in the Design and Evaluation of Ambient Information Systems Workshop, Toronto, Canada, pp. 30-35, 2007.

  54. Seok-Hee Hong and Hiroshi Nagamochi, Convex Drawings of Graphs with Non-convex Boundary, Proceedings of WG (Workshop on Graph Algorithm) 2006, pp. 113-124, Lecture Notes in Computer Science 4271, 2006.

  55. Seok-Hee Hong and Hiroshi Nagamochi, Convex Drawings of Hierarchical Plane Graphs, Proceedings of AWOCA (Australasian Workshop on Combinatorial Algorithm) 2006, 2006.

  56. Joshua Wing Kei Ho, Tristan Manwaring, Seok-Hee Hong, Uwe Rohm, David Cho Yau Fung, Kai Xu, Tim Kraska, David Hart, PathBank: Web-Based Querying and Visualization of an Integrated Biological Pathway Database, Proceedings of CGIV (Computer Graphics, Imaging and Visualization) 2006, pp. 84-89, IEEE, 2006.

  57. Tim Dwyer, Seok-Hee Hong, Dirk Koschutzki, Falk Schreiber and Kai Xu, Visual Analysis of Network Centralities, Proceedings of Asia Pacific Symposium on Information Visualisation (APVIS 2006), pp. 189-197, 2006.

  58. Weidong Huang, Seok-Hee Hong and Peter Eades, How People Read Sociograms: A Questionnaire Study, Proceedings of Asia Pacific Symposium on Information Visualisation (APVIS 2006), pp. 199-206, 2006.

  59. Weidong Huang, Seok-Hee Hong and Peter Eades, Predicting Graph Reading Performance: A Cognitive Approach, Proceedings of Asia Pacific Symposium on Information Visualisation (APVIS 2006), pp. 207-216, 2006.

  60. Seok-Hee Hong and Nikola S. Nikolov, Hierarchical Layout of Directed Graphs in Three Dimensions, Proceedings of Graph Drawing 2005, pp. 251-261, Lecture Notes in Computer Science 3843, 2005.

  61. Joshua Wing Kei Ho and Seok-Hee Hong, Drawing Clustered Graphs in Three Dimensions, Proceedings of Graph Drawing 2005, pp. 492-502, Lecture Notes in Computer Science 3843, 2005.

  62. Weidong Huang, Seok-Hee Hong and Peter Eades, Layout Effects on Sociogram Perception, Proceedings of Graph Drawing 2005, pp. 262-273, Lecture Notes in Computer Science 3843, 2005.

  63. Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua Wing Kei Ho, Seok-Hee Hong, Dirk Koschutzki, Colin Murray, Nikola S. Nikolov, Ronnie Taib, Alexandre Tarassov, Kai Xu, GEOMI: GEOmetry for Maximum Insight, Proceedings of Graph Drawing 2005, pp. 468-479, Lecture Notes in Computer Science 3843, 2005.

  64. Seok-Hee Hong, MultiPlane: a New Framework for Drawing Graphs in Three Dimensions, Proceedings of Graph Drawing 2005, pp. 514-515, Lecture Notes in Computer Science 3843, 2005.

  65. Seok-Hee Hong, Network Analysis and Visualisation, Proceedings of Graph Drawing 2005, pp. 524-527, Lecture Notes in Computer Science 3843, 2005.

  66. Wanchun Li, Seok-Hee Hong and Peter Eades, Navigating Software Architecture, Proceedings of IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05), pp. 225-232, IEEE, 2005.

  67. Wanchun Li, Seok-Hee Hong and Peter Eades, A Framework for Visualising Large Graphs, Proceedings of International Conference Information Visualisation (IV05), pp. 528-535, IEEE, 2005.

  68. Adel Ahmed, Tim Dwyer, Seok-Hee Hong, Colin Murray, Le Song, Ying Xin Wu, Visualisation and Analysis of Large and Complex Scale-free Networks, Proc. of EuroVis 2005 (EUROGRAPHICS-IEEE VGTC Symposium on Visualization), pp. 1â€"8, IEEE, 2005.

  69. Kozo Sugiyama, Ryo Osawa and Seok-Hee Hong, The Puzzle Generators and Symmetric Puzzle Layout, Proceedings of APVIS (Asia Pacific Symposium on Information Visualisation) 2005, pp. 93-102, Vol. 45, CRPIT, 2005.

  70. Seok-Hee Hong and N. Nikolov, Layered Drawings of Directed Graphs in Three Dimensions, Proceedings of APVIS (Asia Pacific Symposium on Information Visualisation) 2005, pp. 65-70, Vol. 45, CRPIT, 2005.

  71. Seok-Hee Hong and T. Murtagh, Visualization of Large and Complex Networks Using PolyPlane, Proceedings of Graph Drawing 2004, Lecture Notes in Computer Science 3383, pp. 471-482, Springer, 2004.

  72. Seok-Hee Hong and Peter Eades, A Linear Time Algorithm for Constructing Maximally Symmetric Straight line Drawings of Planar Graphs, Proceedings of Graph Drawing 2004, Lecture Notes in Computer Science 3383, pp. 307-317, Springer, 2004.

  73. Seok-Hee Hong, Damian Merrick and Hugo A D do Nascimento, The Metro Map Layout Problem , Proceedings of Graph Drawing 2004, Lecture Notes in Computer Science 3383, Springer, pp. 482-491, 2004.

  74. Seok-Hee Hong, Damian Merrick and Hugo A D do Nascimento, The Metro Map Layout Problem, Proceedings of Invis.au (Australasian Symposium on Information Visualisation) 2004, CRPIT 35. Churcher, N. and Churcher, C., Eds., ACS. pp. 91-100, 2004.

  75. Seok-Hee Hong and Peter Eades, Symmetric Layout of Disconnected Graphs, Algorithms and Computations, Proceedings of ISAAC 2003 (Algorithms and Computations), Lecture Notes in Computer Science, Springer, 2003, pp. 405-414, 2003.

  76. Kozo Sugiyama, Seok-Hee Hong and Atsuhiko Maeda, The Puzzle Layout Problem, Graph Drawing, Proceedings of Graph Drawing 2003, Lecture Notes in Computer Science 2912, pp. 500-501, Springer, 2003.

  77. Seok-Hee Hong and Peter Eades, Drawing Disconnected Graphs Symmetrically, Proceedings of WAAC (Japan-Korea Workshop on Algorithms and Computation) 2003, pp. 276-288, 2003.

  78. Seok-Hee Hong, The Rectilinear Crossing Minimization Problem, Proc. of AWOCA (Australasian Workshop on Combinatorial Algorithms) 2003, pp. 46-56, 2003.

  79. Seok-Hee Hong and Peter Eades, Drawing Disconnected Graphs Symmetrically, Proc. of WAAC (Japan-Korea Workshop on Algorithms and Computation) 2003, pp. 276-288, 2003.

  80. Tom Murtagh and Seok-Hee Hong, 3DTreeDraw: A Three Dimensional Tree Drawing System Proc. of SoCG (ACM Symposium on Computational Geometry) 2003, pp. 380-382, 2003.

  81. Christoph Buchheim and Seok-Hee Hong, Crossing Minimization for Symmetries, Proc. of ISAAC02, (Algorithms and Computations), LNCS 2518, pp 563-574, 2002.

  82. David Abelson, Seok-Hee Hong and Don E. Taylor, A Group-Theoretic Method for Drawing Graphs Symmetrically, Graph Drawing, Proc. of Graph Drawing 2002, Lecture Notes in Computer Science 2528, Springer, pp 86-97, 2002.

  83. Seok-Hee Hong, Brendan McKay and Peter Eades, Symmetric Drawings of Triconnected Planar Graphs, Proceeding of SODA 2002, pp. 356-365, 2002.

  84. Seok-Hee Hong, Drawing Graphs Symmetrically in Three Dimensions, Proceeding of GD01, LNCS 2265, Springer Verlag, pp. 189-204, 2002.

  85. Seok-Hee Hong and Peter Eades, An Algorithm for Finding Three Dimensional Symmetry in Trees, Proceeding of Graph Drawing 2000, Lecture Notes in Computer Science 1984, Springer, pp. 360-371, 2000.

  86. Seok-Hee Hong and Peter Eades,An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs, Proceeding of ISAAC 2000, Lecture Notes in Computer Science 1969, Springer, pp. 266-277, 2000.

  87. Seok-Hee Hong and Peter Eades, An Algorithm for Finding Three Dimensional Symmetry in Trees, Proceedings of Korea Information Science Society Spring Conference, 2000.

  88. Seok-Hee Hong and Peter Eades, How to Find Three Dimensional Symmetry in Series Parallel Digraphs, Proceedings of Korea Information Science Society Spring Conference, 2000.

  89. Seok-Hee Hong, Peter Eades and Sang-Ho Lee, Finding Planar Geometric Automorphisms in Planar Graphs, Proceedings of the 9th Int'l Symp. on Algorithms and Computation, Lecture Notes in Computer Science 1533, Springer, pp. 277-286, 1998.

  90. Seok-Hee Hong, Peter Eades, Aaron Quigley and Sang-Ho Lee, Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions, Proceedings of the 6th Symp. on Graph Drawing '98, Lecture Notes in Computer Science, Springer, Montreal, Canada, 1998.

  91. Yun-Hee Lee, Seok-Hee Hong and Sang-Ho Lee, Design and Implementation of Interconnection Network System, Proceedings of Korea Information Science Society Fall Conference, pp.667-669, 1998.

  92. Hye-Ryon Park, Seok-Hee Hong, Sang-Ho Lee and Peter Eades, Algorithms for Drawing Series-Parallel Digraphs Symmetrically, Proc. of SoftVis 97 Software Visualisation Workshop, Australia, 1997.

  93. Seok-Hee Hong and Sang-Ho Lee, The Flip Distance Problem of Triangulations, Proc. of the Japan-Korea Joint Workshop on Algorithms and Computation, pp.9 - 15, 1997.

  94. Hye-Ryon Park, Seok-Hee Hong and Sang-Ho Lee, Algorithms for Detecting the Geometric Symmetry of a Series-Parallel Digraph and Its Drawing Algorithm, Proc. of the Japan-Korea Joint Workshop on Algorithms and Computation, pp.32 - 39, 1997.

  95. Seok-Hee Hong and Sang-Ho Lee, The Flip Distance Problem of Triangulations, Proceedings of Korea Information Science Society Fall Conference, 1997.

  Refereed Conference Abstracts and Poster Papers

  1. M. Chimani, P. Eades, P. Eades, S. Hong, K. Klein, W. Huang, M. Marner, R. Smith and B. Thomas, "People Prefer Less Stress and Fewer Crossings", Graph Drawing 2014, 2014.

  2. S. Hong, "Visual Analytics for Massive Complex Networks", Proceedings of CGIV (Computer Graphics, Imaging and Visualization) 2013, IEEE, 2013.

  3. T. Dwyer, F. Frati, S. Hong and K. Klein, "Theory and Practice of Graph Drawing", Proceedings of Graph Drawing 2012, pp. 571-574, Lecture Notes in Computer Science, Springer, 2013.

  4. S. Hong, "Recent Advances in Straight-line Graph Drawing: Extending Fary's Theorem, Steinitz's Theorem and Tutte's Barycenter Theorem", Proceedings of AAAC 2011 (Asian Association for Algorithms and Computation), 2011.

  5. S. Hong, N. Katoh, S. Poon and S. Tanigawa, "On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs", Proceedings of AAAC 2011 (Asian Association for Algorithms and Computation), 2011.

  6. V. Batagelj, K. Borner, U. Brandes, S. Hong et al,,Sunbelt 2011 Viszards Session, "Visualization and Analysis of Airline Traffic", Proceedings of Sunbelt 2011, US.

  7. Q. Nguyen, P. Eades, S. Hong and W. Huang, "Large Crossing Angles in Circular Layouts", Proceedings of Graph Drawing 2010, pp. 397-399, Lecture Notes in Computer Science, Springer, 2011.

  8. S. Hong, "Drawing Graphs with Large Crossing Angles", Proceedings of AAAC 2010 (Asian Association for Algorithms and Computation), 2010.

  9. K. Haraguchi, S. Hong and H. Nagamochi, "Visual Analysis of Hierarchical Data using 2.5D Drawing with Minimum Occlusion", IEEE Pacific Visualization Symposium 2008 (PacificVis 2008), March 5-7 Kyoto, Japan, 2008. (Best Post Award)

  10. Jaeseong Gim, Yohei Arahori, Takashi Imamichi, Seok-Hee Hong and Hiroshi Nagamochi, Overlap Removal in Label Layouts by a Multi-sphere Scheme, IEEE Pacific Visualization Symposium 2008 (PacificVis 2008), March 5-7 Kyoto, Japan, 2008.

  11. Vladimir Batagelj et al., Sunbelt 2008 Viszards Session, Visualization and Analysis of WoS (Web of Science), Proceedings of Sunbelt 2008, US.

  12. Adel Ahmed, Xiaoyan Fu, Seok-Hee Hong, Hoang Quan Nguyen, and Kai Xu, Visual Analysis of Dynamic Networks with Geological Clustering, poster, IEEE Symposium on Visual Analytics Science and Technology (VAST) 2007, October 2007, California USA.

  13. Xiaoyan Fu, Seok-Hee Hong, Pip Pattison and Garry Robins, Visualisation and Interaction of Temporal Multi-relational Networks, Proceedings of Sunbelt 2007, pp. 6, 2007.

  14. Vladimir Batagelj et al., Sunbelt 2007 Viszards Session, Visualization and Analysis of Wiki, Proceedings of Sunbelt 2007, Greece.

  15. Kai Xu, Rohan Williams, X. Huang, C. Cotsapas, Seok-Hee Hong, G. McCaughan, M. Gorrell, and Peter Little, Multi-scale Visualisation and Function Analysis of Gene Ontology Network for High Throughput Experiments, Bioinformatics Australia 2006, 2006.

  16. David Fung, Seok-Hee Hong, Kai Xu, and David Hart, Contextual Visualization of Microarray Data in Bioprocess Gene Ontology, Bioinformatics Australia 2006, 2006.

  17. R. Williams, Kai Xu, X. Huang, C. Cotsapas, Seok-Hee Hong, G. McCaughan, M. Gorrell, and Peter Little, Visualisation and Analysis of Large and Complex Networks, 14th Annnual International Conference On Intelligent Systems For Molecular Biology (ISMB 2006), 2006.

  18. Vladimir Batagelj et al., Sunbelt 2006 Viszards Session, Visualization and Analysis of IMDB (Internet Movie DataBase), Proceedings of Sunbelt 2006, Canada.

  19. Xiaoyan Fu, Seok-Hee Hong, Nikolas S. Nikolov, Xiaobin Shen, Ying Xing Wu, and Kai Xu, Visualization and Analysis of Small-World Email Networks, 12th IEEE Symposium on Information Visualization (InfoVis 2006), 2006.

  20. Seok-Hee Hong and T. Murtagh, PolyPlane: An Implementation of a New Layout Algorithm for Trees in Three Dimensions, IEEE InfoVis poster, 2003.

  21. Nikola S. Nikolov and Seok-Hee Hong, Uniqueness Centralities, Proceedings of Sunbelt 2005, pp. 102, 2005.

  22. Tim Dwyer, Xiaoyan Fu, Seok-Hee Hong, Nikola S. Nikolov and Kai Xu, Visualisation and Analysis of Large and Complex Networks Using GEOMI, Proceedings of Sunbelt 2005, pp. 92, 2005.

  Technical Report

  1. M. A. Bekos, S. Cornelsen, L. Grilli, S. Hong and M. Kaufmann, "On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs", CoRR abs/1409.0461, 2014.

  2. S. Hong and H. Nagamochi, "Beyond Planarity: Testing Full Outer-2-Planarity in Linear Time", TR [2014-003], Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2014.

  3. S. Hong, P. Eades, N. Katoh, G. Liotta, P. Schweitzer and Y. Suzuki, "A Linear Time Algorithm for Testing Outer-1-Planarity",TR IT-IVG-2013-01, School of IT, University of Sydney, 2013.

  4. M. Bekos, S. Cornelsen, M. Fink, S. Hong, M. Kaufmann, M. Nollenburg, I. Rutter and A. Symbonis, "Many-to-One Boundary Labeling with Backbones", CoRR abs/1308.6801, 2013.

  5. J. Kim, P. Eades, R. Fleischer, S. Hong, C. Iliopoulos, K. Park, S. Puglisi and T. Tokuyama, "Order Preserving Matching", CoRR abs/1302.4064, 2013.

  6. S. Hong and H. Nagamochi, "Simpler Testing for Two-page Book Embedding of Partitioned Graphs", TR 2003-001, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, 2013.

  7. H. Dehkordi, Q. Nguyen, P. Eades, S. Hong, "Circular Graph Drawings with Large Crossing Angles", School of IT, University of Sydney, TR, 2012.

  8. Q. Nguyen, P. Eades and S. Hong, "On the Faithfulness of Graph Visualizations", School of IT, University of Sydney, TR, 2012.

  9. Q. Nguyen, P. Eades and S. Hong, "StreamEB: Stream Edge Bundling", School of IT, University of Sydney, TR, tr689, July 2012.

  10. P. Eades, S. Hong, N. Katoh, G. Liotta, P. Schweitzer and Y. Suzuki, "Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time",TR IT-IVG-2012-02, School of IT, University of Sydney, 2012.

  11. P. Eades, S. Hong, G. Liotta, S. Poon, "Fary's Theorem for 1-planar Graphs", TR IT-IVG-2012-01, School of IT, University of Sydney, 2012.

  12. 2. P. Eades, S. Hong, G. Liotta, S. Poon, "Straight-line Drawings of 1-planar Graphs", TR IT-IVG-2011-01, School of IT, University of Sydney, 2011.

  13. P. Eades, W. Huang and S. Hong, "A Force-Directed Method for Large Crossing Angle Graph Drawing", CoRR abs/1012.4559, 2010.

  14. P. Eades, W. Huang and S. Hong, "A Force-Directed Method for Large Crossing Angle Graph Drawing". Technical Report Number 640, University of Sydney, 2009.

  15. S. Hong and H. Nagamochi, "Two-page Book Embedding and Clustered Graph Planarity" , TR [2009-004], Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2009.

  16. S. Hong and H. Nagamochi, "Testing Planarity of Level Graphs with Intra-level Edges", TR [2009-005], Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2009.

  17. K. Haraguchi, S. Hong and H. Nagamochi, "Visual Analysis of Hierarchical Data Using 2.5D Drawing with Minimum Occlusion", TR [2009-010], Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2009.

  18. K. Haraguchi, S. Hong and H. Nagamochi, "Classification via Visualization of Sample-feature Bipartite Graphs", TR [2009-011], Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2009.

  19. T. Imamichi, Y. Arahori, J. Gim, S. Hong and H. Nagamochi, "Removing overlaps in label layouts using multi-sphere scheme", TR 2008-06, Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2008.

  20. S. Hong and H. Nagamochi, "Extending Steinitz' Theorem to Non-convex Polyhedra", TR 2008-12, Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2008.

  21. Seok-Hee Hong and Hiroshi Nagamochi, Star-shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints , TR 2008-02, Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2008.

  22. David C.Y. Fung, Seok-Hee Hong, Kai Xu and David Hart, Visualizing the Gene Ontology-Annotated Clusters of Co-expressed Genes: A Two-Design Study , Technical Report No: 622; School of Information Technologies; The University of Sydney 2008.

  23. Seok-Hee Hong and Hiroshi Nagamochi, Convex Drawings with Non-convex Boundary Constraints, TR 2007-003, Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2007.

  24. Seok-Hee Hong and Hiroshi Nagamochi, Convex Drawings of Hierarchical Planar Graphs and Clustered Planar Graphs, Department of Applied Mathematics and Physics, Graduate School of Informatics, University of Kyoto, Japan, 2007.

  25. Richard Webber and Seok-Hee Hong, Force-directed Animations for a Class of Dynamic Bipartite and Clustered Graphs, NICTA TR, 2007.

  26. Nicolas Senechal, Seok-Hee Hong and Peter Eades, Display of Sensor Networks, NICTA TR 2006.

  27. Hoang Quan Nguyen and Seok-Hee Hong, Comparison of Centrality-Based Planarisation for 2.5D Graph Drawing, NICTA TR 2006.

  28. Adel Ahmed and Seok-Hee Hong, "Navigation Techniques for 2.5D Graph Layout", TR, School of IT, University of Sydney, 2006.

  29. Christoph Buchheim and Seok-Hee Hong, Testing Planarity of Geometric Automorphisms in Linear Time, ZAIK 2006-517, University of Cologne, Germany, 2006.

  30. Weidong Huang, Seok-Hee Hong, and Peter Eades, Layouts effects: Comparison of Sociogram Drawing Conventions, Technical report, USYD-IT-TR-575, Oct 2005.

  31. Seok-Hee Hong, MultiPlane: a New Framework for Drawing Graphs in Three Dimensions, NICTA TR 2005.

  32. Christoph Buchheim and Seok-Hee Hong, Crossing Minimisation for Symmetries, ZAIK 2005-484, University of Cologne, Germany, 2005.

  33. Seok-Hee Hong, Brendan McKay and Peter Eades, A Linear Time ALgorithm for Constructing Maximally Symmetric Drawings of Triconnected Planar Graphs, TR IT-IVG-2004-01, SChool of IT, UNiversity of Sydney, 2004.

  34. Seok-Hee Hong, Damian Merrick and Hugo do Nascimento, The Metromap Layout Problem,TR IT-IVG-2003-03, School of IT, University of Sydney, 2003.

  35. Kozo Sugiyama, Seok-Hee Hong and Atsuhiko Maeda, The Puzzle Layout Problem,TR IT-IVG-2003-02, School of IT, University of Sydney, 2003.

  36. Seok-Hee Hong and Tom Murtagh, PolyPlane: A New Layout Algorithm For Trees In Three Dimensions,Technical Report IT-IVG-2003-01, School of Information Technologies, The University of Sydney, 2003.

  37. David Abelson, Seok-Hee Hong and Donald E. Taylor, A Group-Theoretic Method for Drawing Graphs Symmetrically , Technical Report IT-IVG-2002-01, School of Information Technologies, The University of Sydney, 2002.

  38. Seok-Hee Hong and Peter Eades, Drawing Trees Symmetrically in Three Dimension, Technical Report IT-IVG-2002-02, School of Information Technologies, The University of Sydney, 2002.

  39. Tom Murtagh and Seok-Hee Hong, 3DTreeDraw: A Three Dimensional Tree Drawing System , Technical Report IT-IVG-2002-03, School of Information Technologies, The University of Sydney, 2002.

  40. Seok-Hee Hong, Brendan McKay and Peter Eades, Drawing Planar Graphs Symmetrically I: Triconnected Planar Graphs, Technical Report CS-IVG-2001-00, Basser Department of Computer Science, The University of Sydney, 2001.

  41. Seok-Hee Hong and Peter Eades, Drawing Planar Graphs Symmetrically II: Biconnected Planar Graphs, Technical Report CS-IVG-2001-01, Basser Department of Computer Science, The University of Sydney, 2001.

  42. Seok-Hee Hong and Peter Eades, Drawing Planar Graphs Symmetrically III: One-connected Planar Graphs, Technical Report CS-IVG-2001-02, Basser Department of Computer Science, The University of Sydney, 2001.

  43. Seok-Hee Hong and Peter Eades, Drawing Planar Graphs Symmetrically IV: Disconnected Planar Graphs, (Extended Abstract),Technical Report CS-IVG-2001-03, Basser Department of Computer Science, The University of Sydney, 2001.

  Thesis