| 2008 |
|---|
| 66 | EE | 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: 157-168 |
| 65 | EE | Markus Chimani,
Michael Jünger,
Michael Schulz:
Crossing Minimization meets Simultaneous Drawing.
PacificVis 2008: 33-40 |
| 64 | EE | 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: 146-158 |
| 63 | EE | 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.
Discrete Optimization 5(2): 373-388 (2008) |
| 62 | EE | J. Joseph Fowler,
Michael Jünger,
Stephen G. Kobourov,
Michael Schulz:
Characterizing Simultaneous Embedding with Fixed Edges.
Electronic Notes in Discrete Mathematics 31: 41-44 (2008) |
| 2007 |
|---|
| 61 | EE | Alejandro Estrella-Balderrama,
Elisabeth Gassner,
Michael Jünger,
Merijam Percan,
Marcus Schaefer,
Michael Schulz:
Simultaneous Geometric Graph Embeddings.
Graph Drawing 2007: 280-290 |
| 60 | EE | Markus Behle,
Michael Jünger,
Frauke Liers:
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
WEA 2007: 379-392 |
| 59 | EE | Stefan Hachul,
Michael Jünger:
Large-Graph Layout Algorithms at Work: An Experimental Study.
J. Graph Algorithms Appl. 11(2): 345-369 (2007) |
| 58 | EE | Michael Jünger,
Volker Kaibel:
Foreword: Special issue on IPCO 2005.
Math. Program. 110(1): 1-2 (2007) |
| 2006 |
|---|
| 57 | | Michael Jünger,
Stephen G. Kobourov,
Petra Mutzel:
Graph Drawing, 8.-13. May 2005
Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 56 | EE | Christoph Buchheim,
Michael Jünger,
Annette Menze,
Merijam Percan:
Bimodal Crossing Minimization.
COCOON 2006: 497-506 |
| 55 | EE | Elisabeth Gassner,
Michael Jünger,
Merijam Percan,
Marcus Schaefer,
Michael Schulz:
Simultaneous Graph Embeddings with Fixed Edges.
WG 2006: 325-335 |
| 54 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
Drawing rooted trees in linear time.
Softw., Pract. Exper. 36(6): 651-665 (2006) |
| 2005 |
|---|
| 53 | | Michael Jünger,
Volker Kaibel:
Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
Springer 2005 |
| 52 | EE | Michael Jünger,
Petra Mutzel,
Stephen G. Kobourov:
05191 Abstracts Collection - Graph Drawing.
Graph Drawing 2005 |
| 51 | EE | Michael Jünger,
Stephen G. Kobourov,
Petra Mutzel:
05191 Executive Summary - Graph Drawing.
Graph Drawing 2005 |
| 50 | EE | Stefan Hachul,
Michael Jünger:
An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs.
Graph Drawing 2005: 235-250 |
| 49 | EE | Christoph Buchheim,
Dietmar Ebner,
Michael Jünger,
Gunnar W. Klau,
Petra Mutzel,
René Weiskircher:
Exact Crossing Minimization.
Graph Drawing 2005: 37-48 |
| 48 | EE | Christoph Buchheim,
Michael Jünger:
Linear optimization over permutation groups.
Discrete Optimization 2(4): 308-319 (2005) |
| 2004 |
|---|
| 47 | EE | Stefan Hachul,
Michael Jünger:
Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm.
Graph Drawing 2004: 285-295 |
| 46 | EE | Thorsten Akkerman,
Christoph Buchheim,
Michael Jünger,
Daniel Teske:
On the complexity of drawing trees nicely: corrigendum.
Acta Inf. 40(8): 603-607 (2004) |
| 45 | EE | 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.
Information Visualization 3(3): 189-208 (2004) |
| 44 | EE | Wilhelm Barth,
Petra Mutzel,
Michael Jünger:
Simple and Efficient Bilayer Cross Counting.
J. Graph Algorithms Appl. 8(2): 179-194 (2004) |
| 2003 |
|---|
| 43 | | Michael Jünger,
Gerhard Reinelt,
Giovanni Rinaldi:
Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers
Springer 2003 |
| 42 | EE | Christoph Buchheim,
Michael Jünger:
An Integer Programming Approach to Fuzzy Symmetry Detection.
Graph Drawing 2003: 166-177 |
| 41 | | Carsten Gutwenger,
Michael Jünger,
Karsten Klein,
Joachim Kupke,
Sebastian Leipert,
Petra Mutzel:
A New Approach for Visualizing UML Class Diagrams.
SOFTVIS 2003: 179-188, 217-218 |
| 40 | EE | Carsten Gutwenger,
Michael Jünger,
Sebastian Leipert,
Petra Mutzel,
Merijam Percan,
René Weiskircher:
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).
WG 2003: 261-272 |
| 39 | EE | Petra Mutzel,
Michael Jünger:
Guest Editors' Foreword.
J. Graph Algorithms Appl. 7(4): 307-309 (2003) |
| 38 | EE | Matthias Elf,
Michael Jünger,
Giovanni Rinaldi:
Minimizing breaks by maximizing cuts.
Oper. Res. Lett. 31(3): 343-349 (2003) |
| 2002 |
|---|
| 37 | | Petra Mutzel,
Michael Jünger,
Sebastian Leipert:
Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers
Springer 2002 |
| 36 | EE | Ernst Althaus,
Alexander Bockmayr,
Matthias Elf,
Michael Jünger,
Thomas Kasper,
Kurt Mehlhorn:
SCIL - Symbolic Constraints in Integer Linear Programming.
ESA 2002: 75-87 |
| 35 | EE | Wilhelm Barth,
Michael Jünger,
Petra Mutzel:
Simple and Efficient Bilayer Cross Counting.
Graph Drawing 2002: 130-141 |
| 34 | EE | Carsten Gutwenger,
Michael Jünger,
Sebastian Leipert,
Petra Mutzel,
Merijam Percan,
René Weiskircher:
Advances in C-Planarity Testing of Clustered Graphs.
Graph Drawing 2002: 220-235 |
| 33 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
Improving Walker's Algorithm to Run in Linear Time.
Graph Drawing 2002: 344-353 |
| 32 | EE | Michael Jünger,
Sebastian Leipert:
Level Planar Embedding in Linear Time.
J. Graph Algorithms Appl. 6(1): 67-113 (2002) |
| 2001 |
|---|
| 31 | | Michael Jünger,
Denis Naddef:
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]
Springer 2001 |
| 30 | EE | 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: 157-222 |
| 29 | EE | Christoph Buchheim,
Michael Jünger:
Detecting Symmetries by Branch & Cut.
Graph Drawing 2001: 178-188 |
| 28 | EE | Carsten Gutwenger,
Michael Jünger,
Karsten Klein,
Joachim Kupke,
Sebastian Leipert,
Petra Mutzel:
Caesar Automatic Layout of UML Class Diagrams.
Graph Drawing 2001: 461-462 |
| 27 | EE | 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: 473-474 |
| 26 | EE | Carsten Gutwenger,
Michael Jünger,
Gunnar W. Klau,
Sebastian Leipert,
Petra Mutzel:
Graph Drawing Algorithm Engineering with AGD.
Software Visualization 2001: 307-323 |
| 25 | | Michael Jünger,
Volker Kaibel:
The QAP-polytope and the star transformation.
Discrete Applied Mathematics 111(3): 283-306 (2001) |
| 2000 |
|---|
| 24 | EE | Christoph Buchheim,
Michael Jünger,
Sebastian Leipert:
A Fast Layout Algorithm for k-Level Graphs.
Graph Drawing 2000: 229-240 |
| 23 | EE | Michael Jünger,
Giovanni Rinaldi:
Practical Performance of Efficient Minimum Cut Algorithms.
Algorithmica 26(1): 172-195 (2000) |
| 22 | | Michael Jünger,
Stefan Thienel:
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization.
Softw., Pract. Exper. 30(11): 1325-1352 (2000) |
| 1999 |
|---|
| 21 | EE | Franz-Josef Brandenburg,
Michael Jünger,
Joe Marks,
Petra Mutzel,
Falk Schreiber:
Graph-Drawing Contest Report.
Graph Drawing 1999: 400-409 |
| 20 | EE | Michael Jünger,
Sebastian Leipert:
Level Planar Embedding in Linear Time.
Graph Drawing 1999: 72-81 |
| 1998 |
|---|
| 19 | EE | Michael Jünger,
Sebastian Leipert,
Petra Mutzel:
Level Planarity Testing in Linear Time.
Graph Drawing 1998: 224-237 |
| 18 | EE | 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: 456-457 |
| 17 | EE | Michael Jünger,
Petra Mutzel,
Thomas Odenthal,
Mark Scharbrodt:
The thickness of a minor-excluded class of graphs.
Discrete Mathematics 182(1-3): 169-176 (1998) |
| 16 | EE | Michael Jünger,
Sebastian Leipert,
Petra Mutzel:
A note on computing a maximal planar subgraph using PQ-trees.
IEEE Trans. on CAD of Integrated Circuits and Systems 17(7): 609-612 (1998) |
| 15 | EE | Michael Jünger,
Stefan Thienel:
Introduction to ABACUS - a branch-and-cut system.
Oper. Res. Lett. 22(2-3): 83-95 (1998) |
| 1997 |
|---|
| 14 | | 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: 58-67 |
| 13 | | Michael Jünger,
Eva K. Lee,
Petra Mutzel,
Thomas Odenthal:
A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem.
Graph Drawing 1997: 13-24 |
| 12 | | Michael Jünger,
Sebastian Leipert,
Petra Mutzel:
Pitfalls of Using PQ-Trees in Automatic Graph Drawing.
Graph Drawing 1997: 193-204 |
| 11 | EE | 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: 84-92 |
| 10 | EE | Caterina De Simone,
Michael Jünger:
On the Two-connected Planar Spanning Subgraph Polytope.
Discrete Applied Mathematics 80(2-3): 223-229 (1997) |
| 9 | | Franz-Josef Brandenburg,
Michael Jünger,
Petra Mutzel:
Algorithmen zum automatischen Zeichnen von Graphen.
Informatik Spektrum 20(4): 199-207 (1997) |
| 8 | EE | Michael Jünger,
Petra Mutzel:
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.
J. Graph Algorithms Appl. 1: (1997) |
| 7 | | 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.
Journal of Computational Biology 4(4): 433-448 (1997) |
| 1996 |
|---|
| 6 | | Michael Jünger,
Petra Mutzel:
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools.
Algorithmica 16(1): 33-59 (1996) |
| 1995 |
|---|
| 5 | | Michael Jünger,
Petra Mutzel:
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.
Graph Drawing 1995: 337-348 |
| 4 | | Michael Jünger,
William R. Pulleyblank:
New Primal and Dual Matching Heuristics.
Algorithmica 13(4): 357-386 (1995) |
| 1994 |
|---|
| 3 | | Michael Jünger,
Petra Mutzel:
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems.
Graph Drawing 1994: 119-130 |
| 2 | | 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: 257-279 (1994) |
| 1993 |
|---|
| 1 | | Michael Jünger,
Petra Mutzel:
Solving the maximum weight planar subgraph.
IPCO 1993: 479-492 |
