default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 2020: Vancouver, BC, Canada
- David Auber
, Pavel Valtr:
Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12590, Springer 2020, ISBN 978-3-030-68765-6
Gradient Descent and Queue Layouts
- Abu Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen G. Kobourov, Mingwei Li:
Graph Drawing via Gradient Descent, (GD)2. 3-17 - Katharina Börsig, Ulrik Brandes, Barna Pásztor:
Stochastic Gradient Descent Works Really Well for Stress Minimization. 18-25 - Laura Merker, Torsten Ueckerdt:
The Local Queue Number of Graphs with Bounded Treewidth. 26-39 - Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Queue Layouts. 40-54 - Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
Lazy Queue Layouts of Posets. 55-68
Drawing Tree-Like Graphs, Visualisation, and Special Drawings of Elementary Graphs
- Timothy M. Chan, Zhengcheng Huang:
Improved Upper and Lower Bounds for LR Drawings of Binary Trees. 71-84 - Václav Blazej, Jirí Fiala, Giuseppe Liotta:
On the Edge-Length Ratio of 2-Trees. 85-98 - Vincenzo Perri, Ingo Scholtes:
HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs. 99-114 - Alessio Arleo, Walter Didimo, Giuseppe Liotta, Silvia Miksch, Fabrizio Montecchiani:
VAIM: Visual Analytics for Influence Maximization. 115-123 - Gábor Damásdi:
Odd Wheels Are Not Odd-distance Graphs. 124-134 - Alon Efrat, Radoslav Fulek, Stephen G. Kobourov, Csaba D. Tóth:
Polygons with Prescribed Angles in 2D and 3D. 135-147
Restricted Drawings of Special Graph Classes
- Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
On Mixed Linear Layouts of Series-Parallel Graphs. 151-159 - Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais:
Schematic Representation of Biconnected Graphs. 160-172 - Jonathan Klawitter, Peter Stumpf:
Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings. 173-180 - Emanuele Balloni, Giuseppe Di Battista, Maurizio Patrignani:
A Tipping Point for the Planarity of Small and Medium Sized Graphs. 181-188
Orthogonality
- Sreejith K. Pallathumadam, Deepak Rajendraprasad:
Characterization and a 2D Visualization of B0-VPG Cocomparability Graphs. 191-204 - Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. 205-219 - Julian Walter, Johannes Zink, Joachim Baumeister, Alexander Wolff:
Layered Drawing of Undirected Graphs with Generalized Port Constraints. 220-234 - Benjamin Niedermann, Ignaz Rutter:
An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings. 235-249 - Michael A. Bekos, Carla Binucci, Giuseppe Di Battista, Walter Didimo, Martin Gronemann, Karsten Klein, Maurizio Patrignani, Ignaz Rutter:
On Turn-Regular Orthogonal Representations. 250-264 - Patrizio Angelini, Ignaz Rutter, Sandhya T. P.:
Extending Partial Orthogonal Drawings. 265-278
Topological Constraints
- Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. 281-294 - Marcel Radermacher, Ignaz Rutter, Peter Stumpf:
Towards a Characterization of Stretchable Aligned Graphs. 295-307 - David Baum:
Exploring the Design Space of Aesthetics with the Repertory Grid Technique. 308-323 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini:
Storyline Visualizations with Ubiquitous Actors. 324-332 - Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck:
Drawing Shortest Paths in Geodetic Graphs. 333-340 - Marthe Bonamy, Bojan Mohar, Alexandra Wesolek:
Limiting Crossing Numbers for Geodesic Drawings on the Sphere. 341-355
Crossings, k-Planar Graphs
- János Pach, Gábor Tardos, Géza Tóth:
Crossings Between Non-homotopic Edges. 359-371 - János Barát, Géza Tóth:
Improvement on the Crossing Number of Crossing-Critical Graphs. 372-381 - Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. 382-389 - Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth:
Simple Topological Drawings of k-Planar Graphs. 390-402 - Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck:
2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth. 403-419
Planarity
- Fabrizio Frati:
Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time. 423-435 - Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time. 436-449 - Amyra Meidiana, Seok-Hee Hong, Peter Eades:
New Quality Metrics for Dynamic Graph Drawing. 450-465 - Helen C. Purchase, Daniel Archambault, Stephen G. Kobourov, Martin Nöllenburg, Sergey Pupyrev, Hsiang-Yun Wu:
The Turing Test for Graph Drawing Algorithms. 466-481 - Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger:
Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. 482-489 - Alexander Pilz, Jonathan Rollin, Lena Schlipf, André Schulz:
Augmenting Geometric Graphs with Matchings. 490-504
Graph Drawing Contest
- Philipp Kindermann, Tamara Mchedlidze, Wouter Meulemans, Ignaz Rutter:
Graph Drawing Contest Report. 507-519
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-06-12 21:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
