Michael Jünger

Sven Mallach

Discret. Optim., 2016

Crossing Minimization in Storyline Visualization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Hardware-Aware Automatic Code-Transformation to Support Compilers in Exploiting the Multi-Level Parallel Potential of Modern CPUs.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Workshop on Code Optimisation for Multi and Many Cores, 2015

2014

Lifting and separation procedures for the cut polytope.

[BibT_eX]

[DOI]

Math. Program., 2014

2013

The Open Graph Drawing Framework (OGDF).

[BibT_eX]

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

Crossings and Planarization.

[BibT_eX]

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

Algorithm Engineering im Graphenzeichnen.

[BibT_eX]

[DOI]

Inform. Spektrum, 2013

The Landscape Metaphor for Visualization of Molecular Similarities.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision, Imaging and Computer Graphics - Theory and Applications, 2013

Solving the simple offset assignment problem as a traveling salesman.

[BibT_eX]

[DOI]

Sven Mallach

Proceedings of the International Workshop on Software and Compilers for Embedded Systems, 2013

MolMap - Visualizing Molecule Libraries as Topographic Maps.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Eduardo Álvarez-Miranda

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

Drawing Clustered Graphs as Topographic Maps.

[BibT_eX]

[DOI]

Martin Gronemann

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

An SDP approach to multi-level crossing minimization.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2011

Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges.

[BibT_eX]

[DOI]

Comput. Geom., 2011

2010

Traces of the XII Aussois Workshop on Combinatorial Optimization.

[BibT_eX]

[DOI]

Thomas M. Liebling

Denis Naddef

William R. Pulleyblank

Giovanni Rinaldi

Laurence A. Wolsey

Math. Program., 2010

Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Intersection Graphs in Simultaneous Embedding with Fixed Edges.

[BibT_eX]

[DOI]

Michael Schulz

J. Graph Algorithms Appl., 2009

2008

Characterizing Simultaneous Embedding with Fixed Edges.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

A branch-and-cut approach to the crossing number problem.

[BibT_eX]

[DOI]

Discret. Optim., 2008

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

Crossing Minimization meets Simultaneous Drawing.

[BibT_eX]

[DOI]

Markus Chimani

Michael Schulz

Proceedings of the IEEE VGTC Pacific Visualization Symposium 2008, 2008

2007

Foreword: Special issue on IPCO 2005.

[BibT_eX]

[DOI]

Math. Program., 2007

Large-Graph Layout Algorithms at Work: An Experimental Study.

[BibT_eX]

[DOI]

Stefan Hachul

J. Graph Algorithms Appl., 2007

A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Markus Behle

Alejandro Estrella-Balderrama

Frauke Liers

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Simultaneous Geometric Graph Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006

Drawing rooted trees in linear time.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2006

Simultaneous Graph Embeddings with Fixed Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Bimodal Crossing Minimization.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Linear optimization over permutation groups.

[BibT_eX]

[DOI]

Discret. Optim., 2005

An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs.

[BibT_eX]

[DOI]

Stefan Hachul

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Exact Crossing Minimization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

05191 Abstracts Collection - Graph Drawing.

[BibT_eX]

[DOI]

Stephen G. Kobourov

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

05191 Executive Summary - Graph Drawing.

[BibT_eX]

[DOI]

Stephen G. Kobourov

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

2004

Simple and Efficient Bilayer Cross Counting.

[BibT_eX]

[DOI]

Wilhelm Barth

J. Graph Algorithms Appl., 2004

Automatic layout of UML class diagrams in orthogonal style.

[BibT_eX]

[DOI]

Inf. Vis., 2004

On the complexity of drawing trees nicely: corrigendum.

[BibT_eX]

[DOI]

Acta Informatica, 2004

Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm.

[BibT_eX]

[DOI]

Stefan Hachul

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Technical Foundations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

Introduction.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

AGD - A Library of Algorithms for Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

A Diagramming Software for UML Class Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing Software, 2004

Graph Drawing: Exact Optimization Helps!

[BibT_eX]

[DOI]

Proceedings of the Sharpest Cut, 2004

2003

Minimizing breaks by maximizing cuts.

[BibT_eX]

[DOI]

Matthias Elf

Giovanni Rinaldi

Oper. Res. Lett., 2003

Detecting symmetries by branch & cut.

[BibT_eX]

[DOI]

Math. Program., 2003

Guest Editors' Foreword.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2003

Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

A New Approach for Visualizing UML Class Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Proceedings ACM 2003 Symposium on Software Visualization, 2003

An Integer Programming Approach to Fuzzy Symmetry Detection.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Preface.

[BibT_eX]

[DOI]

Rüdiger Schultz

Robert Weismantel

Math. Methods Oper. Res., 2002

Level Planar Embedding in Linear Time.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2002

Advances in C-Planarity Testing of Clustered Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Improving Walker's Algorithm to Run in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

SCIL - Symbolic Constraints in Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2002

2001

Box-inequalities for quadratic assignment polytopes.

[BibT_eX]

[DOI]

Math. Program., 2001

The QAP-polytope and the star transformation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

AGD: A Library of Algorithms for Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Caesar Automatic Layout of UML Class Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Graph Drawing Algorithm Engineering with AGD.

[BibT_eX]

[DOI]

Proceedings of the Software Visualization, 2001

Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.

[BibT_eX]

[DOI]

Proceedings of the Computational Combinatorial Optimization, 2001

2000

The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2000

On the SQAP-Polytope.

[BibT_eX]

[DOI]

SIAM J. Optim., 2000

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints.

[BibT_eX]

[DOI]

Norbert Ascheuer

Comput. Optim. Appl., 2000

Practical Performance of Efficient Minimum Cut Algorithms.

[BibT_eX]

[DOI]

Giovanni Rinaldi

Algorithmica, 2000

A Fast Layout Algorithm for <i>k</i>-Level Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Franz-Josef Brandenburg

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

A note on computing a maximal planar subgraph using PQ-trees.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1998

Introduction to ABACUS - a branch-and-cut system.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1998

The thickness of a minor-excluded class of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

A Library of Algorithms for Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Level Planarity Testing in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997

2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1997

A Branch-and-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes.

[BibT_eX]

[DOI]

J. Comput. Biol., 1997

Algorithmen zum automatischen Zeichnen von Graphen.

[BibT_eX]

[DOI]

Franz-Josef Brandenburg

Inform. Spektrum, 1997

On the Two-connected Planar Spanning Subgraph Polytope.

[BibT_eX]

[DOI]

Caterina De Simone

Discret. Appl. Math., 1997

A branch-and-cut approach to physical mapping with end-probes.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Franz-Josef Brandenburg

Thomas Lengauer

Proceedings of the Informatik '97, 1997

A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Pitfalls of Using PQ-Trees in Automatic Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools.

[BibT_eX]

[DOI]

Algorithmica, 1996

1995

New Primal and Dual Matching Heuristics.

[BibT_eX]

[DOI]

William R. Pulleyblank

Algorithmica, 1995

Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

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

[BibT_eX]

[DOI]

Math. Program., 1994

Provably good solutions for the traveling salesman problem.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1994

The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Solving the maximum weight planar subgraph.

[BibT_eX]

Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Practical problem solving with cutting plane algorithms in combinatorialoptimization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 1993

1991

A complete description of the traveling salesman polytope on 8 nodes.

[BibT_eX]

[DOI]

Thomas Christof

Oper. Res. Lett., 1991

Optimal control of plotting and drilling machines: A case study.

[BibT_eX]

[DOI]

ZOR Methods Model. Oper. Res., 1991

Computing correct Delaunay triangulations.

[BibT_eX]

[DOI]

Doris Zepf

Computing, 1991

1990

Computing the Convex Hull in the Euclidean Plane in Linear Expected Time.

[BibT_eX]

[DOI]

Proceedings of the Applied Geometry And Discrete Mathematics, 1990

1989

Experiments in quadratic 0-1 programming.

[BibT_eX]

[DOI]

Francisco Barahona

Math. Program., 1989

1988

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design.

[BibT_eX]

[DOI]

Oper. Res., 1988

1987

Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra.

[BibT_eX]

[DOI]

Reinhardt Euler

Math. Oper. Res., 1987

1985

Polyhedral combinatorics and the acyclic subdigraph problem.

[BibT_eX]

[DOI]

PhD thesis, 1985

Facets of the linear ordering polytope.

[BibT_eX]

[DOI]

Math. Program., 1985

On the acyclic subgraph polytope.

[BibT_eX]

[DOI]

Math. Program., 1985

On partitioning the edges of graphs into connected subgraphs.

[BibT_eX]

[DOI]

William R. Pulleyblank

J. Graph Theory, 1985

1984

A Cutting Plane Algorithm for the Linear Ordering Problem.

[BibT_eX]

[DOI]