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 |
|---|---|---|
| 2023 | On Families of Planar DAGs with Constant Stack Number. | Martin Nllenburg, Sergey Pupyrev |
| 2023 | Balancing Between the Local and Global Structures (LGS) in Graph Embedding. | Jacob Miller, Vahan Huroyan, Stephen G. Kobourov |
| 2023 | On the Perception of Small Sub-graphs. | Jacob Miller, Mohammad Ghoniem, Hsiang-Yun Wu, Helen C. Purchase |
| 2023 | Tree Drawings with Columns. | Jonathan Klawitter, Johannes Zink |
| 2023 | Three Edge-Disjoint Plane Spanning Paths in a Point Set. | Philipp Kindermann, Jan Kratochvl, Giuseppe Liotta, Pavel Valtr |
| 2023 | On the Complexity of Lombardi Graph Drawing. | Paul Jungeblut |
| 2023 | Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. | Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov |
| 2023 | Minimizing an Uncrossed Collection of Drawings. | Petr Hlinen, Toms Masark |
| 2023 | A Simple Pipeline for Orthogonal Graph Drawing. | Tim Hegemann, Alexander Wolff |
| 2023 | Mutual Witness Proximity Drawings of Isomorphic Trees. | Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta |
| 2023 | On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity. | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali |
| 2023 | Degenerate Crossing Number and Signed Reversal Distance. | Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay |
| 2023 | Parameterized Complexity of Simultaneous Planarity. | Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter |
| 2023 | TimeLighting: Guidance-Enhanced Exploration of 2D Projections of Temporal Graphs. | Velitchko Andreev Filipov, Davide Ceneda, Daniel Archambault, Alessio Arleo |
| 2023 | On the Biplanarity of Blowups. | David Eppstein |
| 2023 | CelticGraph: Drawing Graphs as Celtic Knots and Links. | Peter Eades, Niklas Grne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber |
| 2023 | Cops and Robbers on 1-Planar Graphs. | Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp |
| 2023 | Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem. | Walter Didimo, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Stephen G. Kobourov, Marie Diana Sieper |
| 2023 | On Minimizing the Energy of a Spherical Graph Representation. | Matt DeVos, Danielle Rogers, Alexandra Wesolek |
| 2023 | The Parametrized Complexity of the Segment Number. | Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvl, Alexander Wolff |
| 2023 | String Graphs with Precise Number of Intersections. | Petr Chmel, Vt Jelnek |
| 2023 | Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. | Alvin Chiu, David Eppstein, Michael T. Goodrich |
| 2023 | Weakly and Strongly Fan-Planar Graphs. | Otfried Cheong, Henry Frster, Julia Katheder, Maximilian Pfister, Lena Schlipf |
| 2023 | Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs. | Marco Caoduro, Andrs Seb |
| 2023 | Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs. | Cornelius Brand, Robert Ganian, Sebastian Rder, Florian Schager |
126–150 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