| Publication | Date of Publication | Type |
|---|
| The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem | 2023-08-10 | Paper |
| Hard to solve instances of the Euclidean traveling salesman problem | 2021-11-16 | Paper |
| The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem | 2021-04-07 | Paper |
| The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem | 2020-10-06 | Paper |
| On the integrality ratio of the subtour LP for Euclidean TSP | 2018-09-28 | Paper |
| The approximation ratio of the greedy algorithm for the metric traveling salesman problem | 2018-09-28 | Paper |
| Proof checking and non-approximability | 2018-07-03 | Paper |
| Algorithmische Mathematik | 2018-06-29 | Paper |
| Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm | 2018-02-23 | Paper |
| Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems | 2017-04-07 | Paper |
| Algorithmic Mathematics | 2016-09-08 | Paper |
| On the nearest neighbor rule for the metric traveling salesman problem | 2015-09-21 | Paper |
| Edge Elimination in TSP Instances | 2015-09-09 | Paper |
| Algorithmic mathematics | 2015-09-08 | Paper |
| A linear-time approximation algorithm for weighted matchings in graphs | 2015-09-02 | Paper |
| On packing squares into a rectangle | 2011-08-02 | Paper |
| The Floyd-Warshall algorithm on graphs with negative cycles | 2010-09-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Surface Realization with the Intersection Segment Functional | 2010-04-01 | Paper |
| Approximating weighted matchings in parallel | 2010-01-29 | Paper |
| Polyhedral tori with minimal coordinates | 2009-10-12 | Paper |
| On approximation algorithms for the terminal Steiner tree problem | 2009-07-09 | Paper |
| A simple approximation algorithm for the weighted matching problem | 2009-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5458664 | 2008-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5458667 | 2008-04-16 | Paper |
| Computation of best possible low degree expanders | 2007-11-30 | Paper |
| On a conjecture of Hoàng and Tu concerning perfectly orderable graphs | 2007-01-09 | Paper |
| Classes of perfect graphs | 2006-10-30 | Paper |
| Surface realization with the intersection edge functional | 2006-08-22 | Paper |
| Lower bounds for the relative greedy algorithm for approximating Steiner trees | 2006-05-16 | Paper |
| Perfectness is an Elusive Graph Property | 2005-02-21 | Paper |
| On simplicial and co-simplicial vertices in graphs. | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448761 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426349 | 2003-09-16 | Paper |
| Recursive generation of partitionable graphs | 2003-03-19 | Paper |
| Steiner trees in uniformly quasi-bipartite graphs. | 2003-01-21 | Paper |
| The \(P_4\)-structure of perfect graphs | 2002-08-08 | Paper |
| On wing-perfect graphs | 1999-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252319 | 1999-06-17 | Paper |
| Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth | 1999-04-13 | Paper |
| A CONJECTURE OF KAUFFMAN ON AMPHICHEIRAL ALTERNATING KNOTS | 1998-05-07 | Paper |
| Does the Jones Polynomial Detect Unknottedness? | 1998-03-09 | Paper |
| On the \(P_ 4\)-structure of perfect graphs. V: Overlap graphs | 1997-09-24 | Paper |
| Perfect graphs with unique \(P_ 4\)-structure | 1997-06-10 | Paper |
| Wing-triangulated graphs are perfect | 1997-06-09 | Paper |
| Even pairs and the strong perfect graph conjecture | 1996-08-22 | Paper |
| Probabilistically checkable proofs and their consequences for approximation algorithms | 1995-11-06 | Paper |
| Even and odd pairs in linegraphs of bipartite graphs | 1995-03-08 | Paper |
| Counterexamples to three conjectures concerning perfect graphs | 1994-09-11 | Paper |
| The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$ | N/A | Paper |
| The Bottom-Left Algorithm for the Strip Packing Problem | N/A | Paper |
