This page contains my notes on talks given on GD 2020 conference, which was held online.

(speaker is shown in bold)

Gradient descent and queue layouts

Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen Kobourov and Mingwei Li. Graph drawing via gradient descent, (GD)^2 – multi-parameter graph drawing using gradient descent, live demo on Mingwei Li’s page ↗

Katharina Börsig, Ulrik Brandes and Barna Pasztor. Stochastic Gradient Descent Works Really Well for Stress Minimization – Stochastic Gradient Descent (SGD) jako alternativa Majorization metody kreslení grafu, z experimentů se zdá, že funguje okay.

Laura Merker and Torsten Ueckerdt. The Local Queue Number of Graphs with Bounded Treewidth – dekompozice grafů se seřazenými vrcholy na jakési queue (queue layouts), definují lokální variantu a nalézají cases, kde globální je unbounded a lokální bounded

Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani and Martin Nöllenburg. Parameterized Algorithms for Queue Layouts – počítání queue layout parametrizované

Jawaherul Md. Alam, Michael Bekos, Martin Gronemann, Michael Kaufmann and Sergey Pupyrev. Lazy Queue Layouts of Posets

Drawing tree-like graphs, visualisation, and special drawings of elementary graphs

Timothy M. Chan and Zhengcheng Huang. Improved Upper and Lower Bounds for LR Drawings of Binary Trees

Václav Blažej, Jiří Fiala and Giuseppe Liotta. On the edge-length ratio of $2$-trees

Vincenzo Perri and Ingo Scholtes. HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs – Visualizace cest v temporálních grafech; pak zkoušení na reálné testcases.

Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch and Fabrizio Montecchiani. VAIM: Visual Analytics for Influence Maximization – (fancy prezentace) nástroj pro visualizační analýzu šíření názorů

Gábor Damásdi. Odd wheels are not odd-distance graphs. – (pěkný) Odd distance graf je takový, který jde do 2d nakreslit hrany úsečkami s lichými celočíselnými délkami. Wheel grafy takto nelze nakreslit.

Alon Efrat, Radoslav Fulek, Stephen Kobourov and Csaba Toth. Polygons with Prescribed Angles in 2D and 3D

Restricted drawings of special graph classes

Patrizio Angelini, Michael Bekos, Philipp Kindermann and Tamara Mchedlidze. On Mixed Linear Layouts of Series-Parallel Graphs – Book embeddings (drawing a grpah on line and connecting edges through pages of a book), page number is minumum necessary number of pages. 2-trees with no (1,1)-layout

Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani and Marco Tais. Schematic Representation of Large Biconnected Graphs – representing huge graphs; we can represent only connected components, any maybe 2-connected components + articulations; oni srudují reprezentaci 2-souvislého grafu

Jonathan Klawitter and Peter Stumpf. Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

Emanuele Balloni, Giuseppe Di Battista and Maurizio Patrignani. A Tipping Point for the Planarity of Small and Medium Sized Graphs


Deepak Rajendraprasad and Sreejith K Pallathumadam. Characterization and a 2D Visualization of B0-VPG Cocomparability Graphs

Patrizio Angelini, Steven Chaplick, Sabine Cornelsen and Giordano Da Lozzo. Planar L-Drawings of Bimodal Graphs

Julian Walter, Johannes Zink, Joachim Baumeister and Alexander Wolff. Layered Drawing of Undirected Graphs with Generalized Port Constraints

Benjamin Niedermann and Ignaz Rutter. An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings

Michael Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani and Ignaz Rutter. On Turn-Regular Orthogonal Representations

Patrizio Angelini, Ignaz Rutter and Sandhya T P. Extending Partial Orthogonal Drawings

Topological constraints

Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder and Raphael Steiner. Topological Drawings meet Classical Theorems from Convex Geometry

Marcel Radermacher, Ignaz Rutter and Peter Stumpf. Towards a characterization of stretchable aligned graphs

David Baum. Exploring Design Space of Aesthetics with Repertory Grids

Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani and Alessandra Tappini. Storyline Visualizations with Ubiquitous Actorso

Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen Kobourov and Thomas Schneck. Drawing Shortest Paths in Geodetic Graphs

Alexandra Wesolek, Bojan Mohar and Marthe Bonamy. Limiting crossing numbers for geodesic drawings on the sphere

Crossings, k-planar graphs

[Best Paper] János Pach, Gábor Tardos and Géza Tóth. Crossings between non-homotopic edges

János Barát and Géza Tóth. Improvement on the crossing number of crossing-critical graphs

Stefan Felsner, Michael Hoffmann, Kristin Knorr and Irene Parada. On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens

Michael Hoffmann, Chih-Hung Liu, Meghana M Reddy and Csaba Toth. Simple Topological Drawings of k-Planar Graphs

Patrizio Angelini, Giordano Da Lozzo, Henry Förster and Thomas Schneck. 2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth


Fabrizio Frati. Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time

Walter Didimo, Michael Kaufmann, Giuseppe Liotta and Giacomo Ortali. Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time

Amyra Meidiana, Seok-Hee Hong and Peter Eades. New Quality Metrics for Dynamic Graph Drawing

Helen Purchase, Daniel Archambault, Stephen Kobourov, Martin Nöllenburg, Sergey Pupyrev and Hsiang-Yun Wu. The Turing Test for Graph Drawing Algorithms

Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber and Alexandra Weinberger. Plane Spanning Trees in Edge-Colored Simple Drawings of $K_n$

Jonathan Rollin, Alexander Pilz, Lena Schlipf and André Schulz. Augmenting Geometric Graphs with Matchings