default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeok-Hee Hong 0001
Seokhee Hong 0001
Person information
- affiliation: University of Sydney, School of Information Technologies, Australia
Other persons with the same name
- Seok-Hee Hong (aka: Seok Hee Hong, Seokhee Hong) — disambiguation page
- Seokhee Hong 0002 (aka: Seok-Hee Hong 0002) — Seoul National University, Department of Computer Science and Engineering, Seoul, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j71]Peter Eades
, Seokhee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli, Stephen K. Wismath:
Introducing fairness in network visualization. Inf. Sci. 691: 121642 (2025)- 2024
- [j70]Carla Binucci, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12: 68828-68846 (2024) - [j69]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. J. Graph Algorithms Appl. 28(2): 1-35 (2024) - [j68]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
Automorphism Faithfulness Metrics for Symmetric Graph Drawings. IEEE Trans. Vis. Comput. Graph. 30(7): 3241-3255 (2024) - [j67]Amyra Meidiana, Seok-Hee Hong, Shijun Cai, Marnijati Torkel, Peter Eades:
SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing. IEEE Trans. Vis. Comput. Graph. 30(7): 3386-3399 (2024) - [c134]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [c133]Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber:
GraphTrials: Visual Proofs of Graph Properties. GD 2024: 16:1-16:18 - [c132]Amyra Meidiana, Seok-Hee Hong, Yongcheng Jing:
Connectivity-Faithful Graph Drawing. GD 2024: 17:1-17:17 - [c131]Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli:
Introducing Fairness in Graph Visualization (Poster Abstract). GD 2024: 49:1-49:3 - [c130]Seok-Hee Hong, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Tommaso Piselli:
Introducing Fairness in Graph Visualization via Gradient Descent. MLVis@EuroVis 2024 - [c129]Yongcheng Jing, Seok-Hee Hong, Dacheng Tao:
Deep Graph Mating. NeurIPS 2024 - [c128]Shijun Cai, Seok-Hee Hong, Amyra Meidiana, Peter Eades, Daniel A. Keim:
Cluster-Faithful Graph Visualization: New Metrics and Algorithms. PacificVis 2024: 192-201 - [c127]Seok-Hee Hong, Patrick Eades:
β-skeleton Shape-based Metrics for Large and Complex Graph Drawings. PacificVis 2024: 277-282 - [i27]Kathryn Gray, Brian Bell, Diana Sieper, Stephen G. Kobourov, Falk Schreiber, Karsten Klein, Seokhee Hong:
Wooly Graphs : A Mathematical Framework For Knitting. CoRR abs/2407.00511 (2024) - [i26]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - [i25]Henry Förster, Felix Klesen, Tim Dwyer, Peter Eades, Seok-Hee Hong, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Fabrizio Montecchiani, Alexander Pastukhov, Falk Schreiber:
GraphTrials: Visual Proofs of Graph Properties. CoRR abs/2409.02907 (2024) - [i24]Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster:
Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062). Dagstuhl Reports 14(2): 71-94 (2024) - 2023
- [j66]Chun Xiao, Seokhee Hong, Weidong Huang:
Optimizing graph layout by t-SNE perplexity estimation. Int. J. Data Sci. Anal. 15(2): 159-171 (2023) - [j65]Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. Int. J. Found. Comput. Sci. 34(7): 807-824 (2023) - [j64]Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han:
Fast subgraph query processing and subgraph matching via static and dynamic equivalences. VLDB J. 32(2): 343-368 (2023) - [c126]Seok-Hee Hong, Juan Pablo Bonilla Ataides, Rowena Kok, Amyra Meidiana, Kunsoo Park:
New Seeding Strategies for the Influence Maximization Problem. COMPLEX NETWORKS (2) 2023: 289-299 - [c125]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52 - [c124]Amirmohammad Pasdar, Young Choon Lee, Seok-Hee Hong:
Catch the Intruder: Collaborative and Personalized Malware Detection By On-Device Application Fingerprinting. ICWS 2023: 595-604 - [c123]Seok-Hee Hong:
Faithful Graph Drawing (Invited Talk). ISAAC 2023: 2:1-2:1 - [c122]Carla Binucci, Giuseppe Di Battista, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Nonplanar Graph Drawings with k Vertices per Face. WG 2023: 86-100 - [i23]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. CoRR abs/2308.13401 (2023) - 2022
- [j63]Shijun Cai, Seok-Hee Hong, Jialiang Shen, Tongliang Liu:
A Machine Learning Approach for Predicting Human Preference for Graph Layouts. J. Graph Algorithms Appl. 26(1): 447-471 (2022) - [j62]Seok-Hee Hong, Subhas C. Nandy, Ryuhei Uehara:
Guest Editors' Foreword. J. Graph Algorithms Appl. 26(2): 207-208 (2022) - [j61]Shijun Cai, Seok-Hee Hong, Xiaobo Xia, Tongliang Liu, Weidong Huang:
A machine learning approach for predicting human shortest path task performance. Vis. Informatics 6(2): 50-61 (2022) - [c121]Seok-Hee Hong, Amyra Meidiana, James Wood, Juan Pablo Ataides, Peter Eades, Kunsoo Park:
dGG, dRNG, DSC: New Degree-based Shape-based Faithfulness Metrics for Large and Complex Graph Visualization. PacificVis 2022: 51-60 - [c120]Amirmohammad Pasdar, Young Choon Lee, Tongliang Liu, Seok-Hee Hong:
Train Me to Fight: Machine-Learning Based On-Device Malware Detection for Mobile Devices. CCGRID 2022: 239-248 - [c119]Amyra Meidiana, Seok-Hee Hong, Peter Eades:
Shape-Faithful Graph Drawings. GD 2022: 93-108 - [c118]Amirmohammad Pasdar, Young Choon Lee, Seok-Hee Hong, Tongliang Liu:
MAPS: a dataset for semantic profiling and analysis of Android applications. MobiArch 2022: 13-18 - [c117]Peter Eades, Seok-Hee Hong, Martin McGrane, Amyra Meidiana:
GDot-i: Interactive System for Dot Paintings of Graphs. EuroVis (Posters) 2022: 5-6 - [c116]Shijun Cai, Amyra Meidiana, Seok-Hee Hong:
DNC: Dynamic Neighborhood Change Faithfulness Metrics. EuroVis (Short Papers) 2022: 49-53 - [c115]Amyra Meidiana, Seok-Hee Hong, Yanyi Pu, Justin Lee, Peter Eades, Jinwook Seo:
DSS: Drawing Dynamic Graphs with Spectral Sparsification. EuroVis (Short Papers) 2022: 55-59 - [i22]Amyra Meidiana, Seok-Hee Hong, Peter Eades:
Shape-Faithful Graph Drawings. CoRR abs/2208.14095 (2022) - [i21]Amirmohammad Pasdar, Young Choon Lee, Seok-Hee Hong:
Mask Off: Analytic-based Malware Detection By Transfer Learning and Model Personalization. CoRR abs/2211.10843 (2022) - 2021
- [j60]Jingming Hu, Tuan Tran Chu, Seok-Hee Hong, Jialu Chen, Amyra Meidiana, Marnijati Torkel, Peter Eades, Kwan-Liu Ma:
BC tree-based spectral sampling for big complex network visualization. Appl. Netw. Sci. 6(1): 60 (2021) - [j59]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 605-624 (2021) - [j58]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-plane graph for a straight-line drawing in linear time. Theor. Comput. Sci. 892: 132-154 (2021) - [c114]Shijun Cai, Seok-Hee Hong, Jialiang Shen, Tongliang Liu:
A Machine Learning Approach for Predicting Human Preference for Graph Layouts*. PacificVis 2021: 6-10 - [c113]Amyra Meidiana, Seok-Hee Hong, Shijun Cai, Marnijati Torkel, Peter Eades:
Sublinear-Time Attraction Force Computation for Large Complex Graph Drawing. PacificVis 2021: 146-150 - [c112]Seok-Hee Hong, Peter Eades, Marnijati Torkel, James Wood, Kunsoo Park:
Louvain-based Multi-level Graph Drawing. PacificVis 2021: 151-155 - [c111]Seok-Hee Hong, Peter Eades, Marnijati Torkel:
GDot: Drawing Graphs with Dots and Circles. PacificVis 2021: 156-165 - [c110]Amyra Meidiana, James Wood, Seok-Hee Hong:
Sublinear-time Algorithms for Stress Minimization in Graph Drawing. PacificVis 2021: 166-175 - [c109]Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han:
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. SIGMOD Conference 2021: 925-937 - [e8]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 [contents] - [i20]Shijun Cai, Seok-Hee Hong, Jialiang Shen, Tongliang Liu:
A Machine Learning Approach for Predicting Human Preference for Graph Layouts. CoRR abs/2103.03665 (2021) - 2020
- [j57]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 (2020) - [j56]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 (2020) - [j55]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 (2020) - [j54]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 (2020) - [c108]Seok-Hee Hong, Peter Eades, Marnijati Torkel, Weidong Huang, Cristina Cifuentes:
Dynamic Graph Map Animation. PacificVis 2020: 1-6 - [c107]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
Quality Metrics for Symmetric Graph Drawings. PacificVis 2020: 11-15 - [c106]Seok-Hee Hong, Hiroshi Nagamochi:
Path-Monotonic Upward Drawings of Graphs. COCOON 2020: 110-122 - [c105]Jingming Hu, Seok-Hee Hong, Jialu Chen, Marnijati Torkel, Peter Eades, Kwan-Liu Ma:
Connectivity-Based Spectral Sampling for Big Complex Network Visualization. COMPLEX NETWORKS (1) 2020: 237-248 - [c104]Amyra Meidiana, Seok-Hee Hong, Peter Eades:
New Quality Metrics for Dynamic Graph Drawing. GD 2020: 450-465 - [c103]Seok-Hee Hong, Shan Lu:
Graph sampling methods for big complex networks integrating centrality, k-core, and spectral sparsification. SAC 2020: 1843-1851 - [c102]Young Choon Lee, Jayden King, Young Ki Kim, Seok-Hee Hong:
Robust Scheduling for Large-Scale Distributed Systems. TrustCom 2020: 38-45 - [c101]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-Planar Graphs. WALCOM 2020: 81-93 - [p4]Seok-Hee Hong:
Beyond Planar Graphs: Introduction. Beyond Planar Graphs 2020: 1-9 - [p3]Seok-Hee Hong:
Algorithms for 1-Planar Graphs. Beyond Planar Graphs 2020: 69-87 - [e7]Seok-Hee Hong, Takeshi Tokuyama:
Beyond Planar Graphs, Communications of NII Shonan Meetings. Springer 2020, ISBN 978-981-15-6532-8 [contents] - [i19]Amyra Meidiana, Seok-Hee Hong, Peter Eades:
New Quality Metrics for Dynamic Graph Drawing. CoRR abs/2008.07764 (2020)
2010 – 2019
- 2019
- [j53]Seok-Hee Hong, Hiroshi Nagamochi:
A linear-time algorithm for testing full outer-2-planarity. Discret. Appl. Math. 255: 234-257 (2019) - [c100]Jayden King, Young Ki Kim, Young Choon Lee, Seok-Hee Hong:
Visualisation of Distributed Systems Simulation Made Simple. CloudCom 2019: 309-312 - [c99]Jingming Hu, Seok-Hee Hong, Peter Eades:
Spectral Vertex Sampling for Big Complex Graphs. COMPLEX NETWORKS (2) 2019: 216-227 - [c98]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
A Quality Metric for Visualization of Clusters in Graphs. GD 2019: 125-138 - [c97]Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi:
Multi-level Graph Drawing Using Infomap Clustering. GD 2019: 139-146 - [c96]Amyra Meidiana, Seok-Hee Hong, Jiajun Huang, Peter Eades, Kwan-Liu Ma:
Topology-Based Spectral Sparsification. LDAV 2019: 73-82 - [c95]Young Choon Lee, Jayden King, Seok-Hee Hong:
Holistic Approach for Studying Resource Failures at Scale. NCA 2019: 1-4 - [i18]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
A Quality Metric for Visualization of Clusters in Graphs. CoRR abs/1908.07792 (2019) - [i17]Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi:
Multi-level Graph Drawing using Infomap Clustering. CoRR abs/1908.08151 (2019) - [i16]Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
A Quality Metric for Symmetric Graph Drawings. CoRR abs/1910.04974 (2019) - [i15]Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, Henk Meijer, Alessandra Tappini, Stephen K. Wismath:
Packing Trees into 1-planar Graphs. CoRR abs/1911.01761 (2019) - [i14]Seok-Hee Hong, Michael Kaufmann, János Pach, Csaba D. Tóth:
Beyond-Planar Graphs: Combinatorics, Models and Algorithms (Dagstuhl Seminar 19092). Dagstuhl Reports 9(2): 123-156 (2019) - 2018
- [j52]Seok-Hee Hong:
Editorial: Special Issue on Algorithms and Computation. Algorithmica 80(7): 2132-2133 (2018) - [j51]Seok-Hee Hong:
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 28(2): 79-80 (2018) - [j50]Seok-Hee Hong, Hiroshi Nagamochi:
Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci. 725: 79-98 (2018) - [j49]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 (2018) - [j48]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 (2018) - [c94]Agron Cela, Young Choon Lee, Seok-Hee Hong:
Resource provisioning for memory intensive graph processing. ACSW 2018: 15:1-15:7 - [c93]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 - [c92]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. GD 2018: 67-74 - [i13]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. CoRR abs/1808.08925 (2018) - 2017
- [j47]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 (2017) - [j46]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 (2017) - [j45]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 (2017) - [c91]An Nguyen, Seok-Hee Hong:
k-core based multi-level graph visualization for scale-free networks. PacificVis 2017: 21-25 - [c90]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades:
dNNG: Quality metrics and layout for neighbourhood faithfulness. PacificVis 2017: 290-294 - [c89]Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong:
Drawing Big Graphs Using Spectral Sparsification. GD 2017: 272-286 - [c88]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. GD 2017: 531-545 - [i12]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
Towards Faithful Graph Visualizations. CoRR abs/1701.00921 (2017) - [i11]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. CoRR abs/1708.07653 (2017) - [i10]Peter Eades, Quan Hoang Nguyen, Seok-Hee Hong:
Drawing Big Graphs using Spectral Sparsification. CoRR abs/1708.08659 (2017) - 2016
- [j44]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 (2016) - [j43]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 (2016) - [c87]Weidong Huang, Peter Eades, Seok-Hee Hong, Henry Been-Lirn Duh:
Effects of curves on graph perception. PacificVis 2016: 199-203 - [c86]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time. GD 2016: 321-334 - [e6]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] - [r3]Seokhee Hong:
Symmetric Graph Drawing. Encyclopedia of Algorithms 2016: 2182-2189 - [i9]Seok-Hee Hong, Hiroshi Nagamochi:
Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time. CoRR abs/1608.07662 (2016) - [i8]Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, János Pach:
Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452). Dagstuhl Reports 6(11): 35-62 (2016) - [i7]Seok-Hee Hong, Takeshi Tokuyama:
Algoritihmcs for Beyond Planar Graphs (NII Shonan Meeting 2016-17). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [j42]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 (2015) - [j41]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 (2015) - [c85]Amyra Meidiana, Seok-Hee Hong:
MultiStory: Visual analytics of dynamic multi-relational networks. PacificVis 2015: 75-79 - [c84]Peter Eades, Seok-Hee Hong, Karsten Klein, An Nguyen:
Shape-Based Quality Metrics for Large Graph Visualization. GD 2015: 502-514 - [c83]Emilio Di Giacomo, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Kazuo Misue, Antonios Symvonis, Hsu-Chun Yen:
Low ply graph drawing. IISA 2015: 1-6 - [c82]Issei Fujishiro, Bing-Yu Chen, Wei Chen, Seok-Hee Hong, Takayuki Itoh, Koji Koyamada, Kenji Ono, Jorji Nonaka:
Top computational visualization R&D problems 2015: panel. SIGGRAPH Asia Visualization in High Performance Computing 2015: 20:1-20:13 - [c81]Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon:
Straight-Line Drawability of a Planar Graph Plus an Edge. WADS 2015: 301-313 - [c80]Seok-Hee Hong, Hiroshi Nagamochi:
Testing Full Outer-2-planarity in Linear Time. WG 2015: 406-421 - [i6]Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon:
Straight-line Drawability of a Planar Graph Plus an Edge. CoRR abs/1504.06540 (2015) - [i5]Seok-Hee Hong, Koji Koyamada, Kwan-Liu Ma:
Big Data Visual Analytics (NII Shonan Meeting 2015-17). NII Shonan Meet. Rep. 2015 (2015) - 2014
- [j40]Jinil Kim, Peter Eades, Rudolf Fleischer, Seok-Hee Hong, Costas S. Iliopoulos, Kunsoo Park, Simon J. Puglisi, Takeshi Tokuyama:
Order-preserving matching. Theor. Comput. Sci. 525: 68-79 (2014) - [j39]Sheelagh Carpendale, Wei Chen, Seok-Hee Hong:
Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium. IEEE Trans. Vis. Comput. Graph. 20(8): 1085-1086 (2014) - [j38]Weidong Huang, Peter Eades, Seok-Hee Hong:
Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4): 452-465 (2014) - [c79]Seok-Hee Hong, Weidong Huang, Kazuo Misue, Wu Quan:
A framework for visual analytics of massive complex networks. BigComp 2014: 22-28 - [c78]Seok-Hee Hong, Hiroshi Nagamochi:
Simpler Algorithms for Testing Two-Page Book Embedding of Partitioned Graphs. COCOON 2014: 477-488 - [c77]Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter:
Drawing Simultaneously Embedded Graphs with Few Bends. GD 2014: 40-51 - [c76]Michael R. Marner, Ross T. Smith, Bruce H. Thomas, Karsten Klein, Peter Eades, Seok-Hee Hong:
GION: Interactively Untangling Large Graphs on Wall-Sized Displays. GD 2014: 113-124 - [c75]Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. GD 2014: 198-209 - [c74]Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo, Giuseppe Di Battista, Seok-Hee Hong, Maurizio Patrignani, Vincenzo Roselli:
Anchored Drawings of Planar Graphs. GD 2014: 404-415 - [i4]Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. CoRR abs/1409.0461 (2014) - 2013
- [j37]Peter Eades, Seok-Hee Hong, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput. Sci. 513: 65-76 (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) - [c73]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
On the faithfulness of graph visualizations. PacificVis 2013: 209-216 - [c72]Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki:
A Linear-Time Algorithm for Testing Outer-1-Planarity. GD 2013: 71-82 - [c71]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. GD 2013: 244-255 - [c70]Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. ISAAC 2013: 33-43 - [c69]Hooman Reisi Dehkordi, Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
Circular Graph Drawings with Large Crossing Angles. WALCOM 2013: 298-309 - [e5]Sheelagh Carpendale, Wei Chen, Seok-Hee Hong:
IEEE Pacific Visualization Symposium, PacificVis 2013, February 27 2013-March 1, 2013, Sydney, NSW, Australia. IEEE Computer Society 2013 [contents] - [r2]Peter Eades, Seok-Hee Hong:
Symmetric Graph Drawing. Handbook of Graph Drawing and Visualization 2013: 87-113 - [i3]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) - [i2]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. CoRR abs/1308.6801 (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. Discret. Appl. Math. 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). GD 2012: 339-345 - [c66]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
StreamEB: Stream Edge Bundling. GD 2012: 400-413 - [c65]Quan Hoang Nguyen, Peter Eades, Seok-Hee Hong:
On the Faithfulness of Graph Visualizations. GD 2012: 566-568 - [c64]Tim Dwyer, Fabrizio Frati, Seok-Hee Hong, Karsten Klein:
Theory and Practice of Graph Drawing. GD 2012: 571-574 - [c63]Hui Liu, Peter Eades, Seok-Hee Hong:
Visualizing dynamic trajectories in social networks. VL/HCC 2012: 197-204 - [p2]Peter Eades, Seok-Hee Hong:
How to Draw a Graph, Revisited. Expanding the Frontiers of Visual Analytics and Visualization 2012: 111-126 - 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. Geom. Appl. 21(3): 251-252 (2011) - [c62]Peter Eades, Seok-Hee Hong, Kazuo Misue:
Kozo Sugiyama 1945 - 2011. GD 2011: 1 - [c61]Quan Hoang Nguyen, Seok-Hee Hong, Peter Eades:
TGI-EB: A New Framework for Edge Bundling Integrating Topology, Geometry and Importance. GD 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. Discret. Appl. Math. 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. GD 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. Int. J. Ambient Comput. Intell. 1(2): 59-69 (2009) - [j21]Weidong Huang, Peter Eades, Seok-Hee Hong:
Measuring effectiveness of graph visualizations: A cognitive load perspective. Inf. Vis. 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. GD 2009: 232-243 - [c54]Kai Xu, Rohan Williams, Seok-Hee Hong, Qing Liu, Ji Zhang:
Semi-bipartite Graph Visualization for Gene Ontology Networks. GD 2009: 244-255 - [c53]Seok-Hee Hong, Hiroshi Nagamochi:
Upward Star-Shaped Polyhedral Graphs. ISAAC 2009: 913-922 - [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. Discret. Appl. Math. 156(12): 2368-2380 (2008) - [j16]Seok-Hee Hong:
Guest Editor's Foreword. J. Graph Algorithms Appl. 12(3): 265-266 (2008) - [j15]David Cho Yau Fung, Seok-Hee Hong, Dirk Koschützki, Falk Schreiber, Kai Xu:
2.5D Visualisation of Overlapping Biological Networks. J. Integr. Bioinform. 5(1) (2008) - [c48]Weidong Huang, Seok-Hee Hong, Peter Eades:
Effects of Crossing Angles. PacificVis 2008: 41-46 - [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. GD 2008: 278-283 - [c43]Takashi Imamichi, Yohei Arahori, Jaeseong Gim, Seok-Hee Hong, Hiroshi Nagamochi:
Removing Node Overlaps Using Multi-sphere Scheme. GD 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:
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 [contents] - [e3]Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga:
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 [contents] - 2007
- [j14]David Abelson, Seok-Hee Hong, Donald E. Taylor:
Geometric automorphism groups of graphs. Discret. Appl. Math. 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]Adel Ahmed, Seok-Hee Hong:
Navigation techniques for 2.5D graph layout. APVIS 2007: 81-84 - [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:
APVIS 2007, 6th International Asia-Pacific Symposium on Visualization 2007, Sydney, Australia, 5-7 February 2007. IEEE Computer Society 2007, ISBN 1-4244-0808-3 [contents] - 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. Discret. Comput. Geom. 36(2): 283-311 (2006) - [j9]Seok-Hee Hong, Hsu-Chun Yen:
Preface. Int. J. Found. Comput. Sci. 17(5): 1003-1004 (2006) - [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. GD 2005: 251-261 - [c25]Weidong Huang, Seok-Hee Hong, Peter Eades:
Layout Effects on Sociogram Perception. GD 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. GD 2005: 468-479 - [c23]Joshua Wing Kei Ho, Seok-Hee Hong:
Drawing Clustered Graphs in Three Dimensions. GD 2005: 492-502 - [c22]Seok-Hee Hong:
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions. GD 2005: 514-515 - [c21]Seok-Hee Hong:
Network Analysis and Visualisation . GD 2005: 524-527 - [c20]Wanchun Li, Seok-Hee Hong, Peter Eades:
A Framework for Visualising Large Graphs. IV 2005: 528-535 - [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:
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 [contents] - 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. GD 2004: 307-317 - [c15]Seok-Hee Hong, Tom Murtagh:
Visualisation of Large and Complex Networks Using PolyPlane. GD 2004: 471-481 - [c14]Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nascimento:
The Metro Map Layout Problem. GD 2004: 482-491 - [r1]Peter Eades, Seok-Hee Hong:
Drawing Graphs. Handbook of Data Structures and Applications 2004 - 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. SCG 2003: 380-381 - [c12]Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda:
The Puzzle Layout Problem. GD 2003: 500-501 - [c11]Seok-Hee Hong, Peter Eades:
Symmetric Layout of Disconnected Graphs. ISAAC 2003: 405-414 - 2002
- [c10]David Abelson, Seok-Hee Hong, Donald E. Taylor:
A Group-Theoretic Method for Drawing Graphs Symmetrically. GD 2002: 86-97 - [c9]Christoph Buchheim, Seok-Hee Hong:
Crossing Minimization for Symmetries. ISAAC 2002: 563-574 - [c8]Seok-Hee Hong, Brendan D. McKay, Peter Eades:
Symmetric drawings of triconnected planar graphs. SODA 2002: 356-365 - 2001
- [c7]Seok-Hee Hong:
Drawing Graphs Symmetrically in Three Dimensions. GD 2001: 189-204 - 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. GD 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]Seok-Hee Hong:
Visualisation of Symmetry in Graphs. VIP 2000: 71-72
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. GD 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. J. Syst. Archit. 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
[j71] [j68] [j67] [c133] [c128] [i25] [c121] [c119] [c117] [c115] [i22] [j60] [c113] [c112] [c111] [j57] [j56] [c108] [c107] [c105] [c104] [i19] [c99] [c98] [c97] [c96] [i18] [i17] [i16] [j49] [c93] [c92] [i13] [j46] [j45] [c90] [c89] [c88] [i12] [i11] [i10] [j43] [c87] [j42] [c84] [c81] [i6] [j40] [j38] [c76] [j37] [j36] [c73] [c72] [c69] [r2] [i3] [j34] [c68] [c67] [c66] [c65] [c63] [p2] [c62] [c61] [c59] [c57] [i1] [j22] [j21] [c56] [c55] [c48] [c47] [c46] [j12] [c34] [j11] [j10] [c31] [c30] [p1] [j7] [c25] [c20] [c18] [j5] [c16] [r1] [j4] [c11] [c8] [j3] [c6] [c5] [c3] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-14 17:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
