Michael Jünger

Publication Activity (10 Years)

Years Active: 1984-2022
Publications (10 Years): 17

Top Venues

CoRR

ACM J. Exp. Algorithmics

Graph Drawing

Math. Program.

University of Augsburg, Germany (PHD)

Education History

University of Augsburg, Germany

PHD

Publications

Martin Grötschel, Michael Jünger, Gerhard Reinelt
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". ACM J. Exp. Algorithmics 27 (2022)
Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. ALENEX (2022)
Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26 (2021)
Michael Jünger, Sven Mallach
Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. INFORMS J. Comput. 33 (4) (2021)
Michael Jünger, Petra Mutzel, Christiane Spisla
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. J. Graph Algorithms Appl. 23 (3) (2019)
Michael Jünger, Sven Mallach
Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. ESA (2019)
Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR (2019)
Michael Jünger, Petra Mutzel, Christiane Spisla
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. CoRR (2018)
Michael Jünger, Petra Mutzel, Christiane Spisla
. Inf. 9 (7) (2018)
Michael Jünger, Petra Mutzel, Christiane Spisla
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. Graph Drawing (2018)
Michael Jünger, Petra Mutzel, Christiane Spisla
Orthogonal Compaction using Additional Bends. VISIGRAPP (3: IVAPP) (2018)
Michael Jünger, Petra Mutzel, Christiane Spisla
Orthogonal Compaction Using Additional Bends. CoRR (2017)
Michael Jünger, Sven Mallach
An integer programming approach to optimal basic block instruction scheduling for single-issue processors. Discret. Optim. 22 (2016)
Martin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli
Crossing Minimization in Storyline Visualization. Graph Drawing (2016)
Martin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli
Crossing Minimization in Storyline Visualization. CoRR (2016)
Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt
Single-commodity robust network design with finite and Hose demand sets. Math. Program. 157 (1) (2016)
Dustin Feld, Thomas Soddemann, Michael Jünger, Sven Mallach
Hardware-Aware Automatic Code-Transformation to Support Compilers in Exploiting the Multi-Level Parallel Potential of Modern CPUs. COSMIC@CGO (2015)
Thorsten Bonato, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
Lifting and separation procedures for the cut polytope. Math. Program. 146 (1-2) (2014)
Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel
The Landscape Metaphor for Visualization of Molecular Similarities. VISIGRAPP (Selected Papers) (2013)
Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel
MolMap - Visualizing Molecule Libraries as Topographic Maps. GRAPP/IVAPP (2013)
Michael Jünger, Sven Mallach
Solving the simple offset assignment problem as a traveling salesman. M-SCOPES (2013)
Martin Gronemann, Carsten Gutwenger, Michael Jünger, Petra Mutzel
Algorithm Engineering im Graphenzeichnen. Inform. Spektrum 36 (2) (2013)
Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO (2012)
Martin Gronemann, Michael Jünger
Drawing Clustered Graphs as Topographic Maps. Graph Drawing (2012)
Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
An SDP approach to multi-level crossing minimization. ACM J. Exp. Algorithmics 17 (1) (2011)
Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
An SDP Approach to Multi-level Crossing Minimization. ALENEX (2011)
J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz
Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. Comput. Geom. 44 (8) (2011)
Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124 (1-2) (2010)
Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) (2010)
Michael Jünger, Michael Schulz
Intersection Graphs in Simultaneous Embedding with Fixed Edges. J. Graph Algorithms Appl. 13 (2) (2009)
J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. Graph Drawing (2008)
Markus Chimani, Michael Jünger, Michael Schulz
Crossing Minimization meets Simultaneous Drawing. PacificVis (2008)
J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. WG (2008)
J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz
Characterizing Simultaneous Embedding with Fixed Edges. Electron. Notes Discret. Math. 31 (2008)
Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
A branch-and-cut approach to the crossing number problem. Discret. Optim. 5 (2) (2008)
Michael Jünger, Volker Kaibel
Foreword: Special issue on IPCO 2005. Math. Program. 110 (1) (2007)
Stefan Hachul, Michael Jünger
Large-Graph Layout Algorithms at Work: An Experimental Study. J. Graph Algorithms Appl. 11 (2) (2007)
Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
Simultaneous Geometric Graph Embeddings. Graph Drawing (2007)
Markus Behle, Michael Jünger, Frauke Liers
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. WEA (2007)
Christoph Buchheim, Michael Jünger, Sebastian Leipert
Drawing rooted trees in linear time. Softw. Pract. Exp. 36 (6) (2006)
Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
Simultaneous Graph Embeddings with Fixed Edges. WG (2006)
Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
Bimodal Crossing Minimization. COCOON (2006)
Michael Jünger, Stephen G. Kobourov, Petra Mutzel
05191 Executive Summary - Graph Drawing. Graph Drawing (2005)
Stefan Hachul, Michael Jünger
An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. Graph Drawing (2005)
Christoph Buchheim, Michael Jünger
Linear optimization over permutation groups. Discret. Optim. 2 (4) (2005)
Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
Exact Crossing Minimization. Graph Drawing (2005)
Michael Jünger, Petra Mutzel, Stephen G. Kobourov
05191 Abstracts Collection - Graph Drawing. Graph Drawing (2005)
Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske
On the complexity of drawing trees nicely: corrigendum. Acta Informatica 40 (8) (2004)
Wilhelm Barth, Petra Mutzel, Michael Jünger
Simple and Efficient Bilayer Cross Counting. J. Graph Algorithms Appl. 8 (2) (2004)
Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller
Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. 3 (3) (2004)
Stefan Hachul, Michael Jünger
Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. Graph Drawing (2004)
Matthias Elf, Michael Jünger, Giovanni Rinaldi
Minimizing breaks by maximizing cuts. Oper. Res. Lett. 31 (3) (2003)
Christoph Buchheim, Michael Jünger
Detecting symmetries by branch & cut. Math. Program. 98 (1-3) (2003)
Petra Mutzel, Michael Jünger
Guest Editors' Foreword. J. Graph Algorithms Appl. 7 (4) (2003)
Christoph Buchheim, Michael Jünger
An Integer Programming Approach to Fuzzy Symmetry Detection. Graph Drawing (2003)
Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
A New Approach for Visualizing UML Class Diagrams. SOFTVIS (2003)
Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG (2003)
Michael Jünger, Sebastian Leipert
Level Planar Embedding in Linear Time. J. Graph Algorithms Appl. 6 (1) (2002)
Wilhelm Barth, Michael Jünger, Petra Mutzel
Simple and Efficient Bilayer Cross Counting. Graph Drawing (2002)
Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
Advances in C-Planarity Testing of Clustered Graphs. Graph Drawing (2002)
Christoph Buchheim, Michael Jünger, Sebastian Leipert
Improving Walker's Algorithm to Run in Linear Time. Graph Drawing (2002)
Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
SCIL - Symbolic Constraints in Integer Linear Programming. ESA (2002)
Michael Jünger, Rüdiger Schultz, Robert Weismantel
Preface. Math. Methods Oper. Res. 56 (1) (2002)
Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel
Graph Drawing Algorithm Engineering with AGD. Software Visualization (2001)
Christoph Buchheim, Michael Jünger
Detecting Symmetries by Branch & Cut. Graph Drawing (2001)
Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
Caesar Automatic Layout of UML Class Diagrams. Graph Drawing (2001)
Michael Jünger, Volker Kaibel
Box-inequalities for quadratic assignment polytopes. Math. Program. 91 (1) (2001)
Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher
AGD: A Library of Algorithms for Graph Drawing. Graph Drawing (2001)
Michael Jünger, Volker Kaibel
The QAP-polytope and the star transformation. Discret. Appl. Math. 111 (3) (2001)
Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. Computational Combinatorial Optimization (2001)
Norbert Ascheuer, Michael Jünger, Gerhard Reinelt
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comput. Optim. Appl. 17 (1) (2000)
Michael Jünger, Volker Kaibel
On the SQAP-Polytope. SIAM J. Optim. 11 (2) (2000)
Michael Jünger, Stefan Thienel
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw. Pract. Exp. 30 (11) (2000)
Michael Jünger, Giovanni Rinaldi, Stefan Thienel
Practical Performance of Efficient Minimum Cut Algorithms. Algorithmica 26 (1) (2000)
Christoph Buchheim, Michael Jünger, Sebastian Leipert
-Level Graphs. Graph Drawing (2000)
Michael Jünger, Sebastian Leipert
Level Planar Embedding in Linear Time. Graph Drawing (1999)
Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
Graph-Drawing Contest Report. Graph Drawing (1999)
Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, Sebastian Leipert
A Library of Algorithms for Graph Drawing. Graph Drawing (1998)
Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt
The thickness of a minor-excluded class of graphs. Discret. Math. 182 (1-3) (1998)
Michael Jünger, Sebastian Leipert, Petra Mutzel
A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 17 (7) (1998)
Michael Jünger, Sebastian Leipert, Petra Mutzel
Level Planarity Testing in Linear Time. Graph Drawing (1998)
Michael Jünger, Stefan Thienel
Introduction to ABACUS - a branch-and-cut system. Oper. Res. Lett. 22 (2-3) (1998)
Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt
A branch-and-cut approach to physical mapping with end-probes. RECOMB (1997)
Caterina De Simone, Michael Jünger
On the Two-connected Planar Spanning Subgraph Polytope. Discret. Appl. Math. 80 (2-3) (1997)
Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel, Thomas Lengauer
Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. GI Jahrestagung (1997)
Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt
A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. J. Comput. Biol. 4 (4) (1997)
Michael Jünger, Giovanni Rinaldi, Stefan Thienel
Practical Performance of Efficient Minimum Cut Algorithms. WAE (1997)
Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal
A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. Graph Drawing (1997)
Michael Jünger, Sebastian Leipert, Petra Mutzel
Pitfalls of Using PQ-Trees in Automatic Graph Drawing. Graph Drawing (1997)
Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel
Algorithmen zum automatischen Zeichnen von Graphen. Inform. Spektrum 20 (4) (1997)
Michael Jünger, Petra Mutzel
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Algorithms Appl. 1 (1) (1997)
Michael Jünger, Petra Mutzel
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Algorithmica 16 (1) (1996)
Michael Jünger, Petra Mutzel
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. Graph Drawing (1995)
Michael Jünger, William R. Pulleyblank
New Primal and Dual Matching Heuristics. Algorithmica 13 (4) (1995)
Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Program. 63 (1994)
Michael Jünger, Petra Mutzel
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. Graph Drawing (1994)
Michael Jünger, Stefan Thienel, Gerhard Reinelt
Provably good solutions for the traveling salesman problem. Math. Methods Oper. Res. 40 (2) (1994)
Michael Jünger, Petra Mutzel
Solving the maximum weight planar subgraph. IPCO (1993)
Michael Jünger, Gerhard Reinelt, Stefan Thienel
Practical problem solving with cutting plane algorithms in combinatorialoptimization. Combinatorial Optimization (1993)
Michael Jünger, Gerhard Reinelt, Doris Zepf
Computing correct Delaunay triangulations. Computing 47 (1) (1991)

Michael Jünger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Jünger