|
2
|
Where to Draw the Line
– Ashim Garg
- 1996
|
|
26
|
Optimal upward planarity testing of single-source digraphs
– Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, Roberto Tamassia
- 1998
|
|
14
|
Graph Drawing
– Roberto Tamassia
- 1997
|
|
24
|
Algorithms for Drawing Clustered Graphs
– Qingwen Feng
- 1997
|
|
71
|
On the Computational Complexity of Upward and Rectilinear Planarity Testing (Extended Abstract)
– Ashim Garg, R. Tamassia
- 1994
|
|
4
|
A parameterized algorithm for upward planarity testing
– Hubert Yan-chor Chan
- 2004
|
|
|
Upward Planar Drawings . . .
– Walter Didimo
- 2006
|
|
1
|
Building blocks of upward planar digraphs
– Patrick Healy, Karol Lynch
- 2005
|
|
13
|
Upward Planar Drawing of Single Source Acyclic Digraphs
– Michael D. Hutton
- 1990
|
|
13
|
Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract)
– Isabel F. Cruz, Ashim Garg
- 1995
|
|
3
|
Upward Embeddings and Orientations of Undirected Planar Graphs
– Walter Didimo, Maurizio Pizzonia
- 2001
|
|
444
|
A Framework for Dynamic Graph Drawing
– Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis
- 1992
|
|
|
Quasi-Upward Planarity (Extended Abstract)
– Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo
|
|
|
Algorithm and Experiments in Testing Planar . . .
– Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
- 2004
|
|
3
|
Fully Dynamic Planarity Testing with Applications
– Zvi Galil, et al.
|
|
10
|
Output-Sensitive Reporting of Disjoint Paths
– Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
- 1996
|
|
3
|
A linear algorithm for finding a maximal planar subgraph
– Hristo N. Djidjev
- 2006
|
|
12
|
I/O-Efficient Algorithms for Shortest Path Related Problems
– Norbert Ralf Zeh
- 2002
|
|
|
A Faster Algorithm for Torus Embedding
– Jennifer Roselynn Woodcock
- 2006
|
