|
25
|
Three-Dimensional Orthogonal Graph Drawing
– David R. Wood
- 2000
|
|
2
|
Where to Draw the Line
– Ashim Garg
- 1996
|
|
10
|
Inserting an Edge Into a Planar Graph
– Carsten Gutwenger, Petra Mutzel, René Weiskircher
- 2000
|
|
24
|
Algorithms for Drawing Clustered Graphs
– Qingwen Feng
- 1997
|
|
7
|
An Approach for Mixed Upward Planarization
– Markus Eiglsperger, Frank Eppinger, Michael Kaufmann
- 2003
|
|
|
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming
– Petra Mutzel, René Weiskircher
- 2004
|
|
5
|
Computing Orthogonal Drawings in a Variable Embedding Setting
– Walter Didimo, Giuseppe Liotta
- 1998
|
|
|
Optimal Crossing Minimization . . .
– Dietmar Ebner
- 2005
|
|
|
Drawing Clustered Graphs on an Orthogonal Grid (Extended Abstract)
– Peter Eades, Qingwen Feng
- 1997
|
|
2
|
Minimum depth graph embedding
– Maurizio Pizzonia, Roberto Tamassia
- 2000
|
|
|
Upward Planar Drawings . . .
– Walter Didimo
- 2006
|
|
6
|
An Experimental Comparison of Orthogonal Compaction Algorithms
– Gunnar W. Klau, Karsten Klein, Petra Mutzel
- 2000
|
|
13
|
Multi-Dimensional Orthogonal Graph Drawing with Small Boxes
– David R. Wood
- 1999
|
|
|
Communicated by:
– Sabine Cornelsen, Andreas Karrenbauer, M. Van Kreveld, B. Speckmann
- 2012
|
|
14
|
Turn-regularity and optimal area drawings of orthogonal representations
– Stina S. Bridgeman , Giuseppe Di Battista, Giuseppe Liotta, Walter Didimo , Roberto Tamassia, Luca Vismara
- 2000
|
|
15
|
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract)
– Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu
- 1995
|
|
2
|
GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends
– Walter Didimo, Antonio Leonforte
- 1998
|
|
22
|
Parallel transitive closure and point location in planar structures
– Roberto Tamassia, Jeffrey, S. Vitter
- 1991
|
|
1
|
Automatic Layout and Labelling of State Diagrams
– Gunnar W. Klau, Petra Mutzel
- 2003
|
