default search action
Seok-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) - [c132]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 - [c131]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 - [c130]Amyra Meidiana, Seok-Hee Hong, Yongcheng Jing:
Connectivity-Faithful Graph Drawing. GD 2024: 17:1-17:17 - [c129]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 - [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