| Publication | Date of Publication | Type |
|---|
Efficient algorithms and hardness results for the weighted \(k\)-server problem
| 2025-01-14 | Paper |
Poly-logarithmic competitiveness for the \(k\)-taxi problem
| 2024-11-28 | Paper |
Maintaining matroid intersections online
| 2024-11-28 | Paper |
Set covering with our eyes wide shut
| 2024-11-28 | Paper |
Graph searching with predictions
| 2024-09-25 | Paper |
Algorithms for uncertain environments: going beyond the worst-case (invited talk)
| 2024-09-12 | Paper |
Matroid-based TSP rounding for half-integral solutions
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
The power of adaptivity for stochastic submodular cover
Operations Research | 2024-07-29 | Paper |
Robust secretary and prophet algorithms for packing integer programs
| 2024-07-19 | Paper |
Online discrepancy with recourse for vectors and graphs
| 2024-07-19 | Paper |
An improved local search algorithm for \(k\)-median
| 2024-07-19 | Paper |
Minimizing completion times for stochastic jobs via batched free times
| 2024-05-14 | Paper |
A local search-based approach for set covering
| 2024-05-14 | Paper |
scientific article; zbMATH DE number 7788345 (Why is no real title available?)
| 2024-01-15 | Paper |
Bag-Of-Tasks Scheduling on Related Machines
| 2023-11-20 | Paper |
Corrigendum: Metric Embedding via Shortest Path Decompositions
SIAM Journal on Computing | 2023-11-14 | Paper |
A quasipolynomial (2 + ε )-approximation for planar sparsest cut
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Chasing convex bodies with linear competitive ratio (invited paper)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Configuration balancing for stochastic requests
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Lipschitz selectors may not yield competitive algorithms for convex body chasing
Discrete & Computational Geometry | 2023-10-12 | Paper |
Robust Algorithms for the Secretary Problem
| 2023-02-03 | Paper |
Chasing Convex Bodies with Linear Competitive Ratio
Journal of the ACM | 2022-12-08 | Paper |
Stochastic makespan minimization in structured set systems (extended abstract)
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Non-adaptive stochastic score classification and explainable halfspace evaluation
| 2022-08-16 | Paper |
Matroid-based TSP rounding for half-integral solutions
| 2022-08-16 | Paper |
Caching with time windows and delays
SIAM Journal on Computing | 2022-07-22 | Paper |
Non-Clairvoyant Precedence Constrained Scheduling.
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561535 (Why is no real title available?)
| 2022-07-21 | Paper |
Stochastic online metric matching
| 2022-07-21 | Paper |
Metric Embedding via Shortest Path Decompositions
SIAM Journal on Computing | 2022-04-20 | Paper |
Optimal Bounds for the k -cut Problem
Journal of the ACM | 2022-03-31 | Paper |
Stochastic makespan minimization in structured set systems
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Random-Order Models
| 2022-02-04 | Paper |
Online Discrepancy with Recourse for Vectors and Graphs
| 2021-11-11 | Paper |
Fully-dynamic bin packing with little repacking
| 2021-07-28 | Paper |
Maximizing profit with convex costs in the random-order model
| 2021-07-28 | Paper |
Non-preemptive flow-time minimization via rejections
| 2021-07-28 | Paper |
A local-search algorithm for Steiner forest
| 2021-06-15 | Paper |
Stochastic load balancing on unrelated machines
Mathematics of Operations Research | 2021-06-03 | Paper |
Chasing Convex Bodies with Linear Competitive Ratio
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
The Karger-Stein algorithm is optimal for k-cut
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Caching with time windows
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
The Markovian price of information
| 2020-02-06 | Paper |
The number of minimum \(k\)-cuts: improving the Karger-Stein bound
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Potential-function proofs for gradient methods
Theory of Computing | 2019-12-05 | Paper |
A Nearly-Linear Bound for Chasing Nested Convex Bodies
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Losing Treewidth by Separating Subsets
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
\(k\)-servers with a smile: online algorithms via projections
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Elastic Caching
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
SIAM Journal on Computing | 2019-09-02 | Paper |
Metric embedding via shortest path decompositions
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Maintaining assignments online: matching, scheduling, and flows
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Minimum \(d\)-dimensional arrangement with fixed points
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Online Steiner tree with deletions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Towards \((1 + \varepsilon)\)-approximate flow sparsifiers
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
scientific article; zbMATH DE number 7053373 (Why is no real title available?)
| 2019-05-10 | Paper |
Scheduling heterogeneous processors isn't as easy as you think
| 2019-05-10 | Paper |
scientific article; zbMATH DE number 7051296 (Why is no real title available?)
| 2019-05-06 | Paper |
Approximate clustering without the approximation
| 2019-05-06 | Paper |
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SIAM Journal on Discrete Mathematics | 2019-03-12 | Paper |
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On the approximability of some network design problems
ACM Transactions on Algorithms | 2018-11-05 | Paper |
On hierarchical routing in doubling metrics
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Algorithms for hub label optimization
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Algorithms and adaptivity gaps for stochastic probing
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Adaptivity gaps for stochastic probing: submodular and XOS functions
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
LAST but not least: online spanners for buy-at-bulk
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the Lovász Theta Function for Independent Sets in Sparse Graphs
SIAM Journal on Computing | 2018-07-04 | Paper |
An FPT algorithm beating 2-approximation for \(k\)-cut
| 2018-03-15 | Paper |
Stochastic load balancing on unrelated machines
| 2018-03-15 | Paper |
Approximation Algorithms for Aversion k-Clustering via Local k-Median
| 2017-12-19 | Paper |
Approximation algorithms for optimal decision trees and adaptive TSP problems
Mathematics of Operations Research | 2017-09-22 | Paper |
A 2-competitive algorithm for online convex optimization with switching costs
| 2017-08-31 | Paper |
Simultaneous Optimization of Sensor Placements and Balanced Schedules
IEEE Transactions on Automatic Control | 2017-08-25 | Paper |
Online and dynamic algorithms for set cover
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Catch them if you can
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
How the experts algorithm can help solve LPs online
Mathematics of Operations Research | 2016-11-16 | Paper |
Embedding tree metrics into low dimensional Euclidean spaces
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
An improved integrality gap for asymmetric TSP paths
Mathematics of Operations Research | 2016-08-10 | Paper |
The power of deferral: maintaining a constant-competitive Steiner tree online
SIAM Journal on Computing | 2016-01-07 | Paper |
Efficient cost-sharing mechanisms for prize-collecting problems
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
Greedy algorithms for Steiner forest
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
On the Lovász theta function for independent sets in sparse graphs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Approximating sparse covering integer programs online
Mathematics of Operations Research | 2015-04-24 | Paper |
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
Mathematics of Operations Research | 2015-04-01 | Paper |
Quorum placement in networks, minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Provisioning a virtual private network: a network design problem for multicommodity flow
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
A constant-factor approximation for stochastic Steiner forest
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Theory of Computing Systems | 2015-01-19 | Paper |
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
| 2014-12-18 | Paper |
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
Algorithmica | 2014-12-02 | Paper |
Dial a ride from \(k\)-forest
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Vertex sparsifiers: new results from old techniques
SIAM Journal on Computing | 2014-11-14 | Paper |
On hierarchical routing in doubling metrics
| 2014-10-13 | Paper |
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
| 2014-10-13 | Paper |
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
| 2014-10-13 | Paper |
On the approximability of some network design problems
| 2014-10-13 | Paper |
How experts can solve LPs online
Lecture Notes in Computer Science | 2014-10-08 | Paper |
A constant factor approximation algorithm for a class of classification problems
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Set connectivity problems in undirected graphs and the directed Steiner network problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Thresholded covering algorithms for robust and max-min optimization
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
The power of deferral: maintaining a constant-competitive Steiner tree online
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Welfare and profit maximization with production costs
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Changing bases: multistage optimization for matroids and matchings
Automata, Languages, and Programming | 2014-07-01 | Paper |
Privately releasing conjunctions and the statistical query barrier
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Differentially private combinatorial optimization
| 2014-05-22 | Paper |
A constant factor approximation algorithm for generalized MIN-sum set cover
| 2014-05-22 | Paper |
scientific article; zbMATH DE number 6297807 (Why is no real title available?)
| 2014-05-22 | Paper |
Clustering under approximation stability
Journal of the ACM | 2014-02-17 | Paper |
Forest density estimation
| 2014-02-03 | Paper |
Privately releasing conjunctions and the statistical query barrier
SIAM Journal on Computing | 2013-11-14 | Paper |
The Approximability of the Binary Paintshop Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Set covering with our eyes closed
SIAM Journal on Computing | 2013-09-25 | Paper |
Online primal-dual for non-linear optimization with applications to speed scaling
Approximation and Online Algorithms | 2013-09-13 | Paper |
The Online Metric Matching Problem for Doubling Metrics
Automata, Languages, and Programming | 2013-08-12 | Paper |
Approximating sparse covering integer programs online
Automata, Languages, and Programming | 2013-08-12 | Paper |
Algorithms for hub label optimization
Automata, Languages, and Programming | 2013-08-06 | Paper |
Multicast routing for energy minimization using speed scaling
Lecture Notes in Computer Science | 2013-04-19 | Paper |
A stochastic probing problem with applications
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Thrifty algorithms for multistage robust optimization
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Packing interdiction and partial covering problems
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Online and Stochastic Survivable Network Design
SIAM Journal on Computing | 2013-03-19 | Paper |
An improved integrality gap for asymmetric TSP paths
Lecture Notes in Computer Science | 2013-03-19 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings
Algorithmica | 2012-12-06 | Paper |
All-norms and all-\(L_p\)-norms approximation algorithms
| 2012-10-19 | Paper |
Approximating TSP on metrics with bounded global growth
SIAM Journal on Computing | 2012-09-12 | Paper |
Approximation algorithms for VRP with stochastic demands
Operations Research | 2012-06-18 | Paper |
Iterative Constructions and Private Data Release
Theory of Cryptography | 2012-06-15 | Paper |
Sampling and cost-sharing: approximation algorithms for stochastic optimization problems
SIAM Journal on Computing | 2012-02-11 | Paper |
scientific article; zbMATH DE number 5968956 (Why is no real title available?)
| 2011-11-08 | Paper |
scientific article; zbMATH DE number 5899242 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
A plant location guide for the unsure: approximation algorithms for min-Max location problems
Mathematics of Operations Research | 2011-04-27 | Paper |
Making doubling metrics geodesic
Algorithmica | 2011-03-02 | Paper |
Vertex Sparsifiers: New Results from Old Techniques
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
An improved approximation algorithm for requirement cut
Operations Research Letters | 2010-09-07 | Paper |
Thresholded Covering Algorithms for Robust and Max-min Optimization
Automata, Languages and Programming | 2010-09-07 | Paper |
Scalably Scheduling Power-Heterogeneous Processors
Automata, Languages and Programming | 2010-09-07 | Paper |
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Automata, Languages and Programming | 2010-09-07 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract)
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Oblivious network design
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Approximating unique games
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Small hop-diameter sparse spanners for doubling metrics
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Improved embeddings of graph metrics into random trees
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Boosted sampling
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
scientific article; zbMATH DE number 5764797 (Why is no real title available?)
| 2010-08-06 | Paper |
Set connectivity problems in undirected graphs and the directed Steiner network problem
| 2010-08-06 | Paper |
scientific article; zbMATH DE number 5764790 (Why is no real title available?)
| 2010-08-06 | Paper |
scientific article; zbMATH DE number 5764865 (Why is no real title available?)
| 2010-08-06 | Paper |
scientific article; zbMATH DE number 5764808 (Why is no real title available?)
| 2010-08-06 | Paper |
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM | 2010-07-14 | Paper |
Metric embeddings with relaxed guarantees
SIAM Journal on Computing | 2010-01-06 | Paper |
Scheduling with Outliers
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Small hop-diameter sparse spanners for doubling metrics
Discrete & Computational Geometry | 2009-03-24 | Paper |
Stochastic Steiner Tree with Non-uniform Inflation
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Approximation via cost sharing
Journal of the ACM | 2008-12-21 | Paper |
Dial a Ride from k-Forest
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Pricing Tree Access Networks with Connected Backbones
Algorithms – ESA 2007 | 2008-09-25 | Paper |
An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
Algorithms – ESA 2007 | 2008-09-25 | Paper |
LP Rounding Approximation Algorithms for Stochastic Network Design
Mathematics of Operations Research | 2008-05-27 | Paper |
How to Complete a Doubling Metric
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Spanners with Slack
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Cost-sharing mechanisms for network design
Algorithmica | 2008-02-18 | Paper |
Infrastructure Leasing Problems
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Approximation algorithms for the unsplittable flow problem
Algorithmica | 2007-03-05 | Paper |
Approximation algorithms for minimizing average distortion
Theory of Computing Systems | 2006-10-25 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
| 2006-07-07 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
| 2006-07-07 | Paper |
Embedding k-Outerplanar Graphs into l1
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Building edge-failure resilient networks
Algorithmica | 2006-03-21 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics | 2005-09-28 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
SIAM Journal on Computing | 2005-02-21 | Paper |
Cuts, trees and \(\ell_1\)-embeddings of graphs
Combinatorica | 2005-02-14 | Paper |
scientific article; zbMATH DE number 2086939 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2079381 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2079369 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2079380 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2079346 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 1947047 (Why is no real title available?)
| 2003-07-07 | Paper |
An elementary proof of a theorem of Johnson and Lindenstrauss
Random Structures & Algorithms | 2003-03-19 | Paper |
Steiner points in tree metrics don't (really) help
| 2002-03-24 | Paper |
Improved bandwidth approximation for trees and chordal graphs
Journal of Algorithms | 2001-10-10 | Paper |
Embedding tree metrics into low-dimensional Euclidean spaces
Discrete & Computational Geometry | 2000-08-24 | Paper |
scientific article; zbMATH DE number 1445378 (Why is no real title available?)
| 2000-05-10 | Paper |
