| Publication | Date of Publication | Type |
|---|
| Comments on “An Exact Method for the Minimum Feedback Arc Set Problem” | 2024-04-14 | Paper |
| Quantum Annealing versus Digital Computing | 2022-09-06 | Paper |
| Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization | 2022-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075808 | 2022-05-11 | Paper |
| Algorithmic Symplectic Packing | 2021-06-18 | Paper |
| A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width | 2019-09-16 | Paper |
| An SDP Approach to Multi-level Crossing Minimization | 2019-09-12 | Paper |
| A flow formulation for horizontal coordinate assignment with prescribed width | 2019-02-15 | Paper |
| An integer programming approach to optimal basic block instruction scheduling for single-issue processors | 2018-05-24 | Paper |
| Crossing Minimization in Storyline Visualization | 2017-02-21 | Paper |
| Single-commodity robust network design with finite and hose demand sets | 2016-06-06 | Paper |
| Martin Grötschel—The Early Years in Bonn and Augsburg | 2015-07-22 | Paper |
| Lifting and separation procedures for the cut polytope | 2014-08-29 | Paper |
| An SDP approach to multi-level crossing minimization | 2014-04-01 | Paper |
| Exact ground states of two-dimensional \(\pm J\) Ising spin glasses | 2013-04-10 | Paper |
| Drawing Clustered Graphs as Topographic Maps | 2013-04-03 | Paper |
| Models and Algorithms for Robust Network Design with Several Traffic Scenarios | 2012-11-02 | Paper |
| Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut | 2010-12-09 | Paper |
| Traces of the XII Aussois Workshop on combinatorial optimization | 2010-09-16 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Linear optimization over permutation groups | 2009-06-02 | Paper |
| Large-Graph Layout Algorithms at Work: An Experimental Study | 2009-01-19 | Paper |
| A branch-and-cut approach to the crossing number problem | 2008-10-29 | Paper |
| A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem | 2008-01-02 | Paper |
| Bimodal Crossing Minimization | 2007-09-10 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm | 2006-08-23 | Paper |
| Simple and Efficient Bilayer Cross Counting | 2006-04-03 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465124 | 2005-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668573 | 2005-04-19 | Paper |
| On the complexity of drawing trees nicely: Corrigendum | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4735939 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043715 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043769 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043780 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472311 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471661 | 2004-07-30 | Paper |
| Detecting symmetries by branch and cut. | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450521 | 2004-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422269 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422278 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422294 | 2003-09-03 | Paper |
| A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints | 2003-08-26 | Paper |
| Minimizing breaks by maximizing cuts. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411347 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789079 | 2003-01-23 | Paper |
| Level Planar Embedding in Linear Time | 2002-07-25 | Paper |
| The QAP-polytope and the star transformation | 2002-02-05 | Paper |
| On the SQAP-Polytope | 2001-03-19 | Paper |
| Box-inequalities for quadratic assignment polytopes | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501696 | 2000-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234163 | 2000-10-10 | Paper |
| Practical performance of efficient minimum cut algorithms | 2000-03-19 | Paper |
| Introduction to ABACUS -- a branch-and-cut system | 1998-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398370 | 1998-07-19 | Paper |
| The thickness of a minor-excluded class of graphs | 1998-05-13 | Paper |
| 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms | 1998-04-01 | Paper |
| On the two-connected planar spanning subgraph polytope | 1998-03-25 | Paper |
| Maximum planar subgraphs and nice embeddings: Practical layout tools | 1996-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840772 | 1996-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845366 | 1996-03-05 | Paper |
| Provably good solutions for the traveling salesman problem | 1995-06-25 | Paper |
| New primal and dual matching heuristics | 1995-05-30 | Paper |
| Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits | 1994-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694565 | 1993-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036709 | 1993-05-18 | Paper |
| A complete description of the traveling salesman polytope on 8 nodes | 1992-06-28 | Paper |
| Computing correct Delaunay triangulations | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974960 | 1992-06-26 | Paper |
| Optimal control of plotting and drilling machines: A case study | 1991-01-01 | Paper |
| Experiments in quadratic 0-1 programming | 1989-01-01 | Paper |
| Via Minimization with Pin Preassignments and Layer Preference | 1989-01-01 | Paper |
| An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design | 1988-01-01 | Paper |
| Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221421 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680606 | 1985-01-01 | Paper |
| On the acyclic subgraph polytope | 1985-01-01 | Paper |
| Facets of the linear ordering polytope | 1985-01-01 | Paper |
| On partitioning the edges of graphs into connected subgraphs | 1985-01-01 | Paper |
| A Cutting Plane Algorithm for the Linear Ordering Problem | 1984-01-01 | Paper |
