| Publication | Date of Publication | Type |
|---|
| The group access bounds for binary search trees | 2026-01-14 | Paper |
| Parameterized approximation for robust clustering in discrete geometric spaces | 2026-01-14 | Paper |
| Approximate cut \& packing ratios for multi-commodity arborescences | 2025-12-22 | Paper |
| Parameterized approximation schemes for clustering with general norm objectives | 2025-08-15 | Paper |
| From gap-ETH to FPT-inapproximability: clique, dominating set, and more | 2025-08-06 | Paper |
| Pattern-avoiding access in binary search trees | 2025-08-05 | Paper |
| Pre-reduction graph products: hardnesses of properly learning DFAs and approximating EDP on DAGs | 2025-08-05 | Paper |
| Independent set, induced matching, and pricing: connections and tight (subexponential time) approximation hardnesses | 2025-05-20 | Paper |
Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Polynomial-time approximation of independent set parameterized by treewidth | 2025-01-06 | Paper |
| Sorting pattern-avoiding permutations via 0-1 matrices forbidding product patterns | 2024-11-28 | Paper |
| Independent set in \(k\)-claw-free graphs: conditional \(\chi \)-boundedness and the power of LP/SDP relaxations | 2024-07-19 | Paper |
| Approximating \(k\)-edge-connected spanning subgraphs via a near-linear time LP solver | 2024-06-24 | Paper |
| Improved pattern-avoidance bounds for Greedy BSTs via matrix decomposition | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7789148 (Why is no real title available?)
Theory of Computing | 2024-01-16 | Paper |
Coloring and Maximum Weight Independent Set of Rectangles
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7758335 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
| Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns | 2023-07-05 | Paper |
| scientific article; zbMATH DE number 7651167 (Why is no real title available?) | 2023-02-07 | Paper |
| On finding balanced bicliques via matchings | 2022-12-21 | Paper |
Multi-Finger Binary Search Trees
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559128 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
On minimum generalized Manhattan connections
(available as arXiv preprint) | 2022-03-25 | Paper |
Survivable network design for group connectivity in low-treewidth graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
Multi-transversals for Triangles and the Tuza's Conjecture
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
SIAM Journal on Computing | 2020-08-18 | Paper |
New tools and connections for exponential-time approximation
Algorithmica | 2019-09-10 | Paper |
Graph products revisited: tight approximation hardness of induced matching, poset dimension and more
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Maximum independent set of rectangles | 2019-05-06 | Paper |
Submodular unsplittable flow on trees
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Beyond metric embedding: approximating group Steiner trees on bounded treewidth graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs
(available as arXiv preprint) | 2018-04-10 | Paper |
On survivable set connectivity
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 |
| On guillotine cutting sequences | 2017-08-31 | Paper |
Finding triangles for maximum planar subgraphs
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
New integrality gap results for the firefighters problem on trees
Approximation and Online Algorithms | 2017-04-04 | Paper |
| Clustering with center constraints | 2017-02-21 | Paper |
| A note on fractional coloring and the integrality gap of LP for maximum weight independent set | 2017-02-14 | Paper |
Submodular unsplittable flow on trees
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Self-adjusting binary search trees: what makes them tick?
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Greedy is an almost optimal deque
Lecture Notes in Computer Science | 2015-10-30 | Paper |
| scientific article; zbMATH DE number 6469225 (Why is no real title available?) | 2015-08-03 | Paper |
| Pattern-avoiding access in binary search trees | 2015-07-24 | Paper |
Nearly tight approximability results for minimum biclique cover and partition
Algorithms - ESA 2014 | 2014-10-08 | Paper |
New approximability results for the robust \(k\)-median problem
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
| Resource minimization for fire containment | 2014-05-22 | Paper |
Approximation algorithms and hardness of integral concurrent flow
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
scientific article; zbMATH DE number 6292751 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
Coloring graph powers: graph product bounds and hardness of approximation
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Improved hardness results for profit maximization pricing problems with unlimited supply
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Coloring and maximum independent set of rectangles
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
