2024

• Binucci, C., Di Battista, G., Didimo, W., Dujmovi?, V., Hong, S., Kaufmann, M., Liotta, G., Morin, P., Tappini, A. (2024). Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access, 12, 68828-68846. [More Information]
• Binucci, C., Tappini, A., Büngener, A., Di Battista, G., Didimo, W., Dujmovi?, V., Hong, S., Kaufmann, M., Liotta, G., Morin, P. (2024). Min-k-planar Drawings of Graphs. Journal of Graph Algorithms and Applications, 28(2 Special Issue), 1-35. [More Information]

2023

• Grilli, L., Hong, S., Kratochvíl, J., Rutter, I. (2023). Drawing Simultaneously Embedded Graphs with Few Bends. International Journal of Foundations of Computer Science, 34(7), 807-824. [More Information]
• Kim, H., Choi, Y., Park, K., Lin, X., Hong, S., Han, W. (2023). Fast subgraph query processing and subgraph matching via static and dynamic equivalences. VLDB Journal, 32(2), 343-368. [More Information]
• Xiao, C., Hong, S., Huang, W. (2023). Optimizing graph layout by t-SNE perplexity estimation. International Journal of Data Science and Analytics, 15(2), 159-171. [More Information]
• Meidiana, A., Hong, S., Eades, P. (2023). Shape-Faithful Graph Drawings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), : Springer Verlag.
• Meidiana, A., Hong, S., Cai, S., Torkel, M., Eades, P. (2023). SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing. IEEE Transactions on Visualization and Computer Graphics. [More Information]

2022

• Cai, S., Hong, S., Shen, J., Liu, T. (2022). A Machine Learning Approach for Predicting Human Preference for Graph Drawings. Journal of Graph Algorithms and Applications, 26(4), 447-470. [More Information]
• Cai, S., Hong, S., Xia, X., Liu, T., Huang, W. (2022). A machine learning approach for predicting human shortest path task performance. Visual Informatics, 6(2), 50-61. [More Information]
• Meidiana, A., Hong, S., Eades, P., Keim, D. (2022). Automorphism Faithfulness Metrics for Symmetric Graph Drawings. IEEE Transactions on Visualization and Computer Graphics. [More Information]
• Pasdar,, A., Lee,, Y., Liu, T., Hong, S. (2022). Train Me to Fight: Machine-Learning Based On-Device Malware Detection for Mobile Devices. Proceedings - 22nd IEEE/ACM International Symposium on Cluster, Cloud and Internet Computing, CCGrid 2022, : Springer Verlag.

2021

• Cai, S., Hong, S., Shen, J., Liu, T. (2021). A Machine Learning Approach for Predicting Human Preference for Graph Layouts. 14th IEEE Pacific Visualization Symposium (PacificVis 2021), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hu, J., Chu, T., Hong, S., Chen, J., Meidiana, A., Torkel, M., Eades, P., Ma, K. (2021). BC tree-based spectral sampling for big complex network visualization. Applied Network Science, 6(1), 60. [More Information]
• Hu, J., Hong, S., Chen, J., Torkel, M., Eades, P., Ma, K. (2021). Connectivity-Based Spectral Sampling for Big Complex Network Visualization. 9th International Conference on Complex Networks and Their Applications (COMPLEX NETWORKS 2020), Cham: Springer Nature. [More Information]
• Hong, S., Eades, P., Torkel, M. (2021). GDot: Drawing Graphs with Dots and Circles. 14th IEEE Pacific Visualization Symposium (PacificVis 2021), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hong, S., Eades, P., Torkel, M., Wood, J., Park, K. (2021). Louvain-based Multi-level Graph Drawing. 14th IEEE Pacific Visualization Symposium (PacificVis 2021), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• De Luca, F., Di Giacomo, E., Hong, S., Kobourov, S., Lenhart, W., Liotta, G., Meijer, H., Tappini, A., Wismath, S. (2021). Packing trees into 1-planar graphs. Journal of Graph Algorithms and Applications, 25(2), 605-624. [More Information]
• Hong, S., Nagamochi, H. (2021). Re-embedding a 1-plane graph for a straight-line drawing in linear time. Theoretical Computer Science, 892, 132-154. [More Information]
• Meidiana, A., Wood, J., Hong, S. (2021). Sublinear-time Algorithms for Stress Minimization in Graph Drawing. 14th IEEE Pacific Visualization Symposium (PacificVis 2021), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Meidiana, A., Hong, S., Cai, S., Torkel, M., Eades, P. (2021). Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing. 14th IEEE Pacific Visualization Symposium (PacificVis 2021), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Kim, H., Choi, Y., Park, K., Lin, X., Hong, S., Han, W. (2021). Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. 2021 International Conference on Management of Data (SIGMOD 2021), China: Association for Computing Machinery (ACM). [More Information]

