Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael Jünger
2010 – today
- 2013
[j35]Martin Gronemann, Carsten Gutwenger, Michael Jünger, Petra Mutzel: Algorithm Engineering im Graphenzeichnen. Informatik Spektrum 36(2): 162-173 (2013)- [c41]Martin Gronemann, Michael Jünger, Nils Kriege, Petra Mutzel: MolMap - Visualizing Molecule Libraries as Topographic Maps. GRAPP/IVAPP 2013: 515-524
- 2012
- [c40]Martin Gronemann, Michael Jünger: Drawing Clustered Graphs as Topographic Maps. Graph Drawing 2012: 426-438
- [c39]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: 261-272
- 2011
- [j34]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): 385-398 (2011)
- [j33]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel: An SDP approach to multi-level crossing minimization. ACM Journal of Experimental Algorithmics 17(1) (2011)
- [c38]Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel: An SDP Approach to Multi-level Crossing Minimization. ALENEX 2011: 116-126
- 2010
- [j32]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): 1-6 (2010)
- [c37]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: 427-439
2000 – 2009
- 2009
- [j31]Michael Jünger, Michael Schulz: Intersection Graphs in Simultaneous Embedding with Fixed Edges. J. Graph Algorithms Appl. 13(2): 205-218 (2009)
- 2008
- [j30]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)
- [j29]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)
- [c36]Markus Chimani, Michael Jünger, Michael Schulz: Crossing Minimization meets Simultaneous Drawing. PacificVis 2008: 33-40
- [c35]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
- [c34]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
- 2007
- [j28]Stefan Hachul, Michael Jünger: Large-Graph Layout Algorithms at Work: An Experimental Study. J. Graph Algorithms Appl. 11(2): 345-369 (2007)
- [j27]Michael Jünger, Volker Kaibel: Foreword: Special issue on IPCO 2005. Math. Program. 110(1): 1-2 (2007)
- [c33]Alejandro Estrella-Balderrama, Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz: Simultaneous Geometric Graph Embeddings. Graph Drawing 2007: 280-290
- [c32]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
- 2006
- [j26]Christoph Buchheim, Michael Jünger, Sebastian Leipert: Drawing rooted trees in linear time. Softw., Pract. Exper. 36(6): 651-665 (2006)
- [c31]Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan: Bimodal Crossing Minimization. COCOON 2006: 497-506
- [c30]Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer, Michael Schulz: Simultaneous Graph Embeddings with Fixed Edges. WG 2006: 325-335
- [e5]Michael Jünger, Stephen G. Kobourov, Petra Mutzel (Eds.): Graph Drawing, 8.-13. May 2005. Dagstuhl Seminar Proceedings 05191, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- 2005
- [j25]Christoph Buchheim, Michael Jünger: Linear optimization over permutation groups. Discrete Optimization 2(4): 308-319 (2005)
- [c29]Michael Jünger, Stephen G. Kobourov, Petra Mutzel: 05191 Executive Summary - Graph Drawing. Graph Drawing 2005
- [c28]Michael Jünger, Petra Mutzel, Stephen G. Kobourov: 05191 Abstracts Collection - Graph Drawing. Graph Drawing 2005
- [c27]Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher: Exact Crossing Minimization. Graph Drawing 2005: 37-48
- [c26]Stefan Hachul, Michael Jünger: An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. Graph Drawing 2005: 235-250
- [e4]Michael Jünger, Volker Kaibel (Eds.): Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings. Lecture Notes in Computer Science 3509, Springer 2005, ISBN 3-540-26199-0
- 2004
- [j24]Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske: On the complexity of drawing trees nicely: corrigendum. Acta Inf. 40(8): 603-607 (2004)
- [j23]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)
- [j22]Wilhelm Barth, Petra Mutzel, Michael Jünger: Simple and Efficient Bilayer Cross Counting. J. Graph Algorithms Appl. 8(2): 179-194 (2004)
- [c25]Stefan Hachul, Michael Jünger: Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. Graph Drawing 2004: 285-295
- 2003
- [j21]Petra Mutzel, Michael Jünger: Guest Editors' Foreword. J. Graph Algorithms Appl. 7(4): 307-309 (2003)
- [j20]Christoph Buchheim, Michael Jünger: Detecting symmetries by branch & cut. Math. Program. 98(1-3): 369-384 (2003)
- [j19]Matthias Elf, Michael Jünger, Giovanni Rinaldi: Minimizing breaks by maximizing cuts. Oper. Res. Lett. 31(3): 343-349 (2003)
- [c24]Christoph Buchheim, Michael Jünger: An Integer Programming Approach to Fuzzy Symmetry Detection. Graph Drawing 2003: 166-177
- [c23]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
- [c22]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher: Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG 2003: 261-272
- [e3]Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi (Eds.): Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers. Lecture Notes in Computer Science 2570, Springer 2003, ISBN 3-540-00580-3
- 2002
- [j18]Michael Jünger, Sebastian Leipert: Level Planar Embedding in Linear Time. J. Graph Algorithms Appl. 6(1): 67-113 (2002)
- [j17]
- [c21]Ernst Althaus, Alexander Bockmayr, Matthias Elf, Michael Jünger, Thomas Kasper, Kurt Mehlhorn: SCIL - Symbolic Constraints in Integer Linear Programming. ESA 2002: 75-87
- [c20]Wilhelm Barth, Michael Jünger, Petra Mutzel: Simple and Efficient Bilayer Cross Counting. Graph Drawing 2002: 130-141
- [c19]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
- [c18]Christoph Buchheim, Michael Jünger, Sebastian Leipert: Improving Walker's Algorithm to Run in Linear Time. Graph Drawing 2002: 344-353
- [e2]Petra Mutzel, Michael Jünger, Sebastian Leipert (Eds.): Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers. Lecture Notes in Computer Science 2265, Springer 2002, ISBN 3-540-43309-0
- 2001
- [j16]Michael Jünger, Volker Kaibel: The QAP-polytope and the star transformation. Discrete Applied Mathematics 111(3): 283-306 (2001)
- [c17]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
- [c16]Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel: Graph Drawing Algorithm Engineering with AGD. Software Visualization 2001: 307-323
- [c15]Christoph Buchheim, Michael Jünger: Detecting Symmetries by Branch & Cut. Graph Drawing 2001: 178-188
- [c14]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
- [c13]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
- [e1]Michael Jünger, Denis Naddef (Eds.): Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]. Lecture Notes in Computer Science 2241, Springer 2001, ISBN 3-540-42877-1
- 2000
- [j15]Michael Jünger, Giovanni Rinaldi: Practical Performance of Efficient Minimum Cut Algorithms. Algorithmica 26(1): 172-195 (2000)
- [j14]Norbert Ascheuer, Michael Jünger, Gerhard Reinelt: A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Comp. Opt. and Appl. 17(1): 61-84 (2000)
- [j13]Michael Jünger, Volker Kaibel: On the SQAP-Polytope. SIAM Journal on Optimization 11(2): 444-463 (2000)
- [j12]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)
- [c12]Christoph Buchheim, Michael Jünger, Sebastian Leipert: A Fast Layout Algorithm for k-Level Graphs. Graph Drawing 2000: 229-240
1990 – 1999
- 1999
- [c11]
- [c10]Franz-Josef Brandenburg, Michael Jünger, Joe Marks, Petra Mutzel, Falk Schreiber: Graph-Drawing Contest Report. Graph Drawing 1999: 400-409
- 1998
- [j11]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)
- [j10]Michael Jünger, Stefan Thienel: Introduction to ABACUS - a branch-and-cut system. Oper. Res. Lett. 22(2-3): 83-95 (1998)
- [j9]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)
- [c9]Michael Jünger, Sebastian Leipert, Petra Mutzel: Level Planarity Testing in Linear Time. Graph Drawing 1998: 224-237
- [c8]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
- 1997
- [j8]Caterina De Simone, Michael Jünger: On the Two-connected Planar Spanning Subgraph Polytope. Discrete Applied Mathematics 80(2-3): 223-229 (1997)
- [j7]Franz-Josef Brandenburg, Michael Jünger, Petra Mutzel: Algorithmen zum automatischen Zeichnen von Graphen. Informatik Spektrum 20(4): 199-207 (1997)
- [j6]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-447 (1997)
- [j5]Michael Jünger, Petra Mutzel: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. J. Graph Algorithms Appl. 1 (1997)
- [c7]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
- [c6]Michael Jünger, Sebastian Leipert, Petra Mutzel: Pitfalls of Using PQ-Trees in Automatic Graph Drawing. Graph Drawing 1997: 193-204
- [c5]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
- [c4]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
- 1996
- [j4]Michael Jünger, Petra Mutzel: Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. Algorithmica 16(1): 33-59 (1996)
- 1995
- [j3]Michael Jünger, William R. Pulleyblank: New Primal and Dual Matching Heuristics. Algorithmica 13(4): 357-386 (1995)
- [c3]Michael Jünger, Petra Mutzel: Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. Graph Drawing 1995: 337-348
- 1994
- [j2]Michael Jünger, Stefan Thienel, Gerhard Reinelt: Provably good solutions for the traveling salesman problem. Math. Meth. of OR 40(2): 183-217 (1994)
- [j1]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)
- [c2]Michael Jünger, Petra Mutzel: The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. Graph Drawing 1994: 119-130
- 1993
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:21 CEST by the dblp team