| Publication | Date of Publication | Type |
|---|
| Parameterized approximation for robust clustering in discrete geometric spaces | 2026-01-14 | Paper |
| An \(o(\log\log n)\)-approximation for submodular facility location | 2026-01-14 | Paper |
| On the bidirected cut relaxation for Steiner forest | 2025-12-22 | Paper |
| Parameterized approximation schemes for clustering with general norm objectives | 2025-08-15 | Paper |
| Online facility location with linear delay | 2024-08-22 | Paper |
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
SIAM Journal on Computing | 2023-06-09 | Paper |
PTAS for Steiner tree on map graphs
(available as arXiv preprint) | 2022-10-13 | Paper |
Better Bounds for Online Line Chasing
(available as arXiv preprint) | 2022-07-21 | Paper |
Constant-Factor FPT Approximation for Capacitated k-Median
(available as arXiv preprint) | 2022-05-11 | Paper |
To close is easier than to open: dual parameterization to \(k\)-median
(available as arXiv preprint) | 2022-03-22 | Paper |
Concave connection cost facility location and the star inventory routing problem
(available as arXiv preprint) | 2022-03-22 | Paper |
Proportional approval voting, harmonic \(k\)-median, and negative association
(available as arXiv preprint) | 2021-07-28 | Paper |
New results on multi-level aggregation
Theoretical Computer Science | 2021-03-09 | Paper |
Unbounded lower bound for k-server against weak adversaries
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Online Algorithms for Multilevel Aggregation
Operations Research | 2020-11-04 | Paper |
Approximating node-weighted \(k\)-MST on planar graphs
Theory of Computing Systems | 2020-06-02 | 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 |
Constant-factor approximation for ordered \(k\)-median
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Better Approximation Bounds for the Joint Replenishment Problem
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Approximating node-weighted \(k\)-MST on planar graphs
Approximation and Online Algorithms | 2019-01-15 | Paper |
An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
ACM Transactions on Algorithms | 2018-11-05 | Paper |
An improved approximation algorithm for knapsack median using sparsification
Algorithmica | 2018-05-23 | Paper |
Online algorithms for multi-level aggregation
(available as arXiv preprint) | 2018-03-02 | Paper |
Approximation algorithms for stochastic and risk-averse optimization
SIAM Journal on Discrete Mathematics | 2018-01-12 | Paper |
Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs
(available as arXiv preprint) | 2017-10-17 | Paper |
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Bi-factor approximation algorithms for hard capacitated \(k\)-median problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
An approximation algorithm for uniform capacitated \(k\)-median problem with \(1+\epsilon\) capacity violation
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Improved approximation algorithm for \(k\)-level uncapacitated facility location problem (with penalties)
Theory of Computing Systems | 2016-03-21 | Paper |
Approximation algorithms for the joint replenishment problem with deadlines
Journal of Scheduling | 2016-01-22 | Paper |
Improved approximation algorithm for fault-tolerant facility placement
Approximation and Online Algorithms | 2015-11-20 | Paper |
An improved approximation algorithm for knapsack median using sparsification
Algorithms - ESA 2015 | 2015-11-19 | Paper |
The interval constrained 3-coloring problem
Theoretical Computer Science | 2015-10-08 | Paper |
PTAS for minimax approval voting
Web and Internet Economics | 2015-01-07 | Paper |
Improved approximation algorithm for \(k\)-level UFL with penalties, a simplistic view on randomizing the scaling parameter
Approximation and Online Algorithms | 2014-09-02 | Paper |
An improved LP-based approximation for Steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Steiner tree approximation via iterative randomized rounding
Journal of the ACM | 2014-02-17 | Paper |
Improved LP-rounding approximation algorithm for \(k\)-level uncapacitated facility location
Automata, Languages, and Programming | 2013-08-12 | Paper |
Online control message aggregation in chain networks
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Approximation algorithms for the joint replenishment problem with deadlines
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Drawing (complete) binary tanglegrams
Algorithmica | 2012-04-26 | Paper |
An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
SIAM Journal on Computing | 2011-01-17 | Paper |
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics | 2010-10-11 | Paper |
Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
The interval constrained 3-coloring problem
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms | 2009-12-10 | Paper |
New algorithms for approximate Nash equilibria in bimatrix games
Theoretical Computer Science | 2009-12-01 | Paper |
Drawing (Complete) Binary Tanglegrams
Graph Drawing | 2009-03-03 | Paper |
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
New Results on Optimizing Rooted Triplets Consistency
Algorithms and Computation | 2009-01-29 | Paper |
The approximation gap for the metric facility location problem is not yet closed
Operations Research Letters | 2008-01-21 | Paper |
| Efficient user removal in broadcast channel with symmetric encryption | 2007-02-13 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
