Active Bibliography

13 Multi-Dimensional Orthogonal Graph Drawing with Small Boxes – David R. Wood - 1999
4 Balanced Vertex-Orderings of Graphs – Therese Biedl , Timothy Chan, Yashar Ganjali, MohammadTaghi Hajiaghayi, David R. Wood - 2002
Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity
2 Where to Draw the Line – Ashim Garg - 1996
1 Efficient Algorithms for Drawing Planar Graphs – Md. Saidur Rahman - 1999
31 On Linear Layouts of Graphs – Vida Dujmovic, David R. Wood - 2004
4 A Note on Computing a Maximal Planar Subgraph using PQ-Trees – Michael Jünger, Sebastian Leipert, Petra Mutzel - 1998
1 Angewandte Mathematik und Informatik Universit at zu K oln – Report No, Using Pq-trees, Sebastian Leipert, Michael Junger, Michael Junger, Petra Mutzel, Petra Mutzel - 1998
81 Upward Planarity Testing – Ashim Garg, Roberto Tamassia - 1995
Aspects combinatoires et . . . – Florent Foucaud - 2012
3 Graph and Network Algorithms – Samir Khuller, Balaji Raghavachari - 1996
Hamiltonian Cycles in Sparse Graphs – Alexander Hertel - 2004
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
Scheduling Algorithms for . . . – Subramanian Ramanathan - 1992
1 On the Phase Transitions of Graph Coloring and Independent Sets – Valmir C. Barbosa, Rubens G. Ferreira - 2002
16 Algorithms for Area-Efficient Orthogonal Drawings – Achilleas Papakostas, Ioannis G. Tollis - 1996
61 A Better Heuristic for Orthogonal Graph Drawings – Therese Biedl, Goos Kant - 1998
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004