September 14-17, 2021

Tübingen, Germany

Accepted papers

  1. Ahmad Biniaz: A short proof of the non-biplanarity of K9
  2. Boris Klemz, Kristin Knorr, Meghana M. Reddy and Felix Schröder: Simplifying Non-Simple Fan-Planar Drawings
  3. Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta and Alessandra Tappini: Quasi-upward Planar Drawings with Minimum Curve Complexity
  4. Carlos Alegria, Manuel Borrazzo, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati and Maurizio Patrignani: Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths
  5. David Eppstein: Limitations on Realistic Hyperbolic Graph Drawing
  6. Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani and Alessandra Tappini: A User Study on Hybrid Graph Visualizations
  7. Giuseppe Di Battista and Fabrizio Frati: From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
  8. Henry Förster, Michael Kaufmann and Chrysanthi Raftopoulou: Recognizing and Embedding Simple Optimal 2-Planar Graphs
  9. Heuichan Lim and Stephen Kobourov: Visualizing The Intermediate Representation of Just-in-Time Compilers
  10. Jacob Fox, Janos Pach and Andrew Suk: On the number of edges of separated multigraphs
  11. Jeff Erickson and Patrick Lin: Planar and Toroidal Morphs Made Easier
  12. Jonathan Klawitter and Johannes Zink: Upward Planar Drawings with Three and More Slopes
  13. Loann Giovannangeli, Frederic Lalanne, David Auber, Romain Giot and Romain Bourqui: Drawing Networks with Deep Neural Network, (DNN)²
  14. Marcus Schaefer: RAC-drawability is ER-complete
  15. Markus Chimani, Max Ilsen and Tilo Wiedera: Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
  16. Martin Nöllenburg, Anaïs Villedieu and Jules Wulms: Layered Area-Proportional Rectangle Contact Representation
  17. Mees van de Kerkhof, Irina Kostitsyna and Maarten Löffler: Embedding Ray Intersection Graphs and Global Curve Simplification
  18. Michael Bekos, Martin Gronemann and Chrysanthi Raftopoulou: On the Queue Number of Planar Graphs
  19. Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf and Antonios Symvonis: One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons
  20. Sarah Carmesin and André Schulz: Arrangements of orthogonal circles with many intersections
  21. Stefan Felsner, Laura Merker, Torsten Ueckerdt and Pavel Valtr: Linear Layouts of Complete Graphs
  22. Stefan Felsner, Torsten Ueckerdt and Kaja Wille: On the Queue-Number of Partial Orders
  23. Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin and Torsten Ueckerdt: Edge-Minimum Saturated k-Planar Drawings
  24. Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani and Martin Nöllenburg: On the Upward Book Thickness Problem: Combinatorial and Complexity Results
  25. Sujoy Bhore, Maarten Löffler, Soeren Nickel and Martin Nöllenburg: Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs
  26. Therese Biedl, Giuseppe Liotta, Jayson Lynch and Fabrizio Montecchiani: Optimal-area visibility representations of outer-1-plane graphs
  27. Tomáš Čížek and Martin Balko: Implementation of Sprouts: a graph drawing game
  28. Václav Blažej, Michal Opler, Matas Šileikis and Pavel Valtr: Non-homotopic Loops with a Bounded Number of Pairwise Intersections

The arxiv proceedings are now online:


Uni Tuebingen