|
5
|
Clustered Graphs and C-planarity
– Qing-wen Feng, Peter Eades, Robert F. Cohen
- 1995
|
|
|
Drawings and Independent Spanning Trees
– Kazuyuki Miura
- 2001
|
|
1
|
Efficient Algorithms for Drawing Planar Graphs
– Md. Saidur Rahman
- 1999
|
|
24
|
Algorithms for Drawing Clustered Graphs
– Qingwen Feng
- 1997
|
|
1
|
Planarity Algorithms via PQ-Trees
– Bernhard Haeupler, Robert E. Tarjan
- 2008
|
|
4
|
Elimination of local bridges
– Martin Juvan, Bojan Mohar
- 1997
|
|
10
|
Output-Sensitive Reporting of Disjoint Paths
– Giuseppe Di Battista, Roberto Tamassia, Luca Vismara
- 1996
|
|
3
|
I/O-Efficient Planar Separators and Applications
– Norbert Zeh
- 2001
|
|
|
Planarity Testing and Embedding
– Pier Francesco Cortese, Maurizio Patrignani
- 2004
|
|
17
|
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem
– Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan
- 1993
|
|
2
|
Where to Draw the Line
– Ashim Garg
- 1996
|
|
|
Optimal Crossing Minimization . . .
– Dietmar Ebner
- 2005
|
|
|
On the Volume and Resolution of 3-Dimensional Convex Graph Drawing (Extended Abstract)
– Marek Chrobak, Michael T. Goodrich, Roberto Tamassia
|
|
74
|
Upward Planarity Testing
– Ashim Garg, Roberto Tamassia
- 1995
|
|
2
|
Partitions of graphs into trees
– Therese Biedl, Franz J. Brandenburg
- 2007
|
|
4
|
Embedding a Graph Into the Torus in Linear Time
– Martin Juvan, Joze Marincek, Bojan Mohar
- 1994
|
|
5
|
Universal obstructions for embedding extension problems, submitted
– Bojan Mohar
|
|
14
|
Graph Drawing
– Roberto Tamassia
- 1997
|
|
|
Correcting and Implementing the PC-tree Planarity Algorithm
– John M. Boyer, Cristina G. Fernandes , Alexandre Noma, Jose Coelho de Pina Jr.
|
