Real-Time Multiversion Concurrency Control Using Precedence Relationship. - Seok-Hee Hong 001; Yoon-Joon Lee; Myoung-Ho Kim (DASFAA, 1995)

Resolving Data Conflicts with Multiple Versions and Precedence Relationships in Real-Time Databases. - Seok-Hee Hong 001; Myoung-Ho Kim (Inf. Process. Lett., 1997)

A real-time concurrency control algorithm: Use of multiversion and precedence relationships. - Seok-Hee Hong 001; Myoung-Ho Kim (J. Syst. Archit., 1997)

Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. - Seok-Hee Hong 001; Peter Eades; Aaron J. Quigley; Sang Ho Lee (GD, 1998)

Finding Planar Geometric Automorphisms in Planar Graphs. - Seok-Hee Hong 001; Peter Eades; Sang Ho Lee (ISAAC, 1998)

An Algorithm for Finding Three Dimensional Symmetry in Trees. - Seok-Hee Hong 001; Peter Eades (GD, 2000)

An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs. - Seok-Hee Hong 001; Peter Eades (ISAAC, 2000)

Visualisation of Symmetry in Graphs. - Seok-Hee Hong 001 (VIP, 2000)

Drawing series parallel digraphs symmetrically. - Seok-Hee Hong 001; Peter Eades; Sang Ho Lee (Comput. Geom., 2000)

Drawing Graphs Symmetrically in Three Dimensions. - Seok-Hee Hong 001 (GD, 2001)

A Group-Theoretic Method for Drawing Graphs Symmetrically. - David Abelson; Seok-Hee Hong 001; Donald E. Taylor (GD, 2002)

Symmetric drawings of triconnected planar graphs. - Seok-Hee Hong 001; Brendan D. McKay; Peter Eades (SODA, 2002)

3DTreeDraw: a thjree dimensional tree drawing system. - Tom Murtagh; Seok-Hee Hong 001 (SCG, 2003)

The Puzzle Layout Problem. - Kozo Sugiyama; Seok-Hee Hong 001; Atsuhiko Maeda (GD, 2003)

Symmetric Layout of Disconnected Graphs. - Seok-Hee Hong 001; Peter Eades (ISAAC, 2003)

Drawing Trees Symmetrically in Three Dimensions. - Seok-Hee Hong 001; Peter Eades (Algorithmica, 2003)

A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. - Seok-Hee Hong 001; Peter Eades (GD, 2004)

Visualisation of Large and Complex Networks Using PolyPlane. - Seok-Hee Hong 001; Tom Murtagh (GD, 2004)

The Metro Map Layout Problem. - Seok-Hee Hong 001; Damian Merrick; Hugo A. D. do Nascimento (GD, 2004)

Linkless symmetric drawings of series parallel digraphs. - Seok-Hee Hong 001; Peter Eades; Jonathan Hillman (Comput. Geom., 2004)

Drawing Graphs. - Peter Eades; Seok-Hee Hong 001 (Handbook of Data Structures and Applications, 2004)

Layered Drawings of Directed Graphs in Three Dimensions. - Seok-Hee Hong 001; Nikola S. Nikolov (APVIS, 2005)

Puzzle Generators and Symmetric Puzzle Layout. - Kozo Sugiyama; Ryo Osawa; Seok-Hee Hong 001 (APVIS, 2005)

GEOMI: GEOmetry for Maximum Insight. - Adel Ahmed; Tim Dwyer; Michael Forster; Xiaoyan Fu; Joshua Wing Kei Ho; Seok-Hee Hong 001; Dirk Koschützki; Colin Murray; Nikola S. Nikolov; Ronnie Taib; Alexandre Tarassov; Kai Xu 003 (GD, 2005)

Drawing Clustered Graphs in Three Dimensions. - Joshua Wing Kei Ho; Seok-Hee Hong 001 (GD, 2005)

MultiPlane: A New Framework for Drawing Graphs in Three Dimensions. - Seok-Hee Hong 001 (GD, 2005)

Network Analysis and Visualisation . - Seok-Hee Hong 001 (GD, 2005)

Hierarchical Layouts of Directed Graphs in Three Dimensions. - Seok-Hee Hong 001; Nikola S. Nikolov (GD, 2005)

Layout Effects on Sociogram Perception. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (GD, 2005)

A Framework for Visualising Large Graphs. - Wanchun Li; Seok-Hee Hong 001; Peter Eades (IV, 2005)

Visualisation and Analysis of Large and Complex Scale-free Networks. - Adel Ahmed; Tim Dwyer; Seok-Hee Hong 001; Colin Murray; Le Song; Ying Xin Wu (EuroVis, 2005)

Navigating Software Architectures with Constant Visual Complexity. - Wanchun Li; Peter Eades; Seok-Hee Hong 001 (VL/HCC, 2005)

Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs. - Seok-Hee Hong 001; Peter Eades (Algorithmica, 2005)

Crossing Minimization for Symmetries. - Christoph Buchheim; Seok-Hee Hong 001 (Theory Comput. Syst., 2005)

Information Display. - Peter Eades; Seok-Hee Hong 001; Keith Nesbitt; Masahiro Takatsuka (Handbook of Nature-Inspired and Innovative Computing, 2006)

PathBank: Web-Based Querying and Visualziation of an Integrated Biological Pathway Database. - Joshua Wing Kei Ho; Tristan Manwaring; Seok-Hee Hong 001; Uwe Röhm; David Cho Yau Fung; Kai Xu 003; Tim Kraska; David Hart (CGIV, 2006)

Visual analysis of network centralities. - Tim Dwyer; Seok-Hee Hong 001; Dirk Koschützki; Falk Schreiber; Kai Xu 003 (APVIS, 2006)

How people read sociograms: a questionnaire study. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (APVIS, 2006)

Predicting graph reading performance: a cognitive approach. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (APVIS, 2006)

Convex Drawings of Graphs with Non-convex Boundary. - Seok-Hee Hong 001; Hiroshi Nagamochi (WG, 2006)

Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. - Seok-Hee Hong 001; Peter Eades (Algorithmica, 2006)

A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. - Seok-Hee Hong 001; Brendan D. McKay; Peter Eades (Discret. Comput. Geom., 2006)

Preface. - Seok-Hee Hong 001; Hsu-Chun Yen (Int. J. Found. Comput. Sci., 2006)

Automatic visualisation of metro maps. - Seok-Hee Hong 001; Damian Merrick; Hugo A. D. do Nascimento (J. Vis. Lang. Comput., 2006)

Visualisation and analysis of the internet movie database. - Adel Ahmed; Vladimir Batagelj; Xiaoyan Fu; Seok-Hee Hong 001; Damian Merrick; Andrej Mrvar (APVIS, 2007)

Navigation techniques for 2.5D graph layout. - Adel Ahmed; Seok-Hee Hong 001 (APVIS, 2007)

Visualization and analysis of email networks. - Xiaoyan Fu; Seok-Hee Hong 001; Nikola S. Nikolov; Xiaobin Shen 001; Yingxin Wu 001; Kai Xu 003 (APVIS, 2007)

GraphScape: integrated multivariate network visualization. - Kai Xu 003; Andrew Cunningham; Seok-Hee Hong 001; Bruce H. Thomas (APVIS, 2007)

Colored Simultaneous Geometric Embeddings. - Ulrik Brandes; Cesim Erten; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; Antonios Symvonis (COCOON, 2007)

Visual Analysis of Dynamic Networks with Geological Clustering. - Adel Ahmed; Xiaoyan Fu; Seok-Hee Hong 001; Quan Hoang Nguyen 001; Kai Xu 003 (IEEE VAST, 2007)

Intrusive and Non-intrusive Evaluation of Ambient Displays. - Xiaobin Shen 001; Peter Eades; Seok-Hee Hong 001; Andrew Vande Moere (Ambient Information Systems, 2007)

Geometric automorphism groups of graphs. - David Abelson; Seok-Hee Hong 001; Donald E. Taylor (Discret. Appl. Math., 2007)

A 2.5D Hierarchical Drawing of Directed Graphs. - Seok-Hee Hong 001; Nikola S. Nikolov; Alexandre Tarassov (J. Graph Algorithms Appl., 2007)

Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (J. Graph Algorithms Appl., 2007)

Effects of Crossing Angles. - Weidong Huang 001; Seok-Hee Hong 001; Peter Eades (PacificVis, 2008)

Beyond time and error: a cognitive approach to the evaluation of graph drawings. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001 (BELIV, 2008)

The long-term evaluation of Fisherman in a partial-attention environment. - Xiaobin Shen 001; Andrew Vande Moere; Peter Eades; Seok-Hee Hong 001 (BELIV, 2008)

Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. - Seok-Hee Hong 001; Hiroshi Nagamochi (COCOON, 2008)

Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints. - Seok-Hee Hong 001; Martin Mader (GD, 2008)

