| Publication | Date of Publication | Type |
|---|
Almost Tight Bounds for Reordering Buffer Management
SIAM Journal on Computing | 2022-06-08 | Paper |
The Art Gallery Problem is ∃ℝ-complete
Journal of the ACM | 2022-03-31 | Paper |
| New approximation algorithms for \((1,2)\)-TSP | 2021-07-28 | Paper |
| Approximating airports and railways | 2020-08-05 | Paper |
Approximation schemes for independent set and sparse subsets of polygons
Journal of the ACM | 2020-02-11 | Paper |
Hardness of approximation for strip packing
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Hardness of approximation for strip packing
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
The art gallery problem is \(\exists \mathbb{R}\)-complete
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fast fencing
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| An \(O(\log k)\)-competitive algorithm for generalized caching | 2019-05-10 | Paper |
An \(O(\log k)\)-competitive algorithm for generalized caching
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Approximation schemes for capacitated geometric network design
SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
Submodular unsplittable flow on trees
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Irrational guards are sometimes needed
(available as arXiv preprint) | 2018-08-13 | Paper |
Reordering buffer management with advice
Journal of Scheduling | 2018-04-04 | Paper |
| Airports and railways: facility location meets network design | 2018-01-24 | Paper |
A quasi-PTAS for the two-dimensional geometric knapsack problem
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking | 2017-08-31 | Paper |
Approximation and hardness results for the maximum edge \(q\)-coloring problem
Journal of Discrete Algorithms | 2016-12-09 | Paper |
Lower bounds for locally highly connected graphs
Graphs and Combinatorics | 2016-11-29 | Paper |
Submodular unsplittable flow on trees
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Algorithmic and hardness results for the colorful components problems
Algorithmica | 2015-10-19 | Paper |
Approximation and hardness results for the maximum edges in transitive closure problem
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Reordering buffer management with advice
Approximation and Online Algorithms | 2014-09-02 | Paper |
Almost tight bounds for reordering buffer management
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Optimal online buffer scheduling for block devices
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Algorithmic and hardness results for the colorful components problems
Lecture Notes in Computer Science | 2014-03-31 | Paper |
| Large-girth roots of graphs | 2012-01-23 | Paper |
Large-girth roots of graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Uniqueness of graph square roots of girth six
The Electronic Journal of Combinatorics | 2011-07-15 | Paper |
Uniqueness of graph square roots of girth six
The Electronic Journal of Combinatorics | 2011-07-15 | Paper |
Uniqueness of graph square roots of girth six
The Electronic Journal of Combinatorics | 2011-07-15 | Paper |
Approximation schemes for capacitated geometric network design
Automata, Languages and Programming | 2011-07-06 | Paper |
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k^*\)
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
Approximation and Hardness Results for the Maximum Edge q-coloring Problem
Algorithms and Computation | 2010-12-09 | Paper |
PTAS for \(k\)-tour cover problem on the plane for moderately large values of \(k\)
Algorithms and Computation | 2009-12-17 | Paper |
Combinatorics of the change-making problem
European Journal of Combinatorics | 2009-12-01 | Paper |
