| Publication | Date of Publication | Type |
|---|
| A constant-factor approximation for pairwise fair \(k\)-center clustering | 2025-12-22 | Paper |
Exact algorithms and lower bounds for stable instances of Euclidean \(k\)-means
SIAM Journal on Computing | 2025-12-17 | Paper |
| A logarithmic integrality gap for generalizations of quasi-bipartite instances of directed Steiner tree | 2025-12-02 | Paper |
| Approximating minimum sum coloring with bundles | 2025-12-02 | Paper |
A \(O(\log k)\)-approximation for \textsc{Directed Steiner Tree} in planar graphs
ACM Transactions on Algorithms | 2025-11-03 | Paper |
| A constant-factor approximation for quasi-bipartite directed Steiner tree on minor-free graphs | 2025-01-14 | Paper |
| An \(O(\log k)\)-approximation for directed Steiner tree in planar graphs | 2024-11-14 | Paper |
| Bi-criteria approximation algorithms for bounded-degree subset TSP | 2024-09-11 | Paper |
Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants
Algorithmica | 2024-08-13 | Paper |
A parameterized approximation scheme for generalized partial vertex cover
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Approximate minimum sum colorings and maximum \(k\)-colorable subgraphs of chordal graphs
Lecture Notes in Computer Science | 2024-01-16 | Paper |
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
(available as arXiv preprint) | 2023-02-07 | Paper |
Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
(available as arXiv preprint) | 2022-08-16 | Paper |
Improved approximations for capacitated vehicle routing with unsplittable client demands
(available as arXiv preprint) | 2022-08-16 | Paper |
A constant-factor approximation for directed latency in quasi-polynomial time
Journal of Computer and System Sciences | 2022-03-29 | Paper |
A constant-factor approximation for directed latency in quasi-polynomial time
Journal of Computer and System Sciences | 2022-03-29 | Paper |
Graph pricing with limited supply
(available as arXiv preprint) | 2022-03-25 | Paper |
| Fair correlation clustering with global and local guarantees | 2022-03-25 | Paper |
| Scheduling problems over network of machines | 2021-07-28 | Paper |
Further approximations for demand matching: matroid constraints and minor-closed graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Scheduling problems over a network of machines
Journal of Scheduling | 2020-01-03 | Paper |
Approximation schemes for clustering with outliers
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Local-search based approximation algorithms for mobile facility location problems (extended abstract)
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Local search yields a PTAS for \(k\)-means in doubling metrics
SIAM Journal on Computing | 2019-05-07 | Paper |
| scientific article; zbMATH DE number 7051239 (Why is no real title available?) | 2019-05-06 | Paper |
Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
Algorithmica | 2019-03-11 | Paper |
LP-based approximation algorithms for facility location in buy-at-bulk network design
Algorithmica | 2019-03-11 | Paper |
Approximation algorithms for minimum-load \(k\)-facility location
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Lift-and-project methods for set cover and knapsack
Algorithmica | 2018-10-18 | Paper |
| Approximation schemes for clustering with outliers | 2018-03-15 | Paper |
Tight analysis of a multiple-swap heuristic for budgeted red-blue median
(available as arXiv preprint) | 2017-12-19 | Paper |
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
(available as arXiv preprint) | 2017-10-17 | Paper |
| Approximating connected facility location with lower and upper bounds via LP rounding | 2017-10-17 | Paper |
| On linear programming relaxations for unsplittable flow in trees | 2017-08-31 | Paper |
Compact, provably-good LPs for orienteering and regret-bounded vehicle routing
(available as arXiv preprint) | 2017-08-31 | Paper |
| Approximation algorithms for minimum-load \(k\)-facility location | 2017-03-22 | Paper |
An improved integrality gap for asymmetric TSP paths
Mathematics of Operations Research | 2016-08-10 | Paper |
Minimizing total sensor movement for barrier coverage by non-uniform sensors on a line
Algorithms for Sensor Systems | 2016-03-10 | Paper |
LP-based approximation algorithms for facility location in buy-at-bulk network design
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
Automata, Languages, and Programming | 2015-10-27 | Paper |
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms | 2015-08-14 | Paper |
Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Approximating minimum-cost connected \(T\)-joins
Algorithmica | 2015-05-21 | Paper |
Minimizing movement in mobile facility location problems
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Linear Programming Hierarchies Suffice for Directed Steiner Tree
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| Asymmetric traveling salesman path and directed latency problems | 2014-05-22 | Paper |
Asymmetric traveling salesman path and directed latency problems
SIAM Journal on Computing | 2013-11-14 | Paper |
Multiple traveling salesmen in asymmetric metrics
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Lift-and-project methods for set cover and knapsack
Lecture Notes in Computer Science | 2013-08-12 | Paper |
An improved integrality gap for asymmetric TSP paths
Lecture Notes in Computer Science | 2013-03-19 | Paper |
Approximating minimum-cost connected \(T\)-joins
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
| Superabundant numbers and the Riemann hypothesis | 2012-01-01 | Paper |
Approximability of packing disjoint cycles
Algorithmica | 2011-05-10 | Paper |
| Explicit upper bounds for \(f(n)=\prod_{p_{\omega(n)}} \frac{p}{p-1}\) | 2010-05-05 | Paper |
Approximability of Packing Disjoint Cycles
Algorithms and Computation | 2008-05-27 | Paper |
| scientific article; zbMATH DE number 2190188 (Why is no real title available?) | 2005-08-01 | Paper |
