UNI KÖln
ZAIK
INFORMATIK
IMPRESSUM
Lehrstuhl | Prof. Dr. Michael Jünger
Home
People
> Staff
> Students
> Alumni
Publications
> Articles
> Books
Teaching (german)
> Lehrveranstaltungen
> Kolloquien
Research
Where to find us

Publications of Michael Jünger
zaik2009-587 GEODUAL: Fun with Geometric Duality (->LINK)
Author(s): Michael Jünger, Michael Schulz, Wojciech Zychowicz
zaik2009-586 Intersection Graphs in Simultaneous Embedding with Fixed Edges (->LINK)
Author(s): Michael Jünger, Michael Schulz
zaik2009-585 An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges (->LINK)
Author(s): J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel, Michael Schulz
zaik2009-584 Characterizations of Restricted Pairs of Planar Graphs allowing Simultaneous Embeddings with Fixed Edges (->LINK)
Author(s): J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz
zaik2009-583 Characterizing Simultaneous Embeddings with Fixed Edges (->LINK)
Author(s): J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz
zaik2007-566 Planarization With Fixed Subgraph Embedding (->LINK)
Author(s): Christoph Buchheim, Michael Jünger, Maria Kandyba, Merijam Percan, Michael Schulz
zaik2007-559 Drawing cycles in networks (->LINK)
Author(s): Christoph Buchheim, Michael Jünger, Merijam Percan, Michael Schulz, Christina Thelen
zaik2007-543 Crossing Minimization meets Simultaneous Drawing (->LINK)
Author(s): Markus Chimani, Michael Jünger, Michael Schulz
zaik2007-531 A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (->LINK)
Author(s): Markus Behle, Michael Jünger, Frauke Liers
zaik2006-523 Simultaneous Geometric Graph Embeddings (->LINK)
Author(s): Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
zaik2006-518 A Provably Fast Multipole Method (->LINK)
Author(s): Stefan Hachul, Michael Jünger
zaik2006-510 Large-Graph Layout Algorithms at Work: An Experimental Study (->LINK)
Author(s): Stefan Hachul, Michael Jünger
zaik2006-509 Large-Graph Layout with the Fast Multipole Multilevel Method (->LINK)
Author(s): Stefan Hachul, Michael Jünger
zaik2006-508 A Branch-and-Cut Approach to the Crossing Number Problem (->LINK)
Author(s): Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
zaik2006-507 Simultaneous Graph Embeddings with Fixed Edges (->LINK)
Author(s): Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz
zaik2005-502 Exact Crossing Minimization (->LINK)
Author(s): Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher
zaik2005-493 Bimodal Crossing Minimization (->LINK)
Author(s): Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
zaik2005-486 Determining Maximum Cuts in Graphs Coming from Theoretical Physics (->LINK)
Author(s): Michael Jünger, Frauke Liers
zaik2005-485 Energy fluctuations in spin glasses (->LINK)
Author(s): Helmut G. Katzgraber, Mathias Körner, Frauke Liers, Michael Jünger, Alexander K. Hartmann
zaik2005-483 Drawing Rooted Trees in Linear Time (->LINK)
Author(s): Christoph Buchheim, Michael Jünger, Sebastian Leipert
zaik2005-482 An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs (->LINK)
Author(s): Stefan Hachul, Michael Jünger
zaik2004-477 Automatic layout of UML class diagrams in orthogonal style (->LINK)
Author(s): Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel, Martin Siebenhaller
zaik2004-472 Drawing Large Graphs with a Potential -Field-Based Multilevel Algorithm (->LINK)
Author(s): Stefan Hachul, Michael Jünger
zaik2004-470 Linear Optimization over Permutation Groups (->LINK)
Author(s): Christoph Buchheim, Michael Jünger
zaik2004-465 On the Complexity of Drawing Trees Nicely: Corrigendum (->LINK)
Author(s): Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske
zaik2003-455 An Integer Programming Approach to Fuzzy Symmetry Detection (->LINK)
Author(s): Christoph Buchheim, Michael Jünger
zaik2003-454 Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS (->LINK)
Author(s): Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi
zaik2003-452 Computing Exact Ground States of Hard Ising Spin Glass Problems by Branch-and-Cut (->LINK)
Author(s): Frauke Liers, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
zaik2003-451 A New Approach for Visualizing UML Class Diagrams (->LINK)
Author(s): Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
zaik2003-449 Simple and Efficient Bilayer Cross Counting (Journal Version) (->LINK)
Author(s): Wilhelm Barth, Petra Mutzel, Michael Jünger
zaik2003-446 Ground state of the Bethe lattice spin glass and running time of an exact optimization algorithm (->LINK)
Author(s): Frauke Liers, Matteo Palassini, Alexander K. Hartmann, Michael Jünger
zaik2003-445 Low Energy Excitations in Spin Glasses from Exact Ground States (->LINK)
Author(s): Matteo Palassini, Frauke Liers, Michael Jünger, A. Peter Young
zaik2002-444 Triangulating Clustered Graphs (->LINK)
Author(s): Michael Jünger, Sebastian Leipert, Merijam Percan
zaik2002-438 Detecting Symmetries by Branch & Cut (Journal Version) (->LINK)
Author(s): Christoph Buchheim, Michael Jünger
zaik2002-437 SCIL - Symbolic Constraints in Integer Linear Programming (->LINK)
Author(s): Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn
zaik2002-436 Advances in C-Planarity Testing of Clustered Graphs (->LINK)
Author(s): Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
zaik2002-435 Subgraph Induced Connectivity Augmentation (->LINK)
Author(s): Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
zaik2002-433 Simple and Efficient Bilayer Cross Counting (->LINK)
Author(s): Wilhelm Barth, Michael Jünger, Petra Mutzel
zaik2002-431 Improving Walker's Algorithm to Run in Linear Time (->LINK)
Author(s): Christoph Buchheim, Michael Jünger, Sebastian Leipert
zaik2001-427 Graph Drawing: Exact Optimization helps! (->LINK)
Author(s): Petra Mutzel, Michael Jünger
zaik2001-422 Detecting Symmetries by Branch & Cut (Extended Abstract) (->LINK)
Author(s): Christoph Buchheim, Michael Jünger
zaik2001-419 Automatisches Layout von Diagrammen (->LINK)
Author(s): Michael Jünger, Petra Mutzel
zaik2001-416 Combinatorial Optimization and Integer Programming (->LINK)
Author(s): Michael Jünger, Gerhard Reinelt
zaik2001-409 Minimizing Breaks by Maximizing Cuts (->LINK)
Author(s): Matthias Elf, Michael Jünger, Giovanni Rinaldi
zaik2000-394 Graph Drawing Algorithm Engineering with AGD (->LINK)
Author(s): Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel
zaik2000-391 Rotation Planning for the Continental Service of a European Airline (->LINK)
Author(s): Matthias Elf, Michael Jünger, Volker Kaibel
zaik1999-375 Graph-Drawing Contest Report (->LINK)
Author(s): Franz J. Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber
zaik1999-374 Level Planar Embedding in Linear Time (Full Version) (->LINK)
Author(s): Michael Jünger, Sebastian Leipert
zaik1999-369 Level Planarity Testing in Linear Time (Full Version) (->LINK)
Author(s): Michael Jünger, Sebastian Leipert, Petra Mutzel
zaik1999-368 A Fast Layout Algorithm for k-Level Graphs (->LINK)
Author(s): Christoph Buchheim, Michael Jünger, Sebastian Leipert
zaik1999-357 Level Planar Embedding in linear Time (Extended Abstract) (->LINK)
Author(s): Michael Jünger, Sebastian Leipert
zpr98-323 A Branch-and-Cut Algorithm for the Asymmetric Hamiltonian Path Problem with Precedence Constraints (->LINK)
Author(s): Norbert Ascheuer, Michael Jünger, Gerhard Reinelt
zpr98-322 The ABACUS System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization (->LINK)
Author(s): Michael Jünger, Stefan Thienel
zpr98-321 Level Planarity Testing in Linear Time (Extended Abstract) (->LINK)
Author(s): Michael Jünger, Sebastian Leipert, Petra Mutzel
zpr98-320 A Note on Computing a Maximal Planar Subgraph using PQ-Trees (->LINK)
Author(s): Michael Jünger, Sebastian Leipert, Petra Mutzel
zpr97-300 Relaxations of the Max Cut Problem and Computation of Spin Glass Ground States (->LINK)
Author(s): Michael Jünger, Giovanni Rinaldi
zpr97-299 A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem (->LINK)
Author(s): Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal
zpr97-292 Global optimization for track finding (->LINK)
Author(s): Martin Diehl, Michael Jünger, R. Frühwirth, J. Scherzer
zpr97-291 The Traveling Salesman Problem (->LINK)
Author(s): Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
zpr97-285 Box-Inequalities for Quadratic Assignment Polytopes (->LINK)
Author(s): Michael Jünger, Volker Kaibel
zpr97-284 The QAP-Polytope and the Star-Transformation (->LINK)
Author(s): Michael Jünger, Volker Kaibel
zpr97-278 Pitfalls of using PQ-trees in Automatic Graph Drawing (->LINK)
Author(s): Michael Jünger, Sebastian Leipert, Petra Mutzel
zpr97-271 Practical Performance of Efficient Minimum Cut Algorithms (->LINK)
Author(s): Michael Jünger, Giovanni Rinaldi, Stefan Thienel
zpr97-264 Algorithmen zum automatischen Zeichnen von Graphen (->LINK)
Author(s): Franz J. Brandenburg, Michael Jünger, Petra Mutzel
zpr97-263 Introduction to ABACUS - A Branch-and-CUt System (->LINK)
Author(s): Michael Jünger, Stefan Thienel
zpr97-260 The Design of the Branch-and-Cut System ABACUS (->LINK)
Author(s): Michael Jünger, Stefan Thienel
zpr96-250a A branch-and-cut approach to physical mapping of chromosomes by unique end-probes (->LINK)
Author(s): Thomas Christof, Michael Jünger, John Kececioglu, Petra Mutzel, Gerhard Reinelt
zpr96-250 A branch-and-cut approach to physical mapping with end-probes (->LINK)
Author(s): Thomas Christof, Michael Jünger, John Kececioglu, Petra Mutzel, Gerhard Reinelt
zpr96-243 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (->LINK)
Author(s): Michael Jünger, Petra Mutzel
zpr96-241 On the SQAP-Polytope (->LINK)
Author(s): Michael Jünger, Volker Kaibel
zpr96-231 The critical exponents of the two-dimensional Ising spin glass revisited: Exact Ground State Calculations and Monte Carlo Simulations (->LINK)
Author(s): Heiko Rieger, Ludger Santen, Ulrich Blasum, Martin Diehl, Michael Jünger, Giovanni Rinaldi
zpr96-229 On the Two-Connected Planar Spanning Subgraph Polytope (->LINK)
Author(s): Caterina De Simone, Michael Jünger
zpr96-227 On Computing a Maximal Planar Subgraph using PQ-Trees (->LINK)
Author(s): Michael Jünger, Sebastian Leipert, Petra Mutzel
zpr96-217 Exact Ground States of Two-Dimensional +-J Ising Spin Glasses (->LINK)
Author(s): Caterina De Simone, Martin Diehl, Michael Jünger, Petra Mutzel, Gerhard Reinelt, Giovanni Rinaldi
zpr96-215 A Basic Study of the QAP-Polytope (->LINK)
Author(s): Michael Jünger, Volker Kaibel
zpr95-203 Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization (->LINK)
Author(s): Michael Jünger, Petra Mutzel
zpr95-201 The thickness of a minor-excluded class of graphs (->LINK)
Author(s): Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt
zpr95-191 Solving large-scale traveling salesman problems with parallel Branch-and-Cut (->LINK)
Author(s): Michael Jünger, Peter Störmer
zpr95-184 Exact ground states in spin glasses: New experimental results with a branch-and-cut algorithm (->LINK)
Author(s): Caterina De Simone, Martin Diehl, Michael Jünger, Petra Mutzel, Gerhard Reinelt, Giovanni Rinaldi
zpr94-174 Computing Delaunay-Triangulations in Manhatten and Maximum Metric (->LINK)
Author(s): Michael Jünger, Volker Kaibel, Stefan Thienel
zpr94-168 The Thickness of Graphs without K5-Minors (->LINK)
Author(s): Michael Jünger, Petra Mutzel, Thomas Odenthal, Mark Scharbrodt
zpr94-165 The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems (->LINK)
Author(s): Michael Jünger, Petra Mutzel
zpr94-158 A Practical Method for Computing Correct Delaunay Triangulations in the Euclidian Metric (->LINK)
Author(s): Michael Jünger, Volker Kaibel, Stefan Thienel
zpr94-156 Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization (->LINK)
Author(s): Michael Jünger, Gerhard Reinelt, Stefan Thienel
zpr93-145 Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools (->LINK)
Author(s): Michael Jünger, Petra Mutzel
zpr93-128 Solving the Maximum Weight Planar Subgraph Problem by Branch-and-Cut (->LINK)
Author(s): Michael Jünger, Petra Mutzel
zpr92-114 Provably good solutions for the traveling salesman problem (->LINK)
Author(s): Michael Jünger, Gerhard Reinelt, Stefan Thienel
zpr92-113 The Traveling Salesman Problem (->LINK)
Author(s): Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi
zpr92-111 Geometric Duality and Combinatorial Optimization (->LINK)
Author(s): Michael Jünger, William R. Pulleyblank
zpr92-108 Schnittebenenverfahren in der Kombinatorischen Optimierung (->LINK)
Author(s): Michael Jünger, Gerhard Reinelt
zpr91-105 New primal and dual Matching heuristics (->LINK)
Author(s): Michael Jünger, William R. Pulleyblank
zpr91-102 Quadratic 0/1 Optimization and a Decomposition Approach for the Placement of Electronic Circuits (->LINK)
Author(s): Michael Jünger, Alexander Martin, Gerhard Reinelt, Robert Weismantel
zpr91-099 A complete description of the travelling salesman polytope on 8 nodes (->LINK)
Author(s): Thomas Christof, Michael Jünger, Gerhard Reinelt
zpr90-096 Computing Correct Delaunay Triangulations (->LINK)
Author(s): Michael Jünger, Gerhard Reinelt, Doris Zepf
zpr90-094 Computing the convex hull in the Euclidean plane in linear expected time (->LINK)
Author(s): Michael Jünger, Karl H. Borgwardt, Norbert Gaffke, Gerhard Reinelt