default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 2019: Prague, Czech Republic
- Daniel Archambault, Csaba D. Tóth:
Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings. Lecture Notes in Computer Science 11904, Springer 2019, ISBN 978-3-030-35801-3
Cartograms and Intersection Graphs
- Steven Chaplick
, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, Johannes Zink:
Stick Graphs with Length Constraints. 3-17 - William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff:
Representing Graphs and Hypergraphs by Touching Polygons in 3D. 18-32 - Arthur van Goethem, Bettina Speckmann, Kevin Verbeek:
Optimal Morphs of Planar Orthogonal Drawings II. 33-45 - Soeren Nickel, Max Sondag, Wouter Meulemans, Markus Chimani, Stephen G. Kobourov, Jaakko Peltonen, Martin Nöllenburg:
Computing Stable Demers Cartograms. 46-60
Geometric Graph Theory
- Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff:
Bundled Crossings Revisited. 63-77 - Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr:
Crossing Numbers of Beyond-Planar Graphs. 78-86 - Oswin Aichholzer, Ruy Fabila Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano, Irene Parada, Birgit Vogtenhuber, Francisco Zaragoza:
On the 2-Colored Crossing Number. 87-100 - Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. 101-113 - Luca Castelli Aleardi:
Balanced Schnyder Woods for Planar Triangulations: An Experimental Study with Applications to Graph Drawing and Graph Separators. 114-121
Clustering
- Amyra Meidiana, Seok-Hee Hong, Peter Eades, Daniel A. Keim:
A Quality Metric for Visualization of Clusters in Graphs. 125-138 - Seok-Hee Hong, Peter Eades, Marnijati Torkel, Ziyang Wang, David Chae, Sungpack Hong, Daniel Langerenken, Hassan Chafi:
Multi-level Graph Drawing Using Infomap Clustering. 139-146 - Henry Förster, Robert Ganian, Fabian Klute, Martin Nöllenburg:
On Strict (Outer-)Confluent Graphs. 147-161
Quality Metrics
- Manuel Borrazzo, Fabrizio Frati:
On the Edge-Length Ratio of Planar Graphs. 165-178 - Fati Chen, Laurent Piccinini, Pascal Poncelet, Arnaud Sallaberry:
Node Overlap Removal Algorithms: A Comparative Study. 179-192 - Oswin Aichholzer, Matias Korman, Yoshio Okamoto, Irene Parada, Daniel Perz, André van Renssen, Birgit Vogtenhuber:
Graphs with Large Total Angular Resolution. 193-199
Arrangements
- Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink:
Computing Height-Optimal Tangles Faster. 203-215 - Steven Chaplick, Henry Förster, Myroslav Kryven, Alexander Wolff:
On Arrangements of Orthogonal Circles. 216-229 - Alan Arroyo, Martin Derka, Irene Parada:
Extending Simple Drawings. 230-243 - János Pach, István Tomon:
Coloring Hasse Diagrams and Disjointness Graphs of Curves. 244-250
A Low Number of Crossings
- Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Thomas Schneck:
Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity. 253-267 - Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. 268-275 - Lorenzo Angori, Walter Didimo, Fabrizio Montecchiani, Daniele Pagliuca, Alessandra Tappini:
ChordLink: A New Hybrid Visualization Model. 276-290 - Sabin Devkota, Abu Reyan Ahmed, Felice De Luca, Katherine E. Isaacs, Stephen G. Kobourov:
Stress-Plus-X (SPX) Graph Layout. 291-304
Best Paper in Track 1
- Petr Hlinený, Abhisekh Sankaran:
Exact Crossing Number Parameterized by Vertex Cover. 307-319
Morphing and Planarity
- Matthias Hummel, Fabian Klute, Soeren Nickel, Martin Nöllenburg:
Maximizing Ink in Partial Edge Drawings of k-plane Graphs. 323-336 - Kazuo Misue, Katsuya Akasaka:
Graph Drawing with Morphing Partial Edges. 337-349 - Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner:
A Note on Universal Point Sets for Planar Graphs. 350-362
Parameterized Complexity
- Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg:
Parameterized Algorithms for Book Embedding Problems. 365-378 - Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. 379-392
Collinearities
- Stefan Felsner:
4-Connected Triangulations on Few Lines. 395-408 - Therese Biedl, Stefan Felsner, Henk Meijer, Alexander Wolff:
Line and Plane Cover Numbers Revisited. 409-415 - Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis:
Drawing Planar Graphs with Few Segments on a Polynomial Grid. 416-429 - Yoshio Okamoto, Alexander Ravsky, Alexander Wolff:
Variants of the Segment Number of a Graph. 430-443
Topological Graph Theory
- Laura Merker, Torsten Ueckerdt:
Local and Union Page Numbers. 447-459 - Philipp de Col, Fabian Klute, Martin Nöllenburg:
Mixed Linear Layouts: Complexity, Heuristics, and Experiments. 460-467 - Therese Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, Tim Ophelders:
Homotopy Height, Grid-Major Height and Graph-Drawing Height. 468-481 - Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder, Birgit Vogtenhuber:
On the Edge-Vertex Ratio of Maximal Thrackles. 482-495
Best Paper in Track 2
- Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov:
Symmetry Detection and Classification in Drawings of Graphs. 499-513
Level Planarity
- Guido Brückner, Markus Himmel, Ignaz Rutter:
An SPQR-Tree-Like Embedding Representation for Upward Planarity. 517-531 - Sven Mallach:
A Natural Quadratic Approach to the Generalized Graph Layering Problem. 532-544 - Manuel Borrazzo, Giordano Da Lozzo, Fabrizio Frati, Maurizio Patrignani:
Graph Stories in Small Area. 545-558 - Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze:
Level-Planar Drawings with Few Slopes. 559-572
Graph Drawing Contest Report
- Philipp Kindermann, Tamara Mchedlidze, Ignaz Rutter:
Graph Drawing Contest Report. 575-583
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 2025-03-24 00:33 CET 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:
