- Burkay Genç, Ugur Dogrusöz
:
A Constrained, Force-Directed Layout Algorithm for Biological Pathways. GD 2003: 314-319 - Emilio Di Giacomo
:
Drawing Series-Parallel Graphs on Restricted Integer 3D Grids. GD 2003: 238-246 - Emilio Di Giacomo
, Walter Didimo:
Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves. GD 2003: 419-424 - Emilio Di Giacomo
, Henk Meijer:
Track Drawings of Graphs with Constant Queue Number. GD 2003: 214-225 - Carsten Gutwenger, Joachim Kupke, Karsten Klein, Sebastian Leipert:
GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration. GD 2003: 123-128 - Carsten Gutwenger, Petra Mutzel
:
An Experimental Study of Crossing Minimization Heuristics. GD 2003: 13-24 - Carsten Gutwenger, Petra Mutzel
:
Graph Embedding with Minimum Depth and Maximum External Face. GD 2003: 259-272 - Toru Hasunuma:
Laying Out Iterated Line Digraphs Using Queues. GD 2003: 202-213 - Guy-Vincent Jourdan, Ivan Rival, Nejib Zaguia:
Degree Navigator™: The Journey of a Visualization Software. GD 2003: 491-493 - Yehuda Koren, David Harel:
Axis-by-Axis Stress Minimization. GD 2003: 450-459 - Jan Kratochvíl, Martin Pergel:
Two Results on Intersection Graphs of Polygons. GD 2003: 59-70 - Colin Murray, Carsten Friedrich, Peter Eades:
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex. GD 2003: 494-495 - Hiroshi Nagamochi:
An Improved Approximation to the One-Sided Bilayer Drawing. GD 2003: 406-418 - Hiroshi Nagamochi, Katsutoshi Kuroya:
Convex Drawing for c-Planar Biconnected Clustered Graphs. GD 2003: 369-380 - Shin-Ichi Nakano, Takeaki Uno:
More Efficient Generation of Plane Triangulations. GD 2003: 273-282 - Andreas Noack:
An Energy Model for Visual Graph Clustering. GD 2003: 425-436 - János Pach, Géza Tóth:
How Many Ways Can One Draw a Graph? GD 2003: 47-58 - Md. Saidur Rahman
, Noritsugu Egi, Takao Nishizeki:
No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs. GD 2003: 387-392 - Georg Sander:
Layout of Directed Hypergraphs with Orthogonal Hyperedges. GD 2003: 381-386 - Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Bounds and Methods for k-Planar Crossing Numbers. GD 2003: 37-46 - Janet M. Six, Ioannis G. Tollis:
A Framework for User-Grouped Circular Drawings. GD 2003: 135-146 - Jan Stola:
3D Visibility Representations of Complete Graphs. GD 2003: 226-237 - Matthew Suderman, Sue Whitesides:
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. GD 2003: 345-356 - Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda:
The Puzzle Layout Problem. GD 2003: 500-501 - Éric Colin de Verdière, Francis Lazarus:
Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface. GD 2003: 478-490 - Report on the Invited Lecture by Pat Hanrahan, Titled "On Being in the Right Space". GD 2003: 514