Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Seok-Hee Hong
2010 – today
- 2013
[j36]Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin: Improving multiple aesthetics produces better graph drawings. J. Vis. Lang. Comput. 24(4): 262-272 (2013)- [c69]Hooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: Circular Graph Drawings with Large Crossing Angles. WALCOM 2013: 298-309
- [i2]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama: Order Preserving Matching. CoRR abs/1302.4064 (2013)
- 2012
- [j35]Seok-Hee Hong, Hiroshi Nagamochi: A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. Algorithmica 62(3-4): 1122-1158 (2012)
- [j34]Emilio Di Giacomo, Walter Didimo, Peter Eades, Seok-Hee Hong, Giuseppe Liotta: Bounds on the crossing resolution of complete geometric graphs. Discrete Applied Mathematics 160(1-2): 132-139 (2012)
- [j33]Seok-Hee Hong, Hiroshi Nagamochi: Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. Theor. Comput. Sci. 445: 36-51 (2012)
- [c68]Seok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon: Fáry's Theorem for 1-Planar Graphs. COCOON 2012: 335-346
- [c67]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki: Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). Graph Drawing 2012: 339-345
- [c66]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: StreamEB: Stream Edge Bundling. Graph Drawing 2012: 400-413
- [c65]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong: On the Faithfulness of Graph Visualizations. Graph Drawing 2012: 566-568
- [c64]Tim Dwyer, Fabrizio Frati, Seok-Hee Hong, Karsten Klein: Theory and Practice of Graph Drawing. Graph Drawing 2012: 571-574
- [c63]Hui Liu, Peter Eades, Seok-Hee Hong: Visualizing dynamic trajectories in social networks. VL/HCC 2012: 197-204
- 2011
- [j32]Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011)
- [j31]Seok-Hee Hong, Hiroshi Nagamochi: Editorial: ISAAC 2008 Special Issue. Algorithmica 61(4): 777-778 (2011)
- [j30]Seok-Hee Hong, Hiroshi Nagamochi: Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. Algorithmica 61(4): 1022-1076 (2011)
- [j29]Seok-Hee Hong, Hiroshi Nagamochi: Guest Editors' Foreword. Int. J. Comput. Geometry Appl. 21(3): 251-252 (2011)
- [c62]
- [c61]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades: TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. Graph Drawing 2011: 123-135
- [c60]Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw: Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC 2011: 200-209
- 2010
- [j28]Seok-Hee Hong, Hiroshi Nagamochi: A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. Algorithmica 58(2): 433-460 (2010)
- [j27]Seok-Hee Hong, Hiroshi Nagamochi: Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. Algorithmica 58(2): 478-497 (2010)
- [j26]Seok-Hee Hong, Hiroshi Nagamochi: An algorithm for constructing star-shaped drawings of plane graphs. Comput. Geom. 43(2): 191-206 (2010)
- [j25]Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Matched drawability of graph pairs and of graph triples. Comput. Geom. 43(6-7): 611-634 (2010)
- [j24]Christian Bachmaier, Hedi Buchner, Michael Forster, Seok-Hee Hong: Crossing minimization in extended level drawings of graphs. Discrete Applied Mathematics 158(3): 159-179 (2010)
- [j23]Seok-Hee Hong, Hiroshi Nagamochi: Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms 8(3): 282-295 (2010)
- [c59]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong, Weidong Huang: Large Crossing Angles in Circular Layouts. Graph Drawing 2010: 397-399
- [c58]Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi: Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. LION 2010: 169-183
- [c57]Weidong Huang, Peter Eades, Seok-Hee Hong, Chun-Cheng Lin: Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. VL/HCC 2010: 176-183
- [i1]Peter Eades, Weidong Huang, Seok-Hee Hong: A Force-Directed Method for Large Crossing Angle Graph Drawing. CoRR abs/1012.4559 (2010)
2000 – 2009
- 2009
- [j22]Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong: Issues for the Evaluation of Ambient Displays. IJACI 1(2): 59-69 (2009)
- [j21]Weidong Huang, Peter Eades, Seok-Hee Hong: Measuring effectiveness of graph visualizations: A cognitive load perspective. Information Visualization 8(3): 139-152 (2009)
- [j20]Seok-Hee Hong, Hiroshi Nagamochi: New Approximation to the One-sided Radial Crossing Minimization. J. Graph Algorithms Appl. 13(2): 179-196 (2009)
- [j19]Seok-Hee Hong, Takao Nishizeki: Guest Editors' Foreword. J. Graph Algorithms Appl. 13(3): 285-287 (2009)
- [c56]Weidong Huang, Peter Eades, Seok-Hee Hong: A graph reading behavior: Geodesic-path tendency. PacificVis 2009: 137-144
- [c55]Peter Eades, Seok-Hee Hong, Sheung-Hung Poon: On Rectilinear Drawing of Graphs. Graph Drawing 2009: 232-243
- [c54]Kai Xu, Rohan Williams, Seok-Hee Hong, Qing Liu, Ji Zhang: Semi-bipartite Graph Visualization for Gene Ontology Networks. Graph Drawing 2009: 244-255
- [c53]
- [c52]David Cho Yau Fung, Seok-Hee Hong, Dirk Koschützki, Falk Schreiber, Kai Xu: Visual Analysis of Overlapping Biological Networks. IV 2009: 337-342
- [c51]Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi: Bipartite Graph Representation of Multiple Decision Table Classifiers. SAGA 2009: 46-60
- [c50]Adel Ahmed, Xiaoyan Fu, Seok-Hee Hong, Quan Hoang Nguyen, Kai Xu: Visual Analysis of History of World Cup: A Dynamic Network with Dynamic Hierarchy and Geographic Clustering. VINCI 2009: 25-39
- [c49]Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath: Matched Drawability of Graph Pairs and of Graph Triples. WALCOM 2009: 322-333
- 2008
- [j18]Christoph Buchheim, Seok-Hee Hong: Testing Planarity of Geometric Automorphisms in Linear Time. Algorithmica 52(4): 448-465 (2008)
- [j17]Seok-Hee Hong, Hiroshi Nagamochi: Convex drawings of graphs with non-convex boundary constraints. Discrete Applied Mathematics 156(12): 2368-2380 (2008)
- [j16]
- [j15]David Cho Yau Fung, Seok-Hee Hong, Dirk Koschützki, Falk Schreiber, Kai Xu: 2.5D Visualisation of Overlapping Biological Networks. J. Integrative Bioinformatics 5(1) (2008)
- [c48]
- [c47]Weidong Huang, Peter Eades, Seok-Hee Hong: Beyond time and error: a cognitive approach to the evaluation of graph drawings. BELIV 2008: 3
- [c46]Xiaobin Shen, Andrew Vande Moere, Peter Eades, Seok-Hee Hong: The long-term evaluation of Fisherman in a partial-attention environment. BELIV 2008: 10
- [c45]Seok-Hee Hong, Hiroshi Nagamochi: Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. COCOON 2008: 405-414
- [c44]Seok-Hee Hong, Martin Mader: Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints. Graph Drawing 2008: 278-283
- [c43]Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi: Removing Node Overlaps Using Multi-sphere Scheme. Graph Drawing 2008: 296-301
- [c42]Luca Grilli, Seok-Hee Hong, Antonios Symvonis, Camille Wormser: Locally Delaunay Realizability of Regular Series-Parallel Graphs. ICCSA Workshops 2008: 461-467
- [c41]Seok-Hee Hong, Hiroshi Nagamochi: Approximating Crossing Minimization in Radial Layouts. LATIN 2008: 461-472
- [e4]Seok-Hee Hong, Takao Nishizeki, Wu Quan (Eds.): Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers. Lecture Notes in Computer Science 4875, Springer 2008, ISBN 978-3-540-77536-2
- [e3]Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga (Eds.): Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Lecture Notes in Computer Science 5369, Springer 2008, ISBN 978-3-540-92181-3
- 2007
- [j14]David Abelson, Seok-Hee Hong, Donald E. Taylor: Geometric automorphism groups of graphs. Discrete Applied Mathematics 155(17): 2211-2226 (2007)
- [j13]Seok-Hee Hong, Nikola S. Nikolov, Alexandre Tarassov: A 2.5D Hierarchical Drawing of Directed Graphs. J. Graph Algorithms Appl. 11(2): 371-396 (2007)
- [j12]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)
- [c40]Xiaoyan Fu, Seok-Hee Hong, Nikola S. Nikolov, Xiaobin Shen, Yingxin Wu, Kai Xu: Visualization and analysis of email networks. APVIS 2007: 1-8
- [c39]Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-Hee Hong, Damian Merrick, Andrej Mrvar: Visualisation and analysis of the internet movie database. APVIS 2007: 17-24
- [c38]Kai Xu, Andrew Cunningham, Seok-Hee Hong, Bruce H. Thomas: GraphScape: integrated multivariate network visualization. APVIS 2007: 33-40
- [c37]
- [c36]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263
- [c35]Adel Ahmed, Xiaoyan Fu, Seok-Hee Hong, Quan Hoang Nguyen, Kai Xu: Visual Analysis of Dynamic Networks with Geological Clustering. IEEE VAST 2007: 221-222
- [c34]Xiaobin Shen, Peter Eades, Seok-Hee Hong, Andrew Vande Moere: Intrusive and Non-intrusive Evaluation of Ambient Displays. Ambient Information Systems 2007
- [e2]Seok-Hee Hong, Kwan-Liu Ma (Eds.): APVIS 2007, 6th International Asia-Pacific Symposium on Visualization 2007, Sydney, Australia, 5-7 February 2007. IEEE 2007, ISBN 1-4244-0808-3
- 2006
- [j11]Seok-Hee Hong, Peter Eades: Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Algorithmica 44(1): 67-100 (2006)
- [j10]Seok-Hee Hong, Brendan D. McKay, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Discrete & Computational Geometry 36(2): 283-311 (2006)
- [j9]
- [j8]Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nascimento: Automatic visualisation of metro maps. J. Vis. Lang. Comput. 17(3): 203-224 (2006)
- [c33]Joshua Wing Kei Ho, Tristan Manwaring, Seok-Hee Hong, Uwe Röhm, David Cho Yau Fung, Kai Xu, Tim Kraska, David Hart: PathBank: Web-Based Querying and Visualziation of an Integrated Biological Pathway Database. CGIV 2006: 84-89
- [c32]Tim Dwyer, Seok-Hee Hong, Dirk Koschützki, Falk Schreiber, Kai Xu: Visual analysis of network centralities. APVIS 2006: 189-197
- [c31]Weidong Huang, Seok-Hee Hong, Peter Eades: How people read sociograms: a questionnaire study. APVIS 2006: 199-206
- [c30]Weidong Huang, Seok-Hee Hong, Peter Eades: Predicting graph reading performance: a cognitive approach. APVIS 2006: 207-216
- [c29]Seok-Hee Hong, Hiroshi Nagamochi: Convex Drawings of Graphs with Non-convex Boundary. WG 2006: 113-124
- [p1]Peter Eades, Seok-Hee Hong, Keith Nesbitt, Masahiro Takatsuka: Information Display. Handbook of Nature-Inspired and Innovative Computing 2006: 633-655
- 2005
- [j7]Seok-Hee Hong, Peter Eades: Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. Algorithmica 42(2): 159-197 (2005)
- [j6]Christoph Buchheim, Seok-Hee Hong: Crossing Minimization for Symmetries. Theory Comput. Syst. 38(3): 293-311 (2005)
- [c28]Seok-Hee Hong, Nikola S. Nikolov: Layered Drawings of Directed Graphs in Three Dimensions. APVIS 2005: 69-74
- [c27]Kozo Sugiyama, Ryo Osawa, Seok-Hee Hong: Puzzle Generators and Symmetric Puzzle Layout. APVIS 2005: 97-105
- [c26]Seok-Hee Hong, Nikola S. Nikolov: Hierarchical Layouts of Directed Graphs in Three Dimensions. Graph Drawing 2005: 251-261
- [c25]Weidong Huang, Seok-Hee Hong, Peter Eades: Layout Effects on Sociogram Perception. Graph Drawing 2005: 262-273
- [c24]Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu, Joshua Wing Kei Ho, Seok-Hee Hong, Dirk Koschützki, Colin Murray, Nikola S. Nikolov, Ronnie Taib, Alexandre Tarassov, Kai Xu: GEOMI: GEOmetry for Maximum Insight. Graph Drawing 2005: 468-479
- [c23]Joshua Wing Kei Ho, Seok-Hee Hong: Drawing Clustered Graphs in Three Dimensions. Graph Drawing 2005: 492-502
- [c22]Seok-Hee Hong: MultiPlane: A New Framework for Drawing Graphs in Three Dimensions. Graph Drawing 2005: 514-515
- [c21]
- [c20]
- [c19]Adel Ahmed, Tim Dwyer, Seok-Hee Hong, Colin Murray, Le Song, Ying Xin Wu: Visualisation and Analysis of Large and Complex Scale-free Networks. EuroVis 2005: 239-246
- [c18]Wanchun Li, Peter Eades, Seok-Hee Hong: Navigating Software Architectures with Constant Visual Complexity. VL/HCC 2005: 225-232
- [e1]Seok-Hee Hong (Ed.): Asia-Pacific Symposium on Information Visualisation, APVIS 2005, Sydney, Australia, January 27-29, 2005. CRPIT 45, Australian Computer Society 2005, ISBN 1-920682-27-9
- 2004
- [j5]Seok-Hee Hong, Peter Eades, Jonathan Hillman: Linkless symmetric drawings of series parallel digraphs. Comput. Geom. 29(3): 191-221 (2004)
- [c17]Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nascimento: The Metro Map Layout Problem. InVis.au 2004: 91-100
- [c16]Seok-Hee Hong, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. Graph Drawing 2004: 307-317
- [c15]Seok-Hee Hong, Tom Murtagh: Visualisation of Large and Complex Networks Using PolyPlane. Graph Drawing 2004: 471-481
- [c14]Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nascimento: The Metro Map Layout Problem. Graph Drawing 2004: 482-491
- 2003
- [j4]Seok-Hee Hong, Peter Eades: Drawing Trees Symmetrically in Three Dimensions. Algorithmica 36(2): 153-178 (2003)
- [c13]Tom Murtagh, Seok-Hee Hong: 3DTreeDraw: a thjree dimensional tree drawing system. Symposium on Computational Geometry 2003: 380-381
- [c12]Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda: The Puzzle Layout Problem. Graph Drawing 2003: 500-501
- [c11]
- 2002
- [c10]David Abelson, Seok-Hee Hong, Donald E. Taylor: A Group-Theoretic Method for Drawing Graphs Symmetrically. Graph Drawing 2002: 86-97
- [c9]
- [c8]Seok-Hee Hong, Brendan D. McKay, Peter Eades: Symmetric drawings of triconnected planar graphs. SODA 2002: 356-365
- 2001
- [c7]
- 2000
- [j3]Seok-Hee Hong, Peter Eades, Sang Ho Lee: Drawing series parallel digraphs symmetrically. Comput. Geom. 17(3-4): 165-188 (2000)
- [c6]Seok-Hee Hong, Peter Eades: An Algorithm for Finding Three Dimensional Symmetry in Trees. Graph Drawing 2000: 360-371
- [c5]Seok-Hee Hong, Peter Eades: An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. ISAAC 2000: 266-277
- [c4]
1990 – 1999
- 1998
- [c3]Seok-Hee Hong, Peter Eades, Aaron J. Quigley, Sang Ho Lee: Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. Graph Drawing 1998: 198-209
- [c2]Seok-Hee Hong, Peter Eades, Sang Ho Lee: Finding Planar Geometric Automorphisms in Planar Graphs. ISAAC 1998: 277-286
- 1997
- [j2]Seok-Hee Hong, Myoung-Ho Kim: Resolving Data Conflicts with Multiple Versions and Precedence Relationships in Real-Time Databases. Inf. Process. Lett. 61(3): 149-156 (1997)
- [j1]Seok-Hee Hong, Myoung-Ho Kim: A real-time concurrency control algorithm: Use of multiversion and precedence relationships. Journal of Systems Architecture 44(2): 119-130 (1997)
- 1995
- [c1]Seok-Hee Hong, Yoon-Joon Lee, Myoung-Ho Kim: Real-Time Multiversion Concurrency Control Using Precedence Relationship. DASFAA 1995: 222-229
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:19 CEST by the dblp team