Universität zu Köln

Akkerman, Thorsten, Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael and Teske, Daniel (2004). On the Complexity of Drawing Trees Nicely: Corrigendum. Acta Informatica, 40 (8). pp. 603-607. Springer.

Althaus, Ernst, Bockmayr, Alexander, Elf, Matthias, Kasper, Thomas, Jünger, Michael and Mehlhorn, Kurt (2002). SCIL - Symbolic Constraints in Integer Linear Programming. In: Algorithms - ESA 2002 : 10th annual European symposium, Rome, Italy, September 17 - 21, 2002 ; proceedings, pp. 75-87. Springer.

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.

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.

Behle, Markus, Jünger, Michael and Liers, Frauke (2007). A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. In: Experimental algorithms : 6th international workshop ; proceedings / WEA 2007, Rome, Italy, June 6 - 8, pp. 379-392. 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.

Bonato, Thorsten, Jünger, Michael, Reinelt, Gerhard and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (2013). Lifting and Separation Procedures for the Cut Polytope. Mathematical Programming A. Springer.

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

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 and Jünger, Michael (2004). An Integer Programming Approach to Fuzzy Symmetry Detection. In: Graph drawing 11th International Symposium, GD 2003, Perugia, Italy, September 21 - 24, 2003 ; revised papers, pp. 166-177. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X and Jünger, Michael (2005). Linear Optimization over Permutation Groups. Discrete Optimization, 2 (4). pp. 308-319. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Kandyba, Maria, Percan, Merijam and Schulz, Michael (2007). Planarization With Fixed Subgraph Embedding. Working Paper.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael and Leipert, Sebastian (2001). A Fast Layout Algorithm for k-Level Graphs. Springer.

Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Percan, Merijam, Schulz, Michael and Thelen, Christina (2007). Drawing cycles in networks. Working Paper.

Cacchiani, Valentina, Jünger, Michael, Liers, Frauke, Lodi, Andrea and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2014). Single-Commodity Robust Network Design with Finite and Hose Demand Sets. Working Paper.

Chimani, Markus, Jünger, Michael and Schulz, Michael (2008). Crossing Minimization meets Simultaneous Drawing. In: Proceedings : IEEE Pacific Visualisation Symposium 2008 ; Kyoto, Japan, 5 - 7 March 2008, pp. 33-40. IEEE.

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.

Elf, Matthias, Jünger, Michael and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (2003). Minimizing Breaks by Maximizing Cuts. Operations Research Letters, 31 (5). pp. 343-349. Elsevier Science.

Estrella-Balderrama, Alejandro, Gassner, Elisabeth, Jünger, Michael, Percan, Merijam, Schaefer, Marcus and Schulz, Michael (2008). Simultaneous Geometric Graph Embeddings. In: Graph drawing : 15th international symposium, GD 2007, Sydney, Australia, September 24 - 26, 2007 ; revised papers, pp. 280-290. Springer.

Feld, Dustin, Jünger, Michael, Mallach, Sven ORCID: 0000-0001-5335-0678 and Soddemann, Thomas (2014). Hardware-Aware Automatic Code-Transformation to Support Compilers in Exploiting the Multi-Level Parallel Potential of Modern CPUs. In: Proceedings of the 2015 International Workshop on Code Optimisation for Multi and Many Cores (COSMIC), 2:1-2:10. ACM.

Feld, Dustin, Soddemann, Thomas, Jünger, Michael and Mallach, Sven ORCID: 0000-0001-5335-0678 (2013). Facilitate SIMD-Code-Generation in the Polyhedral Model by Hardware-aware Automatic Code-Transformation. In: Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques, pp. 45-54.

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.

Fowler, J. Joseph, Jünger, Michael, Kobourov, Stephen G. and Schulz, Michael (2008). Characterizations of Restricted Pairs of Planar Graphs allowing Simultaneous Embeddings with Fixed Edges. In: Workshop on Graph-Theoretic Concepts in Computer Science 2008, pp. 146-158. Springer.

Fowler, J. Joseph, Jünger, Michael, Kobourov, Stephen G. and Schulz, Michael (2008). Characterizing Simultaneous Embeddings with Fixed Edges. Electronic Notes in Discrete Mathematics, 31. pp. 41-44. Elsevier.

Gassner, Elisabeth, Jünger, Michael, Percan, Merijam, Schaefer, Marcus and Schulz, Michael (2006). Simultaneous Graph Embeddings with Fixed Edges. In: Graph-theoretic concepts in computer science : 32nd international workshop, WG 2006, Bergen, Norway, June 22 - 24, 2006 ; revised papers, pp. 325-335. Springer.

Gronemann, Martin ORCID: 0000-0003-2565-090X and Jünger, Michael (2013). Drawing Clustered Graphs as Topographic Maps. In: Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers, pp. 426-438. Springer.

Gronemann, Martin ORCID: 0000-0003-2565-090X, Jünger, Michael, Mallach, Sven ORCID: 0000-0001-5335-0678 and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2011). Towards shortest longest edges in orthogonal graph drawing. ["eprint_fieldopt_monograph_type_preprint" not defined].

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.

Hachul, Stefan and Jünger, Michael (2004). Drawing Large Graphs with a Potential -Field-Based Multilevel Algorithm. In: Graph drawing: 12th international symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004; revised selected papers, pp. 285-295. Springer.

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, Limerick, Ireland, September 12 - 14, 2005 ; revised papers, Springer.

Hachul, Stefan and Jünger, Michael (2007). Large-Graph Layout Algorithms at Work: An Experimental Study. Journal of Graph Algorithms and Applications, 11 (21). pp. 345-369.

