The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michael Jünger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Christoph Buchheim, Michael Jünger, Annette Menze, Merijam Percan
    Bimodal Crossing Minimization. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:497-506 [Conf]
  3. 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]
  4. Michael Jünger, Petra Mutzel, Stephen G. Kobourov
    05191 Abstracts Collection - Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:- [Conf]
  5. Michael Jünger, Stephen G. Kobourov, Petra Mutzel
    05191 Executive Summary - Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:- [Conf]
  6. 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]
  7. Christoph Buchheim, Michael Jünger
    Detecting Symmetries by Branch & Cut. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:178-188 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Michael Jünger, Sebastian Leipert
    Level Planar Embedding in Linear Time. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:72-81 [Conf]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. Michael Jünger, Petra Mutzel
    Solving the maximum weight planar subgraph. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:479-492 [Conf]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]

  54. Crossing Minimization meets Simultaneous Drawing. [Citation Graph (, )][DBLP]


  55. An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. [Citation Graph (, )][DBLP]


  56. Simultaneous Geometric Graph Embeddings. [Citation Graph (, )][DBLP]


  57. Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002