| Publication | Date of Publication | Type |
|---|
Improved guarantees for the a priori TSP
Mathematics of Operations Research | 2025-11-26 | Paper |
Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
Discrete Optimization | 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
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
Approximating maximum integral multiflows on bounded genus graphs
Discrete & Computational Geometry | 2023-12-21 | Paper |
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs
SIAM Journal on Computing | 2023-12-19 | Paper |
Approximating the discrete time-cost tradeoff problem with bounded depth
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Improving the approximation ratio for capacitated vehicle routing
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Faster goal-oriented shortest path search for bulk and incremental detailed routing
(available as arXiv preprint) | 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
SIAM Journal on Computing | 2022-03-11 | Paper |
Improving the approximation ratio for capacitated vehicle routing
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Approximating the discrete time-cost tradeoff problem with bounded depth
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
Reducing Path TSP to TSP
SIAM Journal on Computing | 2021-11-19 | Paper |
On the integrality gap of the prize-collecting Steiner forest LP
(available as arXiv preprint) | 2021-07-28 | Paper |
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
An improved approximation algorithm for ATSP
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Reducing path TSP to TSP
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Few sequence pairs suffice: representing all rectangle placements
SIAM Journal on Discrete Mathematics | 2020-10-27 | Paper |
The asymmetric traveling salesman path LP has constant integrality ratio
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
An improved upper bound on the integrality ratio for the \(s\)-\(t\)-path TSP
Operations Research Letters | 2020-02-10 | Paper |
The asymmetric traveling salesman path LP has constant integrality ratio
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Vehicle routing with subtours
Discrete Optimization | 2019-11-28 | Paper |
Approaching 3/2 for the \(s\)-\(t\)-path TSP
Journal of the ACM | 2019-11-21 | Paper |
Approximation algorithms for a facility location problem with service capacities
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Better \(s-t\)-tours by Gao trees
Mathematical Programming. Series A. Series B | 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
Masterclass | 2018-06-29 | Paper |
| Approaching \(\frac 23\) for the \(s\)-\(t\)-path TSP | 2018-03-15 | Paper |
Approaching \(\frac 23\) for the \(s\)-\(t\)-path TSP
(available as arXiv preprint) | 2018-03-15 | Paper |
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Mathematical Programming Computation | 2018-02-23 | Paper |
Combinatorial optimization. Theory and algorithms
Algorithms and Combinatorics | 2018-01-09 | Paper |
The repeater tree construction problem
Information Processing Letters | 2017-11-03 | Paper |
Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
SIAM Journal on Discrete Mathematics | 2017-08-31 | Paper |
| Algorithmic Mathematics | 2016-09-08 | Paper |
Better \(s\)-\(t\)-tours by Gao trees
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Reassembling trees for the traveling salesman
SIAM Journal on Discrete Mathematics | 2016-05-17 | Paper |
Algorithmic mathematics
Springer-Lehrbuch | 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
Combinatorica | 2015-01-07 | Paper |
| Combinatorial optimization in VLSI design | 2014-11-10 | Paper |
On dual minimum cost flow algorithms (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
\(d\)-dimensional arrangement revisited
Information Processing Letters | 2014-04-11 | Paper |
Faster algorithm for optimum Steiner trees
Information Processing Letters | 2013-04-04 | Paper |
| Combinatorial optimization. Theory and algorithms. Translated from the English by R. von Randow | 2012-02-14 | Paper |
Combinatorial optimization. Theory and algorithms.
Algorithms and Combinatorics | 2012-01-02 | Paper |
Faster min-max resource sharing in theory and practice
Mathematical Programming Computation | 2011-06-08 | Paper |
Chip-Design und Mathematik
Mitteilungen der Deutschen Mathematiker-Vereinigung | 2011-05-31 | Paper |
Splitting trees at vertices
Discrete Mathematics | 2011-01-07 | Paper |
Mathematics of chip design
Production Factor Mathematics | 2010-12-28 | Paper |
Ottimizzazione Combinatoria
UNITEXT | 2010-08-11 | Paper |
| scientific article; zbMATH DE number 5654449 (Why is no real title available?) | 2010-01-07 | Paper |
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Journal of Discrete Algorithms | 2009-12-10 | Paper |
Geometric quadrisection in linear time, with application to VLSI placement
Discrete Optimization | 2009-06-02 | Paper |
Combinatorial Problems in Chip Design
Bolyai Society Mathematical Studies | 2009-02-12 | Paper |
| Kombinatorische Optimierung | 2008-06-25 | Paper |
From stars to comets: improved local search for universal facility location
Operations Research Letters | 2007-10-30 | Paper |
Combinatorial optimization. Theory and algorithms.
Algorithms and Combinatorics | 2007-10-25 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Combinatorial optimization. Theory and applications.
Algorithms and Combinatorics | 2005-11-29 | Paper |
A note on Schrijver's submodular function minimization algorithm.
Journal of Combinatorial Theory. Series B | 2003-08-17 | Paper |
On dual minimum cost flow algorithms
Mathematical Methods of Operations Research | 2003-07-14 | Paper |
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
Discrete Applied Mathematics | 2002-09-17 | Paper |
Combinatorial optimization. Theory and algorithms.
Algorithms and Combinatorics | 2002-05-23 | Paper |
The edge-disjoint paths problem is NP-complete for series-parallel graphs
Discrete Applied Mathematics | 2002-04-22 | Paper |
Worst-case ratios of networks in the rectilinear plane
Networks | 2002-01-14 | Paper |
Combinatorial optimization. Theory and algorithms
Algorithms and Combinatorics | 2000-07-30 | Paper |
Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
Optimization Methods & Software | 2000-03-23 | Paper |
| scientific article; zbMATH DE number 1056877 (Why is no real title available?) | 1997-10-26 | Paper |
| scientific article; zbMATH DE number 1077809 (Why is no real title available?) | 1997-10-24 | Paper |
NP-completeness of some edge-disjoint paths problems
Discrete Applied Mathematics | 1995-08-27 | Paper |
Cost Allocation for Set Covering: the Happy Nucleolus
(available as arXiv preprint) | N/A | Paper |