2020

• Hong, S. (2020). Algorithms for 1-Planar Graphs. In Seok-Hee Hong, Takeshi Tokuyama (Eds.), Beyond Planar Graphs, Communications of NII Shonan Meetings, (pp. 69-87). Singapore: Springer Nature Singapore. [More Information]
• Hong, S., Tokuyama, T. (2020). Beyond Planar Graphs, Communications of NII Shonan Meetings. Singapore: Springer Nature Singapore. [More Information]
• Hong, S. (2020). Beyond Planar Graphs: Introduction. In Seok-Hee Hong, Takeshi Tokuyama (Eds.), Beyond Planar Graphs, Communications of NII Shonan Meetings, (pp. 1-9). Singapore: Springer Nature Singapore. [More Information]
• Binucci, C., Di Giacomo, E., Hong, S., Liotta, G., Meijer, H., Sacristán, V., Wismath, S. (2020). Colored anchored visibility representations in 2D and 3D space. Computational Geometry: Theory and Applications, 89, 1-13. [More Information]
• Hong, S., Eades, P., Torkel, M., Huang, W., Cifuentes, C. (2020). Dynamic Graph Map Animation. 13th IEEE Pacific Visualization Symposium (PacificVis 2020), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Angelini, P., Eades, P., Hong, S., Klein, K., Kobourov, S., Liotta, G., Navarra, A., Tappini, A. (2020). Graph planarity by replacing cliques with paths. Algorithms, 13(8), 1-10. [More Information]
• Hong, S., Lu, S. (2020). Graph sampling methods for big complex networks integrating centrality, k-core, and spectral sparsification. 35th Annual ACM Symposium on Applied Computing (SAC 2020), New York: Association for Computing Machinery (ACM). [More Information]
• Kim, H., Min, S., Park, K., Lin, X., Hong, S., Han, W. (2020). IDAR: Fast supergraph search using DAG integration. Proceedings of the VLDB Endowment, 13(9), 1456-1468. [More Information]
• Meidiana, A., Hong, S., Eades, P. (2020). New Quality Metrics for Dynamic Graph Drawing. 28th International Symposium on GraphDrawing and Network Visualization, GD 2020, Cham: Springer Nature Switzerland. [More Information]
• De Luca, F., Di Giacomo, E., Hong, S., Kobourov, S., Lenhart, W., Liotta, G., Meijer, H., Tappini, A., Wismath, S. (2020). Packing trees into 1-planar graphs. 14th International Conference and Workshops on Algorithms and Computation (WALCOM 2020), Cham: Springer. [More Information]
• Hong, S., Nagamochi, H. (2020). Path-Monotonic Upward Drawings of Graphs. 26th International Computing and Combinatorics Conference (COCOON 2020), Cham: Springer. [More Information]
• Meidiana, A., Hong, S., Eades, P., Keim, D. (2020). Quality Metrics for Symmetric Graph Drawings. 13th IEEE Pacific Visualization Symposium (PacificVis 2020), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Lee, Y., King, J., Kim, Y., Hong, S. (2020). Robust Scheduling for Large-Scale Distributed Systems. 19th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2020), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hu, J., Hong, S., Eades, P. (2020). Spectral Vertex Sampling for Big Complex Graphs. 8th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2019, Cham: Springer. [More Information]
• Meidiana, A., Hong, S., Torkel, M., Cai, S., Eades, P. (2020). Sublinear Time Force Computation for Big Complex Network Visualization. Computer Graphics Forum, 39(3), 579-591. [More Information]

