Browse by Classification

Fowler, J. Joseph and Kobourov, Stephen G. (2008) Characterization of Unlabeled Level Planar Graphs. [Conference Paper]

Bachmaier, Christian and Brunner, Wolfgang and König, Christof (2008) Cyclic Level Planarity Testing and Embedding. [Conference Paper]

Fowler, J. Joseph and Kobourov, Stephen G. (2008) Minimum Level Nonplanar Patterns for Trees. [Conference Paper]

Harrigan, Martin and Healy, Patrick (2008) Practical Level Planarity Testing and Layout with Embedding Constraints. [Conference Paper]

Tsiaras, Vassilis and Triantafilou, Sofia and Tollis, Ioannis G. (2008) Treemaps for Directed Acyclic Graphs. [Conference Paper]

Hong, Seok-Hee and Nikolov, Nikola S. (2006) Hierarchical Layouts of Directed Graphs in Three Dimensions. [Conference Paper]

Suderman, Matthew (2006) Proper and Planar Drawings of Graphs on Three Layers. [Conference Paper]

Forster, Michael (2004) A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. [Conference Paper]

Eiglsperger, Markus and Siebenhaller, Martin and Kaufmann, Michael (2004) An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. [Conference Paper]

Nagamochi, Hiroshi (2004) An Improved Approximation to the One-Sided Bilayer Drawing. [Conference Paper]

Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2004) Confluent Layered Drawings. [Conference Paper]

Görg, Carsten and Birke, Peter and Pohl, Mathias and Diehl, Stephan (2004) Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs. [Conference Paper]

Suderman, Matthew and Whitesides, Sue (2004) Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. [Conference Paper]

Dujmovic, Vida and Fernau, Henning and Kaufmann, Michael (2004) Fixed Parameter Algorithms for one-sided crossing minimization Revisited. [Conference Paper]

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Suderman, Matthew (2004) Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. [Conference Paper]

Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. [Conference Paper]

Six, Janet M. and Tollis, Ioannis G. (2002) Automated Visualization of Process Diagrams. [Conference Paper]

Eschbach, Thomas and Günther, Wolfgang and Drechsler, Rolf and Becker, Bernd (2002) Crossing Reduction by Windows Optimization. [Conference Paper]

Brandes, Ulrik and Köpf, Boris (2002) Fast and Simple Horizontal Coordinate Assignment. [Conference Paper]

Healy, Patrick and Nikolov, Nikola S. (2002) How to Layer a Directed Acyclic Graph. [Conference Paper]

Jünger, Michael and Leipert, Sebastian (2002) Level Planar Embedding in linear Time. [Journal (On-line/Unpaginated)]

North, Stephen and Woodhull, Gordon (2002) Online Hierarchical Graph Drawing. [Conference Paper]

Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. [Preprint]

Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. [Conference Paper]

Baburin, Danil E. (2002) Some Modifications of Sugiyama Approach. [Conference Paper]

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs. [Conference Paper]

Waddle, Vance (2001) Graph Layout for Displaying Data Structures. [Conference Paper]

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (1999) A Fast Layout Algorithm for k-Level Graphs. [Preprint]

Waddle, Vance and Malhotra, Ashok (1999) An E log E Line Crossing Algorithm for Levelled Graphs. [Conference Paper]

Jünger, Michael and Leipert, Sebastian (1999) Level Planar Embedding in linear Time. [Preprint]

Jünger, Michael and Leipert, Sebastian (1999) Level Planar Embedding in Linear Time. [Conference Paper]

Shahrokhi, Farhad and Vrt'o, Imrich (1999) On 3-Layer Crossings and Pseudo Arrangements. [Conference Paper]

Chen, Ho-Lin and Yen, Hsu-Chun (1999) Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. [Conference Paper]

Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) An Algorithm for Labeling Edges of Hierarchical Drawings. [Conference Paper]

Lin, Xuemin and Eades, Peter (1998) Area Requirements for Drawing Hierarchically Planar Graphs. [Conference Paper]

Seemann, Jochen (1998) Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams. [Conference Paper]

Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S. (1998) Geometric Thickness of Complete Graphs. [Conference Paper]

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Level Planarity Testing in Linear Time. [Preprint]

Mutzel, Petra (1997) An Alternative Mathod to Crossing Minimization on Hierarchiocal Graphs (extended abstract). [Conference Paper]

Garg, Ashim and Tamassia, Roberto (1997) GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D. [Conference Paper]

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1997) Pitfalls of using PQ-Trees in Automatic Graph Drawing. [Preprint]

Eades, Peter and Feng, Qing-Wen and Lin, Xuemin (1997) Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. [Conference Paper]

Frick, Arne (1997) Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. [Conference Paper]

Jünger, Michael and Mutzel, Petra (1996) 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. [Preprint]

Sander, Georg (1996) A Fast Heuristic for Hierarchical Manhattan Layout. [Conference Paper]

Dodson, David (1996) COMAIDE: Information Visualization using Cooperative 3D Diagram Layout. [Conference Paper]

Jünger, Michael and Mutzel, Petra (1995) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. [Preprint]