Removing Node Overlaps Using Multi-sphere Scheme. - Takashi Imamichi; Yohei Arahori; Jaeseong Gim; Seok-Hee Hong 001; Hiroshi Nagamochi (GD, 2008)

Locally Delaunay Realizability of Regular Series-Parallel Graphs. - Luca Grilli 001; Seok-Hee Hong 001; Antonios Symvonis; Camille Wormser (ICCSA Workshops, 2008)

Approximating Crossing Minimization in Radial Layouts. - Seok-Hee Hong 001; Hiroshi Nagamochi (LATIN, 2008)

Testing Planarity of Geometric Automorphisms in Linear Time. - Christoph Buchheim; Seok-Hee Hong 001 (Algorithmica, 2008)

Convex drawings of graphs with non-convex boundary constraints. - Seok-Hee Hong 001; Hiroshi Nagamochi (Discret. Appl. Math., 2008)

Guest Editor's Foreword. - Seok-Hee Hong 001 (J. Graph Algorithms Appl., 2008)

2.5D Visualisation of Overlapping Biological Networks. - David Cho Yau Fung; Seok-Hee Hong 001; Dirk Koschützki; Falk Schreiber; Kai Xu 003 (J. Integr. Bioinform., 2008)

A graph reading behavior: Geodesic-path tendency. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001 (PacificVis, 2009)

On Rectilinear Drawing of Graphs. - Peter Eades; Seok-Hee Hong 001; Sheung-Hung Poon (GD, 2009)

Semi-bipartite Graph Visualization for Gene Ontology Networks. - Kai Xu 003; Rohan Williams; Seok-Hee Hong 001; Qing Liu 001; Ji Zhang 001 (GD, 2009)

Upward Star-Shaped Polyhedral Graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (ISAAC, 2009)

Visual Analysis of Overlapping Biological Networks. - David Cho Yau Fung; Seok-Hee Hong 001; Dirk Koschützki; Falk Schreiber; Kai Xu 003 (IV, 2009)

Bipartite Graph Representation of Multiple Decision Table Classifiers. - Kazuya Haraguchi; Seok-Hee Hong 001; Hiroshi Nagamochi (SAGA, 2009)

Visual Analysis of History of World Cup: A Dynamic Network with Dynamic Hierarchy and Geographic Clustering. - Adel Ahmed; Xiaoyan Fu; Seok-Hee Hong 001; Quan Hoang Nguyen 001; Kai Xu 003 (VINCI, 2009)

Issues for the Evaluation of Ambient Displays. - Xiaobin Shen 001; Andrew Vande Moere; Peter Eades; Seok-Hee Hong 001 (Int. J. Ambient Comput. Intell., 2009)

Measuring effectiveness of graph visualizations: A cognitive load perspective. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001 (Inf. Vis., 2009)

New Approximation to the One-sided Radial Crossing Minimization. - Seok-Hee Hong 001; Hiroshi Nagamochi (J. Graph Algorithms Appl., 2009)

Guest Editors' Foreword. - Seok-Hee Hong 001; Takao Nishizeki (J. Graph Algorithms Appl., 2009)

Large Crossing Angles in Circular Layouts. - Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001; Weidong Huang 001 (GD, 2010)

Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. - Kazuya Haraguchi; Seok-Hee Hong 001; Hiroshi Nagamochi (LION, 2010)

Improving Force-Directed Graph Drawings by Making Compromises Between Aesthetics. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001; Chun-Cheng Lin (VL/HCC, 2010)

A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2010)

Approximation Algorithms for Minimizing Edge Crossings in Radial Drawings. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2010)

Matched drawability of graph pairs and of graph triples. - Luca Grilli 001; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2010)

An algorithm for constructing star-shaped drawings of plane graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (Comput. Geom., 2010)

A Force-Directed Method for Large Crossing Angle Graph Drawing - Peter Eades; Weidong Huang 001; Seok-Hee Hong 001 (CoRR, 2010)

Crossing minimization in extended level drawings of graphs. - Christian Bachmaier; Hedi Buchner; Michael Forster; Seok-Hee Hong 001 (Discret. Appl. Math., 2010)

Convex drawings of hierarchical planar graphs and clustered planar graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (J. Discrete Algorithms, 2010)

Kozo Sugiyama 1945 - 2011. - Peter Eades; Seok-Hee Hong 001; Kazuo Misue (GD, 2011)

TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. - Quan Hoang Nguyen 001; Seok-Hee Hong 001; Peter Eades (GD, 2011)

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. - Patrizio Angelini; Giuseppe Di Battista; Walter Didimo; Fabrizio Frati; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Anna Lubiw (EGC, 2011)

Colored Simultaneous Geometric Embeddings and Universal Pointsets. - Ulrik Brandes; Cesim Erten; Alejandro Estrella-Balderrama; J. Joseph Fowler; Fabrizio Frati; Markus Geyer; Carsten Gutwenger; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Petra Mutzel; et al. (Algorithmica, 2011)

Editorial: ISAAC 2008 Special Issue. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2011)

Extending Steinitz's Theorem to Upward Star-Shaped Polyhedra and Spherical Polyhedra. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2011)

Guest Editors' Foreword. - Seok-Hee Hong 001; Hiroshi Nagamochi (Int. J. Comput. Geom. Appl., 2011)

How to Draw a Graph, Revisited. - Peter Eades; Seok-Hee Hong 001 (Expanding the Frontiers of Visual Analytics and Visualization, 2012)

Fáry's Theorem for 1-Planar Graphs. - Seok-Hee Hong 001; Peter Eades; Giuseppe Liotta; Sheung-Hung Poon (COCOON, 2012)

Theory and Practice of Graph Drawing. - Tim Dwyer; Fabrizio Frati; Seok-Hee Hong 001; Karsten Klein 001 (GD, 2012)

Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract). - Peter Eades; Seok-Hee Hong 001; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (GD, 2012)

StreamEB: Stream Edge Bundling. - Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001 (GD, 2012)

On the Faithfulness of Graph Visualizations. - Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001 (GD, 2012)

Visualizing dynamic trajectories in social networks. - Hui Liu; Peter Eades; Seok-Hee Hong 001 (VL/HCC, 2012)

A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners. - Seok-Hee Hong 001; Hiroshi Nagamochi (Algorithmica, 2012)

Bounds on the crossing resolution of complete geometric graphs. - Emilio Di Giacomo; Walter Didimo; Peter Eades; Seok-Hee Hong 001; Giuseppe Liotta (Discret. Appl. Math., 2012)

Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints. - Seok-Hee Hong 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2012)

Circular Graph Drawings with Large Crossing Angles. - Hooman Reisi Dehkordi; Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001 (WALCOM, 2013)

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. - Peter Eades; Seok-Hee Hong 001; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (Theor. Comput. Sci., 2013)

Improving multiple aesthetics produces better graph drawings. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001; Chun-Cheng Lin (J. Vis. Lang. Comput., 2013)

Symmetric Graph Drawing. - Peter Eades; Seok-Hee Hong 001 (Handbook of Graph Drawing and Visualization, 2013)

A framework for visual analytics of massive complex networks. - Seok-Hee Hong 001; Weidong Huang 001; Kazuo Misue; Wu Quan (BigComp, 2014)

Anchored Drawings of Planar Graphs. - Patrizio Angelini; Giordano Da Lozzo; Marco Di Bartolomeo; Giuseppe Di Battista; Seok-Hee Hong 001; Maurizio Patrignani; Vincenzo Roselli (GD, 2014)

GION: Interactively Untangling Large Graphs on Wall-Sized Displays. - Michael R. Marner; Ross T. Smith; Bruce H. Thomas; Karsten Klein 001; Peter Eades; Seok-Hee Hong 001 (GD, 2014)

Order-preserving matching. - Jinil Kim; Peter Eades; Rudolf Fleischer; Seok-Hee Hong 001; Costas S. Iliopoulos; Kunsoo Park; Simon J. Puglisi; Takeshi Tokuyama (Theor. Comput. Sci., 2014)

Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium. - Sheelagh Carpendale; Wei Chen 001; Seok-Hee Hong 001 (IEEE Trans. Vis. Comput. Graph., 2014)

Larger crossing angles make graphs easier to read. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001 (J. Vis. Lang. Comput., 2014)

MultiStory: Visual analytics of dynamic multi-relational networks. - Amyra Meidiana; Seok-Hee Hong 001 (PacificVis, 2015)

Low ply graph drawing. - Emilio Di Giacomo; Walter Didimo; Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Kazuo Misue; Antonios Symvonis; Hsu-Chun Yen (IISA, 2015)

Top computational visualization R&D problems 2015: panel. - Issei Fujishiro; Bing-Yu Chen 004; Wei Chen 001; Seok-Hee Hong 001; Takayuki Itoh; Koji Koyamada; Kenji Ono; Jorji Nonaka (SIGGRAPH Asia Visualization in High Performance Computing, 2015)

