A Cutting Plane Algorithm for the Linear Ordering Problem. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Oper. Res., 1984)

On partitioning the edges of graphs into connected subgraphs. - Michael Jünger; Gerhard Reinelt; William R. Pulleyblank (J. Graph Theory, 1985)

On the acyclic subgraph polytope. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Math. Program., 1985)

Facets of the linear ordering polytope. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (Math. Program., 1985)

Polyhedral combinatorics and the acyclic subdigraph problem. - Michael Jünger (Heldermann, 1985)

Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra. - Reinhardt Euler; Michael Jünger; Gerhard Reinelt (Math. Oper. Res., 1987)

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. - Francisco Barahona; Martin Grötschel; Michael Jünger; Gerhard Reinelt (Oper. Res., 1988)

Experiments in quadratic 0-1 programming. - Francisco Barahona; Michael Jünger; Gerhard Reinelt (Math. Program., 1989)

Computing the Convex Hull in the Euclidean Plane in Linear Expected Time. - Karl Heinz Borgwardt; Norbert Gaffke; Michael Jünger; Gerhard Reinelt (Applied Geometry And Discrete Mathematics, 1990)

Computing correct Delaunay triangulations. - Michael Jünger; Gerhard Reinelt; Doris Zepf (Computing, 1991)

Optimal control of plotting and drilling machines: A case study. - Martin Grötschel; Michael Jünger; Gerhard Reinelt (ZOR Methods Model. Oper. Res., 1991)

A complete description of the traveling salesman polytope on 8 nodes. - Thomas Christof; Michael Jünger; Gerhard Reinelt (Oper. Res. Lett., 1991)

Practical problem solving with cutting plane algorithms in combinatorialoptimization. - Michael Jünger; Gerhard Reinelt; Stefan Thienel (Combinatorial Optimization, 1993)

Solving the maximum weight planar subgraph. - Michael Jünger; Petra Mutzel (IPCO, 1993)

The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. - Michael Jünger; Petra Mutzel (GD, 1994)

Provably good solutions for the traveling salesman problem. - Michael Jünger; Stefan Thienel; Gerhard Reinelt (Math. Methods Oper. Res., 1994)

Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. - Michael Jünger; Alexander Martin 001; Gerhard Reinelt; Robert Weismantel (Math. Program., 1994)

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

New Primal and Dual Matching Heuristics. - Michael Jünger; William R. Pulleyblank (Algorithmica, 1995)

Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. - Michael Jünger; Petra Mutzel (Algorithmica, 1996)

Pitfalls of Using PQ-Trees in Automatic Graph Drawing. - Michael Jünger; Sebastian Leipert; Petra Mutzel (GD, 1997)

A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. - Michael Jünger; Eva K. Lee; Petra Mutzel; Thomas Odenthal (GD, 1997)

Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. - Franz-Josef Brandenburg; Michael Jünger; Petra Mutzel; Thomas Lengauer (GI Jahrestagung, 1997)

A branch-and-cut approach to physical mapping with end-probes. - Thomas Christof; Michael Jünger; John D. Kececioglu; Petra Mutzel; Gerhard Reinelt (RECOMB, 1997)

On the Two-connected Planar Spanning Subgraph Polytope. - Caterina De Simone; Michael Jünger (Discret. Appl. Math., 1997)

Algorithmen zum automatischen Zeichnen von Graphen. - Franz-Josef Brandenburg; Michael Jünger; Petra Mutzel (Inform. Spektrum, 1997)

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. - Thomas Christof; Michael Jünger; John D. Kececioglu; Petra Mutzel; Gerhard Reinelt (J. Comput. Biol., 1997)

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. - Michael Jünger; Petra Mutzel (J. Graph Algorithms Appl., 1997)

Level Planarity Testing in Linear Time. - Michael Jünger; Sebastian Leipert; Petra Mutzel (GD, 1998)

A Library of Algorithms for Graph Drawing. - Petra Mutzel; Carsten Gutwenger; Ralf Brockenauer; Sergej Fialko; Gunnar W. Klau; Michael Krüger; Thomas Ziegler 002; Stefan Näher; David Alberts; Dirk Ambras; Gunter Koch; Michael Jünger; et al. (GD, 1998)

The thickness of a minor-excluded class of graphs. - Michael Jünger; Petra Mutzel; Thomas Odenthal; Mark Scharbrodt (Discret. Math., 1998)

