|
Headlines |
|
|
Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy: WALCOM: Algorithms and Computation – 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings. Lecture Notes in Computer Science 12635, Springer 2021, ISBN 978-3-030-68210-1 Seok-Hee Hong: 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia. LIPIcs 64, Schloss Dagstuhl – Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-026-2 [ S. Carpendale, W. Chen and S. Hong, Proceedings of IEEE Pacificvis 2013, IEEE TVCG 2013. P. Eades, T. Ertl and H. Shen, Proceedings of IEEE Pacificvis 2009, IEEE TVCG 2009. S. Hong, H. Nagamochi and T. Fukunaga, Proceedings of ISAAC 2008 (International Symposium on Algorithms and Computation), Lecture Notes in Computer Science, Springer, 2008. S. Hong, T. Nishizeki and W. Quan, Proceedings of GD 2007 (International Symposium on Graph Drawing), Lecture Notes in Computer Science, Springer, 4875, 2008. S. Hong and K. Ma, Proceedings of APVIS 2007 (Asia Pacific Symposium on Visualisation), IEEE, 2007. Hong, S. (editor), Proc. Asia-Pacific Symposium on Information Visualisation (APVIS), 2005, CRPIT, ISBN 1-920682-27-9. Hong, S. (editor), Proc. Australasian Workshop on Combinatorial Algorithms (AWOCA), Ballina, Australia, July 2004, ISBN 1-86487-628-X. |
|
|
|
|
|
Seok-Hee Hong:Beyond Planar Graphs: Introduction. Beyond Planar Graphs 2020: 1-9 Seok-Hee Hong: Algorithms for 1-Planar Graphs. Beyond Planar Graphs 2020: 69-87 Peter Eades, Karsten Klein: Graph Visualization. Graph Data Management 2018: 33-70 Seok-Hee Hong, Takeshi Tokuyama: Beyond Planar Graphs, Communications of NII Shonan Meetings. Springer 2020, ISBN 978-981-15-6532-8 P. Eades. Handbook of human centric visualization. Edited by Weidong Huang. Springer, 2014. S. Hong, “Graph Algorithms in Network Analysis”, Encyclopedia on Systems Biology, Springer, pp 853-861, 2013.P. Eades and S. Hong, “Chapter 5: Detection and Display of Symmetries”, Handbook of Graph Drawing and Visualisation, R. Tamassia (editor), CRC Press, 2013. P. Eades and S. Hong, “How to Draw Graphs: revisited”, State of the Art in Computer Graphics, Visualization and Visual Analytics, J. Dill, R.A. Earnshaw, D. J. Kasik, J.A. Vince, P.C. Wong, Guest Editors, Springer, 2012. E. Di Giacomo, W. Didimo, P. Eades and G. Liotta, “2-Layer Right Angle Crossing Drawings.” Combinatorial Algorithms, pp. 156-169, 2011. 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. P. Eades, C. Gutwenger, S. Hong and P. Mutzel, “Graph Drawing Algorithms”, Chapter 9 of the Handbook on Algorithms and Theory of Computation (Ed. M. Atallah), CRC Press, 2009. Peter Eades, SeokHee Hong, Keith Nesbitt, and Masahiro Takatsuka. Handbook of Nature-Inspired And Innovative Computing: Integrating Classical Models with Emerging Technologies, chapter 20, pages 633–655. Springer, 2006. Eades, P., Hong, S., “Detection and Display of Symmetry”, Chapter 5 in Tamassia, R. (editor), Handbook of Graph Drawing and Visualization, CRC Press, to appear. Healy, P., Nikolov, N., “Hierarchical Drawing Algorithms” in Tamassia, R. (editor), Handbook of Graph Drawing and Visualization, CRC Press, to appear. Lungu, M., Xu, K., “Biomedical Visualization”, Chapter 8 in Kerren, A., Ebert, A., Meyer, J. (editors), Human-Centered Visualization Environments, Springer, Lecture Notes in Computer Science, to appear. Xu, K., Pohl, M., Qeli, E. “Graphs and Trees”, Chapter 4 in Kerren, A., Ebert, A., Meyer, J. (editors), Human-Centered Visualization Environments, Springer, Lecture Notes in Computer Science, to appear. Eades, P., Hong, S., Nesbitt, K., Takatsuka, M., “Information Display”, Chapter 20 in Zomaya, A. (editor), Handbook of Innovative Computational Paradigms, Springer, 2005, pp. 633-655. Eades, P., Hong, S., “Drawing Graphs:, Chapter 46 in Mehta, D., Sahni, S. (editors), Handbook of Data Structures and Applications, CRC Press, 2004. |
|
|
2020 Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini: Graph Planarity by Replacing Cliques with Paths. Algorithms 13(8): 194 Amyra Meidiana, Seok-Hee Hong, Marnijati Torkel, Shijun Cai, Peter Eades: Sublinear Time Force Computation for Big Complex Network Visualization. Comput. Graph. Forum 39(3): 579-591 Carla Binucci, Emilio Di Giacomo, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Vera Sacristán, Stephen K. Wismath: Colored anchored visibility representations in 2D and 3D space. Comput. Geom. 89: 101592 Hyunjoon Kim, Seunghwan Min, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han: IDAR: Fast Supergraph Search Using DAG Integration. Proc. VLDB Endow. 13(9): 1456-1468 Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani: Polyline drawings with topological constraints. Theor. Comput. Sci. 809: 250-264 2019 Seok-Hee Hong, Hiroshi Nagamochi: A linear-time algorithm for testing full outer-2-planarity. Discret. Appl. Math. 255: 234-257 Akane Seto, Aleksandar Shurbevski, Hiroshi Nagamochi, Peter Eades: Acute Constraints in Straight-Line Drawings of Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 994-1001 Kenichi Koizumi, Peter Eades, Kei Hiraki, Mary Inaba: BJR-tree: fast skyline computation algorithm using dominance relation-based tree structure. Int. J. Data Sci. Anal. 7(1): 17-34 2018 Seok-Hee Hong: Editorial: Special Issue on Algorithms and Computation. Algorithmica 80(7): 2132-2133 Seok-Hee Hong: Guest Editor’s Foreword. Int. J. Comput. Geom. Appl. 28(2): 79-80 Seok-Hee Hong, Hiroshi Nagamochi:Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci. 725: 79-98 Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth: Gap-planar graphs. Theor. Comput. Sci. 745: 36-52 Shixia Liu, Gennady L. Andrienko, Yingcai Wu, Nan Cao, Liu Jiang, Conglei Shi, Yu-Shuen Wang, Seokhee Hong: Steering data quality with visual analytics: The complexity challenge. Vis. Informatics 2(4): 191-197 2017 Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann: On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Algorithmica 79(2): 401-427 Peter Eades, Seok-Hee Hong, An Nguyen, Karsten Klein: Shape-Based Quality Metrics for Large Graph Visualization. J. Graph Algorithms Appl. 21(1): 29-53 Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades, Amyra Meidiana: Proxy Graph: Visual Quality Metrics of Big Graph Sampling. IEEE Trans. Vis. Comput. Graph. 23(6): 1600-1611 2016 Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa: On the edge crossing properties of Euclidean minimum weight Laman graphs. Comput. Geom. 51: 15-24 Hooman Reisi Dehkordi, Peter Eades, Seok-Hee Hong, Quan Hoang Nguyen: Circular right-angle crossing drawings in linear time. Theor. Comput. Sci. 639: 26-41 2015 Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki: A Linear-Time Algorithm for Testing Outer-1-Planarity. Algorithmica 72(4): 1033-1054 Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis: Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 2014 E. Di Giacomo, W. Didimo, P. Eades, and G. Liotta. “2-layer right angle crossing drawings.” Algorithmica 68, no. 4 (2014): 954-997, 2014. 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 . 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 . 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 . K. Klein, O. Koch, N. Kriege, P. Mutzel and T. Schafer, “Scaffold hunter: visual analysis of biological activity data”, Journal of Cheminformatics, pp. 1-2, 6(1), Springer, 2014. 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 . P. Angelini, D. Eppstein, F. Frati, M. Kaufmann, S. Lazard, T. Mchedlidze, M. Teillaud and A. Wolff. “Universal Point Sets for Planar Graph Drawings with Circular Arcs”. Journal of Graph Algorithms and Applications. 18(3):313-324. 2014. F. Frati, J. Gudmundsson, S. Gaspers and L. Mathieson. “Augmenting Graphs to Minimize the Diameter”. Algorithmica. 2014. F. Frati, M. Kaufmann, J. Pach, C. Toth and D. Wood. “On the Upward Planarity of Mixed Plane Graphs. Journal of Graph Algorithms and Applications”. 18(2):253-279. 2014. F. Frati, J. Gudmundsson and E. Welzl. “On the Number of Upward Planar Orientations of Maximal Planar Graphs”. Theoretical Computer Science. 544:32-59. 2014. P. Eades and G. Liotta. “Right angle crossing graphs and 1-planarity.” Discrete Applied Mathematics 161, no. 7 (2013): 961-969, 2013 P. Angelini, T. Bruckdorfer, M. Chiesa, F. Frati, M. Kaufmann and C. Squarcella. “On the Area Requirements of Euclidean Minimum Spanning Trees”. Computational Geometry: Theory and Applications. 47(2):200-213. 2014. Special Issue on Selected Papers from WADS ’11. 2013 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. G. Di Battista, F. Frati and J. Pach. “On the Queue Number of Planar Graphs”. SIAM Journal on Computing. 42(6):2243-2285. 2013. F. Frati, R. Fulek and A. R. Vargas. “On the Page Number of Upward Planar Directed Graphs”. Journal of Graph Algorithms and Applications. 17(3):221-244. 2013. E. Di Giacomo, F. Frati, R. Fulek, L. Grilli and M. Krug. “Orthogeodesic Point-Set Embedding of Trees”. Computational Geometry: Theory and Applications. 46(8):924-944. 2013. P. Angelini, G. Di Battista and F. Frati. “Simultaneous Embedding of Embedded Planar Graphs”. International Journal on Computational Geometry and Applications. 23(2):93-126. 2013. Special Issue on Selected Papers from ISAAC ’11. V. Dujmovic, F. Frati, G. Joret and D. R. Wood. “Nonrepetitive Colourings of Planar Graphs with O(log n) Colours”. Electronic Journal of Combinatorics. 20(1). 2013. 2012 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. 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. 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. G. Di Battista, F. Frati and M. Patrignani. “Nonconvex Representations of Plane Graphs”. SIAM Journal on Discrete Mathematics. 26(4):1670-1681. 2012. P. Angelini, E. Colasante, G. Di Battista, F. Frati and M. Patrignani. “Monotone Drawings of Graphs. Journal of Graph Algorithms and Applications”. 16(1):5-35. 2012. Special Issue on Selected Papers from GD ’10. P. Angelini, G. Di Battista, F. Frati, M. Patrignani and I. Rutter. “Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected or a Connected Graph”. Journal of Discrete Algorithms. 14:150-172. 2012. P. Angelini, G. Di Battista and F. Frati. “Succinct Greedy Drawings Do Not Always Exist”. Networks. 59(3):267-274. 2012. P. Angelini and F. Frati. “Acyclically 3-Colorable Planar Graphs”. Journal of Combinatorial Optimization. 24(2):116-130. 2012. Special Issue on Selected Papers from WALCOM ’10. F. Frati. “Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area”. Computational Geometry: Theory and Applications. 45:524-533. 2012. Special Issue on Selected Papers from CCCG ’07. 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. H.R. Dehkordi and P. Eades, “Every outer-1-plane graph has a right angle crossing drawing.” International Journal of Computational Geometry & Applications 22, no. 06, pp. 543-557, 2012. 2011 P. Angelini, F. Frati and M. Kaufmann. “Straight-line Rectangular Drawings of Clustered Graphs”. Discrete and Computational Geometry. 45(1):88-140. 2011. P. Angelini, G. Di Battista and F. Frati. “Simultaneous Embedding of Embedded Planar Graphs”. In 22nd International Symposium on Algorithms and Computation (ISAAC ’11), Springer-Verlag, volume 7074, pp. 271-280, Lecture Notes in Computer Science, 2011. F. Frati and M. Kaufmann. “Polynomial Area Bounds for MST Embeddings of Trees”. Computational Geometry: Theory and Applications. 44:529-543. 2011. S. Hong and H. Nagamochi, “Extending Steinitz’s Theorem to Upward Star-Shaped Polyhedra and Spherical PolyhedraGraph-theoretic Characterization of Non-convex Polyhedra”, Algorithmica, Volume 61, Number 4, pp. 1022-1076, 2011. 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. 2010 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. S. Hong and H. Nagamochi, “Approximation Algorithms for Crossing Minimisation in Radial Layouts”, Algorithmica, Springer, Volume 58, Number 2, pp. 478-497, 2010. S. Hong and H. Nagamochi, “Linear time algorithm for Symmetric Convex Drawings of Planar Graphs”, to appear Algorithmica, Springer, Volume 58, Number 2, pp. 433-460, 2010. 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. 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. 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. 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. W. Didimo, P. Eades and G. Liotta, “A characterization of complete bipartite RAC graphs.” Information Processing Letters 110, no. 16, pp. 687-691, 2010. 2009 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. 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. 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. 2008 D. Fung, S. Hong, D. Koschützki, F. Schreiber and K. Xu, “2.5D Visualisation of Overlapping Biological Networks”, Journal of Integrative Bioinformatics, 5(1), 2008. S. Hong and H. Nagamochi, “Convex Drawings of Graphs with Non-convex Boundary Constraints”, Discrete Applied Mathematics, 156(12), pp. 2368-2380, Elsevier, 2008. C. Buchheim and S. Hong, “Testing Planarity of Symmetries in Linear Time”, Algorithmica, 52(4), pp. 448-465, Springer, 2008. Hugo A. D. do Nascimento, Peter Eades: User Hints for map labeling. J. Vis. Lang. Comput. 19(1): 39-74, 2008. Buchheim, C., Hong, S., “Testing Planarity of Geometric Automorphisms in Linear Time”, Algorithmica, 52(4), pp. 448-465, Springer, 2008. do Nascimento, H., Eades, P., “User Hints for Map Labelling”, Journal of Visual Languages and Computing, 19(1), 2008, pp. 39-74. 2007 Peter Eades, Patrick Healy: Guest Editor’s Foreword. J. Graph Algorithms Appl. 11(2): 323-324 (2007) Weidong Huang, Seok-Hee Hong, Peter Eades: Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. J. Graph Algorithms Appl. 11(2): 397-429 (2007) Abelson, D., Hong, S., Taylor, D. E., “A Group-Theoretic Method for Drawing Graphs Symmetrically”, submitted to Discrete Applied Mathematics. Hong, S., Nikolov, N., Tarassov, A., “A 2.5D Hierachical Drawing of Directed Graphs”, Journal of Graph Algorithms and Applications, Vol. 11, no. 2, pp. 371-396, 2007. Huang, W., Hong, S., Eades, P., “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. 2006 P. Eades, Q. Feng, X. Lin, and H. Nagamochi, “Straight-line drawing algorithms for hierarchical graphs and clustered graphs.” Algorithmica 44, no. 1, pp. 1-32, 2006. Moscato, P., Webber, R., Chen, X., “Using Relative Neighborhood Graphs to Uncover Hybridizations in Cultural Evolutionary Processes” submitted to BioSystems, Elsevier. Xu, K., Zhou, X., Deng, K., Shen, H. T., Lin, X., “Direct Mesh: Visualization for Multiresolution Terrain Database”, submitted to IEEE Transaction on Knowledge and Data Engineering. Deng, K., Zhou, X., Shen, H. T., Xu, K., Lin, X., “Efficient Surface k-NN Query Processing”, submitted to The International Journal on Very Large Data Bases (VLDB Journal). Xu, K., “LOD-Quadtree: A Spatial Index for Secondary-Storage Selective Refinement”, submitted to Data and Knowledge Engineering Journal, Elsevier. Hong, S., McKay, B., Eades, P., “A Linear Time Algorithm for Constructing Maximally Symmetric Straight-line Drawings of Tri-connected Planar Graphs”, Discrete and Computational Geometry, 36(2), 2006, pp. 283-311. Xu, K., Zhou, X., Deng, K., Shen, H. T., Lin, X., “A Multi-Resolution Terrain Model for Efficient Visualization Query Processing”, IEEE Transaction on Knowledge and Data Engineering, 18(10), 2006, pp. 1382-1396. 2005 H. AD. do Nascimento and P. Eades, “User hints: a framework for interactive optimization.” Future Generation Computer Systems 21, no. 7, pp. 1177-1191, 2005. Buchheim, C., Hong, S., “Crossing Minimization for Symmetries”, Theory of Computing Systems, Vol. 38, Issue 3, 2005, pp. 293-311. Hong, S., Eades, P., “Drawing Planar Graphs Symmetrically II: Bi-connected Graphs”, Algorithmica, Vol. 42, Issue 2, 2005, pp. 159-197. Bachmaier, C., Brandenburg, F. J., Forster, M., “Radial Level Planarity Testing and Embedding in Linear Time”, Journal of Graph Algorithms and Applications, Vol. 9, Issue 1, 2005, pp. 53-97. Huang, X., Eades, P., Lai, W.: “PGD: A Framework for Filtering, Clustering and Dynamic Layout Graphs”, IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, . 35, Issue 2, 2005. 2004 Hong, S., Eades, P., Hillman, J., “Linkless Symmetric Drawings of Series Parallel Digraphs”, Computational Geometry: Theory and Applications, Vol. 29, Issue 3, 2004, pp. 191-222. Brandes, U., Dwyer, T., Schreiber, F., “Visual Understanding of Metabolic Pathways Across Organisms using Layout in Two and a Half Dimensions”, Journal of Integrative Bioinformatics, Vol. 2, 2004. Dwyer, T., Gallagher, D. R., “Visualising Changes in Fund Manager Holdings in Two and a Half-dimensions”, Information Visualization, Vol. 3, Issue 4, 2004, pp. 227-244. 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. 2003 Seok-Hee Hong and Peter Eades, Drawing Trees Symmetrically in Three Dimensions, Algorithmica, Vol. 36, No. 2, pp. 153-178, 2003. 2002 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. 2000 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. |
|
|
Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy: WALCOM: Algorithms and Computation – 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings. Lecture Notes in Computer Science 12635, Springer 2021, ISBN 978-3-030-68210-1 Seok-Hee Hong, Takeshi Tokuyama:Beyond Planar Graphs, Communications of NII Shonan Meetings. Springer 2020, ISBN 978-981-15-6532-8 [contents] Seok-Hee Hong: 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia. LIPIcs 64, Schloss Dagstuhl – Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-026-2 [contents] Editor: S. Hong, CG&A (IEEE Computer Graphics and Applications). Editor: S. Hong, JGAA (Journal of Graph Algorithms and Applications). Guest editor: S. Hong, S. Carpendale and W. Chen, IEEE Transactions on Visualization & Computer Graphics. 20(8), Special Section on the IEEE Pacific Visualization Symposium, 2014. Guest Editor: S. Hong and H. Nagamochi, Algorithmica, Springer, Special issue from ISAAC 2008, 61(4) 2011. Guest Editor: S. Hong and H. Nagamochi, IJCGA (International Journal of Computational Geometry and Applications), World Scientific, Special issue from ISAAC 2008, 21(3), 2011. Guest Editor: S. Hong and T. Nishizeki, JGAA (Journal of Graph Algorithms and Applications), Special issue from GD 2007, 13(3), 2009 Guest Editor: S. Hong, JGAA (Journal of Graph Algorithms and Applications), Special issue from APVIS 2007, 12(3),2008. Guest Editor: S. Hong and H-C. Yen, IJFCS (International Journal of Foundations of Computer Science), World Scientific, Special issue on Graph Drawing, 17(5),2006. |
|
|
2020 Seok-Hee Hong, Peter Eades, Marnijati Torkel, Weidong Huang, Cristina Cifuentes: Dynamic Graph Map Animation. PacificVis 2020: 1-6 Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim: Quality Metrics for Symmetric Graph Drawings. PacificVis 2020: 11-15 Seok-Hee Hong, Hiroshi Nagamochi: Path-Monotonic Upward Drawings of Graphs. COCOON 2020: 110-122 Amyra Meidiana, Seok-Hee Hong, Peter Eades: New Quality Metrics for Dynamic Graph Drawing. Graph Drawing 2020: 450-465 Seok-Hee Hong, Shan Lu: Graph sampling methods for big complex networks integrating centrality, k-core, and spectral sparsification. SAC 2020: 1843-1851 Young Choon Lee, Jayden King, Young Ki Kim, Seok-Hee Hong: Robust Scheduling for Large-Scale Distributed Systems. TrustCom 2020: 38-45 Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath: Packing Trees into 1-Planar Graphs. WALCOM 2020: 81-93 Joseph Kotlarek, Oh-Hyun Kwon, Kwan-Liu Ma, Peter Eades, Andreas Kerren, Karsten Klein, Falk Schreiber: A Study of Mental Maps in Immersive Network Visualization. PacificVis 2020: 1-10 Jayden King, Young Ki Kim, Young Choon Lee, Seok-Hee Hong: Visualisation of Distributed Systems Simulation Made Simple. CloudCom 2019: 309-312 Jingming Hu, Seok-Hee Hong, Peter Eades: Spectral Vertex Sampling for Big Complex Graphs. COMPLEX NETWORKS (2) 2019: 216-227 Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim: A Quality Metric for Visualization of Clusters in Graphs. Graph Drawing 2019: 125-138 Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi: Multi-level Graph Drawing Using Infomap Clustering. Graph Drawing 2019: 139-146 Amyra Meidiana, Seok-Hee Hong, Jiajun Huang, Peter Eades, Kwan-Liu Ma: Topology-Based Spectral Sparsification. LDAV 2019: 73-82 Young Choon Lee, Jayden King, Seok-Hee Hong: Holistic Approach for Studying Resource Failures at Scale. NCA 2019: 1-4 2018 Agron Cela, Young Choon Lee, Seok-Hee Hong: Resource provisioning for memory intensive graph processing. ACSW 2018: 15:1-15:7 Seok-Hee Hong, Quan Hoang Nguyen, Amyra Meidiana, Jiaxi Li, Peter Eades: BC Tree-Based Proxy Graphs for Visualization of Big Graphs. PacificVis 2018: 11-20 Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini: Turning Cliques into Paths to Achieve Planarity. Graph Drawing 2018: 67-74 Peter Eades, Patrick Healy, Nikola S. Nikolov: The Weighted Barycenter Drawing Recognition Problem. Graph Drawing 2018: 569-575 Emilio Di Giacomo, Peter Eades, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani: Polyline Drawings with Topological Constraints. ISAAC 2018: 39:1-39:13 2017 An Nguyen, Seok-Hee Hong: k-core based multi-level graph visualization for scale-free networks. PacificVis 2017: 21-25 Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades: dNNG: Quality metrics and layout for neighbourhood faithfulness. PacificVis 2017: 290-294 Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong: Drawing Big Graphs Using Spectral Sparsification. Graph Drawing 2017: 272-286 Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth: Gap-Planar Graphs. Graph Drawing 2017: 531-545
2016 Weidong Huang, Peter Eades, Seok-Hee Hong, Henry Been-Lirn Duh: Effects of curves on graph perception. PacificVis 2016: 199-203 Seok-Hee Hong, Hiroshi Nagamochi: Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. Graph Drawing 2016: 321-334 Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:Simultaneous Orthogonal Planarity. Graph Drawing 2016: 532-545 2015 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. 2014 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. 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. 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. 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. 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. 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. 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. 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. H. R. Dehkordi, F. Frati and J. Gudmundsson. “Increasing-Chord Graphs On Point Sets”. In Proc. 22nd International Symposium on Graph Drawing (GD ’14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 464-475, 2014. T. Chan, F. Frati, C. Gutwenger, A. Lubiw, P. Mutzel and M. Schaefer. “Drawing Partially Embedded and Simultaneously Planar Graphs”. In Proc. 22nd International Symposium on Graph Drawing (GD ’14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 25-39, 2014. P. Angelini, G. Da Lozzo, G. Di Battista, F. Frati and V. Roselli. “The Importance of Being Proper (In Clustered-Level Planarity and T-Level Planarity)”. In Proc. 22nd International Symposium on Graph Drawing (GD ’14), Springer-Verlag, volume 8871 of Lecture Notes in Computer Science, pages 246-258, 2014. P. Angelini, G. Da Lozzo, G. Di Battista, F. Frati, M. Patrignani and V. Roselli. “Morphing Planar Graph Drawings Optimally”. In Proc. 41st International Colloquium on Automata, Languages and Programming (ICALP ’14), Springer Verlag, volume 8572 of Lecture Notes in Computer Science, pages 126-137, 2014. M. Chimani, G. Di Battista, F. Frati and K. Klein, “Advances on testing c-planarity of embedded flat clustered graphs”, Proceedings of GD 2014, pp. 416-427, Lecture Notes in Computer Science, Springer, 2014. 2013 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. Q. Nguyen, P. Eades and S. Hong, “On the Faithfulness of Graph Visualizations”, Proceedings of PacificVis 2013, pp. 209-216, IEEE, 2013. 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. 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. 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 2013, pp. 339-345, Lecture Notes in Computer Science, Springer, 2013. P. Angelini, W. Evans, F. Frati and J. Gudmundsson. “SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs”. In Proc. 24th International Symposium on Algorithms and Computation (ISAAC 2013), Springer-Verlag, volume 8283 of Lecture Notes in Computer Science, pages 185-195, 2013. F. Frati, J. Gudmundsson, S. Gaspers and L. Mathieson. “Augmenting Graphs to Minimize the Diameter”. In Proc. 24th International Symposium on Algorithms and Computation (ISAAC 2013), Springer-Verlag, volume 8283 of Lecture Notes in Computer Science, pages 383-393, 2013. F. Frati, M. Kaufmann, J. Pach, C. Toth and D. Wood. “On the Upward Planarity of Mixed Plane Graphs”. In Proc. 21st International Symposium on Graph Drawing (GD ’13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 1-12, 2013. P. Angelini, G. Da Lozzo, G. Di Battista and F. Frati. “Strip Planarity Testing”. In Proc. 21st International Symposium on Graph Drawing (GD ’13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 37-48, 2013. P. Angelini, F. Frati, M. Patrignani and V. Roselli. “Morphing Planar Graph Drawings Efficiently”. In Proc. 21st International Symposium on Graph Drawing (GD ’13), Springer-Verlag, volume 8242 of Lecture Notes in Computer Science, pages 49-60, 2013. P. Angelini, D. Eppstein, F. Frati, M. Kaufmann, S. Lazard, T. Mchedlidze, M. Teillaud and A. Wolff. “Universal Point Sets for Planar Graph Drawings with Circular Arcs”. In 25st Canadian Conference on Computational Geometry (CCCG ’13), 2013. S. Alamdari, P. Angelini, T. M. Chan, G. Di Battista, F. Frati, A. Lubiw, M. Patrignani, V. Roselli, S. Singla and B. T. Wilkinson. “Morphing Planar Graph Drawings with a Polynomial Number of Steps”. In 24th ACM-SIAM Symposium on Discrete Algorithms (SODA ’13), pages 1656-1667, 2013. F. Frati, M. Glisse, W. Lenhart, G. Liotta, T. Mchedlidze and R. I. Nishat. “Point-Set Embeddability of 2-Colored Trees”. In Proc. 20th International Symposium on Graph Drawing (GD ’12), Springer-Verlag, volume 7704 of Lecture Notes in Computer Science, pages 291-302, 2013. D. Bremner, W. Evans, F. Frati, L. Heyer, S. Kobourov, W. Lenhart, G. Liotta, D. Rappaport and S. Whitesides. “On Representing Graphs by Touching Cuboids”. In Proc. 20th International Symposium on Graph Drawing (GD ’12), Springer-Verlag, volume 7704 of Lecture Notes in Computer Science, pages 187-198, 2013. M. Chimani and K. Klein, “Shrinking the search space for clustered planarity”, Proceedings of GD 2013, pp. 90-101, Lecture Notes in Computer Science, Springer, 2013. 2012 Y. Higashikawa, N. Katoh and S. Hong, “Online TSP in a Maximal 1-Plane Geometric Graph”, Proceedings of WAAC 2012, 2012. H. Liu, P. Eades, S. Hong, “Visualizing Dynamic Trajectories in Social Networks”, Proceedings of VL/HCC 2012, pp 197-204, IEEE, 2012. F. Frati, J. Gudmundsson and E. Welzl. “On the Number of Upward Planar Orientations of Maximal Planar Graphs”. In, K. Chao, T. Hsu, D. Lee, editors, 23rd International Symposium on Algorithms and Computation (ISAAC ’12), Springer-Verlag, volume 7676 of Lecture Notes in Computer Science, pages 413-422, 2012. F. Frati. “Multilevel Drawings of Clustered Graphs”. In, J. Gudmundsson, J. Mestre, T. Viglas, editors, Proc. 18th Annual International Computing and Combinatorics Conference (COCOON ’12), Springer-Verlag, volume 7434 of Lecture Notes in Computer Science, pages 311-322, 2012. F. Frati, R. Fulek and A. R. Vargas. “On the Page Number of Upward Planar Directed Graphs”. In 19th International Symposium on Graph Drawing (GD ’11), Springer-Verlag, Lecture Notes in Computer Science, pages 391-402, 2012. E. Di Giacomo, F. Frati, R. Fulek, L. Grilli and M. Krug. “Orthogeodesic Point-Set Embedding of Trees”. In 19th International Symposium on Graph Drawing (GD ’12), Springer-Verlag, Lecture Notes in Computer Science, pages 52-63, 2012. S. Hong, P. Eades, G. Liotta and S. Poon, “Fary’s Theorem for 1-planar Graphs”, Proceedings of COCOON 2012, LNCS, pp. 335-346, 2012. 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, LNCS, Springer, pp. 123-135, 2012. P. Eades and G. Liotta. “Right angle crossing graphs and 1-planarity.” In Graph Drawing, pp. 148-153. Springer Berlin Heidelberg, 2012. 2011 P. Angelini, G. Di Battista and F. Frati. “Simultaneous Embedding of Embedded Planar Graphs”. In, T. Asano, Y. Okamoto, O. Watanabe, editors, 22nd International Symposium on Algorithms and Computation (ISAAC ’11), Springer-Verlag, volume 7074 of Lecture Notes in Computer Science, pages 271-280, 2011. P. Angelini, T. Bruckdorfer, M. Chiesa, F. Frati, M. Kaufmann and C. Squarcella. “On the Area Requirements of Euclidean Minimum Spanning Trees”. In, F. K. H. A. Dehne, J. Iacono, J.-R. Sack, editors, 12th Algorithms and Data Structures Symposium (WADS ’11), Springer, volume 6844 of Lecture Notes in Computer Science, pages 25-36, 2011. 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”, Proceedings of XIV Spanish Meeting on Computational Geometry 2011. S. Janowski, B. Kormeier, K. Hippe, Q. Nguyen, S. Hong, Seok-Hee; R. Hofestudt, J. Stoye, B. Kaltschmidt and C. Kaltschmidt, “Reconstruction and analysis of biological networks based on large scale data from the NF-?B pathway”, Proceedings of IB 2011 (International Symposium on Integrative Bioinformatics 2011), to appear. 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. 2010 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. 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. 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. 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 P. Eades, S. Hong and S. Poon, “On Rectilinear Drawing of Graphs”, Proceedings of Graph Drawing 2009, LNCS, Springer, pp. 232-243, Springer, 2010. Walter Didimo, Peter Eades, Giuseppe Liotta: A characterization of complete bipartite RAC graphs. Inf. Process. Lett. 110(16): 687-691 ,2010. 2009 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. 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. 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. 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. 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. D. Fung, S. Hong, D. Koschützki, 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. 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. 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. 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. 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. 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. 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. Peter Eades, Thomas Ertl, Han-Wei Shen: IEEE Pacific Visualization Symposium PacificVis 2009, Beijing, China, April 20-23, 2009 IEEE Computer Society 2009 Walter Didimo, Peter Eades, Giuseppe Liotta: Drawing Graphs with Right Angle Crossings. WADS 2009: 206-217 2008 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. 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. 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. S. Hong and H. Nagamochi, “Approximating Crossing Minimization in Radial Layouts”, Proceedings of LATIN 2008 (Latin American Theoretical Informatics Symposium), LNCS 4957, pp. 461-472, 2008. W. Huang, S. Hong and P. Eades, “Effects of Crossing Angles”, Proceedings of IEEE Pacific Visualization Symposium (PacificVis 2008), IEEE, pp. 41-46, 2008. W. Huang, S. Hong and P. Eades, “A Cognitive Approach to the Evaluation of Graph Visualizations”, Proceedings of BELIV’08 workshop, ACM, 3, 2008. 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. 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. Peter Eades: Some Constrained Notions of Planarity. ISAAC 2008: 2 2007 C. Muller-Tomfelde, B. Kellar, P. Eades: HxI : An Australian Initiative in ICT-Augmented Human Interactivity. INTERACT (2) 2007: 675-676 Q. Nguyen and S. Hong. “Centrality-Based Planarisation and Thickness”, Proceedings of WAAC 2007 (Korea-Japan Workshop on Algorithms and Computations), 2007. 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. 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. U. Brandes, C. Erten, J. Fowler, F. Frati, M. Geyer, C. Gutwenger, S. Hong, M. Kaufmann, S. G. Kobourov, G. Liotta, P. Mutzel, A. Symvonis, “Colored Simultaneous Geometric Embeddings”, Proceedings of COCOON 2007 (Computing and Combinatorics), Lecture Notes in Computer Science 4598, pp. 254-263, 2007. Huang, W*., Hong, S.-H*., Eades, P*., Using eye tracking to investigate graph layout effects, Asia-Pacific Symposium on Visualisation (APVIS2007). Fu X*, Hong S-H*, Nikolov N, Shen X, Wu Y-X*, Xu K*, Visualization and Analysis of Email Networks, Asia-Pacific Symposium on Visualisation (APVIS2007). Ahmed A*, Batagelu V, Fu X*, Hong S-H*, Merrick D*, Mrvar A, Visualisation and Analysis of the Internet Movie Database, Asia-Pacific Symposium on Visualisation, APVIS2007. Xu, K.*, Cunningham, A., Hong, S.-H.*, Thomas, B., GraphScape: Integrated Multivariate Network Visualization, Asia-Pacific Symposium on Visualisation 2007 (APVIS2007). Ahmed A* and Hong S-H*, Navigation Techniques for 2.5D Graph Layout, Asia-Pacific Symposium on Visualisation (APVIS2007). 2006 Hong, S., Nagamochi, H., “Convex Drawings of Graphs with Non-Convex Boundary”, Proc. 32nd Int. Work. Graph-Theoretic Concepts in Computer Science, (June 22-24, 2006), Bergen, Norway. Hong, S., Nagamochi, H., “Convex drawings of hierarchical graphs”, Proc. 17th Australasian Workshop on Combinatorial Algorithms (AWOCA 2006), July 13-19, 2006. Buchheim, C., Zheng, L., “Fixed linear crossing minimization by reduction to the Maximum Cut problem”, Proc. 12th Computing and Combinatorics Conference (COCOON2006). Ho, J. W. K., Manwaring, T., Hong, S., Roehm, U., Fung, D. C. Y., Xu, K., Kraska, T., Hart, D., “PathBank: Web-based Querying and Visualziation of an Integrated Biological Pathway Database”, Proc. 3rd Int. Conf. Computer Graphics, Imaging and Visualization (CGIV2006). Murray, C., Ke, W., Borner, K., “Mapping Scientific Disciplines and Author Expertise Based on Personal Bibliography Files”, Proc. 10th Int. Conf. Information Visualisation (IV06), July 5-7, 2006. London, England. Webber, R., Herbert, R. D., Wei, J., “Space-filling Techniques in Visualizing Output from Computer Based Economic Models”, Proc. 12th Int.Conf. Computing in Economics and Finance, 22-24 Jun. Limassol, Cyprus 2006. Xu, K., “Web-Based Genomic Information Integration with Gene Ontology”, Proc. 8th Asia-Pacific Web Conference (APWEB2006), Harbin, China, pp. 812-817. Deng, K., Zhou, X., Shen, H., Xu, K., Lin, X., “Surface k-NN Query Processing”, Proc. 22nd International Conference on Data Engineering (ICDE 2006), (3-7 April, 2006), Atlanta, USA. Dwyer, T., Hong, S., Koschutzki, D., Schreiber, F., Xu, K., “Visual Analysis of Network Centralities”, Misue, K., Sugiyama, K., Tanaka, J. (editors), Proc. Asia-Pacific Symp. Information Visualization (APVIS2006), CRPIT, Vol. 60, Jan 2006, pp. 189-197. Huang, W., Hong, S., Eades, P., “How People Read Sociograms: A Questionnaire Study”, Misue, K., Sugiyama, K., Tanaka, J. (editors), Proc. Asia-Pacific Symp. Information Visualization (APVIS2006), CRPIT, Vol. 60, Jan 2006, pp. 199-206. Huang, W., Hong, S., Eades, P., “Predicting Graph Reading Performance: A Cognitive Approach”, Misue, K., Sugiyama, K., Tanaka, J. (editors), Proc. Asia-Pacific Symp. Information Visualization (APVIS2006), CRPIT, Vol. 60, Jan 2006, pp.207-216. Merrick, D., Gudmundsson, J., “Increasing the Readability of Graph Drawings with Centrality-Based Scaling”, Misue, K., Sugiyama, K., Tanaka, J. (editors), Proc. Asia-Pacific Symp. Information Visualization (APVIS2006), CRPIT, Vol. 60, Jan 2006, pp. 67-76. Song, L* and Epps, J*., Improving Separability of EEG Signals During Motor Imagery with an Efficient Circular Laplacian Proc. 31st IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP, 14-19 May 2006, Toulouse, France, Vol. 2, pp. 1048-1051, ISBN 1-4244-0469-X Merrick, K.*, Maher, M-L, Motivated Reinforcement Learning for Non-Player Characters in Persistent Computer Game Worlds, International Conference on Advances in Computer Entertainment Technology (ACE 2006), 14-16 June, 2006, Hollywood, USA. CD-Rom (no pages). ACM 1-59593-380-8/06/0006. Buchheim, C. and Zheng, L*, Fixed linear crossing minimization by reduction to the Maximum Cut problem, 12th International Computing and Combinatorics Conference (COCOON’06), 15-18 Aug. 2006, pp. 507-516, ISBN 0302-9743. Song, L* and Epps, J*, Classifying EEG for Brain-Computer Interfaces: Learning Optimal Filters for Dynamical System Features, Proc. Int. Conf. on Machine Learning (Pittsburgh, PA), 2006, CD-ROM (no page numbers), ISBN 1-59593-383-2. Gudmundsson J* and Merrick D* Path Simplification for Metro Map Layout., 14th International Symposium on Graph Drawing (GD’06). Sept 18-20 2006. Karlsruhe, Germany. Gudmundsson J*, van Kreveld M, and Merrick D*, Schematisation of Tree Drawings, 14th International Symposium on Graph Drawing (GD’06). Sept 18-20 2006. Karlsruhe, Germany. Ahmed, A., Dwyer, T., Forster, M., Fu, X., Ho, J., Hong, S., Koschutzki, D., Murray, C., Nikolov, N., Taib, R., Tarassov, A., Xu, K., “GEOMI: GEOmetry for Maximum Insight”, Healy, P., Eades, P. (editors), Proc. 13th Int. Symp. Graph Drawing (GD2005), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3843, 2006, pp. 468-479. Ho, J., Hong, S., “Drawing Clustered Graphs in Three Dimensions”, Healy, P., Eades, P. (editors), Proc. 13th Int. Symp. Graph Drawing (GD2005), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3843, 2006, pp. 492-502. Hong, S., Nikolov, N., “Hierarchical Layout of Directed Graphs in Three Dimensions”, Healy, P., Eades, P. (editors), Proc. 13th Int. Symp. Graph Drawing (GD2005), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3843, 2006, pp. 251-261. Huang, W., Hong, S., Eades, P., “Layout Effects on Sociogram Perception”, Healy, P., Eades, P. (editors), Proc. 13th Int. Symp. Graph Drawing (GD2005), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3843, 2006, pp. 262-273. Hong, S., “MultiPlane: A New Framework for Drawing Graphs in Three Dimensions”, Healy, P., Eades, P. (editors), Proc. 13th Int. Symp. Graph Drawing (GD2005), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3843, 2006, pp. 514-515. Hong, S., “Network Analysis and Visualisation”, Healy, P., Eades, P. (editors), Proc. 13th Int. Symp. Graph Drawing (GD2005), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3843, 2006, pp. 524-527. Fang Chen, Benjamin Close, Peter Eades, Julien Epps, Peter Hutterer, Serge Lichman, Masahiro Takatsuka, Bruce Thomas, and Mike Wu. Vicat: Visualization and interaction on a collaborative access table. In Morten Fjeld and Masahiro Takatsuka, editors, Proceedings of The First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (TableTop2006), pages 59–60, Adelaide, Australia, January 2006. IEEE Computer Society, IEEE Computer Society. 2005 X. Shen and P. Eades, “Using MoneyColor to represent financial data.” In proceedings of the 2005 Asia-Pacific symposium on Information visualisation-Volume 45, pp. 125-129. Australian Computer Society, Inc., 2005. X. Huang, P. Eades and W. Lai, “A framework of filtering, clustering and dynamic layout graphs for visualization.” In Proceedings of the Twenty-eighth Australasian conference on Computer Science-Volume 38, pp. 87-96. Australian Computer Society, Inc., 2005. Ahmed, A., Dwyer, T., Hong, S., Murray, C., Song, L., Wu, Y., “Visualisation and Analysis of Large and Complex Scale-free Networks”, Brodlie, K. W., Duke, D. J., Joy, K. I. (editors), EUROGRAPHICS – IEEE VGTC Symposium on Visualization, (1-3 Jun, 2005), pp. 1-8. Bachmaier, C., Fischer, F., Forster, M., “Radial Coordinate Assignment for Level Graphs”, Wang, L. (editor), Proc. Computing and Combinatorics Conference, COCOON2005, Springer-Verlag, Lecture Notes in Computer Science, Vol. 3595, 2005, pp. 401-410. Li, P., Eades, P., Hong, S., “Navigating Software Architectures with Constant Visual Complexity”, IEEE Symp. Visual Languages and Human-Centric Computing (VL/HCC2005), (21-24 Sep 2005), Dallas, Texas, USA. Herbert, R. D., Webber, R., Wei J., “Measurement of Space-filling Techniques in Simulating the Minority Game”, Proc. Int. Conf. Neural Networks and Brain (13-15 Oct 2005), Beijing, China, IEEE Press, pp. 542-547. Li, W., Hong, S., Eades, P., “A Framework for Visualising Large Graphs”, Proc. 9th International Conference Information Visualisation (IV’05), (July 6-8, 2005), pp. 528-535. Fu, X., Li, D., “Haptic Shoes: Representing Information by Vibration”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 47-50. Hong, S., Nikolov, N., “Layered Drawings of Directed Graphs in Three Dimensions”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 69-74. Hong, S., Sugiyama, K., Osawa, R., “Puzzle Generators and Symmetric Puzzle Layout”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 97-106. Ahmed, A., Eades, P., “Automatic camera Path Generation for Graph Navigation in 3D”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 27-32 Huang, W., Eades, P., “How People Read Graphs”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 51-58. Huang, W., Murray, C., Shen, X., Song, L., Wu, Y., Zheng, L., “Visualisation and Analysis of Network Motifs”, Proc. 9th International Conference on Information Visualisation (IV05), (July 6-8, 2005). Li, W., Nikolov, N., Eades, P., “Using Spring Algorithms to Remove Node Overlapping”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 131-140. Murray, C., “A User-based Evaluation of Skeletal Animation Techniques in Graph Interaction”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 7-14. Murray, C., Friedrich, C., “Visualisation of Satisfiability using the Logic Engine”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 147-152. Yip, B., Goyette, S., Madden, C., “Visualising Internet Traffic Data with Three-Dimensional Spherical Display”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 153-158. Zheng, L., Song, L., Eades, P., “Crossing Minimisation Problems of Drawing Bipartite Graphs in Two Clusters”, Proc. Asia-Pacific Symposium on Information Visualisation, (Jan 2005), Sydney, CRPIT, Vol. 45, pp. 33-38. Shen X., Vande Moere, A., Eades, P., “An Intrusive Evaluation of Peripheral Display”, Proc. 3rd Int. Conf. Computer Graphics and Interactive Techniques in Australasia and South East Asia, (2 Dec, 2005), pp. 289-292. Song, L., “Desynchronization Network Analysis for the Recognition of Imagined Movement”, Proc. 27th IEEE EMBS Annual International Conference, 2005. Song, L., Gordon, E., Gysels, E., “Phase Synchrony Rates for the Recognition of Motor Imageries in BCIs”, Neural Information Processing Systems (NIPS), 2005. Song, L., Takatsuka, M., “Real-time 3d finger pointing for an augmented desk,” 6th Australasian User Interface Conference, CRPIT, Vol. 40, 2005. Xu, K., Zhou, X., “Multi-resolution Query Optimisation in an Online Environment”, Seventh Asia Pacific Web Conference, (Mar 29-Apr 1, 2005), China. 2004 Colin Murray, Damian Merrick, and Masahiro Takatsuka. Graph interaction through force-based skeletal animation. In Neville Churcher and Clare Churcher, editors, Proceedings of the Australasian Symposium on Information Visualization. Australian Computer Society, Australian Computer Society, January 2004. Hong, S., Eades, P., “A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Planar Graphs”, Janos Pach (editor), Proc. 12th Int. Symp. Graph Drawing (GD2004), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3383, pp 307-317, 2004. Hong, S., Merrick, D., do Nascimento, H., “The Metro Map Layout Problem”, Janos Pach (editor), Proc. 12th Int. Symp. Graph Drawing (GD2004), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3383, pp. 482-491, 2004. Hong, S., Murtagh, T., “Visualization of Large and Complex Networks using PolyPlane”, Janos Pach (editor), Proc. 12th Int. Symp. Graph Drawing (GD2004), Springer-Verlag, Lecture Notes in Computer Science, Vol. 3383, pp. 471-481, 2004. 2003 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. 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. 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. Seok-Hee Hong, The Rectilinear Crossing Minimization Problem, Proc. of AWOCA (Australasian Workshop on Combinatorial Algorithms) 2003, pp. 46-56, 2003. 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. 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. 2002 Christoph Buchheim and Seok-Hee Hong, Crossing Minimization for Symmetries, Proc. of ISAAC02, (Algorithms and Computations), LNCS 2518, pp 563-574, 2002. 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. Seok-Hee Hong, Brendan McKay and Peter Eades, Symmetric Drawings of Triconnected Planar Graphs, Proceeding of SODA 2002, pp. 356-365, 2002. Seok-Hee Hong, Drawing Graphs Symmetrically in Three Dimensions, Proceeding of GD01, LNCS 2265, Springer Verlag, pp. 189-204, 2002. 2001 Aaron Quigley and Peter Eades, “FADE: Graph drawing, clustering, and visual abstraction.” In Graph Drawing, pp. 197-210. Springer Berlin Heidelberg, 2001. Francois Bertault and Peter Eades. “Drawing hypergraphs in the subset standard (short demo paper).” In Graph Drawing, pp. 164-169. Springer Berlin Heidelberg, 2001. Carsten Friedrich and Peter Eades. “The Marey graph animation tool demo.” In Graph Drawing, pp. 396-406. Springer Berlin Heidelberg, 2001. Hugo AD do Nascimento and Peter Eades. “Interactive graph clustering based on user hints.” In Second International Workshop on Soft Computing Applied to Software Engineering. 2001. 2000 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. 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. Seok-Hee Hong and Peter Eades, An Algorithm for Finding Three Dimensional Symmetry in Trees, Proceedings of Korea Information Science Society Spring Conference, 2000. 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. |
|
|
2014 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. 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. G. Di Battista and F. Frati. “A Survey on Small-Area Planar Graph Drawing”. Technical Report arXiv:1410.1006, Cornell University, 2014. G. Aloupis, L. Barba, P. Carmi, V. Dujmovic, F. Frati and P Morin. “Compatible Connectivity-Augmentation of Disconnected Graphs”. Technical Report arXiv:1408.2436, Cornell University, 2014. H. R. Dehkordi, F. Frati and J. Gudmundsson. “Increasing-Chord Graphs On Point Sets”. Technical Report arXiv:1408.2592, Cornell University, 2014. M. Chimani, G. Di Battista, F. Frati and K. Klein. “Advances on Testing C-Planarity of Embedded Flat Clustered Graphs”. Technical Report arXiv:1408.2595, Cornell University, 2014. P. Angelini, G. Da Lozzo, G. Di Battista, F. Frati, M. Patrignani and V. Roselli. “Morphing Planar Graph Drawings Optimally”. Technical Report arXiv:1402.4364, Cornell University, 2014. 2013 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. 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. 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. 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. P. Angelini, G. Da Lozzo, G. Di Battista and F. Frati. “Strip Planarity Testing of Embedded Planar Graphs”. Technical Report arXiv:1309.0683, Cornell University, 2013. P. Angelini, F. Frati, M. Patrignani and V. Roselli. “Morphing Planar Graph Drawings Efficiently”. Technical Report arXiv:1308.4291, Cornell University, 2013. 2012 H. Dehkordi, Q. Nguyen, P. Eades, S. Hong, “Circular Graph Drawings with Large Crossing Angles”, School of IT, University of Sydney, TR, 2012. Q. Nguyen, P. Eades and S. Hong, “On the Faithfulness of Graph Visualizations”, School of IT, University of Sydney, TR, 2012. Q. Nguyen, P. Eades and S. Hong, “StreamEB: Stream Edge Bundling”, School of IT, University of Sydney, TR, tr689, July 2012. 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. P. Angelini, G. Da Lozzo, G. Di Battista, F. Frati, M. Patrignani and V. Roselli. “Relaxing the Constraints of Clustered Planarity”. Technical Report arXiv:1207.3934, Cornell University, 2012. 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. 2011 P. Angelini, T. Bruckdorfer, M. Chiesa, F. Frati, M. Kaufmann and C. Squarcella. “On the Area Requirements of Euclidean Minimum Spanning Trees”. Technical Report RT-DIA-183-2011, Dept. of Computer Science and Automation, Roma Tre University, 2011. 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. 2010 P. Eades, W. Huang and S. Hong, “A Force-Directed Method for Large Crossing Angle Graph Drawing”, CoRR abs/1012.4559, 2010. 2009 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. 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. 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. 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. 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. 2008 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. 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. S. Hong and H. 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. 2007 S. Hong and H. 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. S. Hong and H. 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. R. Webber and S. Hong, “Force-directed Animations for a Class of Dynamic Bipartite and Clustered Graphs”, NICTA TR, 2007. 2006 Q. Nguyen and S. Hong, “Comparison of Centrality-Based Planarisation for 2.5D Graph Drawing”, NICTA TR 2006. A. Ahmed and S. Hong, “Navigation Techniques for 2.5D Graph Layout”, TR, School of IT, University of Sydney, 2006. Senechal, N., Hong, S., Eades, P., “Display of Sensor Networks”, NICTA TR 2006. 2005 Buchheim, C., Zheng, L., “Fixed Linear Crossing Minimisation by Reduction to the Maximum Cut Problem”, Technical report for ADONET, Dec 2005. Huang, W., Hong, S., Eades, P., “Layouts effects: comparison of sociogram drawing conventions”, Technical report, USYD-IT-TR-575, Oct 2005. Zheng, L., Buchheim, C., “Solutions of Crossing Minimisation Problems by Linear Constrained Quadratic Programming”, Technical report for ADONET, Nov 2005. 2004 S. Hong, B. McKay and P. 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. 2003 S. Hong and T. 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. K. Sugiyama, S. Hong and A. Maeda, “The Puzzle Layout Problem”, TR IT-IVG-2003-02, School of Information Technologies, The University of Sydney, 2003. S. Hong, D. Merrick and H. Nascimento, “The Metromap Layout Problem”, TR IT-IVG-2003-03, School of Information Technologies, The University of Sydney, 2003. 2002 D. Abelson, S. Hong and D. Taylor, “A Group-Theoretic Method for Drawing Graphs Symmetrically”, Technical Report IT-IVG-2002-01, School of Information Technologies, The University of Sydney, 2002. S. Hong and P. Eades, “Drawing Trees Symmetrically in Three Dimension”, Technical Report IT-IVG-2002-02, School of Information Technologies, The University of Sydney, 2002. T. Murtagh and S. Hong, “3DTreeDraw: A Three Dimensional Tree Drawing System”, Technical Report IT-IVG-2002-03, School of Information Technologies, The University of Sydney, 2002. 2001 S. Hong, B. McKay and P. 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. S. Hong and P. 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. SS. Hong and P. 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. S. Hong and P. 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. |
|
|
Posters |
|
|
2014 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. 2013 S. Hong, “Visual Analytics for Massive Complex Networks”, Proceedings of CGIV (Computer Graphics, Imaging and Visualization) 2013, IEEE, 2013. 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. P. Eades and K Klein, “The Graph Landscape-a Visualisation of Graph Properties”, Proceedings of GD 2013, pp. 534, Lecture Notes in Computer Science, Springer, 2013 T. Angus, T. Freeman and K. Klein, “Application of Graph Layout Algorithms for the Visualization of Biological Networks in 3D”, Proceedings of GD 2013, pp. 534, Lecture Notes in Computer Science, Springer, 2013 2011 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. 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. 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. 2010 S. Hong, “Drawing Graphs with Large Crossing Angles”, Proceedings of AAAC 2010 (Asian Association for Algorithms and Computation), 2010. 2008 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) J. Gim, Y. Arahori, T. Imamichi, S. Hong and H. Nagamochi, “Overlap Removal in Label Layouts by a Multi-sphere Scheme”, IEEE Pacific Visualization Symposium 2008 (PacificVis 2008), March 5-7 Kyoto, Japan, 2008. V. Batagelj, K. Borner, U. Brandes, S. Hong et al,,Sunbelt 2008 Viszards Session, “Visualization and Analysis of WoS (Web of Science)”, Proceedings of Sunbelt 2008, US. 2007 A. Ahmed, X. Fu, S. Hong, Q. Nguyen,and K. Xu, “Visual Analysis of Dynamic Networks with Geological Clustering”, poster, IEEE Symposium on Visual Analytics Science and Technology (VAST) 2007, October 2007, California USA. X. Fu, S. Hong, P. Pattison and G. Robins, “Visualisation and Interaction of Temporal Multi-relational Networks, Proceedings of Sunbelt 2007, pp. 6, 2007. Batagelj et al, Sunbelt 2007 Viszards Session, “Visualization and Analysis of Wiki”, Proceedings of Sunbelt 2007, Greece. 2006 Williams, R., Xu, K., Huang, X. X., Cotsapas, C., Hong, S., McCaughan, G., Gorrell, M., Little, P., “Combined visualization and analysis of Gene Ontology annotations using multivariate representations of annotations and bipartite networks”, 14th Annual International conference on Intelligent Systems for Molecular Biology (ISMB2006), Fortaleza, Brazil, August 6-10, 2006 Wu, Y., Takatsuka, M., Webber, R. “Visualizing Multivariate Network Using GeoSOM and Spherical Disk Layout”, 12th IEEE Symposium on Information Visualization (InfoVis2006) Webber, R. “The Star System – A Case Study for Clustered Graph Animation”, 12th IEEE Symposium on Information Visualization (InfoVis2006) Fu, X., Hong, S., Nikolov, N., Shen, X., Wu, Y., Xu, K., “Visualization and Analysis of Small-World Networks”, 12th IEEE Symposium on Information Visualization (InfoVis 2006) Hong S-H*, Visualisation and Analysis of Large and Complex Networks, Computing The Future Symposium 2006, Submitted and accepted 5/07/2006, Displayed 13/09/2006 Xu K*, Biological Network Analysis and Visualization, Computing The Future Symposium 2006, Submitted and accepted 5/07/2006, Displayed 13/09/2006 Merrick D*, Algorithms for Metro Map Layout, Computing The Future Symposium 2006, Submitted and accepted 5/07/2006, Displayed 13/09/2006 Huang, W (T)*, Do Edge Crossings Really Matter?, Computing The Future Symposium 2006, Submitted and accepted 5/07/2006, Displayed 13/09/2006 Hong S-H*, Webber R*, Xu K*, Fu X*, Senechal N*, Ahmed A*, Huang W*, Li P*, Merrick D*, Murray C*, Song L*, Wu Y*, Zheng L*, VALACON: Visualisation and Analysis of Large and Complex Networks / Project overview and specific examples, IET netWORKing 2006, displayed 17/08/2006 (http://iee-nsw.org/yms/networking/info-company.php) 2005 Hong, S., Nikolov, N., Forster, M., Xu, K., Fu, X., Ahmed, A., Huang, W., Li, P., Merrick, D., Murray, C., Song, L., Wu, Y., Zheng, L., “VALACON: Visualisation and Analysis of Large and Complex Networks/ Project overview and subprojects”, NICTA TechFest, May 2005. Webber, R., Ahmed, A., Ruiz, N., “The IMAGEN Program”, NICTA Canberra Summer School, 2 Dec 2005. Shen, X., Vande Moere, A., Eades, P., “An Intrusive Evaluation of Ambient Display”, IEEE InfoVis, 24 Oct 2005. Kraska, T., Manwaring, T., Hart, D. Hong, S., Xu, K.; Fung, D., Ho, J., Hart, D., Roehm, U., “PathBank”, University of Sydney Research Conversazione, 28 Oct 2005. Hong, S., Forster, M., Fu, X., Taib, R., Webber, R., Xu, K., Ahmed, A., Fung, D., Ho, J., Huang, T., Li, P., Merrick, D., Murray, C., Song, L., Wu, Y., Zheng, L., “Visualisation and Analysis of Large and Complex Networks (VALACON)”, University of Sydney Research Conversazione, 28 Oct 2005. 2004 Ahmed, A., Dwyer, T., Murray, C., Song, L., Wu, Y., “WilmaScope Graph Visualisation”, Student team, 1st place, Fekete, J.-D., Grinstein, G., Plaisant, C., IEEE InfoVis 2004 Contest, Conference Proceedings, InfoVis 2004, Austin, Texas, IEEE Visualisation, Oct 10-15, 2004 (Proceedings on optical media).
|
|
| GEOMI-2 | |
| GEOMI | |
|
|
|
