default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th GD 2022: Tokyo, Japan
- Patrizio Angelini
, Reinhard von Hanxleden:
Graph Drawing and Network Visualization - 30th International Symposium, GD 2022, Tokyo, Japan, September 13-16, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13764, Springer 2023, ISBN 978-3-031-22202-3
Properties of Drawings of Complete Graphs
- Andrew Suk, Ji Zeng:
Unavoidable Patterns in Complete Simple Topological Graphs. 3-15 - Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Nicolas El Maalouly, Johannes Obenaus, Rosna Paul, Meghana M. Reddy, Birgit Vogtenhuber, Alexandra Weinberger:
Compatible Spanning Trees in Simple Drawings of Kn. 16-24 - William J. Lenhart, Giuseppe Liotta:
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs. 25-39 - Alfredo García, Javier Tejel, Birgit Vogtenhuber, Alexandra Weinberger:
Empty Triangles in Generalized Twisted Drawings of Kn. 40-48 - Oswin Aichholzer, Alfredo García, Irene Parada, Birgit Vogtenhuber, Alexandra Weinberger:
Shooting Stars in Simple Drawings of Km, n. 49-57
Stress-based Visualizations of Graphs
- Loann Giovannangeli, Frédéric Lalanne, Romain Giot, Romain Bourqui:
FORBID: Fast Overlap Removal by Stochastic GradIent Descent for Graph Drawing. 61-76 - Jacob Miller, Vahan Huroyan, Stephen G. Kobourov:
Spherical Graph Drawing by Multi-dimensional Scaling. 77-92 - Amyra Meidiana, Seok-Hee Hong, Peter Eades:
Shape-Faithful Graph Drawings. 93-108
Planar and Orthogonal Drawings
- Sabine Cornelsen, Gregor Diatzko:
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. 111-126 - Carlos Alegría, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani:
Unit-length Rectangular Drawings of Graphs. 127-143 - Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-Convex Drawings of 3-Connected Planar Graphs. 144-156 - Walter Didimo, Michael Kaufmann, Giuseppe Liotta, Giacomo Ortali:
Rectilinear Planarity of Partial 2-Trees. 157-172
Drawings and Properties of Directed Graphs
- Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, Kirill Simonov:
Testing Upward Planarity of Partial 2-Trees. 175-187 - Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis:
Computing a Feedback Arc Set Using PageRank. 188-200 - Carla Binucci, Walter Didimo, Maurizio Patrignani:
st-Orientations with Few Transitive Edges. 201-216
Beyond Planarity
- Jacob Fox, János Pach, Andrew Suk:
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. 219-231 - Martin Nöllenburg, Manuel Sorge, Soeren Terziadis, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms:
Planarizing Graphs and Their Drawings by Vertex Splitting. 232-246 - Otfried Cheong, Maximilian Pfister, Lena Schlipf:
The Thickness of Fan-Planar Graphs is At Most Three. 247-260 - Abu Reyan Ahmed, Stephen G. Kobourov, Myroslav Kryven:
An FPT Algorithm for Bipartite Vertex Splitting. 261-268
Dynamic Graph Visualization
- Velitchko Andreev Filipov, Alessio Arleo, Markus Bögl, Silvia Miksch:
On Time and Space: An Experimental Study on Graph Structural and Temporal Encodings. 271-288 - Giuseppe Di Battista, Walter Didimo, Luca Grilli, Fabrizio Grosso, Giacomo Ortali, Maurizio Patrignani, Alessandra Tappini:
Small Point-Sets Supporting Graph Stories. 289-303 - Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis:
On the Complexity of the Storyplan Problem. 304-318 - Kathryn Gray, Mingwei Li, Abu Reyan Ahmed, Stephen G. Kobourov:
Visualizing Evolving Trees. 319-335 - Kazuo Misue:
Improved Scheduling of Morphing Edge Drawing. 336-349
Linear Layouts
- Sergey Pupyrev:
Queue Layouts of Two-Dimensional Posets. 353-360 - Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, Chrysanthi N. Raftopoulou:
Recognizing DAGs with Page-Number 2 Is NP-complete. 361-370 - Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter:
The Rique-Number of Graphs. 371-386
Contact and Visibility Graph Representations
- Steven Chaplick, Philipp Kindermann, Jonathan Klawitter, Ignaz Rutter, Alexander Wolff:
Morphing Rectangular Duals. 389-403 - Therese Biedl:
Visibility Representations of Toroidal and Klein-bottle Graphs. 404-417 - Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter, Joachim Spoerhase, Alexander Wolff, Johannes Zink:
Coloring Mixed and Directional Interval Graphs. 418-431 - Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Alexander Wolff:
Outside-Obstacle Representations with All Vertices on the Outer Face. 432-440 - Stefan Felsner, Sandro Roch, Manfred Scheucher:
Arrangements of Pseudocircles: On Digons and Triangles. 441-455
GD Contest Report
- Philipp Kindermann, Fabian Klute, Tamara Mchedlidze, Wouter Meulemans:
Graph Drawing Contest Report. 459-470
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-12-05 22:22 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:
