![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
GD 2001: Vienna, Austria
- Petra Mutzel
, Michael Jünger, Sebastian Leipert:
Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers. Lecture Notes in Computer Science 2265, Springer 2002, ISBN 3-540-43309-0
Hierarchical Drawing
- Vida Dujmovic, Michael R. Fellows, Michael T. Hallett
, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
:
A Fixed-Parameter Approach to Two-Layer Planarization. 1-15 - Patrick Healy, Nikola S. Nikolov:
How to Layer a Directed Acyclic Graph. 16-30 - Ulrik Brandes, Boris Köpf:
Fast and Simple Horizontal Coordinate Assignment. 31-44 - Janet M. Six, Ioannis G. Tollis:
Automated Visualization of Process Diagrams. 45-59
Planarity
- Giuseppe Di Battista, Walter Didimo, A. Marcandalli:
Planarization of Clustered Graphs. 60-74 - Keith Edwards, Graham Farr:
An Algorithm for Finding Large Induced Planar Subgraphs. 75-83 - Hubert de Fraysseix, Patrice Ossona de Mendez:
A Characterization of DFS Cotree Critical Graphs. 84-95
Crossing Theory
- Hristo N. Djidjev, Imrich Vrto:
An Improved Lower Bound for Crossing Numbers. 96-101 - Petr Hlinený:
Crossing-Critical Graphs and Path-Width. 102-114 - Xavier Muñoz
, Walter Unger, Imrich Vrto:
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. 115-123
Compaction
- Markus Eiglsperger, Michael Kaufmann:
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size. 124-138 - Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Labeling Heuristics for Orthogonal Drawings. 139-153
Planar Graphs
- János Pach, Gábor Tardos:
Untangling a Polygon. 154-161 - Christian A. Duncan, Alon Efrat
, Stephen G. Kobourov
, Carola Wenk:
Drawing with Fat Edges. 162-177
Symmetries
- Christoph Buchheim, Michael Jünger:
Detecting Symmetries by Branch & Cut. 178-188 - Seok-Hee Hong:
Drawing Graphs Symmetrically in Three Dimensions. 189-204
Interactive Drawing
- Hugo A. D. do Nascimento, Peter Eades:
User Hints for Directed Graph Drawing. 205-219 - Carsten Friedrich, Michael E. Houle:
Graph Drawing in Motion II. 220-231 - Stephen C. North, Gordon Woodhull:
Online Hierarchical Graph Drawing. 232-246
Representations
- János Pach, Géza Tóth:
Recognizing String Graphs Is Decidable. 247-260 - Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác:
On Intersection Graphs of Segments with Prescribed Slopes. 261-271
Aesthetics
- Eriola Kruja, Joe Marks, Ann Blair, Richard C. Waters:
A Short Note on the History of Graph Drawing. 272-286 - Jan Adamec, Jaroslav Nesetril:
Towards an Aesthetic Invariant for Graph Drawing. 287-296
D- and 3D-Embeddings
- Therese Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood
:
Orthogonal Drawings with Few Layers. 297-311 - David R. Wood
:
Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing. 312-327 - Stefan Felsner, Giuseppe Liotta, Stephen K. Wismath:
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. 328-342 - Robert Babilon, Jirí Matousek, Jana Maxová, Pavel Valtr:
Low-Distortion Embeddings of Trees. 343-351
Data Visualization
- M. Eduard Gröller:
Insight into Data through Visualization. 352-366
Floor-Planning
- Chien-Chih Liao, Hsueh-I Lu, Hsu-Chun Yen:
Floor-Planning via Orderly Spanning Trees. 367-377 - Karlis Freivalds
, Ugur Dogrusöz
, Paulis Kikusts:
Disconnected Graph Layout and the Polyomino Packing Approach. 378-391
Planar Drawings
- Md. Saidur Rahman
, Mahmuda Naznin
, Takao Nishizeki:
Orthogonal Drawings of Plane Graphs without Bends. 392-406 - Christian A. Duncan, Stephen G. Kobourov
:
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution. 407-421
Corrected Printing of GD 2000 Paper
- Joan P. Hutchinson:
On Polar Visibility Representations of Graphs (corrected version). 422-434
Software Exhibition
- David Auber:
Tulip. 435-437 - Georg Sander, Adrian Vasiliu:
The ILOG JViews Graph Layout Module. 438-439 - Emilio Di Giacomo
, Giuseppe Liotta:
WAVE. 440-441 - Tim Dwyer, Peter Eckersley:
WilmaScope - An Interactive 3D Graph Visualisation System. 442-443 - Gabriele Barbagallo, Andrea Carmignani, Giuseppe Di Battista, Walter Didimo, Maurizio Pizzonia:
Exploration and Visualization of Computer Networks: Polyphemus and Hermes. 444-445 - Claus Lewerentz, Frank Simon, Frank Steinbrückner:
CrocoCosmos. 446-447 - Stina S. Bridgeman, Roberto Tamassia:
The Graph Drawing Server. 448-450 - Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Drawing Database Schemas with DBdraw. 451-452 - Roland Wiese, Markus Eiglsperger, Michael Kaufmann:
yFiles: Visualization and Automatic Layout of Graphs. 453-454 - Franz-Josef Brandenburg, Michael Forster, Andreas Pick, Marcus Raitner, Falk Schreiber:
BioPath. 455-456 - François Bertault, Wendy Feng, Uli Fößmeier, Gabe Grigorescu, Brendan Madden:
Graph Visualization API Library for Application Builders. 457-458 - Jay S. Bagga, Adrian Heinz:
JGraph - A Java Based System for Drawing Graphs and Running Graph Algorithms. 459-460 - Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
:
Caesar Automatic Layout of UML Class Diagrams. 461-462 - Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler
, Boris Köpf, Jürgen Lerner, Dorothea Wagner:
Visone. 463-464 - Ulrich Lauther, Andreas Stübinger:
Generating Schematic Cable Plans Using Springembedder Methods. 465-466 - Holger Eichelberger:
SugiBib. 467-468 - Jean Delahousse, Pascal Auillans:
Knowledge Index Manager. 469-470 - Günter Hotz, Steffen Lohse:
Planarity Testing of Graphs on Base of a Spring Model. 471-472 - Carsten Gutwenger, Michael Jünger, Gunnar W. Klau
, Sebastian Leipert, Petra Mutzel
, René Weiskircher:
AGD: A Library of Algorithms for Graph Drawing. 473-474 - Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia:
Industrial Plant Drawer. 475-476 - Vladimir Batagelj, Andrej Mrvar
:
Pajek - Analysis and Visualization of Large Networks. 477-478 - Kathy Ryall:
GLIDE. 479-480 - Rodolfo Castelló, Rym Mili, Ioannis G. Tollis:
ViSta. 481-482 - John Ellson, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Gordon Woodhull:
Graphviz - Open Source Graph Drawing Tools. 483-484
Graph Exchange Formats
- Andreas Winter:
Exchanging Graphs with GXL. 485-500 - Ulrik Brandes, Markus Eiglsperger, Ivan Herman
, Michael Himsolt, M. Scott Marshall:
GraphML Progress Report. 501-512
Graph-Drawing Contest
- Therese Biedl, Franz-Josef Brandenburg:
Graph-Drawing Contest Report. 513-522
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.