2019

• Hong, S., Nagamochi, H. (2019). A linear-time algorithm for testing full outer-2-planarity. Discrete Applied Mathematics, 255, 234-257. [More Information]
• Meidiana, A., Hong, S., Eades, P., Keim, D. (2019). A Quality Metric for Visualization of Clusters in Graphs. 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), Cham: Springer. [More Information]
• Lee, Y., King, J., Hong, S. (2019). Holistic Approach for Studying Resource Failures at Scale. 18th IEEE International Symposium on Network Computing and Applications (NCA 2019), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hong, S., Eades, P., Torkel, M., Wang, Z., Chae, M., Hong, S., Langerenken, D., Chafi, H. (2019). Multi-level Graph Drawing Using Infomap Clustering. 27th International Symposium on Graph Drawing and Network Visualization (GD 2019), Cham: Springer. [More Information]
• Meidiana, A., Hong, S., Huang, J., Eades, P., Ma, K. (2019). Topology-Based Spectral Sparsification. 9th IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV 2019), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• King, J., Kim, Y., Lee, Y., Hong, S. (2019). Visualisation of distributed systems simulation made simple. 11th IEEE International Conference on Cloud Computing Technology and Science (CloudCom 2019), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]

2018

• Hong, S., Nguyen, Q., Meidiana, A., Li, J., Eades, P. (2018). BC Tree-based Proxy Graphs for Visualization of Big Graphs. 11th IEEE Pacific Visualization Symposium (PacificVis 2018), Piscataway: IEEE Computer Society. [More Information]
• Eades, P., Nguyen, Q., Hong, S. (2018). Drawing Big Graphs using Spectral Sparsification. 25th International Symposium on Graph Drawing & Network Visualization, Cham: Springer International Publishing. [More Information]
• Hong, S. (2018). Editorial: Special Issue on Algorithms and Computation. Algorithmica, 80(7), 2132-2133. [More Information]
• Bae, S., Baffier, J., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S., Korman, M., Montecchiani, F., Rutter, I., et al (2018). Gap-planar graphs. 25th International Symposium on Graph Drawing and Network Visualization (GD 2017), Cham: Springer. [More Information]
• Bae, S., Baffier, J., Chun, J., Eades, P., Eickmeyer, K., Grilli, L., Hong, S., Korman, M., Montecchiani, F., Rutter, I., et al (2018). Gap-planar graphs. Theoretical Computer Science, 745, 36-52. [More Information]
• Hong, S. (2018). Guest editor's foreword. International Journal of Computational Geometry and Applications, 28(2), 79-80. [More Information]
• Cela, A., Lee, Y., Hong, S. (2018). Resource provisioning for memory intensive graph processing. 2018 Australasian Computer Science Week Multiconference (ACSW 2018), Brisbane: Association for Computing Machinery (ACM). [More Information]
• Hong, S., Nagamochi, H. (2018). Simpler algorithms for testing two-page book embedding of partitioned graphs. Theoretical Computer Science, 725, 79-98. [More Information]
• Liu, S., Andrienko, G., Wu, Y., Cao, N., Jiang, L., Shi, C., Wang, Y., Hong, S. (2018). Steering data quality with visual analytics: The complexity challenge. Visual Informatics, 2(4), 191-197. [More Information]
• Angelini, P., Eades, P., Hong, S., Klein, K., Kobourov, S., Liotta, G., Navarra, A., Tappini, A. (2018). Turning cliques into paths to achieve planarity. 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), Cham: Springer. [More Information]

2017

• Hong, S., Nguyen, Q., Meidiana, A., Li, J. (2017). BCSA: BC Tree-based Sampling and Visualization of Big Graphs. 25th International Symposium on Graph Drawing & Network Visualization, Cham: Springer International Publishing.
• Nguyen, Q., Hong, S., Eades, P. (2017). DNNG: Quality metrics and layout for neighbourhood faithfulness. 10th IEEE Pacific Visualization Symposium, PacificVis 2017, Washington, D.C.: IEEE Computer Society. [More Information]
• Nguyen, A., Hong, S. (2017). K-core based multi-level graph visualization for scale-free networks. 10th IEEE Pacific Visualization Symposium, PacificVis 2017, Washington, D.C.: IEEE Computer Society. [More Information]
• Bekos, M., Cornelsen, S., Grilli, L., Hong, S., Kaufmann, M. (2017). On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Algorithmica, 79(2), 401-427. [More Information]
• Nguyen, Q., Hong, S., Eades, P., Meidiana, A. (2017). Proxy graph: Visual quality metrics of big graph sampling. IEEE Transactions on Visualization and Computer Graphics, 23(6), 1600-1611. [More Information]
• Eades, P., Hong, S., Nguyen, A., Klein, K. (2017). Shape-based quality metrics for large graph visualization. Journal of Graph Algorithms and Applications, 21(1), 29-53. [More Information]
• Nguyen, Q., Eades, P., Hong, S. (2017). Which graph layout gives a good shape for large graphs? 25th International Symposium on Graph Drawing & Network Visualization, Cham: Springer International Publishing.

2016

• Dekhordi, H., Eades, P., Hong, S., Nguyen, Q. (2016). Circular right-angle crossing drawings in linear time. Theoretical Computer Science, 639, 26-41. [More Information]
• Huang, W., Eades, P., Hong, S., Duh, H. (2016). Effects of curves on graph perception. 2016 IEEE Pacific Visualization Symposium (PacificVis), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Bereg, S., Hong, S., Katoh, N., Poon, S., Tanigawa, S. (2016). On the edge crossing properties of Euclidean minimum weight Laman graphs. Computational Geometry: Theory and Applications, 51, 15-24. [More Information]
• Hong, S. (2016). Preface. 27th International Symposium on Algorithms and Computation (ISAAC 2016), Sydney: Schloss Dagstuhl - Leibniz Center for Informatics.
• Hong, S., Nagamochi, H. (2016). Re-embedding a 1-plane graph into a straight-line drawing in linear time. 24th International Symposium on Graph Drawing and Network Visualization (GD 2016), Cham: Springer. [More Information]
• Hong, S., Nagamochi, H. (2016). Testing full outer-2-planarity in linear time. 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Berlin: Springer. [More Information]

2015

• Hong, S., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2015). A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica, 72, 1033-1054. [More Information]
• Di Giacomo, E., Didimo, W., Hong, S., Kaufmann, M., Kobourov, S., Liotta, G., Misue, K., Symvonis, A., Yen, H. (2015). Low ply graph drawing. 6th International Conference on Information, Intelligence, Systems and Applications (IISA 2015), Piscataway, New Jersey: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Bekos, M., Cornelsen, S., Fink, M., Hong, S., Kaufmann, M., Nollenburg, M., Rutter, I., Symvonis, A. (2015). Many-to-One Boundary Labeling with Backbones. Journal of Graph Algorithms and Applications, 19(3), 779-816. [More Information]
• Meidiana, A., Hong, S. (2015). MultiStory: Visual Analytics of Dynamic Multi-Relational Networks. 2015 8th IEEE Pacific Visualization Symposium (PacificVis 2015), Piscataway: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hong, S. (2015). Panel: Top computation visualization problems 2015 - Big complex network visualization. The 8th ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, : Springer Verlag.
• Eades, P., Hong, S., Klein, K., NGUYEN, N. (2015). Shape-Based Quality Metrics for Large Graph Visualization. 23rd International Symposium on Graph Drawing & Network Visualization. Springer. [More Information]
• Eades, P., Hong, S., Liotta,, G., Katoh,, N., Poon,, S. (2015). Straight-line drawability of a planar graph plus an edge. 14th International Symposium, WADS Algorithms and Data Structures, : Springer Verlag.
• Eades, P., Hong, S., Liotta, G., Katoh, N., Poon, S. (2015). Straight-Line Drawability of a Planar Graph Plus an Edge. WADS 2015: Algorithms and Data Structures Symposium. Springer.
• Fujishiro, I., Chen, B., Chen, W., Hong, S., Itoh, T., Koyamada, K., Ono, K., Nonaka, J. (2015). Top computational visualization R&D problems 2015: panel. The 8th ACM SIGGRAPH Conference and Exhibition on Computer Graphics and Interactive Techniques in Asia, : Springer Verlag.

2014

• Hong, S., Huang, W., Misue, K., Quan, W. (2014). A framework for visual analytics of massive complex networks. International Conference on Big Data and Smart Computing, Bangkok, Thailand: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Angelini, P., Da Lozzo, G., Di Bartolomeo, M., Di Battista, G., Hong, S., Patrignani, M., Roselli, V. (2014). Anchored Drawings of Planar Graphs. 22nd International Symposium on Graph Drawing (GD 2014), Berlin: Springer. [More Information]
• Grilli, L., Hong, S., Kratochvil, J., Rutter, I. (2014). Drawing Simultaneously Embedded Graphs with Few Bends. 22nd International Symposium on Graph Drawing (GD 2014), Berlin: Springer. [More Information]
• Marner, M., Smith, R., Thomas, B., Klein, K., Eades, P., Hong, S. (2014). GION: Interactively Untangling Large Graphs on Wall-Sized Displays. 22nd International Symposium on Graph Drawing (GD 2014), Berlin: Springer. [More Information]
• Carpendale, S., Chen, W., Hong, S. (2014). Guest editors' introduction: Special section on the IEEE pacific visualization symposium. IEEE Transactions on Visualization and Computer Graphics, 20(8), 1085-1086. [More Information]
• Huang, W., Eades, P., Hong, S. (2014). Larger crossing angles make graphs easier to read. Journal of Visual Languages and Computing, 25(4), 452-465. [More Information]
• Bekos, M., Cornelsen, S., Grilli, L., Hong, S., Kaufmann, M. (2014). On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. 22nd International Symposium on Graph Drawing (GD 2014), Berlin: Springer. [More Information]
• Kim, J., Eades, P., Fleischer, R., Hong, S., Iliopoulos, C., Park, K., Puglisi, S., Tokuyama, T. (2014). Order-preserving matching. Theoretical Computer Science, 525, 68-79. [More Information]
• Chimani, M., Eades, P., Eades, P., Hong, S., Huang, W., Klein, K., Marner, M., Smith, R., Thomas, B. (2014). People prefer less stress and fewer crossings. Lecture Notes in Computer Science (LNCS), 8871, 523-524.
• Hong, S., Nagamochi, H. (2014). Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. 20th International Conference on Computing and Combinatorics (COCOON 2014), Cham: Springer. [More Information]

2013

• Eades, P., Hong, S., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theoretical Computer Science, 513, 65-76. [More Information]
• Hong, S., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). A Linear-Time Algorithm for Testing Outer-1-Planarity. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
• Dekhordi, H., Nguyen, Q., Eades, P., Hong, S. (2013). Circular graph drawings with large crossing angles. 7th International Workshop on Algorithms and Computation (WALCOM 2013), Berlin: Springer. [More Information]
• Huang, W., Eades, P., Hong, S., Lin, C. (2013). Improving multiple aesthetics produces better graph drawings. Journal of Visual Languages and Computing, 24(4), 262-272. [More Information]
• Bekos, M., Cornelsen, S., Fink, M., Hong, S., Kaufmann, M., Nollenburg, M., Rutter, I., Symvonis, A. (2013). Many-to-one boundary labeling with backbones. 21st International Symposium on Graph Drawing (GD 2013), Cham, Switzerland: Springer. [More Information]
• Carpendale, S., Chen, W., Hong, S. (2013). Message from the program chairs. IEEE Pacific Visualization Symposium 2013, Australia: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Sergey, B., Hong, S., Katoh, N., Poon, S., Tanigawa, S. (2013). On the edge crossing properties of Euclidean minimum weight Laman graphs. The 24th International Symposium on Algorithms and Computation (ISAAC 2013), Berlin Heidelberg: Springer. [More Information]
• Nguyen, Q., Eades, P., Hong, S. (2013). On the Faithfulness of Graph Visualizations. IEEE Symposium on Pacific Visualization 2013, Sydney, Australia: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Nguyen, Q., Eades, P., Hong, S. (2013). On the Faithfulness of Graph Visualizations. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
• Nguyen, Q., Eades, P., Hong, S. (2013). StreamEB: Stream Edge Bundling. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
• Eades, P., Hong, S., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y. (2013). Testing Maximal 1-planarity of Graphs with a Rotation System in Linear Time (Extended Abstract). 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]
• Dwyer, T., Frati, F., Hong, S., Klein, K. (2013). Theory and Practice of Graph Drawing. 20th International Symposium on Graph Drawing (GD 2012), Heidelberg: Springer. [More Information]

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, 62(3-4), 1122-1158. [More Information]
• 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. [More Information]
• Hong, S., Eades, P., Liotta, G., Poon, S. (2012). Fary's theorem for 1-planar graphs. 18th Annual International Conference on Computing and Combinatorics (COCOON 2012), Berlin: Springer. [More Information]
• 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. [More Information]
• 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. [More Information]
• 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., 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. [More Information]
• Fung, D., Li, S., Goel, A., Hong, S., Wilkins, M. (2012). Visualization of the interactome: What are we looking at? Proteomics, 12(10), 1669-1686. [More Information]
• Liu, H., Eades, P., Hong, S. (2012). Visualizing Dynamic Trajectories in Social Networks. 2012 IEEE Symposium on Visual Languages and Human-Centric Computing, Los Alamitos: IEEE Computer Society. [More Information]

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, 60(3), 569-592. [More Information]
• 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, 61(4), 777-778.
• Hong, S., Nagamochi, H. (2011). Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. Algorithmica, 61(4), 1022-1076. [More Information]
• Nguyen, Q., Eades, P., Hong, S., Huang, W. (2011). Large crossing angles in circular layouts. 18th International Symposium on Graph Drawing (GD 2010), Berlin: Springer. [More Information]

2010

