Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st GD 2023: Palermo, Italy - Part I
- Michael A. Bekos
, Markus Chimani:
Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part I. Lecture Notes in Computer Science 14465, Springer 2023, ISBN 978-3-031-49271-6
Best Papers
- David Eppstein:
On the Biplanarity of Blowups. 3-17 - Peter Eades, Niklas Gröne, Karsten Klein, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber:
CelticGraph: Drawing Graphs as Celtic Knots and Links. 18-35
Beyond Planarity
- Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. 39-52 - Otfried Cheong, Henry Förster, Julia Katheder, Maximilian Pfister, Lena Schlipf:
Weakly and Strongly Fan-Planar Graphs. 53-68 - Csaba D. Tóth:
On RAC Drawings of Graphs with Two Bends per Edge. 69-77 - Petr Chmel, Vít Jelínek:
String Graphs with Precise Number of Intersections. 78-92
Crossing Numbers
- Niloufar Fuladi, Alfredo Hubard, Arnaud de Mesmay:
Degenerate Crossing Number and Signed Reversal Distance. 95-109 - Petr Hlinený, Tomás Masarík:
Minimizing an Uncrossed Collection of Drawings. 110-123 - Oswin Aichholzer, Stefan Felsner, Rosna Paul, Manfred Scheucher, Birgit Vogtenhuber:
Bichromatic Perfect Matchings with Crossings. 124-132
Linear Layouts
- Martin Nöllenburg, Sergey Pupyrev:
On Families of Planar DAGs with Constant Stack Number. 135-151 - Patricia Bachmann, Ignaz Rutter, Peter Stumpf:
On 3-Coloring Circle Graphs. 152-160
Geometric Aspects
- Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber:
The Complexity of Recognizing Geometric Hypergraphs. 163-179 - Paul Jungeblut:
On the Complexity of Lombardi Graph Drawing. 180-194 - Jonathan Klawitter, Johannes Zink:
Tree Drawings with Columns. 195-210
Visualization Challenges
- Jacob Miller, Mohammad Ghoniem, Hsiang-Yun Wu, Helen C. Purchase:
On the Perception of Small Sub-graphs. 213-230 - Velitchko Andreev Filipov, Davide Ceneda, Daniel Archambault, Alessio Arleo:
TimeLighting: Guidance-Enhanced Exploration of 2D Projections of Temporal Graphs. 231-245 - Carla Binucci, Henry Förster, Julia Katheder, Alessandra Tappini:
Evaluating Animation Parameters for Morphing Edge Drawings. 246-262 - Jacob Miller, Vahan Huroyan, Stephen G. Kobourov:
Balancing Between the Local and Global Structures (LGS) in Graph Embedding. 263-279
Graph Representations
- Marco Caoduro, András Sebö:
Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs. 283-295 - André Schulz:
Side-Contact Representations with Convex Polygons in 3D: New Results for Complete Bipartite Graphs. 296-303 - Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta:
Mutual Witness Proximity Drawings of Isomorphic Trees. 304-319
Graph Decompositions
- Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, Pavel Valtr:
Three Edge-Disjoint Plane Spanning Paths in a Point Set. 323-338 - János Pach, Morteza Saghafian, Patrick Schnider:
Decomposition of Geometric Graphs into Star-Forests. 339-346
a service of 
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 2024-04-26 17:30 CEST 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:
