Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 11.

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

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2001) A Fast Layout Algorithm for k-Level Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000, Colonial Williamsburg, VA, USA , pp. 229-240 (Official URL: http://dx.doi.org/10.1007/3-540-44541-2_22).

Mutzel, Petra and Gutwenger, Carsten and Brockenauer, Ralf and Fialko, Sergej and Klau, Gunnar W. and Krüger, Michael and Ziegler, Thomas and Näher, Stefan and Alberts, David and Ambras, Dirk and Koch, Gunter and Jünger, Michael and Buchheim, Christoph and Leipert, Sebastian (1998) A Library of Algorithms for Graph Drawing. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 456-457 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_44).

Buchheim, Christoph and Jünger, Michael (2004) An Integer Programming Approach to Fuzzy Symmetry Detection. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003, Perugia, Italy , pp. 166-177 (Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_16).

Buchheim, Christoph and Hong, Seok-Hee (2002) Crossing Minimization for Symmetries. In: 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), November 20-23, 2002, Vancouver, Canada , pp. 563-574 (Official URL: http://dx.doi.org/10.1007/3-540-36136-7_49).

Buchheim, Christoph and Hong, Seok-Hee (2005) Crossing Minimization for Symmetries. [Journal (Paginated)]

Buchheim, Christoph and Jünger, Michael (2002) Detecting Symmetries by Branch & Cut. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 178-188 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_15).

Buchheim, Christoph and Ebner, Dietmar and Jünger, Michael and Klau, Gunnar W. and Mutzel, Petra and Weiskircher, René (2006) Exact Crossing Minimization. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 37-48 (Official URL: http://dx.doi.org/10.1007/11618058_4).

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. [Preprint]

Buchheim, Christoph and Jünger, Michael and Leipert, Sebastian (2002) Improving Walker's Algorithm to Run in Linear Time. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 344-353 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_32).

Akkerman, Thorsten and Buchheim, Christoph and Jünger, Michael and Teske, Daniel (2004) On the complexity of drawing trees nicely: corrigendum. [Journal (Paginated)]

This list was generated on Wed Jul 23 04:05:05 2014 CEST.