Michael Jünger

According to our database1, Michael Jünger
  • authored at least 103 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Orthogonal Compaction Using Additional Bends.
CoRR, 2017

2016
Single-commodity robust network design with finite and Hose demand sets.
Math. Program., 2016

An integer programming approach to optimal basic block instruction scheduling for single-issue processors.
Discrete Optimization, 2016

Crossing Minimization in Storyline Visualization.
CoRR, 2016

Crossing Minimization in Storyline Visualization.
Proceedings of the Graph Drawing and Network Visualization, 2016

2015
Hardware-Aware Automatic Code-Transformation to Support Compilers in Exploiting the Multi-Level Parallel Potential of Modern CPUs.
Proceedings of the 2015 International Workshop on Code Optimisation for Multi and Many Cores, 2015

2014
Lifting and separation procedures for the cut polytope.
Math. Program., 2014

2013
The Open Graph Drawing Framework (OGDF).
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Crossings and Planarization.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Algorithm Engineering im Graphenzeichnen.
Informatik Spektrum, 2013

Solving the simple offset assignment problem as a traveling salesman.
Proceedings of the International Workshop on Software and Compilers for Embedded Systems, 2013

MolMap - Visualizing Molecule Libraries as Topographic Maps.
Proceedings of the GRAPP & IVAPP 2013: Proceedings of the International Conference on Computer Graphics Theory and Applications and International Conference on Information Visualization Theory and Applications, 2013

2012
Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Drawing Clustered Graphs as Topographic Maps.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
An SDP approach to multi-level crossing minimization.
ACM Journal of Experimental Algorithmics, 2011

Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges.
Comput. Geom., 2011

An SDP Approach to Multi-level Crossing Minimization.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
Traces of the XII Aussois Workshop on Combinatorial Optimization.
Math. Program., 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Intersection Graphs in Simultaneous Embedding with Fixed Edges.
J. Graph Algorithms Appl., 2009

2008
Characterizing Simultaneous Embedding with Fixed Edges.
Electronic Notes in Discrete Mathematics, 2008

A branch-and-cut approach to the crossing number problem.
Discrete Optimization, 2008

Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Crossing Minimization meets Simultaneous Drawing.
Proceedings of the IEEE VGTC Pacific Visualization Symposium 2008, 2008

2007
Foreword: Special issue on IPCO 2005.
Math. Program., 2007

Large-Graph Layout Algorithms at Work: An Experimental Study.
J. Graph Algorithms Appl., 2007

A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Simultaneous Geometric Graph Embeddings.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
Drawing rooted trees in linear time.
Softw., Pract. Exper., 2006

Simultaneous Graph Embeddings with Fixed Edges.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Bimodal Crossing Minimization.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
Linear optimization over permutation groups.
Discrete Optimization, 2005

An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Exact Crossing Minimization.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

05191 Abstracts Collection - Graph Drawing.
Proceedings of the Graph Drawing, 8.-13. May 2005, 2005

05191 Executive Summary - Graph Drawing.
Proceedings of the Graph Drawing, 8.-13. May 2005, 2005

2004
Simple and Efficient Bilayer Cross Counting.
J. Graph Algorithms Appl., 2004

Automatic layout of UML class diagrams in orthogonal style.
Information Visualization, 2004

On the complexity of drawing trees nicely: corrigendum.
Acta Inf., 2004

Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

Technical Foundations.
Graph Drawing Software, 2004

Introduction.
Graph Drawing Software, 2004

AGD - A Library of Algorithms for Graph Drawing.
Graph Drawing Software, 2004

A Diagramming Software for UML Class Diagrams.
Graph Drawing Software, 2004

2003
Minimizing breaks by maximizing cuts.
Oper. Res. Lett., 2003

Detecting symmetries by branch & cut.
Math. Program., 2003

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2003

Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

A New Approach for Visualizing UML Class Diagrams.
Proceedings of the Proceedings ACM 2003 Symposium on Software Visualization, 2003

An Integer Programming Approach to Fuzzy Symmetry Detection.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Preface.
Math. Meth. of OR, 2002

Level Planar Embedding in Linear Time.
J. Graph Algorithms Appl., 2002

Advances in C-Planarity Testing of Clustered Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Improving Walker's Algorithm to Run in Linear Time.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

Simple and Efficient Bilayer Cross Counting.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

SCIL - Symbolic Constraints in Integer Linear Programming.
Proceedings of the Algorithms, 2002

2001
Box-inequalities for quadratic assignment polytopes.
Math. Program., 2001

The QAP-polytope and the star transformation.
Discrete Applied Mathematics, 2001

AGD: A Library of Algorithms for Graph Drawing.
Graph Drawing, 2001

Caesar Automatic Layout of UML Class Diagrams.
Graph Drawing, 2001

Detecting Symmetries by Branch & Cut.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Graph Drawing Algorithm Engineering with AGD.
Proceedings of the Software Visualization, 2001

Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.
Proceedings of the Computational Combinatorial Optimization, 2001

2000
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization.
Softw., Pract. Exper., 2000

On the SQAP-Polytope.
SIAM Journal on Optimization, 2000

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints.
Comp. Opt. and Appl., 2000

Practical Performance of Efficient Minimum Cut Algorithms.
Algorithmica, 2000

A Fast Layout Algorithm for k-Level Graphs.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
Level Planar Embedding in Linear Time.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

Graph-Drawing Contest Report.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998
A note on computing a maximal planar subgraph using PQ-trees.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1998

Introduction to ABACUS - a branch-and-cut system.
Oper. Res. Lett., 1998

The thickness of a minor-excluded class of graphs.
Discrete Mathematics, 1998

A Library of Algorithms for Graph Drawing.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

Level Planarity Testing in Linear Time.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.
J. Graph Algorithms Appl., 1997

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes.
Journal of Computational Biology, 1997

Algorithmen zum automatischen Zeichnen von Graphen.
Informatik Spektrum, 1997

On the Two-connected Planar Spanning Subgraph Polytope.
Discrete Applied Mathematics, 1997

A branch-and-cut approach to physical mapping with end-probes.
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997

Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen.
Proceedings of the Informatik '97, 1997

A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Pitfalls of Using PQ-Trees in Automatic Graph Drawing.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools.
Algorithmica, 1996

1995
New Primal and Dual Matching Heuristics.
Algorithmica, 1995

Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, GD '95, Passau, 1995

1994
Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits.
Math. Program., 1994

Provably good solutions for the traveling salesman problem.
Math. Meth. of OR, 1994

The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993
Solving the maximum weight planar subgraph.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Practical problem solving with cutting plane algorithms in combinatorialoptimization.
Proceedings of the Combinatorial Optimization, 1993

1991
Optimal control of plotting and drilling machines: A case study.
ZOR - Meth. & Mod. of OR, 1991

Computing correct Delaunay triangulations.
Computing, 1991

1990
Computing the Convex Hull in the Euclidean Plane in Linear Expected Time.
Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989
Experiments in quadratic 0-1 programming.
Math. Program., 1989

1988
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design.
Operations Research, 1988

1987
Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra.
Math. Oper. Res., 1987

1985
Polyhedral combinatorics and the acyclic subdigraph problem.
PhD thesis, 1985

Facets of the linear ordering polytope.
Math. Program., 1985

On the acyclic subgraph polytope.
Math. Program., 1985

On partitioning the edges of graphs into connected subgraphs.
Journal of Graph Theory, 1985

1984
A Cutting Plane Algorithm for the Linear Ordering Problem.
Operations Research, 1984


  Loading...