Straight-Line Drawability of a Planar Graph Plus an Edge. - Peter Eades; Seok-Hee Hong 001; Giuseppe Liotta; Naoki Katoh; Sheung-Hung Poon (WADS, 2015)

Testing Full Outer-2-planarity in Linear Time. - Seok-Hee Hong 001; Hiroshi Nagamochi (WG, 2015)

A Linear-Time Algorithm for Testing Outer-1-Planarity. - Seok-Hee Hong 001; Peter Eades; Naoki Katoh; Giuseppe Liotta; Pascal Schweitzer; Yusuke Suzuki (Algorithmica, 2015)

Many-to-One Boundary Labeling with Backbones. - Michael A. Bekos; Sabine Cornelsen; Martin Fink 001; Seok-Hee Hong 001; Michael Kaufmann 001; Martin Nöllenburg; Ignaz Rutter; Antonios Symvonis (J. Graph Algorithms Appl., 2015)

Big Data Visual Analytics (NII Shonan Meeting 2015-17). - Seok-Hee Hong 001; Koji Koyamada; Kwan-Liu Ma (NII Shonan Meet. Rep., 2015)

Effects of curves on graph perception. - Weidong Huang 001; Peter Eades; Seok-Hee Hong 001; Henry Been-Lirn Duh (PacificVis, 2016)

Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. - Seok-Hee Hong 001; Hiroshi Nagamochi (GD, 2016)

On the edge crossing properties of Euclidean minimum weight Laman graphs. - Sergey Bereg; Seok-Hee Hong 001; Naoki Katoh; Sheung-Hung Poon; Shin-ichi Tanigawa (Comput. Geom., 2016)

Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452). - Seok-Hee Hong 001; Michael Kaufmann 001; Stephen G. Kobourov; János Pach (Dagstuhl Reports, 2016)

Algoritihmcs for Beyond Planar Graphs (NII Shonan Meeting 2016-17). - Seok-Hee Hong 001; Takeshi Tokuyama (NII Shonan Meet. Rep., 2016)

Circular right-angle crossing drawings in linear time. - Hooman Reisi Dehkordi; Peter Eades; Seok-Hee Hong 001; Quan Hoang Nguyen 001 (Theor. Comput. Sci., 2016)

Symmetric Graph Drawing. - Seokhee Hong 001 (Encyclopedia of Algorithms, 2016)

k-core based multi-level graph visualization for scale-free networks. - An Nguyen 001; Seok-Hee Hong 001 (PacificVis, 2017)

dNNG: Quality metrics and layout for neighbourhood faithfulness. - Quan Hoang Nguyen 001; Seok-Hee Hong 001; Peter Eades (PacificVis, 2017)

Drawing Big Graphs Using Spectral Sparsification. - Peter Eades; Quan Hoang Nguyen 001; Seok-Hee Hong 001 (GD, 2017)

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. - Michael A. Bekos; Sabine Cornelsen; Luca Grilli 001; Seok-Hee Hong 001; Michael Kaufmann 001 (Algorithmica, 2017)

Towards Faithful Graph Visualizations. - Quan Hoang Nguyen 001; Peter Eades; Seok-Hee Hong 001 (CoRR, 2017)

Shape-Based Quality Metrics for Large Graph Visualization. - Peter Eades; Seok-Hee Hong 001; An Nguyen 001; Karsten Klein 001 (J. Graph Algorithms Appl., 2017)

Proxy Graph: Visual Quality Metrics of Big Graph Sampling. - Quan Hoang Nguyen 001; Seok-Hee Hong 001; Peter Eades; Amyra Meidiana (IEEE Trans. Vis. Comput. Graph., 2017)

Resource provisioning for memory intensive graph processing. - Agron Cela; Young Choon Lee; Seok-Hee Hong 001 (ACSW, 2018)

BC Tree-Based Proxy Graphs for Visualization of Big Graphs. - Seok-Hee Hong 001; Quan Hoang Nguyen 001; Amyra Meidiana; Jiaxi Li; Peter Eades (PacificVis, 2018)

Turning Cliques into Paths to Achieve Planarity. - Patrizio Angelini; Peter Eades; Seok-Hee Hong 001; Karsten Klein 001; Stephen G. Kobourov; Giuseppe Liotta; Alfredo Navarra; Alessandra Tappini (GD, 2018)

Editorial: Special Issue on Algorithms and Computation. - Seok-Hee Hong 001 (Algorithmica, 2018)

