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)

Dynamic Graph Map Animation. - Seok-Hee Hong 001; Peter Eades; Marnijati Torkel; Weidong Huang 001; Cristina Cifuentes (PacificVis, 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)

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)

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)

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)

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)