Search the dblp DataBase
Michael Jünger :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Matthias Elf , Carsten Gutwenger , Michael Jünger , Giovanni Rinaldi Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. [Citation Graph (0, 0)][DBLP ] Computational Combinatorial Optimization, 2001, pp:157-222 [Conf ] Christoph Buchheim , Michael Jünger , Annette Menze , Merijam Percan Bimodal Crossing Minimization. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:497-506 [Conf ] Carsten Gutwenger , Michael Jünger , Gunnar W. Klau , Sebastian Leipert , Petra Mutzel Graph Drawing Algorithm Engineering with AGD. [Citation Graph (0, 0)][DBLP ] Software Visualization, 2001, pp:307-323 [Conf ] Michael Jünger , Petra Mutzel , Stephen G. Kobourov 05191 Abstracts Collection - Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2005, pp:- [Conf ] Michael Jünger , Stephen G. Kobourov , Petra Mutzel 05191 Executive Summary - Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2005, pp:- [Conf ] Ernst Althaus , Alexander Bockmayr , Matthias Elf , Michael Jünger , Thomas Kasper , Kurt Mehlhorn SCIL - Symbolic Constraints in Integer Linear Programming. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:75-87 [Conf ] Christoph Buchheim , Michael Jünger Detecting Symmetries by Branch & Cut. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2001, pp:178-188 [Conf ] Christoph Buchheim , Michael Jünger An Integer Programming Approach to Fuzzy Symmetry Detection. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2003, pp:166-177 [Conf ] Christoph Buchheim , Michael Jünger , Sebastian Leipert A Fast Layout Algorithm for k -Level Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2000, pp:229-240 [Conf ] Christoph Buchheim , Michael Jünger , Sebastian Leipert Improving Walker's Algorithm to Run in Linear Time. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2002, pp:344-353 [Conf ] Wilhelm Barth , Michael Jünger , Petra Mutzel Simple and Efficient Bilayer Cross Counting. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2002, pp:130-141 [Conf ] Franz-Josef Brandenburg , Michael Jünger , Joe Marks , Petra Mutzel , Falk Schreiber Graph-Drawing Contest Report. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1999, pp:400-409 [Conf ] Christoph Buchheim , Dietmar Ebner , Michael Jünger , Gunnar W. Klau , Petra Mutzel , René Weiskircher Exact Crossing Minimization. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2005, pp:37-48 [Conf ] Carsten Gutwenger , Michael Jünger , Karsten Klein , Joachim Kupke , Sebastian Leipert , Petra Mutzel Caesar Automatic Layout of UML Class Diagrams. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2001, pp:461-462 [Conf ] Carsten Gutwenger , Michael Jünger , Gunnar W. Klau , Sebastian Leipert , Petra Mutzel , René Weiskircher AGD: A Library of Algorithms for Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2001, pp:473-474 [Conf ] Carsten Gutwenger , Michael Jünger , Sebastian Leipert , Petra Mutzel , Merijam Percan , René Weiskircher Advances in C-Planarity Testing of Clustered Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2002, pp:220-235 [Conf ] Stefan Hachul , Michael Jünger Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2004, pp:285-295 [Conf ] Stefan Hachul , Michael Jünger An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 2005, pp:235-250 [Conf ] Michael Jünger , Sebastian Leipert Level Planar Embedding in Linear Time. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1999, pp:72-81 [Conf ] Michael Jünger , Sebastian Leipert , Petra Mutzel Pitfalls of Using PQ-Trees in Automatic Graph Drawing. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1997, pp:193-204 [Conf ] Michael Jünger , Sebastian Leipert , Petra Mutzel Level Planarity Testing in Linear Time. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1998, pp:224-237 [Conf ] Michael Jünger , Eva K. Lee , Petra Mutzel , Thomas Odenthal A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1997, pp:13-24 [Conf ] Michael Jünger , Petra Mutzel The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1994, pp:119-130 [Conf ] Michael Jünger , Petra Mutzel Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1995, pp:337-348 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] Graph Drawing, 1998, pp:456-457 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] GI Jahrestagung, 1997, pp:58-67 [Conf ] Michael Jünger , Petra Mutzel Solving the maximum weight planar subgraph. [Citation Graph (0, 0)][DBLP ] IPCO, 1993, pp:479-492 [Conf ] Thomas Christof , Michael Jünger , John D. Kececioglu , Petra Mutzel , Gerhard Reinelt A branch-and-cut approach to physical mapping with end-probes. [Citation Graph (0, 0)][DBLP ] RECOMB, 1997, pp:84-92 [Conf ] Carsten Gutwenger , Michael Jünger , Karsten Klein , Joachim Kupke , Sebastian Leipert , Petra Mutzel A New Approach for Visualizing UML Class Diagrams. [Citation Graph (0, 0)][DBLP ] SOFTVIS, 2003, pp:179-188 [Conf ] Elisabeth Gassner , Michael Jünger , Merijam Percan , Marcus Schaefer , Michael Schulz Simultaneous Graph Embeddings with Fixed Edges. [Citation Graph (0, 0)][DBLP ] WG, 2006, pp:325-335 [Conf ] Carsten Gutwenger , Michael Jünger , Sebastian Leipert , Petra Mutzel , Merijam Percan , René Weiskircher Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WG, 2003, pp:261-272 [Conf ] Thorsten Akkerman , Christoph Buchheim , Michael Jünger , Daniel Teske On the complexity of drawing trees nicely: corrigendum. [Citation Graph (0, 0)][DBLP ] Acta Inf., 2004, v:40, n:8, pp:603-607 [Journal ] Michael Jünger , Petra Mutzel Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1996, v:16, n:1, pp:33-59 [Journal ] Michael Jünger , William R. Pulleyblank New Primal and Dual Matching Heuristics. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1995, v:13, n:4, pp:357-386 [Journal ] Michael Jünger , Giovanni Rinaldi Practical Performance of Efficient Minimum Cut Algorithms. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2000, v:26, n:1, pp:172-195 [Journal ] Michael Jünger , Volker Kaibel The QAP-polytope and the star transformation. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:111, n:3, pp:283-306 [Journal ] Caterina De Simone , Michael Jünger On the Two-connected Planar Spanning Subgraph Polytope. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:80, n:2-3, pp:223-229 [Journal ] Franz-Josef Brandenburg , Michael Jünger , Petra Mutzel Algorithmen zum automatischen Zeichnen von Graphen. [Citation Graph (0, 0)][DBLP ] Informatik Spektrum, 1997, v:20, n:4, pp:199-207 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Information Visualization, 2004, v:3, n:3, pp:189-208 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 1997, v:4, n:4, pp:433-448 [Journal ] Wilhelm Barth , Petra Mutzel , Michael Jünger Simple and Efficient Bilayer Cross Counting. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2004, v:8, n:2, pp:179-194 [Journal ] Petra Mutzel , Michael Jünger Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2003, v:7, n:4, pp:307-309 [Journal ] Michael Jünger , Sebastian Leipert Level Planar Embedding in Linear Time. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 2002, v:6, n:1, pp:67-113 [Journal ] Michael Jünger , Petra Mutzel 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms. [Citation Graph (0, 0)][DBLP ] J. Graph Algorithms Appl., 1997, v:1, n:, pp:- [Journal ] Michael Jünger , Alexander Martin , Gerhard Reinelt , Robert Weismantel Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits. [Citation Graph (0, 0)][DBLP ] Math. Program., 1994, v:63, n:, pp:257-279 [Journal ] Michael Jünger , Volker Kaibel Foreword: Special issue on IPCO 2005. [Citation Graph (0, 0)][DBLP ] Math. Program., 2007, v:110, n:1, pp:1-2 [Journal ] Matthias Elf , Michael Jünger , Giovanni Rinaldi Minimizing breaks by maximizing cuts. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2003, v:31, n:3, pp:343-349 [Journal ] Michael Jünger , Stefan Thienel Introduction to ABACUS - a branch-and-cut system. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 1998, v:22, n:2-3, pp:83-95 [Journal ] Michael Jünger , Stefan Thienel The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 2000, v:30, n:11, pp:1325-1352 [Journal ] Christoph Buchheim , Michael Jünger , Sebastian Leipert Drawing rooted trees in linear time. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 2006, v:36, n:6, pp:651-665 [Journal ] Michael Jünger , Sebastian Leipert , Petra Mutzel A note on computing a maximal planar subgraph using PQ-trees. [Citation Graph (0, 0)][DBLP ] IEEE Trans. on CAD of Integrated Circuits and Systems, 1998, v:17, n:7, pp:609-612 [Journal ] Markus Behle , Michael Jünger , Frauke Liers A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. [Citation Graph (0, 0)][DBLP ] WEA, 2007, pp:379-392 [Conf ] Michael Jünger , Petra Mutzel , Thomas Odenthal , Mark Scharbrodt The thickness of a minor-excluded class of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:182, n:1-3, pp:169-176 [Journal ] Crossing Minimization meets Simultaneous Drawing. [Citation Graph (, )][DBLP ] An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. [Citation Graph (, )][DBLP ] Simultaneous Geometric Graph Embeddings. [Citation Graph (, )][DBLP ] Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. [Citation Graph (, )][DBLP ] Search in 0.145secs, Finished in 0.147secs