Gap-planar graphs. - Sang Won Bae 001; Jean-François Baffier; Jinhee Chun; Peter Eades; Kord Eickmeyer; Luca Grilli 001; Seok-Hee Hong 001; Matias Korman; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (Theor. Comput. Sci., 2018)

Simpler algorithms for testing two-page book embedding of partitioned graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2018)

Steering data quality with visual analytics: The complexity challenge. - Shixia Liu; Gennady L. Andrienko; Yingcai Wu; Nan Cao 001; Liu Jiang; Conglei Shi; Yu-Shuen Wang; Seokhee Hong 001 (Vis. Informatics, 2018)

Visualisation of Distributed Systems Simulation Made Simple. - Jayden King; Young Ki Kim; Young Choon Lee; Seok-Hee Hong 001 (CloudCom, 2019)

Spectral Vertex Sampling for Big Complex Graphs. - Jingming Hu; Seok-Hee Hong 001; Peter Eades (COMPLEX NETWORKS (2), 2019)

Multi-level Graph Drawing Using Infomap Clustering. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel; Ziyang Wang; David Chae; Sungpack Hong; Daniel Langerenken; Hassan Chafi (GD, 2019)

A Quality Metric for Visualization of Clusters in Graphs. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades; Daniel A. Keim (GD, 2019)

Topology-Based Spectral Sparsification. - Amyra Meidiana; Seok-Hee Hong 001; Jiajun Huang; Peter Eades; Kwan-Liu Ma (LDAV, 2019)

Holistic Approach for Studying Resource Failures at Scale. - Young Choon Lee; Jayden King; Seok-Hee Hong 001 (NCA, 2019)

A Quality Metric for Symmetric Graph Drawings. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades; Daniel A. Keim (CoRR, 2019)

Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092). - Seok-Hee Hong 001; Michael Kaufmann 001; János Pach; Csaba D. Tóth (Dagstuhl Reports, 2019)

A linear-time algorithm for testing full outer-2-planarity. - Seok-Hee Hong 001; Hiroshi Nagamochi (Discret. Appl. Math., 2019)

Beyond Planar Graphs: Introduction. - Seok-Hee Hong 001 (Beyond Planar Graphs, 2020)

Algorithms for 1-Planar Graphs. - Seok-Hee Hong 001 (Beyond Planar Graphs, 2020)

Dynamic Graph Map Animation. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel; Weidong Huang 001; Cristina Cifuentes (PacificVis, 2020)

Quality Metrics for Symmetric Graph Drawings. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades; Daniel A. Keim (PacificVis, 2020)

Path-Monotonic Upward Drawings of Graphs. - Seok-Hee Hong 001; Hiroshi Nagamochi (COCOON, 2020)

Connectivity-Based Spectral Sampling for Big Complex Network Visualization. - Jingming Hu; Seok-Hee Hong 001; Jialu Chen; Marnijati Torkel; Peter Eades; Kwan-Liu Ma (COMPLEX NETWORKS (1), 2020)

New Quality Metrics for Dynamic Graph Drawing. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades (GD, 2020)

Graph sampling methods for big complex networks integrating centrality, k-core, and spectral sparsification. - Seok-Hee Hong 001; Shan Lu (SAC, 2020)

Robust Scheduling for Large-Scale Distributed Systems. - Young Choon Lee; Jayden King; Young Ki Kim; Seok-Hee Hong 001 (TrustCom, 2020)

Graph Planarity by Replacing Cliques with Paths. - Patrizio Angelini; Peter Eades; Seok-Hee Hong 001; Karsten Klein 001; Stephen G. Kobourov; Giuseppe Liotta; Alfredo Navarra; Alessandra Tappini (Algorithms, 2020)

Sublinear Time Force Computation for Big Complex Network Visualization. - Amyra Meidiana; Seok-Hee Hong 001; Marnijati Torkel; Shijun Cai; Peter Eades (Comput. Graph. Forum, 2020)

Colored anchored visibility representations in 2D and 3D space. - Carla Binucci; Emilio Di Giacomo; Seok-Hee Hong 001; Giuseppe Liotta; Henk Meijer; Vera Sacristán; Stephen K. Wismath (Comput. Geom., 2020)

IDAR: Fast Supergraph Search Using DAG Integration. - Hyunjoon Kim; Seunghwan Min; Kunsoo Park; Xuemin Lin 001; Seok-Hee Hong 001; Wook-Shin Han (Proc. VLDB Endow., 2020)

