Subject: G.700 Layering
Number of records: 14.
Healy, Patrick and Nikolov, Nikola S. (2002) A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem. In Goodrich, Michael T. and Kobourov, Stephen G., Eds. Proceedings Graph Drawing, pages pp. 98-109, Irvine, CA, USA.
Dujmovic, Vida and Fellows, M. and Hallett, M. and Kitching, Matthew and Liotta, Giuseppe and McCartin, C. and Nishimura, N. and Ragde, P. and Rosamond, F. and Suderman, Matthew and Whitesides, Sue and Wood, David R. (2002) A Fixed-Parameter Approach to Two-Layer Planarization. In Mutzel, Petra and Jünger, Michael and Leipert, Sebastian, Eds. Proceedings Graph Drawing, pages pp. 1-15, Vienna, Austria.
Jünger, Michael and Lee, Eva K. and Mutzel, Petra and Odenthal, Thomas (1998) A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem (Extended Abstract). In DiBattista, Giuseppe, Eds. Proceedings Graph Drawing, pages pp. 13-24, 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.
Duncan, Christian A. and Goodrich, Michael T. and Kobourov, Stephen G. (1998) Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 111-124, Montréal, Canada.
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.
Jünger, Michael and Mutzel, Petra (1996) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. In Brandenburg, Franz J., Eds. Proceedings Graph Drawing, pages pp. 337-348, Passau, Germany.
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.
Günther, Wolfgang and Schönfeld, Robby and Becker, Bernd and Molitor, Paul (2001) k-Layer Straightline Crossing Minimization by Speeding Up Sifting. In Marks, Joe, Eds. Proceedings Graph Drawing, pages pp. 253-258, Colonial Williamsburg.
Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Level Planarity Testing in Linear Time
. In Whitesides, Sue H., Eds. Proceedings Graph Drawing, pages pp. 224-237, Montréal, Canada.
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.
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.
Matuszewski, Christian and Schönfeld, Robby and Molitor, Paul (1999) Using Sifting for k-Layer Straightline Crossing Minimization. In Kratochvíl, Jan, Eds. Proceedings Graph Drawing, pages pp. 217-224, Stirín Castle, Czech Republic.
This list was generated on Fri Jun 27 09:36:18 CEST 2008.
