| Publication | Date of Publication | Type |
|---|
| Vehicle routing with time-dependent travel times: theory, practice, and benchmarks | 2024-09-11 | Paper |
| Approximation algorithms for traveling salesman problems | 2024-08-26 | Paper |
| Faster goal-oriented shortest path search for bulk and incremental detailed routing | 2024-08-20 | Paper |
| Approximating maximum integral multiflows on bounded genus graphs | 2023-12-21 | Paper |
| Beating the Integrality Ratio for $s$-$t$-Tours in Graphs | 2023-12-19 | Paper |
| Approximating the discrete time-cost tradeoff problem with bounded depth | 2023-03-14 | Paper |
| Improving the approximation ratio for capacitated vehicle routing | 2023-03-14 | Paper |
| Faster goal-oriented shortest path search for bulk and incremental detailed routing | 2022-08-16 | Paper |
| Packing cycles in planar and bounded-genus graphs | 2022-07-01 | Paper |
| An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem | 2022-03-11 | Paper |
| Improving the approximation ratio for capacitated vehicle routing | 2021-12-21 | Paper |
| Approximating the discrete time-cost tradeoff problem with bounded depth | 2021-12-21 | Paper |
| Reducing Path TSP to TSP | 2021-11-19 | Paper |
| On the Integrality Gap of the Prize-Collecting Steiner Forest LP | 2021-07-28 | Paper |
| An Approximation Algorithm for Fully Planar Edge-Disjoint Paths | 2021-04-28 | Paper |
| An improved approximation algorithm for ATSP | 2021-01-19 | Paper |
| Reducing path TSP to TSP | 2021-01-19 | Paper |
| Few Sequence Pairs Suffice: Representing All Rectangle Placements | 2020-10-27 | Paper |
| The asymmetric traveling salesman path LP has constant integrality ratio | 2020-08-28 | Paper |
| An improved upper bound on the integrality ratio for the \(s\)-\(t\)-path TSP | 2020-02-10 | Paper |
| The asymmetric traveling salesman path LP has constant integrality ratio | 2020-02-06 | Paper |
| Vehicle routing with subtours | 2019-11-28 | Paper |
| Approaching 3/2 for the s - t -path TSP | 2019-11-21 | Paper |
| Approximation algorithms for a facility location problem with service capacities | 2018-11-05 | Paper |
| Better \(s-t\)-tours by Gao trees | 2018-10-26 | Paper |
| Algorithmische Mathematik | 2018-06-29 | Paper |
| Combinatorial optimization. Theory and algorithms. Translated from the 6th English edition by Ulrich Brenner and Rabe von Randow | 2018-06-29 | Paper |
| Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP | 2018-03-15 | Paper |
| Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm | 2018-02-23 | Paper |
| Combinatorial optimization. Theory and algorithms | 2018-01-09 | Paper |
| The repeater tree construction problem | 2017-11-03 | Paper |
| Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges | 2017-08-31 | Paper |
| Algorithmic Mathematics | 2016-09-08 | Paper |
| Better s-t-Tours by Gao Trees | 2016-08-10 | Paper |
| Reassembling trees for the traveling salesman | 2016-05-17 | Paper |
| Algorithmic mathematics | 2015-09-08 | Paper |
| Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs | 2015-01-07 | Paper |
| Combinatorial optimization in VLSI design | 2014-11-10 | Paper |
| On dual minimum cost flow algorithms (extended abstract) | 2014-09-26 | Paper |
| \(d\)-dimensional arrangement revisited | 2014-04-11 | Paper |
| Faster algorithm for optimum Steiner trees | 2013-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3116952 | 2012-02-14 | Paper |
| Combinatorial optimization. Theory and algorithms. | 2012-01-02 | Paper |
| Faster min-max resource sharing in theory and practice | 2011-06-08 | Paper |
| Chip-Design und Mathematik | 2011-05-31 | Paper |
| Splitting trees at vertices | 2011-01-07 | Paper |
| Mathematics of Chip Design | 2010-12-28 | Paper |
| Ottimizzazione Combinatoria | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3655277 | 2010-01-07 | Paper |
| A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing | 2009-12-10 | Paper |
| Geometric quadrisection in linear time, with application to VLSI placement | 2009-06-02 | Paper |
| Combinatorial Problems in Chip Design | 2009-02-12 | Paper |
| Kombinatorische Optimierung | 2008-06-25 | Paper |
| From stars to comets: improved local search for universal facility location | 2007-10-30 | Paper |
| Combinatorial optimization. Theory and algorithms. | 2007-10-25 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Combinatorial optimization. Theory and applications. | 2005-11-29 | Paper |
| A note on Schrijver's submodular function minimization algorithm. | 2003-08-17 | Paper |
| On dual minimum cost flow algorithms | 2003-07-14 | Paper |
| Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip | 2002-09-17 | Paper |
| Combinatorial optimization. Theory and algorithms. | 2002-05-23 | Paper |
| The edge-disjoint paths problem is NP-complete for series-parallel graphs | 2002-04-22 | Paper |
| Worst-case ratios of networks in the rectilinear plane | 2002-01-14 | Paper |
| Combinatorial optimization. Theory and algorithms | 2000-07-30 | Paper |
| Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350682 | 1997-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4360320 | 1997-10-24 | Paper |
| NP-completeness of some edge-disjoint paths problems | 1995-08-27 | Paper |
| Cost Allocation for Set Covering: the Happy Nucleolus | N/A | Paper |
