Subject: P.480 Layered
Number of records: 47.
Jünger, Michael and Mutzel, Petra (1996) 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.
Forster, Michael (2004) A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 206-216, New York.
Sander, Georg (1996) A Fast Heuristic for Hierarchical Manhattan Layout. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 447-458, Passau, Germany.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (1999) A Fast Layout Algorithm for k-Level Graphs.
Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 229-240, Colonial Williamsburg.
Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1998) An Algorithm for Labeling Edges of Hierarchical Drawings. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 169-180, Rome, Italy.
Mutzel, Petra (1997) An Alternative Mathod to Crossing Minimization on Hierarchiocal Graphs (extended abstract). In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 318-333, Berkeley, California, USA.
Waddle, Vance and Malhotra, Ashok (1999) An E log E Line Crossing Algorithm for Levelled Graphs. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 59-71, Stirín Castle, Czech Republic.
Eiglsperger, Markus and Siebenhaller, Martin and Kaufmann, Michael (2004) An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 155-166, New York.
Nagamochi, Hiroshi (2004) An Improved Approximation to the One-Sided Bilayer Drawing. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 406-418, Perugia.
Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 276-284, Irvine, CA, USA.
Lin, Xuemin and Eades, Peter (1998) Area Requirements for Drawing Hierarchically Planar Graphs. In Di Battista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 219-229, Rome, Italy.
Six, Janet M. and Tollis, Ioannis G. (2002) Automated Visualization of Process Diagrams. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 44-59, Vienna, Austria.
Fowler, J. Joseph and Kobourov, Stephen G. (2008) Characterization of Unlabeled Level Planar Graphs. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 37-49, Sidney, Australia.
Dodson, David (1996) COMAIDE: Information Visualization using Cooperative 3D Diagram Layout. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 190-201, Passau, Germany.
Eppstein, David and Goodrich, Michael T. and Meng, Jeremy Yu (2004) Confluent Layered Drawings. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 184-194, New York.
Eschbach, Thomas and Günther, Wolfgang and Drechsler, Rolf and Becker, Bernd (2002) Crossing Reduction by Windows Optimization. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 285-294, Irvine, CA, USA.
Bachmaier, Christian and Brunner, Wolfgang and König, Christof (2008) Cyclic Level Planarity Testing and Embedding. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 50-61, Sidney, Australia.
Görg, Carsten and Birke, Peter and Pohl, Mathias and Diehl, Stephan (2004) Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 228-238, New York.
Jünger, Michael and Mutzel, Petra (1995) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.
Suderman, Matthew and Whitesides, Sue (2004) Experiments with the Fixed-Parameter Approach for Two-Layer Planarization. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 345-356, Perugia.
Seemann, Jochen (1998) Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams. In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 415-424, Rome, Italy.
Brandes, Ulrik and Köpf, Boris (2002) Fast and Simple Horizontal Coordinate Assignment. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 31-44, Vienna, Austria.
Dujmovic, Vida and Fernau, Henning and Kaufmann, Michael (2004) Fixed Parameter Algorithms for one-sided crossing minimization Revisited. In Liotta, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 332-344, Perugia.
Dillencourt, Michael B. and Eppstein, David and Hirschberg, Daniel S. (1998) Geometric Thickness of Complete Graphs. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 102-110, Montréal, Canada.
Garg, Ashim and Tamassia, Roberto (1997) GIOTTO3D: A System for Visualizing Hierarchical Structures in 3D. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 193-200, Berkeley, California, USA.
Waddle, Vance (2001) Graph Layout for Displaying Data Structures. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 241-252, Colonial Williamsburg.
Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Suderman, Matthew (2004) Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem. In Pach, János, Eds. Proceedings Graph Drawing, pages pp. 262-272, New York.
Hong, Seok-Hee and Nikolov, Nikola S. (2006) Hierarchical Layouts of Directed Graphs in Three Dimensions. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 251-261, Limerick, Ireland.
Healy, Patrick and Nikolov, Nikola S. (2002) How to Layer a Directed Acyclic Graph. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 16-30, Vienna, Austria.
Jünger, Michael and Leipert, Sebastian (1999) Level Planar Embedding in linear Time.
Jünger, Michael and Leipert, Sebastian (1999) Level Planar Embedding in Linear Time. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 72-81, Stirín Castle, Czech Republic.
Jünger, Michael and Leipert, Sebastian (2002) Level Planar Embedding in linear Time. Journal of Graph Algorithms and Applications 6(1).
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Level Planarity Testing in Linear Time.
Fowler, J. Joseph and Kobourov, Stephen G. (2008) Minimum Level Nonplanar Patterns for Trees. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 69-75, Sidney, Australia.
Shahrokhi, Farhad and Vrt'o, Imrich (1999) On 3-Layer Crossings and Pseudo Arrangements. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 225-231, Stirín Castle, Czech Republic.
North, Stephen and Woodhull, Gordon (2002) Online Hierarchical Graph Drawing. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 232-246, Vienna, Austria.
Chen, Ho-Lin and Yen, Hsu-Chun (1999) Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 416-417, Stirín Castle, Czech Republic.
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1997) Pitfalls of using PQ-Trees in Automatic Graph Drawing.
Harrigan, Martin and Healy, Patrick (2008) Practical Level Planarity Testing and Layout with Embedding Constraints. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 62-68, Sidney, Australia.
Suderman, Matthew (2006) Proper and Planar Drawings of Graphs on Three Layers. In Healy, Patrick and Nikolov, Nikola S., Eds. Proceedings Graph Drawing, pages pp. 434-445, Limerick, Ireland.
Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting.
Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 130-141, Irvine, CA, USA.
Baburin, Danil E. (2002) Some Modifications of Sugiyama Approach. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 366-367, Irvine, CA, USA.
Eades, Peter and Feng, Qing-Wen and Lin, Xuemin (1997) Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 113-128, Berkeley, California, USA.
Tsiaras, Vassilis and Triantafilou, Sofia and Tollis, Ioannis G. (2008) Treemaps for Directed Acyclic Graphs. In Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu, Eds. Proceedings Graph Drawing, pages pp. 377-388, Sidney, Australia.
Frick, Arne (1997) Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm. In North, Stephen, Eds. Proceedings Graph Drawing, pages pp. 169-183, Berkeley, California, USA.
This list was generated on Fri Jun 27 09:36:47 CEST 2008.
