The Open Graph Drawing Framework (OGDF)

Cluster Layout Planarity testing Booth/Lueker and Boyer/Myrvold Cluster (Feng et al.) Upward (Bertolazzi et al.) Customizable planarization method Edge insertion (fixed & variable embedding) Crossing Minimization optimal, minor-monotone, simultaneous Orthogonal layout Compaction (constructive + improvement) Customizable Sugiyama layout Energy-based layout (FM, ...) Tree-, Circular-, Balloon-layout, ...

[1]  Markus Chimani,et al.  Layer-free upward crossing minimization , 2008, JEAL.

[2]  Ioannis G. Tollis,et al.  Constrained Visibility Representations of Graphs , 1992, Inf. Process. Lett..

[3]  F. Leighton,et al.  Drawing Planar Graphs Using the Canonical Ordering , 1996 .

[4]  Markus Chimani,et al.  Non-planar core reduction of graphs , 2009, Discret. Math..

[5]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[6]  Ronald L. Graham,et al.  Optimal scheduling for two-processor systems , 1972, Acta Informatica.

[7]  Michael Jünger,et al.  Drawing rooted trees in linear time , 2006 .

[8]  Michael Jünger,et al.  The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization , 2000, Softw. Pract. Exp..

[9]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[10]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[11]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[12]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[13]  Petra Mutzel,et al.  Planar Biconnectivity Augmentation with Fixed Embedding , 2009, IWOCA.

[14]  Karsten Klein,et al.  Computing Maximum C-Planar Subgraphs , 2009, GD.

[15]  Petra Mutzel,et al.  A new approximation algorithm for the planar augmentation problem , 1998, SODA '98.

[16]  Michael Jünger,et al.  Exact Crossing Minimization , 2005, GD.

[17]  Carsten Gutwenger,et al.  Application of SPQR-trees in the planarization approach for drawing graphs , 2010 .

[18]  Markus Chimani,et al.  Computing crossing numbers , 2009 .

[19]  Petra Mutzel,et al.  AGD-Library: A Library of Algorithms for Graph Drawing , 1997 .

[20]  R. Tamassia,et al.  Upward planarity testing , 1995 .

[21]  Petra Mutzel,et al.  Optimal Compaction of Orthogonal Grid Drawings , 1999, IPCO.

[22]  Xuemin Lin,et al.  A heuristic for the feedback arc set problem , 1995, Australas. J Comb..

[23]  Markus Chimani,et al.  Upward Planarization Layout , 2009, J. Graph Algorithms Appl..

[24]  Walter Didimo,et al.  Planarization of Clustered Graphs , 2001, Graph Drawing.

[25]  Michael Forster,et al.  Applying Crossing Reduction Strategies to Layered Compound Graphs , 2002, GD.

[26]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[27]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[28]  Roberto Tamassia,et al.  On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.

[29]  Michael Jünger,et al.  A Fast Layout Algorithm for k-Level Graphs , 2000, Graph Drawing.

[30]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[31]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

[32]  Karsten Klein,et al.  An Experimental Evaluation of Multilevel Layout Methods , 2010, GD.

[33]  Georg Sander,et al.  Layout of compound directed graphs , 1996 .

[34]  John Q. Walker,et al.  A node‐positioning algorithm for general trees , 1990, Softw. Pract. Exp..

[35]  Michael Jünger,et al.  Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm , 2004, GD.

[36]  Petra Mutzel,et al.  On the Hardness and Approximability of Planar Biconnectivity Augmentation , 2009, COCOON.

[37]  Markus Chimani,et al.  A New Approach to Exact Crossing Minimization , 2008, ESA.

[38]  W. T. Tutte.  How to Draw a Graph , 1963 .

[39]  Petra Mutzel,et al.  Graph Embedding with Minimum Depth and Maximum External Face , 2003, GD.

[40]  Petra Mutzel,et al.  Inserting an Edge into a Planar Graph , 2001, SODA '01.

[41]  Roberto Tamassia,et al.  Incremental planarity testing , 1989, 30th Annual Symposium on Foundations of Computer Science.

[42]  Dorothea Wagner,et al.  Completely connected clustered graphs , 2006, J. Discrete Algorithms.

[43]  Markus Chimani,et al.  Experiments on exact crossing minimization using column generation , 2006, JEAL.

[44]  Robert E. Tarjan,et al.  Maintaining bridge-connected and biconnected components on-line , 1992, Algorithmica.

[45]  Michael Jünger,et al.  A note on computing a maximal planar subgraph using PQ-trees , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[46]  Michael Jünger,et al.  A branch-and-cut approach to the crossing number problem , 2008, Discret. Optim..

[47]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

[48]  Roberto Tamassia,et al.  Minimum Depth Graph Embedding , 2000, ESA.

[49]  Gunnar W. Klau,et al.  A Combinatorial Approach to Orthogonal Placement Problems , 2002, OR.

[50]  Michael Jünger,et al.  Drawing rooted trees in linear time , 2006, Softw. Pract. Exp..

[51]  Andreas Ludwig,et al.  A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.

[52]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[53]  J. van Leeuwen,et al.  Drawing Graphs , 2001, Lecture Notes in Computer Science.

[54]  Markus Eiglsperger,et al.  Caesar Automatic Layout of UML Class Diagrams , 2001, GD.

[55]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[56]  Petra Mutzel,et al.  Quasi-orthogonal drawing of planar graphs , 1998 .

[57]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[58]  M.N.S. Swamy,et al.  O(n2) algorithms for graph planarization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[59]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[60]  Michael Kaufmann,et al.  Drawing High Degree Graphs with Low Bend Numbers , 1995, GD.

[61]  Markus Chimani,et al.  Efficient Extraction of Multiple Kuratowski Subdivisions , 2007, GD.

[62]  Georg Sander.  Visualisierungstechniken für den Compilerbau , 1996, Ausgezeichnete Informatikdissertationen.

[63]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[64]  J. Hopcroft,et al.  Efficient algorithms for graph manipulation , 1971 .

[65]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[66]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[67]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[68]  Falk Schreiber,et al.  Visualisierung biochemischer Reaktionsnetze , 2001 .

[69]  Goos Kant,et al.  Planar Graph Augmentation Problems (Extended Abstract) , 1991, WADS.

[70]  Maurizio Patrignani,et al.  Planarity Testing and Embedding , 2013, Handbook of Graph Drawing and Visualization.

[71]  M. N. Shanmukha Swamy,et al.  O(n²) Algorithms for Graph Planarization , 1988, WG.

[72]  R. Kipp Martin.  Tutorial: COIN-OR: Software for the OR Community , 2010, Interfaces.