Graph Drawing
GD
A
CORE rank
CORE rank (raw)
A
Fields of research
Theory of Computation
Papers indexed
1,486
1994–2025
Papers per year
199462 peak2025
Most published authors
GD papers
1,486 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2018 | Graph Drawing Contest Report. | William E. Devanny, Philipp Kindermann, Maarten Lffler, Ignaz Rutter |
| 2018 | On Contact Graphs of Paths on a Grid. | Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries |
| 2018 | A Greedy Heuristic for Crossing-Angle Maximization. | Almut Demel, Dominik Drrschnabel, Tamara Mchedlidze, Marcel Radermacher, Lasse Wulf |
| 2018 | Clustered Planarity = Flat Clustered Planarity. | Pier Francesco Cortese, Maurizio Patrignani |
| 2018 | Crossing Numbers and Stress of Random Graphs. | Markus Chimani, Hanna Dring, Matthias Reitzner |
| 2018 | Same Stats, Different Graphs - (Graph Statistics and Why We Need Graph Drawings). | Hang Chen, Utkarsh Soni, Yafeng Lu, Ross Maciejewski, Stephen G. Kobourov |
| 2018 | Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends. | Steven Chaplick, Fabian Lipp, Alexander Wolff, Johannes Zink |
| 2018 | Short Plane Supports for Spatial Hypergraphs. | Thom Castermans, Mereke van Garderen, Wouter Meulemans, Martin Nllenburg, Xiaoru Yuan |
| 2018 | Level Planarity: Transitivity vs. Even Crossings. | Guido Brckner, Ignaz Rutter, Peter Stumpf |
| 2018 | Universal Slope Sets for Upward Planar Drawings. | Michael A. Bekos, Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani |
| 2018 | A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution. | Michael A. Bekos, Henry Frster, Christian Geckeler, Lukas Hollnder, Michael Kaufmann, Amadus M. Spallek, Jan Splett |
| 2018 | Pole Dancing: 3D Morphs for Tree Drawings. | Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini |
| 2018 | Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. | Evmorfia N. Argyriou, Sabine Cornelsen, Henry Frster, Michael Kaufmann, Martin Nllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff |
| 2018 | Turning Cliques into Paths to Achieve Planarity. | Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen G. Kobourov, Giuseppe Liotta, Alfredo Navarra, Alessandra Tappini |
| 2018 | On RAC Drawings of Graphs with One Bend per Edge. | Patrizio Angelini, Michael A. Bekos, Henry Frster, Michael Kaufmann |
| 2018 | Greedy Rectilinear Drawings. | Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini |
| 2018 | Queue Layouts of Planar 3-Trees. | Jawaherul Md. Alam, Michael A. Bekos, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev |
| 2018 | How to Fit a Tree in a Box. | Hugo A. Akitaya, Maarten Lffler, Irene Parada |
| 2018 | The Number of Crossings in Multigraphs with No Empty Lens. | Michael Kaufmann, Jnos Pach, Gza Tth, Torsten Ueckerdt |
| 2017 | MLSEB: Edge Bundling Using Moving Least Squares Approximation. | Jieting Wu, Jianping Zeng, Feiyu Zhu, Hongfeng Yu |
| 2017 | Reconstructing Generalized Staircase Polygons with Uniform Step Length. | Nodari Sitchinava, Darren Strash |
| 2017 | Drawing Dynamic Graphs Without Timeslices. | Paolo Simonetto, Daniel Archambault, Stephen G. Kobourov |
| 2017 | Non-crossing Paths with Geographic Constraints. | Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek |
| 2017 | Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs. | Mukund Raj, Ross T. Whitaker |
| 2017 | Mixed Linear Layouts of Planar Graphs. | Sergey Pupyrev |
326–350 of 1,486← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AALENEXWorkshop on Algorithm Engineering and Experiments