Accepted papers


  • ● Manfred Scheucher, Hendrik Schrezenmaier and Raphael Steiner. A Note on Universal Point Sets for Planar Graphs
  • ● Stefan Felsner. 4-Connected Triangulations on Few Lines
  • ● Amyra Meidiana, Seok-Hee Hong, Peter Eades and Daniel Keim. A Quality Metric for Visualization of Clusters in Graphs
  • ● Kazuo Misue and Katsuya Akasaka. Graph Drawing with Morphing Partial Edges
  • ● Oswin Aichholzer, Ruy Fabila-Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber and Francisco Javier Zaragoza Martinez. On the 2-colored crossing number
  • ● Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff and Johannes Zink. Computing Optimal Tangles Faster
  • ● Patrizio Angelini, Michael Bekos, Michael Kaufmann and Thomas Schneck. Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
  • ● Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft and Johannes Zink. Stick Graphs with Length Constraints
  • ● Therese Biedl, Stefan Felsner, Henk Meijer and Alexander Wolff. Line and Plane Cover Numbers Revisited
  • ● Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen Kobourov, Giuseppe Liotta and Maurizio Patrignani. The QuaSEFE Problem
  • ● Manuel Borrazzo and Fabrizio Frati. On the Edge-Length Ratio of Planar Graphs
  • ● Steven Chaplick, Thomas C. Van Dijk, Alexander Wolff, Myroslav Kryven, Alexander Ravsky and Ji-Won Park. Bundled Crossings Revisited
  • ● Myroslav Kryven, Henry Förster, Steven Chaplick and Alexander Wolff. On Arrangements of Orthogonal Circles
  • ● Petr Hlineny and Abhisekh Sankaran. Exact Crossing Number Parameterized by the Vertex Cover
  • ● Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani and Martin Nöllenburg. Parameterized Algorithms for Book Embedding Problems
  • ● Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder and Birgit Vogthenhuber. On the Edge-Vertex Ratio of Maximal Thrackles
  • ● Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck and Antonios Symvonis. Drawing planar graphs with few segments on a polynomial grid
  • ● Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani and Pavel Valtr. Crossing Numbers of Beyond-Planar Graphs
  • ● William Evans, Paweł Rzążeewski, Noushin Saeedi, Chan-Su Shin and Alexander Wolff. Representing Graphs and Hypergraphs by Touching Polygons in 3D
  • ● Alan Arroyo, Martin Derka and Irene Parada. Extending Simple Drawings
  • ● Sven Mallach. A Natural Quadratic Approach to the Generalized Graph Layering Problem
  • ● Sabin Devkota, Abu Reyan Ahmed, Felice De Luca, Kate Isaacs and Stephen Kobourov. Stress-Plus-X (SPX) Graph Layout
  • ● Seok-Hee Hong, Peter Eades, Marni Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken and Hassan Chafi. Multi-level Graph Drawing using Infomap Clustering
  • ● Fati Chen, Laurent Piccinini, Pascal Poncelet and Arnaud Sallaberry. Node Overlap Removal Algorithms: A Comparative Study
  • ● Laura Merker and Torsten Ueckerdt. Local and Union Page Numbers
  • ● Emilio Di Giacomo, Giuseppe Liotta and Fabrizio Montecchiani. Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs
  • ● Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca and Alessandra Tappini. ChordLink: A New Hybrid Visualization Model
  • ● Guido Brückner, Nadine Krisam and Tamara Mchedlidze. Level-Planar Drawings with Few Slopes
  • ● Guido Brückner, Markus Himmel and Ignaz Rutter. An SPQR-Tree-Like Embedding Representation for Upward Planarity
  • ● Manuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati and Maurizio Patrignani. Graph Stories in Small Area
  • ● Arthur van Goethem, Bettina Speckmann and Kevin Verbeek. Optimal Morphs of Planar Orthogonal Drawings II
  • ● Philipp de Col, Fabian Klute and Martin Nöllenburg. Mixed Linear Layouts: Complexity, Heuristics, and Experiments
  • ● Matthias Hummel, Fabian Klute, Soeren Nickel and Martin Nöllenburg. Maximizing Ink in Partial Edge Drawings of k-plane Graphs
  • ● Henry Förster, Robert Ganian, Fabian Klute and Martin Nöllenburg. On Strict (Outer-)Confluent Graphs
  • ● Janos Pach and Istvan Tomon. Coloring Hasse diagrams and disjointness graphs of curves
  • ● Max Sondag, Wouter Meulemans, Soeren Nickel, Martin Nöllenburg, Markus Chimani, Stephen Kobourov and Jaakko Peltonen. Computing Stable Demers Cartograms
  • ● Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay and Tim Ophelders. Homotopy height, grid-minor height and graph-drawing height
  • ● Luca Castelli Aleardi. Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
  • ● Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen and Birgit Vogtenhuber. Graphs with large total angular resolution
  • ● Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber and Emo Welzl. Minimal Representations of Order Types by Geometric Graphs
  • ● Yoshio Okamoto, Alexander Ravsky and Alexander Wolff. Variants of the Segment Number of a Graph
  • ● Felice De Luca, Md. Iqbal Hossain and Stephen Kobourov. Symmetry Detection and Classification in Drawings of Graphs


News and contact


🕫 24.8.2019: Program available.
🕫 24.7.2019: List of accepted papers published.
🕫 18.7.2019: Call for posters published.
🕫 18.2.2019: Call for papers published.
🕫 16.10.2018: The web page was launched.


Contact: gd2019@kam.mff.cuni.cz

Organized by:
MFF UK
KAM
IUUK
DIMATIA

In cooperation with:
MFF UK

Local arrangements are provided by:
CONFORG

Poster:
GD Poster

Sponsors


Gold sponsors:
Avast

Tom Sawyer

yWorks

RSJ

RSJ

Bronze sponsors:
Springer

Sponsors:
Znovín