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 |
|---|---|---|
| 2013 | On Balanced ✛-Contact Representations. | Stephane Durocher, Debajyoti Mondal |
| 2013 | Graph Drawing Contest Report. | Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander |
| 2013 | Upward Planarity Testing: A Computational Study. | Markus Chimani, Robert Zeranski |
| 2013 | Extending Partial Representations of Circle Graphs. | Steven Chaplick, Radoslav Fulek, Pavel Klavk |
| 2013 | Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. | Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw |
| 2013 | On Orthogonally Convex Drawings of Plane Graphs - (Extended Abstract). | Yi-Jun Chang, Hsu-Chun Yen |
| 2013 | Dynamic Traceroute Visualization at Multiple Abstraction Levels. | Massimo Candela, Marco Di Bartolomeo, Giuseppe Di Battista, Claudio Squarcella |
| 2013 | Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices. | Thomas Blsius, Annette Karrer, Ignaz Rutter |
| 2013 | Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings. | Therese Biedl, Thomas Blsius, Benjamin Niedermann, Martin Nllenburg, Roman Prutkin, Ignaz Rutter |
| 2013 | Drawing Permutations with Few Corners. | Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev |
| 2013 | Slanted Orthogonal Drawings. | Michael A. Bekos, Michael Kaufmann, Robert Krug, Stefan Nher, Vincenzo Roselli |
| 2013 | Many-to-One Boundary Labeling with Backbones. | Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nllenburg, Ignaz Rutter, Antonios Symvonis |
| 2013 | Fixed Parameter Tractability of Crossing Minimization of Almost-Trees. | Michael J. Bannister, David Eppstein, Joseph A. Simons |
| 2013 | Superpatterns and Universal Point Sets. | Michael J. Bannister, Zhanpeng Cheng, William E. Devanny, David Eppstein |
| 2013 | Characterizing Planarity by the Splittable Deque. | Christopher Auer, Franz J. Brandenburg, Andreas Gleiner, Kathrin Hanauer |
| 2013 | Recognizing Outer 1-Planar Graphs in Linear Time. | Christopher Auer, Christian Bachmaier, Franz J. Brandenburg, Andreas Gleiner, Kathrin Hanauer, Daniel Neuwirth, Josef Reislhuber |
| 2013 | Strip Planarity Testing. | Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati |
| 2013 | Morphing Planar Graph Drawings Efficiently. | Patrizio Angelini, Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli |
| 2013 | Drawing Non-Planar Graphs with Crossing-Free Subgraphs. | Patrizio Angelini, Carla Binucci, Giordano Da Lozzo, Walter Didimo, Luca Grilli, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis |
| 2013 | Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs. | Md. Jawaherul Alam, Franz J. Brandenburg, Stephen G. Kobourov |
| 2013 | Straight Line Triangle Representations. | Nieke Aerts, Stefan Felsner |
| 2012 | Homotopic $\mathcal{C}$-Oriented Routing. | Kevin Verbeek |
| 2012 | Graph Drawing in TikZ. | Till Tantau |
| 2012 | Density Theorems for Intersection Graphs of t-Monotone Curves. | Andrew Suk |
| 2012 | Interactive Network Exploration to Derive Insights: Filtering, Clustering, Grouping, and Simplification. | Ben Shneiderman, Cody Dunne |
551–575 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