Hachul, Stefan and Jünger, Michael (2005). Large-Graph Layout with the Fast Multipole Multilevel Method. Working Paper.

Hachul, Stefan and Jünger, Michael (2006). A Provably Fast Multipole Method. Working Paper.

Jünger, Michael and Kaibel, Volker (1996). A Basic Study of the QAP-Polytope. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Kaibel, Volker (2001). Box-Inequalities for Quadratic Assignment Polytopes. Mathematical Programming : Series A, 91 (1). pp. 175-197. Springer.

Jünger, Michael and Kaibel, Volker (2000). On the SQAP-Polytope. SIAM Journal on Optimization, 11 (2). pp. 444-463. SIAM.

Jünger, Michael and Kaibel, Volker (2001). The QAP-Polytope and the Star-Transformation. Discrete Applied Mathematics, 111 (3). pp. 283-306. Elsevier.

Jünger, Michael, Kaibel, Volker and Thienel, Stefan (1994). Computing Delaunay-Triangulations in Manhatten and Maximum Metric. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Kaibel, Volker and Thienel, Stefan (1994). A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric. ["eprint_fieldopt_monograph_type_preprint" not defined].

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 and Leipert, Sebastian (2002). Level Planar Embedding in Linear Time (Full Version). Journal of Graph Algorithms and Applications, 6 (1). pp. 67-113. Brown University.

Jünger, Michael and Leipert, Sebastian (1999). Level Planar Embedding in linear Time (Extended Abstract). 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, 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.

Jünger, Michael, Leipert, Sebastian and Percan, Merijam (2002). Triangulating Clustered Graphs. Working Paper.

Jünger, Michael and Mallach, Sven ORCID: 0000-0001-5335-0678 (2019). Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. In: Lipics, 63:1-63:13. Dagstuhl Publishing.

Jünger, Michael and Mallach, Sven ORCID: 0000-0001-5335-0678 (2013). Solving the Simple Offset Assignment Problem as a Traveling Salesman. In: M-SCOPES '13: Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems, pp. 31-39. ACM.

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 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].

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.

Jünger, Michael and Reinelt, Gerhard (2001). Combinatorial Optimization and Integer Programming. Oxford: Eolss Publishers.

Jünger, Michael, Reinelt, Gerhard ORCID: 0000-0002-7193-501X and Rinaldi, Giovanni (1995). The Traveling Salesman Problem. Elsevier. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Reinelt, Gerhard and Thienel, Stefan (1995). Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization. American Math. Soc. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael, Reinelt, Gerhard ORCID: 0000-0002-7193-501X and Thienel, Stefan (1994). Provably good solutions for the traveling salesman problem. Physica-Verl.. ["eprint_fieldopt_monograph_type_preprint" not defined].

Jünger, Michael and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (1998). Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States. Springer.

Jünger, Michael, Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 and Thienel, Stefan (2000). Practical Performance of Efficient Minimum Cut Algorithms. Algorithmica, 26 (1). pp. 172-195. Springer.

Jünger, Michael and Schulz, Michael (2009). Intersection Graphs in Simultaneous Embedding with Fixed Edges. Journal of Graph Algorithms and Applications, 13 (2). pp. 205-218. Brown University.

Jünger, Michael, Schulz, Michael and Zychowicz, Wojciech (2009). GEODUAL: Fun with Geometric Duality. Working Paper.

Jünger, Michael and Thienel, Stefan (1998). Introduction to ABACUS - A branch-and-cut System. Operations Research Letters, 22 (2-3). pp. 83-95. Elsevier.

Katzgraber, Helmut G., Liers, Frauke, Hartmann, Alexander K., Körner, Mathias, Hartmann, Alexander K. and Jünger, Michael (2005). Universality-class dependence of energy distributions in spin glasses. Physical Review B, 72 (9). 094421. APS.

Liers, Frauke, Palassini, Matteo, Hartmann, Alexander K. and Jünger, Michael (2003). Ground state of the Bethe lattice spin glass and running time of an exact optimization algorithm. Physical Review B, 68 (9). 094406. American Physical Society.

Palassini, Matteo, Liers, Frauke, Jünger, Michael and Young, A. Peter (2003). Low Energy Excitations in Spin Glasses from Exact Ground States. Physical Review B, 68 (6). 064413. American Physical Society.

Rieger, Heiko, Santen, Ludger, Blasum, Ulrich, Diehl, Martin, Jünger, Michael and Rinaldi, Giovanni ORCID: 0000-0003-0148-2470 (1996). The critical exponents of the two-dimensional Ising spin glass revisited: Exact Ground State Calculations and Monte Carlo Simulations. Journal of physics : A, Mathematical and general, 29 (14). pp. 3939-3950. IOP Publ..

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.

Simone, Caterina De and Jünger, Michael (1997). On the Two-Connected Planar Spanning Subgraph Polytope. Discrete Applied Mathematics, 80 (2-3). pp. 223-229. Elsevier Science.

Störmer, Peter and Jünger, Michael (1995). Solving large-scale traveling salesman problems with parallel Branch-and-Cut. ["eprint_fieldopt_monograph_type_preprint" not defined].

Álvarez-Miranda, Eduardo, Liers, Frauke, Lodi, Andrea, Parriani, Tiziano, Schmidt, Daniel R. ORCID: 0000-0001-7381-912X, Cacchiani, Valentina, Dorneth, Tim and Jünger, Michael (2012). Models and Algorithms for Robust Network Design with Several Traffic Scenarios. In: Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, pp. 261-272. Springer-Verlag.