default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGD 2004: New York, New York, USA
- János Pach:
Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3383, Springer 2004, ISBN 3-540-24528-6
Papers
- Greg Aloupis, Prosenjit Bose, Pat Morin
:
Reconfiguring Triangulations with Edge Flips and Point Moves. 1-11 - Reid Andersen, Fan R. K. Chung, Lincoln Lu:
Drawing Power Law Graphs. 12-17 - Shabnam Aziza, Therese Biedl:
Hexagonal Grid Drawings: Algorithms and Lower Bounds. 18-24 - József Balogh, Gelasio Salazar:
Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. 25-35 - Saugata Basu, Raghavan Dhandapani, Richard Pollack:
On the Realizable Weaving Patterns of Polynomial Curves in R3. 36-42 - Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Drawing the AS Graph in 2.5 Dimensions. 43-48 - Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff:
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. 49-59 - Nicolas Bonichon, Stefan Felsner, Mohamed Mosbah:
Convex Drawings of 3-Connected Plane Graphs. 60-70 - Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood:
Partitions of Complete Geometric Graphs into Plane Trees. 71-81 - John M. Boyer:
Additional PC-Tree Planarity Conditions. 82-88 - Ulrik Brandes, Christian Pich:
GraphML Transformation. 89-99 - Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
Clustering Cycles into Cycles of Clusters. 100-110 - Alice M. Dean, Ellen Gethner, Joan P. Hutchinson:
Unit Bar-Visibility Layouts of Triangulated Polygons. 111-121 - Vida Dujmovic, Matthew Suderman, David R. Wood:
Really Straight Graph Drawings. 122-132 - Vida Dujmovic, David R. Wood:
Layouts of Graph Subdivisions. 133-143 - Dietmar Ebner, Gunnar W. Klau, René Weiskircher:
Label Number Maximization in the Slider Model. 144-154 - Markus Eiglsperger, Martin Siebenhaller, Michael Kaufmann:
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. 155-166 - Robert B. Ellis, Jeremy L. Martin, Catherine H. Yan:
Random Geometric Graph Diameter in the Unit Disk with lp Metric. 167-172 - David Eppstein:
Algorithms for Drawing Media. 173-183 - David Eppstein, Michael T. Goodrich, Jeremy Yu Meng:
Confluent Layered Drawings. 184-194 - Cesim Erten, Stephen G. Kobourov:
Simultaneous Embedding of Planar Graphs with Few Bends. 195-205 - Michael Forster:
A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. 206-216 - Hubert de Fraysseix, Patrice Ossona de Mendez:
Contact and Intersection Representations. 217-227 - Carsten Görg, Peter Birke, Mathias Pohl, Stephan Diehl:
Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs. 228-238 - Emden R. Gansner, Yehuda Koren, Stephen C. North:
Graph Drawing by Stress Majorization. 239-250 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer:
Computing Radial Drawings on the Minimum Number of Circles. 251-261 - Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Matthew Suderman:
Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. 262-272 - Craig Gotsman, Yehuda Koren:
Distributed Graph Layout for Sensor Networks. 273-284 - Stefan Hachul, Michael Jünger:
Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. 285-295 - Patrick Healy, Karol Lynch:
Building Blocks of Upward Planar Digraphs. 296-306 - Seok-Hee Hong, Peter Eades:
A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. 307-317 - Peter Hui, Marcus Schaefer, Daniel Stefankovic:
Train Tracks and Confluent Drawings. 318-328 - Matthew Kitching, Sue Whitesides:
The Three Dimensional Logic Engine. 329-339 - Jan Kyncl, János Pach, Géza Tóth:
Long Alternating Paths in Bicolored Point Sets. 340-348 - Adam Marcus, Gábor Tardos:
Intersection Reverse Sequences and Geometric Applications. 349-359 - Matthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto:
New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. 360-370 - Serguei Norine:
Drawing Pfaffian Graphs. 371-376 - Charalampos Papamanthou, Ioannis G. Tollis, Martin Doerr:
3D Visualization of Semantic Metadata Models and Ontologies. 377-388 - Maurizio Patrignani:
A Note on the Self-similarity of Some Orthogonal Drawings. 389-394 - Attila Pór, David R. Wood:
No-Three-in-Line-in-3D. 395-402 - Marcus Raitner:
Visual Navigation of Compound Graphs. 403-413 - Lubomir Torok, Imrich Vrto:
Layout Volumes of the Hypercube. 414-424 - Huaming Zhang, Xin He:
New Theoretical Bounds of Visibility Representation of Plane Graphs. 425-430
Software Demonstrations
- James Abello, Stephen G. Kobourov, Roman Yusufov:
Visualizing Large Graphs with Compound-Fisheye Views and Treemaps. 431-441 - Ugur Dogrusöz, Erhan Giral, Ahmet Cetintas, Ali Civril, Emek Demir:
A Compound Graph Layout Algorithm for Biological Pathways. 442-447 - Benjamin Finkel, Roberto Tamassia:
Curvilinear Graph Drawing Using the Force-Directed Method. 448-453 - David Forrester, Stephen G. Kobourov, Armand Navabi, Kevin Wampler, Gary V. Yee:
Graphael: A System for Generalized Force-Directed Layouts. 454-464 - Paul Holleis, Franz-Josef Brandenburg:
QUOGGLES: Query On Graphs - A Graphical Largely Extensible System. 465-470 - Seok-Hee Hong, Tom Murtagh:
Visualisation of Large and Complex Networks Using PolyPlane. 471-481 - Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nascimento:
The Metro Map Layout Problem. 482-491 - Stephen G. Kobourov, Chandan Pitta:
An Interactive Multi-user System for Simultaneous Graph Drawing. 492-501
Posters
- Christian Bachmaier, Franz-Josef Brandenburg, Michael Forster, Paul Holleis, Marcus Raitner:
Gravisto: Graph Visualization Toolkit. 502-503 - Yanga Byun, Kyungsook Han:
DNA Secondary Structures for Probe Design. 504-507 - Marcus Raitner:
Open Problems Wiki. 508-509 - Georg Sander, Adrian Vasiliu:
Visualization and ILOG CPLEX. 510-511
Graph Drawing Contest
- Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov:
Graph-Drawing Contest Report. 512-516
Invited Talk
- Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. 517-533
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-30 20:19 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:
