| Publication | Date of Publication | Type |
|---|
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
SIAM Journal on Computing | 2026-09-02 | Paper |
| On the bidirected cut relaxation for Steiner forest | 2025-12-22 | Paper |
| A better-than-2 approximation for weighted tree augmentation | 2025-08-13 | Paper |
| Beating the integrality ratio for s-t-tours in graphs | 2025-08-12 | Paper |
Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
Journal of the ACM | 2025-06-27 | Paper |
Cost allocation for set covering: the happy nucleolus
Operations Research Letters | 2025-05-05 | Paper |
| Single-source unsplittable flows in planar graphs | 2024-11-28 | Paper |
Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
Mathematical Programming. Series A. Series B | 2024-09-19 | 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 |
| Local search for weighted tree augmentation and Steiner tree | 2024-07-19 | Paper |
| A (1.5+)-approximation algorithm for weighted connectivity augmentation | 2024-05-08 | Paper |
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs
SIAM Journal on Computing | 2023-12-19 | Paper |
Breaching the 2-approximation barrier for the forest augmentation problem
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Improving the approximation ratio for capacitated vehicle routing
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
A fast (2 + 2/7)-approximation algorithm for capacitated cycle covering
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
Mathematical Programming. Series A. Series B | 2022-03-22 | 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 |
Reducing Path TSP to TSP
SIAM Journal on Computing | 2021-11-19 | Paper |
Improving on best-of-many-Christofides for \(T\)-tours
Operations Research Letters | 2021-04-07 | Paper |
Reducing path TSP to TSP
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
An improved approximation algorithm for ATSP
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | 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 |
Approaching 3/2 for the \(s\)-\(t\)-path TSP
Journal of the ACM | 2019-11-21 | Paper |
Layers and matroids for the traveling salesman's paths
Operations Research Letters | 2019-06-11 | Paper |
Approaching 23 for the s-t-path TSP
(available as arXiv preprint) | 2018-03-15 | Paper |
| Approaching 23 for the s-t-path TSP | 2018-03-15 | Paper |
Layers and Matroids for the Traveling Salesman's Paths
(available as arXiv preprint) | 2017-03-21 | Paper |
Cost Allocation for Set Covering: the Happy Nucleolus
(available as arXiv preprint) | N/A | Paper |
