Michael Jünger

130 papers A 33B 8C 1Misc 1Journal 61Unranked 14

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Algorithmic Symplectic Packing. Exp. Math. Greta Fischer, Jean Gutt, Michael Jünger
2024	B	`conf`	PACE Solver Description: Exact Solution of the One-Sided Crossing Minimization Problem by the MPPEG Team. IPEC Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt
2024	J	`jnl`	PACE Solver Description: Exact Solution of the One-sided Crossing Minimization Problem by the MPPEG Team. CoRR Michael Jünger, Paul J. Jünger, Petra Mutzel, Gerhard Reinelt
2024	A	`conf`	Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. GD Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg
2024	J	`jnl`	Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings. CoRR Alexander Dobler, Michael Jünger, Paul J. Jünger, Julian Meffert, Petra Mutzel, Martin Nöllenburg
2022	J	`jnl`	Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". ACM J. Exp. Algorithmics Martin Grötschel, Michael Jünger, Gerhard Reinelt
2022	A	`conf`	McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. ALENEX Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel
2021	J	`jnl`	Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. INFORMS J. Comput. Michael Jünger, Sven Mallach
2021	J	`jnl`	Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
2019	J	`jnl`	A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. J. Graph Algorithms Appl. Michael Jünger, Petra Mutzel, Christiane Spisla
2019	A	`conf`	Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization. ESA Michael Jünger, Sven Mallach
2019	J	`jnl`	Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs. CoRR Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk
2018	A	`conf`	A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. GD Michael Jünger, Petra Mutzel, Christiane Spisla
2018	J	`jnl`	A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width. CoRR Michael Jünger, Petra Mutzel, Christiane Spisla
2018	J	`jnl`	More Compact Orthogonal Drawings by Allowing Additional Bends Inf. Michael Jünger, Petra Mutzel, Christiane Spisla
2018	—	`conf`	Orthogonal Compaction using Additional Bends. VISIGRAPP (3: IVAPP) Michael Jünger, Petra Mutzel, Christiane Spisla
2017	J	`jnl`	Orthogonal Compaction Using Additional Bends. CoRR Michael Jünger, Petra Mutzel, Christiane Spisla
2016	J	`jnl`	An integer programming approach to optimal basic block instruction scheduling for single-issue processors. Discret. Optim. Michael Jünger, Sven Mallach
2016	A	`conf`	Crossing Minimization in Storyline Visualization. GD Martin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli
2016	J	`jnl`	Crossing Minimization in Storyline Visualization. CoRR Martin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli
2016	J	`jnl`	Single-commodity robust network design with finite and Hose demand sets. Math. Program. Valentina Cacchiani, Michael Jünger, Frauke Liers, Andrea Lodi, Daniel R. Schmidt
2015	—	`conf`	Hardware-Aware Automatic Code-Transformation to Support Compilers in Exploiting the Multi-Level Parallel Potential of Modern CPUs. COSMIC@CGO Dustin Feld, Thomas Soddemann, Michael Jünger, Sven Mallach
2014	J	`jnl`	Lifting and separation procedures for the cut polytope. Math. Program. Thorsten Bonato, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
2013	J	`jnl`	Algorithm Engineering im Graphenzeichnen. Inform. Spektrum Martin Gronemann, Carsten Gutwenger, Michael Jünger, Petra Mutzel
2013	—	`ch.`	Crossings and Planarization. Handbook of Graph Drawing and Visualization Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, Petra Mutzel
2013	—	`conf`	MolMap - Visualizing Molecule Libraries as Topographic Maps. GRAPP/IVAPP Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel
2013	—	`conf`	Solving the simple offset assignment problem as a traveling salesman. M-SCOPES Michael Jünger, Sven Mallach
2013	—	`conf`	The Landscape Metaphor for Visualization of Molecular Similarities. VISIGRAPP (Selected Papers) Martin Gronemann, Michael Jünger, Nils M. Kriege, Petra Mutzel
2013	—	`ch.`	The Open Graph Drawing Framework (OGDF). Handbook of Graph Drawing and Visualization Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein, Petra Mutzel
2012	A	`conf`	Drawing Clustered Graphs as Topographic Maps. GD Martin Gronemann, Michael Jünger
2012	C	`conf`	Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt
2011	A	`conf`	An SDP Approach to Multi-level Crossing Minimization. ALENEX Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
2011	J	`jnl`	An SDP approach to multi-level crossing minimization. ACM J. Exp. Algorithmics Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
2011	J	`jnl`	Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. Comput. Geom. J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz
2010	—	`book`	50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2010	—	`conf`	Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey
2010	J	`jnl`	Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey
2009	J	`jnl`	Intersection Graphs in Simultaneous Embedding with Fixed Edges. J. Graph Algorithms Appl. Michael Jünger, Michael Schulz
2008	J	`jnl`	A branch-and-cut approach to the crossing number problem. Discret. Optim. Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
2008	A	`conf`	An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. GD J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz
2008	B	`conf`	Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. WG J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz
2008	J	`jnl`	Characterizing Simultaneous Embedding with Fixed Edges. Electron. Notes Discret. Math. J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz
2008	B	`conf`	Crossing Minimization meets Simultaneous Drawing. PacificVis Markus Chimani, Michael Jünger, Michael Schulz
2007	—	`conf`	A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. WEA Markus Behle, Michael Jünger, Frauke Liers
2007	J	`jnl`	Foreword: Special issue on IPCO 2005. Math. Program. Michael Jünger, Volker Kaibel
2007	J	`jnl`	Large-Graph Layout Algorithms at Work: An Experimental Study. J. Graph Algorithms Appl. Stefan Hachul, Michael Jünger
2007	A	`conf`	Simultaneous Geometric Graph Embeddings. GD Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
2006	Misc	`conf`	Bimodal Crossing Minimization. COCOON Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
2006	J	`jnl`	Drawing rooted trees in linear time. Softw. Pract. Exp. Christoph Buchheim, Michael Jünger, Sebastian Leipert
2006	A	`ed.`	Graph Drawing, 8.-13. May 2005 Graph Drawing Michael Jünger, Stephen G. Kobourov, Petra Mutzel
2006	B	`conf`	Simultaneous Graph Embeddings with Fixed Edges. WG Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
2005	A	`conf`	05191 Abstracts Collection - Graph Drawing. Graph Drawing Michael Jünger, Petra Mutzel, Stephen G. Kobourov
2005	A	`conf`	05191 Executive Summary - Graph Drawing. Graph Drawing Michael Jünger, Stephen G. Kobourov, Petra Mutzel
2005	A	`conf`	An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. GD Stefan Hachul, Michael Jünger
2005	A	`conf`	Exact Crossing Minimization. GD Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
2005	B	`ed.`	Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings IPCO Michael Jünger, Volker Kaibel
2005	J	`jnl`	Linear optimization over permutation groups. Discret. Optim. Christoph Buchheim, Michael Jünger
2004	—	`ch.`	A Diagramming Software for UML Class Diagrams. Graph Drawing Software Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
2004	—	`ch.`	AGD - A Library of Algorithms for Graph Drawing. Graph Drawing Software Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
2004	J	`jnl`	Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller
2004	A	`conf`	Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. GD Stefan Hachul, Michael Jünger
2004	—	`book`	Graph Drawing Software Graph Drawing Software Michael Jünger, Petra Mutzel
2004	—	`ch.`	Graph Drawing: Exact Optimization Helps! The Sharpest Cut Petra Mutzel, Michael Jünger
2004	—	`ch.`	Introduction. Graph Drawing Software Michael Jünger, Petra Mutzel
2004	J	`jnl`	On the complexity of drawing trees nicely: corrigendum. Acta Informatica Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske
2004	J	`jnl`	Simple and Efficient Bilayer Cross Counting. J. Graph Algorithms Appl. Wilhelm Barth, Petra Mutzel, Michael Jünger
2004	—	`ch.`	Technical Foundations. Graph Drawing Software Michael Jünger, Petra Mutzel
2003	—	`conf`	A New Approach for Visualizing UML Class Diagrams. SOFTVIS Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
2003	A	`conf`	An Integer Programming Approach to Fuzzy Symmetry Detection. GD Christoph Buchheim, Michael Jünger
2003	—	`ed.`	Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers Combinatorial Optimization Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
2003	J	`jnl`	Detecting symmetries by branch & cut. Math. Program. Christoph Buchheim, Michael Jünger
2003	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Petra Mutzel, Michael Jünger
2003	J	`jnl`	Minimizing breaks by maximizing cuts. Oper. Res. Lett. Matthias Elf, Michael Jünger, Giovanni Rinaldi
2003	B	`conf`	Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
2002	A	`conf`	Advances in C-Planarity Testing of Clustered Graphs. GD Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
2002	A	`ed.`	Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers GD Petra Mutzel, Michael Jünger, Sebastian Leipert
2002	A	`conf`	Improving Walker's Algorithm to Run in Linear Time. GD Christoph Buchheim, Michael Jünger, Sebastian Leipert
2002	J	`jnl`	Level Planar Embedding in Linear Time. J. Graph Algorithms Appl. Michael Jünger, Sebastian Leipert
2002	J	`jnl`	Preface. Math. Methods Oper. Res. Michael Jünger, Rüdiger Schultz, Robert Weismantel
2002	A	`conf`	SCIL - Symbolic Constraints in Integer Linear Programming. ESA Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
2002	A	`conf`	Simple and Efficient Bilayer Cross Counting. GD Wilhelm Barth, Michael Jünger, Petra Mutzel
2001	A	`conf`	AGD: A Library of Algorithms for Graph Drawing. GD Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher
2001	J	`jnl`	Box-inequalities for quadratic assignment polytopes. Math. Program. Michael Jünger, Volker Kaibel
2001	—	`conf`	Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. Computational Combinatorial Optimization Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi
2001	A	`conf`	Caesar Automatic Layout of UML Class Diagrams. GD Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
2001	—	`ed.`	Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000] Computational Combinatorial Optimization Michael Jünger, Denis Naddef
2001	A	`conf`	Detecting Symmetries by Branch & Cut. GD Christoph Buchheim, Michael Jünger
2001	—	`conf`	Graph Drawing Algorithm Engineering with AGD. Software Visualization Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel
2001	J	`jnl`	The QAP-polytope and the star transformation. Discret. Appl. Math. Michael Jünger, Volker Kaibel
2000	J	`jnl`	A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comput. Optim. Appl. Norbert Ascheuer, Michael Jünger, Gerhard Reinelt
2000	A	`conf`	A Fast Layout Algorithm for GD Christoph Buchheim, Michael Jünger, Sebastian Leipert
2000	J	`jnl`	On the SQAP-Polytope. SIAM J. Optim. Michael Jünger, Volker Kaibel
2000	J	`jnl`	Practical Performance of Efficient Minimum Cut Algorithms. Algorithmica Michael Jünger, Giovanni Rinaldi, Stefan Thienel
2000	J	`jnl`	The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw. Pract. Exp. Michael Jünger, Stefan Thienel
1999	A	`conf`	Graph-Drawing Contest Report. GD Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
1999	A	`conf`	Level Planar Embedding in Linear Time. GD Michael Jünger, Sebastian Leipert
1998	A	`conf`	A Library of Algorithms for Graph Drawing. GD 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
1998	J	`jnl`	A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Michael Jünger, Sebastian Leipert, Petra Mutzel
1998	J	`jnl`	Introduction to ABACUS - a branch-and-cut system. Oper. Res. Lett. Michael Jünger, Stefan Thienel
1998	A	`conf`	Level Planarity Testing in Linear Time. GD Michael Jünger, Sebastian Leipert, Petra Mutzel
1998	J	`jnl`	The thickness of a minor-excluded class of graphs. Discret. Math. Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt
1997	J	`jnl`	2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Algorithms Appl. Michael Jünger, Petra Mutzel
1997	J	`jnl`	A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes. J. Comput. Biol. Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt
1997	A	`conf`	A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. GD Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal
1997	B	`conf`	A branch-and-cut approach to physical mapping with end-probes. RECOMB Thomas Christof, Michael Jünger, John D. Kececioglu, Petra Mutzel, Gerhard Reinelt
1997	—	`conf`	Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen. GI Jahrestagung Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel, Thomas Lengauer
1997	J	`jnl`	Algorithmen zum automatischen Zeichnen von Graphen. Inform. Spektrum Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel
1997	J	`jnl`	On the Two-connected Planar Spanning Subgraph Polytope. Discret. Appl. Math. Caterina De Simone, Michael Jünger
1997	A	`conf`	Pitfalls of Using PQ-Trees in Automatic Graph Drawing. GD Michael Jünger, Sebastian Leipert, Petra Mutzel
1997	—	`conf`	Practical Performance of Efficient Minimum Cut Algorithms. WAE Michael Jünger, Giovanni Rinaldi, Stefan Thienel
1996	J	`jnl`	Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Algorithmica Michael Jünger, Petra Mutzel
1995	A	`conf`	Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. GD Michael Jünger, Petra Mutzel
1995	J	`jnl`	New Primal and Dual Matching Heuristics. Algorithmica Michael Jünger, William R. Pulleyblank
1994	J	`jnl`	Provably good solutions for the traveling salesman problem. Math. Methods Oper. Res. Michael Jünger, Stefan Thienel, Gerhard Reinelt
1994	J	`jnl`	Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. Math. Program. Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel
1994	A	`conf`	The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. GD Michael Jünger, Petra Mutzel
1993	—	`conf`	Practical problem solving with cutting plane algorithms in combinatorialoptimization. Combinatorial Optimization Michael Jünger, Gerhard Reinelt, Stefan Thienel
1993	B	`conf`	Solving the maximum weight planar subgraph. IPCO Michael Jünger, Petra Mutzel
1991	J	`jnl`	A complete description of the traveling salesman polytope on 8 nodes. Oper. Res. Lett. Thomas Christof, Michael Jünger, Gerhard Reinelt
1991	J	`jnl`	Computing correct Delaunay triangulations. Computing Michael Jünger, Gerhard Reinelt, Doris Zepf
1991	J	`jnl`	Optimal control of plotting and drilling machines: A case study. ZOR Methods Model. Oper. Res. Martin Grötschel, Michael Jünger, Gerhard Reinelt
1990	—	`conf`	Computing the Convex Hull in the Euclidean Plane in Linear Expected Time. Applied Geometry And Discrete Mathematics Karl Heinz Borgwardt, Norbert Gaffke, Michael Jünger, Gerhard Reinelt
1989	J	`jnl`	Experiments in quadratic 0-1 programming. Math. Program. Francisco Barahona, Michael Jünger, Gerhard Reinelt
1988	J	`jnl`	An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res. Francisco Barahona, Martin Grötschel, Michael Jünger, Gerhard Reinelt
1987	J	`jnl`	Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra. Math. Oper. Res. Reinhardt Euler, Michael Jünger, Gerhard Reinelt
1985	J	`jnl`	Facets of the linear ordering polytope. Math. Program. Martin Grötschel, Michael Jünger, Gerhard Reinelt
1985	J	`jnl`	On partitioning the edges of graphs into connected subgraphs. J. Graph Theory Michael Jünger, Gerhard Reinelt, William R. Pulleyblank
1985	J	`jnl`	On the acyclic subgraph polytope. Math. Program. Martin Grötschel, Michael Jünger, Gerhard Reinelt
1985	—	`—`	Polyhedral combinatorics and the acyclic subdigraph problem. Michael Jünger
1984	J	`jnl`	A Cutting Plane Algorithm for the Linear Ordering Problem. Oper. Res. Martin Grötschel, Michael Jünger, Gerhard Reinelt