| Publication | Date of Publication | Type |
|---|
Matroid-based TSP rounding for half-integral solutions
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
| The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. | 2023-11-13 | Paper |
Matroid-based TSP rounding for half-integral solutions
(available as arXiv preprint) | 2022-08-16 | Paper |
scientific article; zbMATH DE number 7525510 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
Online facility location with deletions
(available as arXiv preprint) | 2021-08-04 | Paper |
On Problems Equivalent to (min,+)-Convolution
(available as arXiv preprint) | 2020-05-27 | Paper |
Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration
(available as arXiv preprint) | 2020-05-27 | Paper |
Dynamic Beats Fixed
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Improved approximation for fractionally subadditive network design
Information Processing Letters | 2019-11-28 | Paper |
A subquadratic approximation scheme for partition
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Lyndon words and short superstrings
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
On problems equivalent to \((\min,+)\)-convolution
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Online pricing with impatient bidders
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Catch them if you can
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
No-wait flowshop scheduling Is as hard as asymmetric traveling salesman problem
Mathematics of Operations Research | 2016-04-15 | Paper |
\(\frac{13}{9}\)-approximation for graphic TSP
Theory of Computing Systems | 2015-02-05 | Paper |
New bounds for online packing LPs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A \(9k\) kernel for nonseparating independent set in planar graphs
Theoretical Computer Science | 2013-12-13 | Paper |
No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem
Lecture Notes in Computer Science | 2013-08-06 | Paper |
A \(9k\) kernel for nonseparating independent set in planar graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
| Approximation algorithms for union and intersection covering problems | 2012-08-31 | Paper |
| \(\frac {13}{9}\)-approximation for graphic TSP | 2012-08-23 | Paper |
35/44-approximation for asymmetric maximum TSP with triangle inequality
Algorithmica | 2011-03-02 | Paper |
Fast approximation in subspaces by doubling metric decomposition
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Fast dynamic transitive closure with lookahead
Algorithmica | 2010-02-23 | Paper |
Deterministic 7/8-approximation for the metric maximum TSP
Theoretical Computer Science | 2009-11-06 | Paper |
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality
Lecture Notes in Computer Science | 2009-10-20 | Paper |
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Deterministic 7/8-Approximation for the Metric Maximum TSP
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Maximum matchings in planar graphs via Gaussian elimination
Algorithmica | 2007-06-21 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