A Machine Learning Approach for Predicting Human Preference for Graph Layouts*. - Shijun Cai; Seok-Hee Hong 001; Jialiang Shen; Tongliang Liu (PacificVis, 2021)

GDot: Drawing Graphs with Dots and Circles. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel (PacificVis, 2021)

Louvain-based Multi-level Graph Drawing. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel; James Wood; Kunsoo Park (PacificVis, 2021)

Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing. - Amyra Meidiana; Seok-Hee Hong 001; Shijun Cai; Marnijati Torkel; Peter Eades (PacificVis, 2021)

Sublinear-time Algorithms for Stress Minimization in Graph Drawing. - Amyra Meidiana; James Wood; Seok-Hee Hong 001 (PacificVis, 2021)

Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. - Hyunjoon Kim; Yunyoung Choi; Kunsoo Park; Xuemin Lin 001; Seok-Hee Hong 001; Wook-Shin Han (SIGMOD Conference, 2021)

BC tree-based spectral sampling for big complex network visualization. - Jingming Hu; Tuan Tran Chu; Seok-Hee Hong 001; Jialu Chen; Amyra Meidiana; Marnijati Torkel; Peter Eades; Kwan-Liu Ma (Appl. Netw. Sci., 2021)

Packing Trees into 1-planar Graphs. - Felice De Luca; Emilio Di Giacomo; Seok-Hee Hong 001; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; Henk Meijer; Alessandra Tappini; Stephen K. Wismath (J. Graph Algorithms Appl., 2021)

Re-embedding a 1-plane graph for a straight-line drawing in linear time. - Seok-Hee Hong 001; Hiroshi Nagamochi (Theor. Comput. Sci., 2021)

dGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization. - Seok-Hee Hong 001; Amyra Meidiana; James Wood; Juan Pablo Ataides; Peter Eades; Kunsoo Park (PacificVis, 2022)

Train Me to Fight: Machine-Learning Based On-Device Malware Detection for Mobile Devices. - Amirmohammad Pasdar; Young Choon Lee; Tongliang Liu; Seok-Hee Hong 001 (CCGRID, 2022)

Shape-Faithful Graph Drawings. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades (GD, 2022)

MAPS: a dataset for semantic profiling and analysis of Android applications. - Amirmohammad Pasdar; Young Choon Lee; Seok-Hee Hong 001; Tongliang Liu (MobiArch, 2022)

DNC: Dynamic Neighborhood Change Faithfulness Metrics. - Shijun Cai; Amyra Meidiana; Seok-Hee Hong 001 (EuroVis (Short Papers), 2022)

GDot-i: Interactive System for Dot Paintings of Graphs. - Peter Eades; Seok-Hee Hong 001; Martin McGrane; Amyra Meidiana (EuroVis (Posters), 2022)

DSS: Drawing Dynamic Graphs with Spectral Sparsification. - Amyra Meidiana; Seok-Hee Hong 001; Yanyi Pu; Justin Lee; Peter Eades; Jinwook Seo (EuroVis (Short Papers), 2022)

Mask Off: Analytic-based Malware Detection By Transfer Learning and Model Personalization. - Amirmohammad Pasdar; Young Choon Lee; Seok-Hee Hong 001 (CoRR, 2022)

A Machine Learning Approach for Predicting Human Preference for Graph Layouts. - Shijun Cai; Seok-Hee Hong 001; Jialiang Shen; Tongliang Liu (J. Graph Algorithms Appl., 2022)

Guest Editors' Foreword. - Seok-Hee Hong 001; Subhas C. Nandy; Ryuhei Uehara (J. Graph Algorithms Appl., 2022)

A machine learning approach for predicting human shortest path task performance. - Shijun Cai; Seok-Hee Hong 001; Xiaobo Xia; Tongliang Liu; Weidong Huang 001 (Vis. Informatics, 2022)

New Seeding Strategies for the Influence Maximization Problem. - Seok-Hee Hong 001; Juan Pablo Bonilla Ataides; Rowena Kok; Amyra Meidiana; Kunsoo Park (COMPLEX NETWORKS (2), 2023)

Min-k-planar Drawings of Graphs. - Carla Binucci; Aaron Büngener; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (GD (1), 2023)

Catch the Intruder: Collaborative and Personalized Malware Detection By On-Device Application Fingerprinting. - Amirmohammad Pasdar; Young Choon Lee; Seok-Hee Hong 001 (ICWS, 2023)

Faithful Graph Drawing (Invited Talk). - Seok-Hee Hong 001 (ISAAC, 2023)

