Universität zu Köln

Journal Article

Barth, Wilhelm, Mutzel, Petra ORCID: 0000-0001-7621-971X and Jünger, Michael (2004). Simple and Efficient Bilayer Cross Counting (Journal Version). Journal of Graph Algorithms and Applications, 8 (21). pp. 179-194. Brown University.

Brandenburg, Franz J., Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1997). Algorithmen zum automatischen Zeichnen von Graphen. Informatik-Spektrum, 20 (4). pp. 199-207. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Chimani, Markus, Ebner, Dietmar, Gutwenger, Carsten, Klau, Gunnar W., Mutzel, Petra ORCID: 0000-0001-7621-971X and Weiskircher, René (2008). A branch-and-cut approach to the crossing number problem. Discrete optimization, 5 (2). pp. 373-388. Elsevier.

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1997). 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. Journal of Graph Algorithms and Applications, 1. pp. 1-25. Brown Univ..

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (2001). Automatisches Layout von Diagrammen. OR news : das Magazin der GOR, 5 (12). pp. 5-12. Gesellschaft für Operations Research.

Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X, Odenthal, Thomas and Scharbrodt, Mark (1998). The thickness of a minor-excluded class of graphs. Discrete Mathematics, 182 (1-3). pp. 169-176. Elsevier.

Mehlhorn, Kurt and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm. Algorithmica, 16 (2). pp. 233-242. Springer.

Simone, Caterina De, Diehl, Martin, Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X, Reinelt, Gerhard and Rinaldi, Giovanni (1995). Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm. Journal of statistical physics, 80 (1-2). pp. 487-496. Springer.

Book Section, Proceedings Item or annotation in a legal commentary

Barth, Wilhelm, Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (2002). Simple and Efficient Bilayer Cross Counting. In: Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, pp. 331-360. Springer.

Bomze, Immanuel, Chimani, Markus, Jünger, Michael, Ljubic, Ivana, Mutzel, Petra ORCID: 0000-0001-7621-971X and Zey, Bernd (2011). Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. In: ISAAC 2010, Part I, pp. 427-439. Heidelberg: Springer-Verlag.

Fowler, J. Joseph, Gutwenger, Carsten, Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X and Schulz, Michael (2009). An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. In: Graph Drawing GD 2008, pp. 157-168. Springer-Verlag.

Gronemann, Martin ORCID: 0000-0003-2565-090X, Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X and Kriege, Nils (2013). MolMap - Visualizing Molecule Libraries as Topographic Maps. In: GRAPP & IVAPP 2013 : proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications ; Barcelona, Spain, 21 - 24 February, pp. 515-524. SciTePress.

Gutwenger, Carsten, Jünger, Michael, Klein, Karsten, Kupke, Joachim, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (2003). A New Approach for Visualizing UML Class Diagrams. In: SoftVis '03 : ACM Symposium on Software Visualization ; San Diego, California, USA, June 11 - 13, 2003, pp. 179-188. ACM.

Gutwenger, Carsten, Leipert, Sebastian, Mutzel, Petra ORCID: 0000-0001-7621-971X, Percan, Merijam, Jünger, Michael and Weiskircher, René (2003). Subgraph Induced Connectivity Augmentation. In: Graph-theoretic concepts in computer science : 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19 - 21, 2003 ; revised papers, pp. 261-272. Springer.

Gutwenger, Carsten, Leipert, Sebastian, Mutzel, Petra ORCID: 0000-0001-7621-971X, Percan, Merijam, Weiskircher, René and Jünger, Michael (2002). Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract). In: Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, pp. 220-336. Springer.

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1997). Pitfalls of using PQ-trees in Automatic Graph Drawing. In: Graph drawing : 5th international symposium, GD '97, Rome, Italy, September 18 - 20, 1997 ; proceedings, pp. 193-204. Springer.

Preprints, Working Papers or Reports

Christof, Thomas, Jünger, Michael, Kececioglu, John, Mutzel, Petra ORCID: 0000-0001-7621-971X and Reinelt, Gerhard (1997). A branch-and-cut approach to physical mapping with end-probes. ACM. Working Paper.

Jünger, Michael, Lee, Eva K., Mutzel, Petra ORCID: 0000-0001-7621-971X and Odenthal, Thomas (1997). A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1999). Level Planarity Testing in Linear Time (Full Version). Working Paper.

Jünger, Michael, Leipert, Sebastian and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). On Computing a Maximal Planar Subgraph using PQ-Trees. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1996). Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1995). The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. Springer. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Mutzel, Petra ORCID: 0000-0001-7621-971X (1993). Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut. IPCO Conference. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Mutzel, Petra ORCID: 0000-0001-7621-971X, Odenthal, Thomas and Scharbrodt, Mark (1994). The Thickness of Graphs without K5-Minors. ["eprint_fieldopt_monograph_type_preprint" not defined].

Mehlhorn, Kurt, Mutzel, Petra ORCID: 0000-0001-7621-971X and Näher, Stefan (1994). An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm. ["eprint_fieldopt_monograph_type_preprint" not defined].

Mutzel, Petra ORCID: 0000-0001-7621-971X (1992). A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test. ["eprint_fieldopt_monograph_type_preprint" not defined].

Other

Brandenburg, Franz J., Jünger, Michael, Marks, Joe, Mutzel, Petra ORCID: 0000-0001-7621-971X and Schreiber, Falk (1999). Graph-Drawing Contest Report. Springer.