Introduction to ABACUS - a branch-and-cut system. - Michael Jünger; Stefan Thienel (Oper. Res. Lett., 1998)

A note on computing a maximal planar subgraph using PQ-trees. - Michael Jünger; Sebastian Leipert; Petra Mutzel (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998)

Graph-Drawing Contest Report. - Franz-Josef Brandenburg; Michael Jünger; Joe Marks; Petra Mutzel; Falk Schreiber (GD, 1999)

A Fast Layout Algorithm for k-Level Graphs. - Christoph Buchheim; Michael Jünger; Sebastian Leipert (GD, 2000)

Practical Performance of Efficient Minimum Cut Algorithms. - Michael Jünger; Giovanni Rinaldi; Stefan Thienel (Algorithmica, 2000)

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. - Norbert Ascheuer; Michael Jünger; Gerhard Reinelt (Comput. Optim. Appl., 2000)

On the SQAP-Polytope. - Michael Jünger; Volker Kaibel (SIAM J. Optim., 2000)

The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. - Michael Jünger; Stefan Thienel (Softw. Pract. Exp., 2000)

Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. - Matthias Elf; Carsten Gutwenger; Michael Jünger; Giovanni Rinaldi (Computational Combinatorial Optimization, 2001)

Graph Drawing Algorithm Engineering with AGD. - Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Sebastian Leipert; Petra Mutzel (Software Visualization, 2001)

Caesar Automatic Layout of UML Class Diagrams. - Carsten Gutwenger; Michael Jünger; Karsten Klein 001; Joachim Kupke 001; Sebastian Leipert; Petra Mutzel (GD, 2001)

AGD: A Library of Algorithms for Graph Drawing. - Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Sebastian Leipert; Petra Mutzel; René Weiskircher (GD, 2001)

The QAP-polytope and the star transformation. - Michael Jünger; Volker Kaibel (Discret. Appl. Math., 2001)

Box-inequalities for quadratic assignment polytopes. - Michael Jünger; Volker Kaibel (Math. Program., 2001)

SCIL - Symbolic Constraints in Integer Linear Programming. - Ernst Althaus; Alexander Bockmayr; Matthias Elf; Michael Jünger; Thomas Kasper; Kurt Mehlhorn (ESA, 2002)

Improving Walker's Algorithm to Run in Linear Time. - Christoph Buchheim; Michael Jünger; Sebastian Leipert (GD, 2002)

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

Level Planar Embedding in Linear Time. - Michael Jünger; Sebastian Leipert (J. Graph Algorithms Appl., 2002)

Preface. - Michael Jünger; Rüdiger Schultz; Robert Weismantel (Math. Methods Oper. Res., 2002)

An Integer Programming Approach to Fuzzy Symmetry Detection. - Christoph Buchheim; Michael Jünger (GD, 2003)

A New Approach for Visualizing UML Class Diagrams. - Carsten Gutwenger; Michael Jünger; Karsten Klein 001; Joachim Kupke 001; Sebastian Leipert; Petra Mutzel (SOFTVIS, 2003)

Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). - Carsten Gutwenger; Michael Jünger; Sebastian Leipert; Petra Mutzel; Merijam Percan; René Weiskircher (WG, 2003)

Guest Editors' Foreword. - Petra Mutzel; Michael Jünger (J. Graph Algorithms Appl., 2003)

Detecting symmetries by branch & cut. - Christoph Buchheim; Michael Jünger (Math. Program., 2003)

Minimizing breaks by maximizing cuts. - Matthias Elf; Michael Jünger; Giovanni Rinaldi (Oper. Res. Lett., 2003)

Graph Drawing: Exact Optimization Helps! - Petra Mutzel; Michael Jünger (The Sharpest Cut, 2004)

A Diagramming Software for UML Class Diagrams. - Carsten Gutwenger; Michael Jünger; Karsten Klein 001; Joachim Kupke 001; Sebastian Leipert; Petra Mutzel (Graph Drawing Software, 2004)

AGD - A Library of Algorithms for Graph Drawing. - Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (Graph Drawing Software, 2004)

Introduction. - Michael Jünger; Petra Mutzel (Graph Drawing Software, 2004)

Technical Foundations. - Michael Jünger; Petra Mutzel (Graph Drawing Software, 2004)

Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. - Stefan Hachul; Michael Jünger (GD, 2004)