Nonplanar Graph Drawings with k Vertices per Face. - Carla Binucci; Giuseppe Di Battista; Walter Didimo; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (WG, 2023)

Optimizing graph layout by t-SNE perplexity estimation. - Chun Xiao; Seokhee Hong 001; Weidong Huang 001 (Int. J. Data Sci. Anal., 2023)

Fast subgraph query processing and subgraph matching via static and dynamic equivalences. - Hyunjoon Kim; Yunyoung Choi; Kunsoo Park; Xuemin Lin 001; Seok-Hee Hong 001; Wook-Shin Han (VLDB J., 2023)

Drawing Simultaneously Embedded Graphs with Few Bends. - Luca Grilli 001; Seok-Hee Hong 001; Jan Kratochvíl; Ignaz Rutter (Int. J. Found. Comput. Sci., 2023)

Introducing Fairness in Graph Visualization (Poster Abstract). - Seok-Hee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli (GD, 2024)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter; Alexander Wolff 001 (GD, 2024)

GraphTrials: Visual Proofs of Graph Properties. - Henry Förster; Felix Klesen; Tim Dwyer; Peter Eades; Seok-Hee Hong 001; Stephen G. Kobourov; Giuseppe Liotta; Kazuo Misue; Fabrizio Montecchiani; Alexander Pastukhov; Falk Schreiber (GD, 2024)

Connectivity-Faithful Graph Drawing. - Amyra Meidiana; Seok-Hee Hong 001; Yongcheng Jing (GD, 2024)

Introducing Fairness in Graph Visualization via Gradient Descent. - Seok-Hee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli (MLVis@EuroVis, 2024)

Deep Graph Mating. - Yongcheng Jing; Seok-Hee Hong 001; Dacheng Tao (NeurIPS, 2024)

Cluster-Faithful Graph Visualization: New Metrics and Algorithms. - Shijun Cai; Seok-Hee Hong 001; Amyra Meidiana; Peter Eades; Daniel A. Keim (PacificVis, 2024)

β-skeleton Shape-based Metrics for Large and Complex Graph Drawings. - Seok-Hee Hong 001; Patrick Eades (PacificVis, 2024)

Graphs Drawn With Some Vertices per Face: Density and Relationships. - Carla Binucci; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (IEEE Access, 2024)

Wooly Graphs : A Mathematical Framework For Knitting. - Kathryn Gray; Brian Bell; Diana Sieper; Stephen G. Kobourov; Falk Schreiber; Karsten Klein 001; Seokhee Hong 001 (CoRR, 2024)

Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062). - Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; János Pach; Henry Förster (Dagstuhl Reports, 2024)

Min-k-planar Drawings of Graphs. - Carla Binucci; Aaron Büngener; Giuseppe Di Battista; Walter Didimo; Vida Dujmovic; Seok-Hee Hong 001; Michael Kaufmann 001; Giuseppe Liotta; Pat Morin; Alessandra Tappini (J. Graph Algorithms Appl., 2024)

SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing. - Amyra Meidiana; Seok-Hee Hong 001; Shijun Cai; Marnijati Torkel; Peter Eades (IEEE Trans. Vis. Comput. Graph., 2024)

Automorphism Faithfulness Metrics for Symmetric Graph Drawings. - Amyra Meidiana; Seok-Hee Hong 001; Peter Eades; Daniel A. Keim (IEEE Trans. Vis. Comput. Graph., 2024)

dcGG, dcRNG: New Degree-Constrained Shape-Based Faithfulness Metrics. - Michael Fang; Harshitha Balakumar; Seok-Hee Hong 001; Amyra Meidiana (PacificVis, 2025)

New Quality Metrics for Connectivity-faithful Sampling and Drawing of Dynamic Graphs. - Amyra Meidiana; Seok-Hee Hong 001; Yongcheng Jing (PacificVis, 2025)

The Price of Upwardness. - Patrizio Angelini; Therese Biedl; Markus Chimani; Sabine Cornelsen; Giordano Da Lozzo; Seok-Hee Hong 001; Giuseppe Liotta; Maurizio Patrignani; Sergey Pupyrev; Ignaz Rutter (Discret. Math. Theor. Comput. Sci., 2025)

Introducing fairness in network visualization. - Peter Eades; Seokhee Hong 001; Giuseppe Liotta; Fabrizio Montecchiani; Martin Nöllenburg; Tommaso Piselli; Stephen K. Wismath (Inf. Sci., 2025)