Active Bibliography

Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity
59 Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs – Peter Eades, Qingwen Feng, Xuemin Lin, Hiroshi Nagamochi - 1999
5 Clustered Graphs and C-planarity – Qing-wen Feng, Peter Eades, Robert F. Cohen - 1995
3 Drawing Clustered Graphs on . . . – Peter Eades, Qingwen Feng, Hiroshi Nagamochi - 1999
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997
81 Multilevel Visualization of Clustered Graphs – Peter Eades, Qingwen Feng - 1997
21 Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs – Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov - 1998
1 Efficient Algorithms for Drawing Planar Graphs – Md. Saidur Rahman - 1999
1 Certifying Algorithms (A Paper under Construction) – Kurt Mehlhorn, Arno Eigenwillig, Kanela Kanegossi, Dieter Kratsch, Ross McConnel, Uli Meyer, Jeremy Spinrad - 2005
9 From Algorithms to Working Programs On the Use of Program Checking in LEDA – Kurt Mehlhorn, Stefan Näher - 1998
1 Graph Embedding with Topological Cycle-Constraints – Christoph Dornheim - 1999
Drawing Clustered Graphs on an Orthogonal Grid (Extended Abstract) – Peter Eades, Qingwen Feng - 1997
4 Orthogonal Grid Drawing of Clustered Graphs – Peter Eades, Qingwen Feng - 1996
36 A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs – Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov - 2000
28 A Fast Multi-Dimensional Algorithm for Drawing Large Graphs – Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov - 2000
PQ Trees, PC Trees, and Planar Graphs – Wen-Lian Hsu, Ross M. McConnell - 2001
5 A linear time algorithm for finding a maximal planar subgraph based on PC-trees – Wen-lian Hsu - 2005
3 I/O-Efficient Planar Separators and Applications – Norbert Zeh - 2001
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002