default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 2003: Perugia, Italy
- Giuseppe Liotta:
Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers. Lecture Notes in Computer Science 2912, Springer 2004, ISBN 3-540-20831-3
Planarity and Planar Drawings
- Matthew Dickerson, David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. 1-12 - Carsten Gutwenger, Petra Mutzel
:
An Experimental Study of Crossing Minimization Heuristics. 13-24 - John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, Giuseppe Di Battista:
Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm. 25-36 - Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Bounds and Methods for k-Planar Crossing Numbers. 37-46
Geometric Graph Theory
- János Pach, Géza Tóth:
How Many Ways Can One Draw a Graph? 47-58 - Jan Kratochvíl, Martin Pergel:
Two Results on Intersection Graphs of Polygons. 59-70 - Hubert de Fraysseix, Patrice Ossona de Mendez:
Stretching of Jordan Arc Contact Systems. 71-85 - Jakub Cerný, Zdenek Dvorák, Vít Jelínek, Jan Kára:
Noncrossing Hamiltonian Paths in Geometric Graphs. 86-97
Applications and Systems - Part I
- Cesim Erten, Philip J. Harding, Stephen G. Kobourov, Kevin Wampler, Gary V. Yee:
GraphAEL: Graph Animations with Evolving Layouts. 98-110 - Ulrik Brandes, Tim Dwyer, Falk Schreiber:
Visualizing Related Metabolic Pathways in Two and a Half Dimensions. 111-122 - Carsten Gutwenger, Joachim Kupke, Karsten Klein, Sebastian Leipert:
GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration. 123-128
Straight-Line, Circular, and Circular-Arc Drawings
- Ashim Garg, Adrian Rusu:
Area-Efficient Drawings of Outerplanar Graphs. 129-134 - Janet M. Six, Ioannis G. Tollis:
A Framework for User-Grouped Circular Drawings. 135-146 - Alon Efrat, Cesim Erten, Stephen G. Kobourov:
Fixed-Location Circular-Arc Drawing of Planar Graphs. 147-158 - Ashim Garg, Adrian Rusu:
A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio. 159-165
Symmetries
- Christoph Buchheim, Michael Jünger:
An Integer Programming Approach to Fuzzy Symmetry Detection. 166-177 - Olaf Delgado-Friedrichs:
Barycentric Drawings of Periodic Graphs. 178-189
3D-Drawings
- Vida Dujmovic, David R. Wood:
Three-Dimensional Grid Drawings with Sub-quadratic Volume. 190-201 - Toru Hasunuma:
Laying Out Iterated Line Digraphs Using Queues. 202-213 - Emilio Di Giacomo, Henk Meijer:
Track Drawings of Graphs with Constant Queue Number. 214-225 - Jan Stola:
3D Visibility Representations of Complete Graphs. 226-237 - Emilio Di Giacomo:
Drawing Series-Parallel Graphs on Restricted Integer 3D Grids. 238-246 - Tiziana Calamoneri, Annalisa Massini:
Nearly Optimal Three Dimensional Layout of Hypercube Networks. 247-258
Embeddings and Triangulations
- Carsten Gutwenger, Petra Mutzel:
Graph Embedding with Minimum Depth and Maximum External Face. 259-272 - Shin-Ichi Nakano, Takeaki Uno:
More Efficient Generation of Plane Triangulations. 273-282 - Sergio Cabello, Erik D. Demaine, Günter Rote:
Planar Embeddings of Graphs with Specified Edge Lengths. 283-294
Applications and Systems - Part II
- Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, Maurizio Pizzonia:
BGPlay: A System for Visualizing the Interdomain Routing Evolution. 295-306 - Stina S. Bridgeman:
GraphEx: An Improved Graph Translation Service. 307-313 - Burkay Genç, Ugur Dogrusöz:
A Constrained, Force-Directed Layout Algorithm for Biological Pathways. 314-319 - Cesim Erten, Stephen G. Kobourov, Chandan Pitta:
Intersection-Free Morphing of Planar Graphs. 320-331
Fixed Parameter Tractability
- Vida Dujmovic, Henning Fernau, Michael Kaufmann:
Fixed Parameter Algorithms for one-sided crossing minimization Revisited. 332-344 - Matthew Suderman, Sue Whitesides:
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. 345-356
Clusters, Cuts, and Orthogonal Drawings
- Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. 357-368 - Hiroshi Nagamochi, Katsutoshi Kuroya:
Convex Drawing for c-Planar Biconnected Clustered Graphs. 369-380 - Georg Sander:
Layout of Directed Hypergraphs with Orthogonal Hyperedges. 381-386 - Md. Saidur Rahman, Noritsugu Egi, Takao Nishizeki:
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. 387-392
k-Level Drawings
- Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster:
Radial Level Planarity Testing and Embedding in Linear Time. 393-405 - Hiroshi Nagamochi:
An Improved Approximation to the One-Sided Bilayer Drawing. 406-418 - Emilio Di Giacomo, Walter Didimo:
Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. 419-424
Force Directed and Energy-Based Techniques
- Andreas Noack:
An Energy Model for Visual Graph Clustering. 425-436 - Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Navabi:
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes. 437-449 - Yehuda Koren, David Harel:
Axis-by-Axis Stress Minimization. 450-459 - Jen-Hui Chuang, Chun-Cheng Lin, Hsu-Chun Yen:
Drawing Graphs with Nonuniform Nodes Using Potential Fields. 460-465
Surfaces and Diagrams
- Stirling Chow, Frank Ruskey:
Drawing Area-Proportional Venn and Euler Diagrams. 466-477 - Éric Colin de Verdière, Francis Lazarus:
Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface. 478-490
Posters
- Guy-Vincent Jourdan, Ivan Rival, Nejib Zaguia:
Degree Navigator™: The Journey of a Visualization Software. 491-493 - Colin Murray, Carsten Friedrich, Peter Eades:
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. 494-495 - Breanne Dyck, Jill Joevenazzo, Elspeth Nickle, Jon Wilsdon, Stephen K. Wismath:
GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions. 496-497 - Yasuhito Asano, Takao Nishizeki:
Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework. 498-499 - Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda:
The Puzzle Layout Problem. 500-501 - Thomas Baudel, Bruno Haible, Georg Sander:
Visual Data Mining with ILOG Discovery. 502-503
Graph Drawing Contest
- Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks:
Graph Drawing Contest Report. 504-508
Invited Talks
- Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Engineering and Visualizing Algorithms. 509-513 - Report on the Invited Lecture by Pat Hanrahan, Titled "On Being in the Right Space". 514
Open Problems
- Franz-Josef Brandenburg, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel:
Selected Open Problems in Graph Drawing. 515-539
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-01-10 18:20 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:
