Faithful Graph Drawing (Invited Talk)

Author Seok-Hee Hong

Thumbnail PDF


  • Filesize: 338 kB
  • 1 pages

Document Identifiers

Author Details

Seok-Hee Hong
  • School of Computer Science, The University of Sydney, Australia


I would like to thank all my research collaborators, in particular, Peter Eades, Hiroshi Nagamochi, Giuseppe Liotta, Amyra Meidiana, and Weidong Huang.

Cite AsGet BibTex

Seok-Hee Hong. Faithful Graph Drawing (Invited Talk). In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, p. 2:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)


Graph drawing aims to compute good geometric representations of graphs in two or three dimensions. It has wide applications in network visualisation, such as social networks and biological networks, arising from many other disciplines. This talk will review fundamental theoretical results as well as recent advances in graph drawing, including symmetric graph drawing, generalisation of the Tutte’s barycenter theorem, Steinitz’s theorem, and Fáry’s theorem, and the so-called beyond planar graphs such as k-planar graphs. I will conclude my talk with recent progress in visualization of big complex graphs, including sublinear-time graph drawing algorithms and faithful graph drawing.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Graph drawing
  • Planar graphs
  • Beyond planar graphs
  • Tutte’s barycenter theorem
  • Steinitz’s theorem
  • Fáry’s theorem
  • Sublinear-time graph drawing algorithm
  • Faithful graph drawing
  • Symmetric graph drawing


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail