| Publication | Date of Publication | Type |
|---|
| A tight \((1.5+\varepsilon)\)-approximation for unsplittable capacitated vehicle routing on trees | 2024-11-14 | Paper |
| An approximation algorithm for distance-constrained vehicle routing on trees | 2024-10-08 | Paper |
| Unsplittable Euclidean capacitated vehicle routing: a \((2+\varepsilon)\)-approximation algorithm | 2024-09-25 | Paper |
| A PTAS for capacitated vehicle routing on trees | 2024-06-24 | Paper |
Apportionment with parity constraints
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Competitive data-structure dynamization
(available as arXiv preprint) | 2024-01-15 | Paper |
Probabilistic Analysis of Euclidean Capacitated Vehicle Routing
(available as arXiv preprint) | 2024-01-15 | Paper |
Approximating maximum integral multiflows on bounded genus graphs
Discrete & Computational Geometry | 2023-12-21 | Paper |
A PTAS for Capacitated Vehicle Routing on Trees
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Iterated tour partitioning for Euclidean capacitated vehicle routing
Random Structures & Algorithms | 2023-10-23 | Paper |
A simple algorithm for graph reconstruction
Random Structures & Algorithms | 2023-10-17 | Paper |
Correlation clustering and two-edge-connected augmentation for planar graphs
Algorithmica | 2023-10-06 | Paper |
| A simple algorithm for graph reconstruction | 2023-09-20 | Paper |
| scientific article; zbMATH DE number 7650099 (Why is no real title available?) | 2023-02-03 | Paper |
Skyline Computation with Noisy Comparisons
Lecture Notes in Computer Science | 2022-10-13 | Paper |
| scientific article; zbMATH DE number 7561427 (Why is no real title available?) | 2022-07-21 | Paper |
Two-sided matching markets with strongly correlated preferences
(available as arXiv preprint) | 2022-05-20 | Paper |
Mixed preferential attachment model: homophily and minorities in social networks
Physica A | 2022-05-19 | Paper |
An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
SIAM Journal on Discrete Mathematics | 2021-04-28 | Paper |
How to aggregate Top-lists: Approximation algorithms via scores and average ranks
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Instance-Optimality in the Noisy Value-and Comparison-Model
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Dynamic clustering to minimize the sum of radii
Algorithmica | 2020-10-21 | Paper |
Recognizing well-parenthesized expressions in the streaming model
SIAM Journal on Computing | 2020-05-31 | Paper |
Dynamic clustering to minimize the sum of radii
(available as arXiv preprint) | 2020-05-27 | Paper |
| Combinatorics of local search: an optimal 4-local Hall's theorem for planar graphs | 2020-05-27 | Paper |
Hierarchical clustering. Objective functions and algorithms
Journal of the ACM | 2020-02-11 | Paper |
Approximating \(k\)-center in planar graphs
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
First come first served for online slot allocation and Huffman coding
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
First come first served for online slot allocation and Huffman coding
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| A polynomial-time approximation scheme for planar multiway cut | 2019-05-10 | Paper |
scientific article; zbMATH DE number 7053305 (Why is no real title available?)
(available as arXiv preprint) | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7053305 (Why is no real title available?) | 2019-05-10 | Paper |
Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
SIAM Journal on Computing | 2019-05-07 | Paper |
Graph reconstruction and verification
ACM Transactions on Algorithms | 2019-03-28 | Paper |
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Semidefinite and linear programming integrality gaps for scheduling identical machines
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
| Indecomposable permutations with a given number of cycles | 2018-07-23 | Paper |
Optimization of bootstrapping in circuits
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Distance in the Forest Fire Model How far are you from Eve?
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Hierarchical clustering: objective functions and algorithms | 2018-03-15 | Paper |
Hierarchical clustering: objective functions and algorithms
(available as arXiv preprint) | 2018-03-15 | Paper |
| Carpooling in social networks | 2017-12-19 | Paper |
Effectiveness of local search for geometric optimization
(available as arXiv preprint) | 2017-10-10 | Paper |
Approximating connectivity domination in weighted bounded-genus graphs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Homophily and the glass ceiling effect in social networks
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
| Correlation clustering and two-edge-connected augmentation for planar graphs | 2017-01-24 | Paper |
Semidefinite and linear programming integrality gaps for scheduling identical machines
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
Energy-efficient algorithms for non-preemptive speed-scaling
Approximation and Online Algorithms | 2015-11-20 | Paper |
Near-linear query complexity for graph inference
Automata, Languages, and Programming | 2015-10-27 | Paper |
A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
Algorithmica | 2015-09-03 | Paper |
Sherali-Adams relaxations of the matching polytope
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
An \(O(n\log n)\) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Recognizing well-parenthesized expressions in the streaming model
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Facility location in evolving metrics
Automata, Languages, and Programming | 2014-07-01 | Paper |
| Correlation clustering with noisy input | 2014-05-22 | Paper |
| scientific article; zbMATH DE number 6297716 (Why is no real title available?) | 2014-05-22 | Paper |
The Min Mean-Weight Cycle in a Random Network
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
Graph reconstruction via distance oracles
Automata, Languages, and Programming | 2013-08-06 | Paper |
Online constrained optimization with recourse
Information Processing Letters | 2013-03-20 | Paper |
Maximum matching in semi-streaming with few passes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Lower bounds for randomized algorithms for online chain partitioning
Information Processing Letters | 2012-10-23 | Paper |
Huffman coding with letter costs: a linear-time approximation scheme
SIAM Journal on Computing | 2012-09-12 | Paper |
On the number of indecomposable permutations with a given number of cycles
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
| Online correlation clustering | 2012-01-23 | Paper |
Integrality gaps of linear and semi-definite programming relaxations for knapsack
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Online ranking for tournament graphs
Approximation and Online Algorithms | 2011-02-15 | Paper |
The train delivery problem -- vehicle routing meets bin packing
Approximation and Online Algorithms | 2011-02-15 | Paper |
| scientific article; zbMATH DE number 5764850 (Why is no real title available?) | 2010-08-06 | Paper |
Distortion lower bounds for line embeddings
Information Processing Letters | 2010-06-09 | Paper |
Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Improved Approximation Algorithms for Budgeted Allocations
Automata, Languages and Programming | 2008-08-28 | Paper |
Some problems in computational geometry
Algorithmica | 1987-01-01 | Paper |
