( en | de | ru )

 

Disambiguation of "Hong, Seok-Hee"

Author of the publication

copydeleteadd this publication to your clipboard
A Group-Theoretic Method for Drawing Graphs Symmetrically.

, , and . GD, volume 2528 of Lecture Notes in Computer Science, page 86-97. Springer, (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Seok-Hee Song

Ui-Seok Hong

Tae-Hee Hong

Seung-Hee Hong

Seung-Hee Hong

 

Other publications of authors with the same name

Automatic visualisation of metro maps., , and . J. Vis. Lang. Comput., 17 (3): 203-224 (2006)Circular right-angle crossing drawings in linear time., , , and . Theor. Comput. Sci., (2016)New Approximation to the One-sided Radial Crossing Minimization., and . J. Graph Algorithms Appl., 13 (2): 179-196 (2009)Visualization and analysis of email networks., , , , , and . APVIS, page 1-8. IEEE Computer Society, (2007)GDot: Drawing Graphs with Dots and Circles., , and . PacificVis, page 156-165. IEEE, (2021)Large Crossing Angles in Circular Layouts., , , and . GD, volume 6502 of Lecture Notes in Computer Science, page 397-399. Springer, (2010)Resource provisioning for memory intensive graph processing., , and . ACSW, page 15:1-15:7. ACM, (2018)Removing Node Overlaps Using Multi-sphere Scheme., , , , and . GD, volume 5417 of Lecture Notes in Computer Science, page 296-301. Springer, (2008)On the Faithfulness of Graph Visualizations., , and . GD, volume 7704 of Lecture Notes in Computer Science, page 566-568. Springer, (2012)A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs., and . GD, volume 3383 of Lecture Notes in Computer Science, page 307-317. Springer, (2004)