 | 2010 |
|---|
| 76 |       | 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) |
| 2009 |
|---|
| 75 | | Seok-Hee Hong,
Hiroshi Nagamochi:
Upward Star-Shaped Polyhedral Graphs.
ISAAC 2009: 913-922 |
| 74 | | David Cho Yau Fung,
Seok-Hee Hong,
Dirk Koschützki,
Falk Schreiber,
Kai Xu:
Visual Analysis of Overlapping Biological Networks.
IV 2009: 337-342 |
| 73 | | Weidong Huang,
Peter Eades,
Seok-Hee Hong:
A graph reading behavior: Geodesic-path tendency.
PacificVis 2009: 137-144 |
| 72 | | Kazuya Haraguchi,
Seok-Hee Hong,
Hiroshi Nagamochi:
Bipartite Graph Representation of Multiple Decision Table Classifiers.
SAGA 2009: 46-60 |
| 71 | | 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 |
| 70 | | Seok-Hee Hong,
Hiroshi Nagamochi:
New Approximation to the One-sided Radial Crossing Minimization.
J. Graph Algorithms Appl. 13(2): 179-196 (2009) |
| 69 | | Seok-Hee Hong,
Takao Nishizeki:
Guest Editors' Foreword.
J. Graph Algorithms Appl. 13(3): 285-287 (2009) |
| 2008 |
|---|
| 68 |  | Seok-Hee Hong,
Takao Nishizeki,
Wu Quan:
Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers
Springer 2008 |
| 67 | | Seok-Hee Hong,
Hiroshi Nagamochi,
Takuro Fukunaga:
Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings
Springer 2008 |
| 66 | | Xiaobin Shen,
Andrew Vande Moere,
Peter Eades,
Seok-Hee Hong:
The long-term evaluation of Fisherman in a partial-attention environment.
BELIV 2008: 10 |
| 65 | | Weidong Huang,
Peter Eades,
Seok-Hee Hong:
Beyond time and error: a cognitive approach to the evaluation of graph drawings.
BELIV 2008: 3 |
| 64 | | Seok-Hee Hong,
Hiroshi Nagamochi:
Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints.
COCOON 2008: 405-414 |
| 63 | | Seok-Hee Hong,
Martin Mader:
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints.
Graph Drawing 2008: 278-283 |
| 62 | | Takashi Imamichi,
Yohei Arahori,
Jaeseong Gim,
Seok-Hee Hong,
Hiroshi Nagamochi:
Removing Node Overlaps Using Multi-sphere Scheme.
Graph Drawing 2008: 296-301 |
| 61 | | Seok-Hee Hong,
Hiroshi Nagamochi:
Approximating Crossing Minimization in Radial Layouts.
LATIN 2008: 461-472 |
| 60 | | Weidong Huang,
Seok-Hee Hong,
Peter Eades:
Effects of Crossing Angles.
PacificVis 2008: 41-46 |
| 59 | | Christoph Buchheim,
Seok-Hee Hong:
Testing Planarity of Geometric Automorphisms in Linear Time.
Algorithmica 52(4): 448-465 (2008) |
| 58 | | Seok-Hee Hong,
Hiroshi Nagamochi:
Convex drawings of graphs with non-convex boundary constraints.
Discrete Applied Mathematics 156(12): 2368-2380 (2008) |
| 57 | | Seok-Hee Hong:
Guest Editor's Foreword.
J. Graph Algorithms Appl. 12(3): 265-266 (2008) |
| 56 | | 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) |
| 2007 |
|---|
| 55 | | Seok-Hee Hong,
Kwan-Liu Ma:
APVIS 2007, 6th International Asia-Pacific Symposium on Visualization 2007, Sydney, Australia, 5-7 February 2007
IEEE 2007 |
| 54 | | Xiaoyan Fu,
Seok-Hee Hong,
Nikola S. Nikolov,
Xiaobin Shen,
Yingxin Wu,
Kai Xu:
Visualization and analysis of email networks.
APVIS 2007: 1-8 |
| 53 | | 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 |
| 52 | | Kai Xu,
Andrew Cunningham,
Seok-Hee Hong,
Bruce H. Thomas:
GraphScape: integrated multivariate network visualization.
APVIS 2007: 33-40 |
| 51 | | Adel Ahmed,
Seok-Hee Hong:
Navigation techniques for 2.5D graph layout.
APVIS 2007: 81-84 |
| 50 | | Xiaobin Shen,
Peter Eades,
Seok-Hee Hong,
Andrew Vande Moere:
Intrusive and Non-intrusive Evaluation of Ambient Displays.
Ambient Information Systems 2007 |
| 49 | | 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 |
| 48 | | David Abelson,
Seok-Hee Hong,
Donald E. Taylor:
Geometric automorphism groups of graphs.
Discrete Applied Mathematics 155(17): 2211-2226 (2007) |
| 47 | | 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) |
| 46 | | 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) |
| 2006 |
|---|
| 45 | | Tim Dwyer,
Seok-Hee Hong,
Dirk Koschützki,
Falk Schreiber,
Kai Xu:
Visual analysis of network centralities.
APVIS 2006: 189-197 |
| 44 | | Weidong Huang,
Seok-Hee Hong,
Peter Eades:
How people read sociograms: a questionnaire study.
APVIS 2006: 199-206 |
| 43 | | Weidong Huang,
Seok-Hee Hong,
Peter Eades:
Predicting graph reading performance: a cognitive approach.
APVIS 2006: 207-216 |
| 42 | | 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 |
| 41 | | Seok-Hee Hong,
Hiroshi Nagamochi:
Convex Drawings of Graphs with Non-convex Boundary.
WG 2006: 113-124 |
| 40 | | Seok-Hee Hong,
Peter Eades:
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs.
Algorithmica 44(1): 67-100 (2006) |
| 39 | | 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) |
| 38 | | Seok-Hee Hong,
Hsu-Chun Yen:
Preface.
Int. J. Found. Comput. Sci. 17(5): 1003-1004 (2006) |
| 37 | | Seok-Hee Hong,
Damian Merrick,
Hugo A. D. do Nascimento:
Automatic visualisation of metro maps.
J. Vis. Lang. Comput. 17(3): 203-224 (2006) |
| 2005 |
|---|
| 36 | | Seok-Hee Hong:
Asia-Pacific Symposium on Information Visualisation, APVIS 2005, Sydney, Australia, January 27-29, 2005
Australian Computer Society 2005 |
| 35 | | Seok-Hee Hong,
Nikola S. Nikolov:
Layered Drawings of Directed Graphs in Three Dimensions.
APVIS 2005: 69-74 |
| 34 | | Kozo Sugiyama,
Ryo Osawa,
Seok-Hee Hong:
Puzzle Generators and Symmetric Puzzle Layout.
APVIS 2005: 97-105 |
| 33 | | 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 |
| 32 | | Seok-Hee Hong,
Nikola S. Nikolov:
Hierarchical Layouts of Directed Graphs in Three Dimensions.
Graph Drawing 2005: 251-261 |
| 31 | | Weidong Huang,
Seok-Hee Hong,
Peter Eades:
Layout Effects on Sociogram Perception.
Graph Drawing 2005: 262-273 |
| 30 | | 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 |
| 29 | | Joshua Wing Kei Ho,
Seok-Hee Hong:
Drawing Clustered Graphs in Three Dimensions.
Graph Drawing 2005: 492-502 |
| 28 | | Seok-Hee Hong:
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions.
Graph Drawing 2005: 514-515 |
| 27 | | Seok-Hee Hong:
Network Analysis and Visualisation .
Graph Drawing 2005: 524-527 |
| 26 | | Wanchun Li,
Seok-Hee Hong,
Peter Eades:
A Framework for Visualising Large Graphs.
IV 2005: 528-535 |
| 25 | | Wanchun Li,
Peter Eades,
Seok-Hee Hong:
Navigating Software Architectures with Constant Visual Complexity.
VL/HCC 2005: 225-232 |
| 24 | | Seok-Hee Hong,
Peter Eades:
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs.
Algorithmica 42(2): 159-197 (2005) |
| 23 | | Christoph Buchheim,
Seok-Hee Hong:
Crossing Minimization for Symmetries.
Theory Comput. Syst. 38(3): 293-311 (2005) |
| 2004 |
|---|
| 22 | | Seok-Hee Hong,
Peter Eades:
A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs.
Graph Drawing 2004: 307-317 |
| 21 | | Seok-Hee Hong,
Tom Murtagh:
Visualisation of Large and Complex Networks Using PolyPlane.
Graph Drawing 2004: 471-481 |
| 20 | | Seok-Hee Hong,
Damian Merrick,
Hugo A. D. do Nascimento:
The Metro Map Layout Problem.
Graph Drawing 2004: 482-491 |
| 19 | | Seok-Hee Hong,
Damian Merrick,
Hugo A. D. do Nascimento:
The Metro Map Layout Problem.
InVis.au 2004: 91-100 |
| 18 | | Seok-Hee Hong,
Peter Eades,
Jonathan Hillman:
Linkless symmetric drawings of series parallel digraphs.
Comput. Geom. 29(3): 191-221 (2004) |
| 2003 |
|---|
| 17 | | Kozo Sugiyama,
Seok-Hee Hong,
Atsuhiko Maeda:
The Puzzle Layout Problem.
Graph Drawing 2003: 500-501 |
| 16 | | Seok-Hee Hong,
Peter Eades:
Symmetric Layout of Disconnected Graphs.
ISAAC 2003: 405-414 |
| 15 | | Tom Murtagh,
Seok-Hee Hong:
3DTreeDraw: a thjree dimensional tree drawing system.
Symposium on Computational Geometry 2003: 380-381 |
| 14 | | Seok-Hee Hong,
Peter Eades:
Drawing Trees Symmetrically in Three Dimensions.
Algorithmica 36(2): 153-178 (2003) |
| 2002 |
|---|
| 13 | | David Abelson,
Seok-Hee Hong,
Donald E. Taylor:
A Group-Theoretic Method for Drawing Graphs Symmetrically.
Graph Drawing 2002: 86-97 |
| 12 | | Christoph Buchheim,
Seok-Hee Hong:
Crossing Minimization for Symmetries.
ISAAC 2002: 563-574 |
| 11 | | Seok-Hee Hong,
Brendan D. McKay,
Peter Eades:
Symmetric drawings of triconnected planar graphs.
SODA 2002: 356-365 |
| 2001 |
|---|
| 10 | | Seok-Hee Hong:
Drawing Graphs Symmetrically in Three Dimensions.
Graph Drawing 2001: 189-204 |
| 2000 |
|---|
| 9 | | Seok-Hee Hong,
Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Trees.
Graph Drawing 2000: 360-371 |
| 8 | | Seok-Hee Hong,
Peter Eades:
An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs.
ISAAC 2000: 266-277 |
| 7 | | Seok-Hee Hong:
Visualisation of Symmetry in Graphs.
VIP 2000: 71-72 |
| 6 | | Seok-Hee Hong,
Peter Eades,
Sang Ho Lee:
Drawing series parallel digraphs symmetrically.
Comput. Geom. 17(3-4): 165-188 (2000) |
| 1998 |
|---|
| 5 | | 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 |
| 4 | | Seok-Hee Hong,
Peter Eades,
Sang Ho Lee:
Finding Planar Geometric Automorphisms in Planar Graphs.
ISAAC 1998: 277-286 |
| 1997 |
|---|
| 3 | | 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) |
| 2 | | 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 |
|---|
| 1 | | Seok-Hee Hong,
Yoon-Joon Lee,
Myoung-Ho Kim:
Real-Time Multiversion Concurrency Control Using Precedence Relationship.
DASFAA 1995: 222-229 |