• Hong, S., Nagamochi, H. (2010). A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. Algorithmica, 58(2), 433-460. [More Information]
• Hong, S., Nagamochi, H. (2010). An algorithm for constructing star-shaped drawings of plane graphs. Computational Geometry: Theory and Applications, 43(2), 191-206. [More Information]
• Hong, S., Nagamochi, H. (2010). Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. Algorithmica, 58(2), 478-497. [More Information]
• Hong, S., Nagamochi, H. (2010). Convex drawings of hierarchical planar graphs and clustered planar graphs. Journal of Discrete Algorithms (Amsterdam), 8(3), 282-295. [More Information]
• Bachmaier, C., Buchner, H., Forster, M., Hong, S. (2010). Crossing minimization in extended level drawings of graphs. Discrete Applied Mathematics, 158(3), 159-179. [More Information]
• 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. [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Grilli, L., Hong, S., Liotta, G., Meijer, H., Wismath, S. (2010). Matched drawability of graph pairs and of graph triples. Computational Geometry: Theory and Applications, 43(6-7), 611-634. [More Information]
• 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. [More Information]
• Eades, P., Hong, S., Poon, S. (2010). On Rectilinear Drawing of Graphs. 17th International Symposium on Graph Drawing (GD 2009), Germany: Springer. [More Information]
• 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. [More Information]
• 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. [More Information]
• 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. [More Information]
• 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. [More Information]

2009

• Huang, W., Eades, P., Hong, S. (2009). A Graph Reading Geodesic-Path Tendency. IEEE Pacific Visualization Symposium - PacificVis 2009, United States: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• 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. [More Information]
• Hong, S. (2009). Classification by Ordering Data Samples. Kyoto RIMS Workshop on Acceleration and Visualization of Computation for Enumeration Problems 2008, Online: RIMS.
• 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. [More Information]
• 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. [More Information]
• 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. [More Information]
• Huang, W., Eades, P., Hong, S. (2009). Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization, 8(3), L169-152. [More Information]
• 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. [More Information]
• 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. [More Information]
• 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. [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• 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, Berlin: Springer.
• Hong, S., Nagamochi, H. (2008). Approximating Crossing Minimization in Radial Layouts. 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), Germany: Springer. [More Information]
• 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 (BELIV08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM). [More Information]
• Hong, S., Nagamochi, H. (2008). Convex drawings of graphs with non-convex boundary constraints. Discrete Applied Mathematics, 156(12), 2368-2380. [More Information]
• Huang, W., Hong, S., Eades, P. (2008). Effects of Crossing Angles. IEEE Pacific Visualization Symposium 2008, United States: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE).
• 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: Institute of Electrical and Electronics Engineers (IEEE).
• 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-Pacific 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. [More Information]
• Buchheim, C., Hong, S. (2008). Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica, 52(4), 448-465. [More Information]
• 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 (BELIV08) A Workshop of the ACM CHI 2008 Conference, USA: Association for Computing Machinery (ACM). [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE).
• 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: Institute of Electrical and Electronics Engineers (IEEE). [More Information]

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. [More Information]
• 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. [More Information]
• Xu, K., Cunningham, A., Hong, S., Thomas, B. (2007). GraphScape: Integrated Multivariate Network Visualization. Asia-Pacific Symposium on Visualisation 2007 APVIS 2007, Piscataway, USA: Institute of Electrical and Electronics Engineers (IEEE).
• 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: Institute of Electrical and Electronics Engineers (IEEE).
• 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: Institute of Electrical and Electronics Engineers (IEEE).
• 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: Institute of Electrical and Electronics Engineers (IEEE).

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. [More Information]
• Hong, S., Merrick, D., do Nascimento, H. (2006). Automatic visualisation of metro maps. Journal of Visual Languages and Computing, 17(3), 203-224. [More Information]
• 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. [More Information]
• Hong, S., Eades, P. (2006). Drawing planar graphs symmetrically, III: Oneconnected planar graphs. Algorithmica, 44(1), 67-100. [More Information]
• 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. [More Information]
• 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. [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE).
• 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. [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• 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. [More Information]
• Buchheim, C., Hong, S. (2005). Crossing Minimization for Symmetries. Theory of Computing Systems, 38(3), 293-311. [More Information]
• Hong, S., Eades, P. (2005). Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica, 42(2), 159-197. [More Information]
• 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. [More Information]
• 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. [More Information]
• 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: Institute of Electrical and Electronics Engineers (IEEE). [More Information]
• Hong, S. (2005). Network analysis and visualisation. 13th International Symposium on Graph Drawing, GD 2005. Springer. [More Information]
• 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: Theory and Applications, 29(3), 191-221. [More Information]
• 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, 36(2), 153-178. [More Information]
• 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. [More Information]
• 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.