|
|
Stop Minding Your P's and Q's: Simplified Planarity by Edge Addition
– John M. Boyer, Wendy Myrvold
- 2003
|
|
|
Correcting and Implementing the PC-tree Planarity Algorithm
– John M. Boyer, Cristina G. Fernandes , Alexandre Noma, Jose Coelho de Pina Jr.
|
|
|
Planarity Testing and Embedding
– Pier Francesco Cortese, Maurizio Patrignani
- 2004
|
|
17
|
On the cutting edge: Simplified O(n) planarity by edge addition
– John M. Boyer, Wendy J. Myrvold
- 2004
|
|
3
|
Simpler Projective Plane Embedding
– Wendy Myrvold, Jianping Roth
- 2000
|
|
1
|
Planarity Algorithms via PQ-Trees
– Bernhard Haeupler, Robert E. Tarjan
- 2008
|
|
3
|
Fully Dynamic Planarity Testing with Applications
– Zvi Galil, et al.
|
|
|
A Simpler and Faster Torus Embedding Algorithm
– Jennifer Roselynn Woodcock
|
|
|
A Faster Algorithm for Torus Embedding
– Jennifer Roselynn Woodcock
- 2006
|
|
9
|
Practical Toroidality Testing
– Eugene Neufeld, Wendy Myrvold
- 1996
|
|
4
|
Elimination of local bridges
– Martin Juvan, Bojan Mohar
- 1997
|
|
|
PQ Trees, PC Trees, and Planar Graphs
– Wen-Lian Hsu, Ross M. McConnell
- 2001
|
|
16
|
The Complexity of Planarity Testing
– Eric Allender, Meena Mahajan
- 2000
|
|
17
|
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem
– Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan
- 1993
|
|
2
|
Drawing Database Schemas
– Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
|
|
24
|
Algorithms for Drawing Clustered Graphs
– Qingwen Feng
- 1997
|
|
25
|
Three-Dimensional Orthogonal Graph Drawing
– David R. Wood
- 2000
|
|
5
|
Universal obstructions for embedding extension problems, submitted
– Bojan Mohar
|
|
4
|
Embedding a Graph Into the Torus in Linear Time
– Martin Juvan, Joze Marincek, Bojan Mohar
- 1994
|
