Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 42.

Conference Paper

Gronemann, Martin and Jünger, Michael and Liers, Frauke and Mambelli, Francesco (2016) Crossing Minimization in Storyline Visualization. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 367-381(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_28).

Gronemann, Martin and Jünger, Michael (2013) Drawing Clustered Graphs as Topographic Maps. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 426-438(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Fowler, J. Joseph and Gutwenger, Carsten and Jünger, Michael and Mutzel, Petra and Schulz, Michael (2009) An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 157-168(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_16).

Estrella-Balderrama, Alejandro and Gassner, Elisabeth and Jünger, Michael and Percan, Merijam and Schaefer, Marcus and Schulz, Michael (2008) Simultaneous Geometric Graph Embeddings. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 280-290(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_28).

Hachul, Stefan and Jünger, Michael (2006) An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 235-250(Official URL: http://dx.doi.org/10.1007/11618058_22).

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 , pp. 37-48(Official URL: http://dx.doi.org/10.1007/11618058_4).

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 , pp. 166-177(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_16).

Hachul, Stefan and Jünger, Michael (2004) Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm (Extended Abstract). In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 285-295(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_29).

Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Leipert, Sebastian and Mutzel, Petra and Weiskircher, René (2002) AGD: A Library of Algorithms for Graph Drawing. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 473-474(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_52).

Gutwenger, Carsten and Jünger, Michael and Leipert, Sebastian and Mutzel, Petra and Percan, Merijam and Weiskircher, René (2002) Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 220-235(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_21).

Gutwenger, Carsten and Jünger, Michael and Klein, Karsten and Kupke, Joachim and Leipert, Sebastian and Mutzel, Petra (2002) Caesar Automatic Layout of UML Class Diagrams. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 461-462(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_46).

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

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 , pp. 344-353(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_32).

Barth, Wilhelm and Jünger, Michael and Mutzel, Petra (2002) Simple and Efficient Bilayer Cross Counting. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 130-141(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_13).

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 , pp. 229-240(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_22).

Brandenburg, Franz J. and Jünger, Michael and Marks, Joe and Mutzel, Petra and Schreiber, Falk (1999) Graph-Drawing Contest Report. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 400-409(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_41).

Jünger, Michael and Leipert, Sebastian (1999) Level Planar Embedding in Linear Time. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 72-81(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_7).

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 , pp. 456-457(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_44).

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: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 13-24(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_46).

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Level Planarity Testing in Linear Time. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 224-237(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_17).

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) Pitfalls of Using PQ-Trees in Automatic Graph Drawing. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 193-204(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_62).

Jünger, Michael and Mutzel, Petra (1996) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 337-348(Official URL: http://dx.doi.org/10.1007/BFb0021817).

Jünger, Michael and Mutzel, Petra (1995) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 119-130(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_363).

Journal (On-line/Unpaginated)

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

Journal (Paginated)

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

Preprint

Gronemann, Martin and Jünger, Michael (2012) Drawing Clustered Graphs as Topographic Maps. [Preprint]

Gronemann, Martin and Jünger, Michael (2012) Drawing Clustered Graphs as Topographic Maps. [Preprint]

Gutwenger, Carsten and Jünger, Michael and Leipert, Sebastian and Mutzel, Petra and Percan, Merijam and Weiskircher, René (2002) Advances in C-Planarity Testing of Clustered Graphs. [Preprint]

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

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

Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Leipert, Sebastian and Mutzel, Petra (2000) Graph Drawing Algorithm Engineering with AGD. [Preprint]

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

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

Jünger, Michael and Leipert, Sebastian and Mutzel, Petra (1998) A Note on Computing a Maximal Planar Subgraph using PQ-Trees. [Preprint]

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

Brandenburg, Franz J. and Jünger, Michael and Mutzel, Petra (1997) Algorithmen zum automatischen Zeichnen von Graphen. [Preprint]

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

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

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

Jünger, Michael and Mutzel, Petra (1994) The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. [Preprint]

Jünger, Michael and Mutzel, Petra (1993) Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. [Preprint]

Jünger, Michael and Mutzel, Petra (1993) Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut. [Preprint]

This list was generated on Sat Jul 11 17:22:48 2020 CEST.