On the complexity of drawing trees nicely: corrigendum. - Thorsten Akkerman; Christoph Buchheim; Michael Jünger; Daniel Teske (Acta Informatica, 2004)

Automatic layout of UML class diagrams in orthogonal style. - Markus Eiglsperger; Carsten Gutwenger; Michael Kaufmann 001; Joachim Kupke 001; Michael Jünger; Sebastian Leipert; Karsten Klein 001; Petra Mutzel; Martin Siebenhaller (Inf. Vis., 2004)

Simple and Efficient Bilayer Cross Counting. - Wilhelm Barth; Petra Mutzel; Michael Jünger (J. Graph Algorithms Appl., 2004)

05191 Executive Summary - Graph Drawing. - Michael Jünger; Stephen G. Kobourov; Petra Mutzel (Graph Drawing, 2005)

05191 Abstracts Collection - Graph Drawing. - Michael Jünger; Petra Mutzel; Stephen G. Kobourov (Graph Drawing, 2005)

Exact Crossing Minimization. - Christoph Buchheim; Dietmar Ebner; Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (GD, 2005)

An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. - Stefan Hachul; Michael Jünger (GD, 2005)

Linear optimization over permutation groups. - Christoph Buchheim; Michael Jünger (Discret. Optim., 2005)

Bimodal Crossing Minimization. - Christoph Buchheim; Michael Jünger; Annette Menze; Merijam Percan (COCOON, 2006)

Simultaneous Graph Embeddings with Fixed Edges. - Elisabeth Gassner; Michael Jünger; Merijam Percan; Marcus Schaefer 001; Michael Schulz 001 (WG, 2006)

Drawing rooted trees in linear time. - Christoph Buchheim; Michael Jünger; Sebastian Leipert (Softw. Pract. Exp., 2006)

Simultaneous Geometric Graph Embeddings. - Alejandro Estrella-Balderrama; Elisabeth Gassner; Michael Jünger; Merijam Percan; Marcus Schaefer 001; Michael Schulz 001 (GD, 2007)

A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. - Markus Behle; Michael Jünger; Frauke Liers (WEA, 2007)

Large-Graph Layout Algorithms at Work: An Experimental Study. - Stefan Hachul; Michael Jünger (J. Graph Algorithms Appl., 2007)

Foreword: Special issue on IPCO 2005. - Michael Jünger; Volker Kaibel (Math. Program., 2007)

Crossing Minimization meets Simultaneous Drawing. - Markus Chimani; Michael Jünger; Michael Schulz 001 (PacificVis, 2008)

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. - J. Joseph Fowler; Carsten Gutwenger; Michael Jünger; Petra Mutzel; Michael Schulz 001 (GD, 2008)

A branch-and-cut approach to the crossing number problem. - Christoph Buchheim; Markus Chimani; Dietmar Ebner; Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Petra Mutzel; René Weiskircher (Discret. Optim., 2008)

Characterizing Simultaneous Embedding with Fixed Edges. - J. Joseph Fowler; Michael Jünger; Stephen G. Kobourov; Michael Schulz 001 (Electron. Notes Discret. Math., 2008)

Intersection Graphs in Simultaneous Embedding with Fixed Edges. - Michael Jünger; Michael Schulz 001 (J. Graph Algorithms Appl., 2009)

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. - Immanuel M. Bomze; Markus Chimani; Michael Jünger; Ivana Ljubic; Petra Mutzel; Bernd Zey (ISAAC (1), 2010)

Traces of the XII Aussois Workshop on Combinatorial Optimization. - Michael Jünger; Thomas M. Liebling; Denis Naddef; William R. Pulleyblank; Gerhard Reinelt; Giovanni Rinaldi; Laurence A. Wolsey (Math. Program., 2010)

Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. - J. Joseph Fowler; Michael Jünger; Stephen G. Kobourov; Michael Schulz 001 (Comput. Geom., 2011)

An SDP approach to multi-level crossing minimization. - Markus Chimani; Philipp Hungerländer; Michael Jünger; Petra Mutzel (ACM J. Exp. Algorithmics, 2011)

Drawing Clustered Graphs as Topographic Maps. - Martin Gronemann; Michael Jünger (GD, 2012)

Models and Algorithms for Robust Network Design with Several Traffic Scenarios. - Eduardo Álvarez-Miranda; Valentina Cacchiani; Tim Dorneth; Michael Jünger; Frauke Liers; Andrea Lodi 001; Tiziano Parriani; Daniel R. Schmidt 001 (ISCO, 2012)

MolMap - Visualizing Molecule Libraries as Topographic Maps. - Martin Gronemann; Michael Jünger; Nils M. Kriege; Petra Mutzel (GRAPP/IVAPP, 2013)

Solving the simple offset assignment problem as a traveling salesman. - Michael Jünger; Sven Mallach (M-SCOPES, 2013)

The Landscape Metaphor for Visualization of Molecular Similarities. - Martin Gronemann; Michael Jünger; Nils M. Kriege; Petra Mutzel (VISIGRAPP (Selected Papers), 2013)

Algorithm Engineering im Graphenzeichnen. - Martin Gronemann; Carsten Gutwenger; Michael Jünger; Petra Mutzel (Inform. Spektrum, 2013)

Crossings and Planarization. - Christoph Buchheim; Markus Chimani; Carsten Gutwenger; Michael Jünger; Petra Mutzel (Handbook of Graph Drawing and Visualization, 2013)

The Open Graph Drawing Framework (OGDF). - Markus Chimani; Carsten Gutwenger; Michael Jünger; Gunnar W. Klau; Karsten Klein 001; Petra Mutzel (Handbook of Graph Drawing and Visualization, 2013)

Lifting and separation procedures for the cut polytope. - Thorsten Bonato; Michael Jünger; Gerhard Reinelt; Giovanni Rinaldi (Math. Program., 2014)

Hardware-Aware Automatic Code-Transformation to Support Compilers in Exploiting the Multi-Level Parallel Potential of Modern CPUs. - Dustin Feld; Thomas Soddemann; Michael Jünger; Sven Mallach (COSMIC@CGO, 2015)

Crossing Minimization in Storyline Visualization. - Martin Gronemann; Michael Jünger; Frauke Liers; Francesco Mambelli (GD, 2016)

An integer programming approach to optimal basic block instruction scheduling for single-issue processors. - Michael Jünger; Sven Mallach (Discret. Optim., 2016)

Single-commodity robust network design with finite and Hose demand sets. - Valentina Cacchiani; Michael Jünger; Frauke Liers; Andrea Lodi 001; Daniel R. Schmidt 001 (Math. Program., 2016)

Orthogonal Compaction using Additional Bends. - Michael Jünger; Petra Mutzel; Christiane Spisla (VISIGRAPP (3: IVAPP), 2018)

More Compact Orthogonal Drawings by Allowing Additional Bends †. - Michael Jünger; Petra Mutzel; Christiane Spisla (Inf., 2018)

Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. - Michael Jünger; Sven Mallach (ESA, 2019)

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. - Michael Jünger; Elisabeth Lobe; Petra Mutzel; Gerhard Reinelt; Franz Rendl; Giovanni Rinaldi; Tobias Stollenwerk (CoRR, 2019)

A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. - Michael Jünger; Petra Mutzel; Christiane Spisla (J. Graph Algorithms Appl., 2019)

Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. - Michael Jünger; Sven Mallach (INFORMS J. Comput., 2021)

Quantum Annealing versus Digital Computing: An Experimental Comparison. - Michael Jünger; Elisabeth Lobe; Petra Mutzel; Gerhard Reinelt; Franz Rendl; Giovanni Rinaldi; Tobias Stollenwerk (ACM J. Exp. Algorithmics, 2021)

McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. - Jonas Charfreitag; Michael Jünger; Sven Mallach; Petra Mutzel (ALENEX, 2022)

Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". - Martin Grötschel; Michael Jünger; Gerhard Reinelt (ACM J. Exp. Algorithmics, 2022)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. - Alexander Dobler; Michael Jünger; Paul J. Jünger; Julian Meffert; Petra Mutzel; Martin Nöllenburg (GD, 2024)

PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. - Michael Jünger; Paul J. Jünger; Petra Mutzel; Gerhard Reinelt (IPEC, 2024)

Algorithmic Symplectic Packing. - Greta Fischer; Jean Gutt; Michael Jünger (Exp. Math., 2024)

PACE2024. - Michael Jünger; Paul J. Jünger; Petra Mutzel; Gerhard Reinelt (DROPS Artifacts, 2024)