| Publication | Date of Publication | Type |
|---|
| Clustering under perturbation stability in near-linear time | 2026-03-23 | Paper |
| Competitive flow time algorithms for polyhedral scheduling | 2025-08-05 | Paper |
| SelfishMigrate: a scalable algorithm for non-clairvoyantly scheduling heterogeneous processors | 2025-08-05 | Paper |
| Probabilistic metric embedding via metric labeling | 2025-01-14 | Paper |
| Fair price discrimination | 2024-11-28 | Paper |
| Online learning and bandits with queried hints | 2024-09-25 | Paper |
| Approximate core for committee selection via multilinear extension and market clearing | 2024-07-19 | Paper |
Auditing for core stability in participatory budgeting
Web and Internet Economics | 2023-08-04 | Paper |
Approximately stable committee selection
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A simple mechanism for a budget-constrained buyer
(available as arXiv preprint) | 2020-06-18 | Paper |
| Approximation algorithms for restless bandit problems | 2019-05-06 | Paper |
Iterative local voting for collective decision-making in continuous spaces
Journal of Artificial Intelligence Research | 2019-03-04 | Paper |
Sequential Deliberation for Social Choice
Web and Internet Economics | 2019-01-30 | Paper |
Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints
Journal of the ACM | 2018-08-02 | Paper |
| scientific article; zbMATH DE number 6861895 (Why is no real title available?) | 2018-04-19 | Paper |
| Competitive analysis of constrained queueing systems | 2017-12-19 | Paper |
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
The core of the participatory budgeting problem
Web and Internet Economics | 2017-02-10 | Paper |
A Note on Modeling Retweet Cascades on Twitter
Lecture Notes in Computer Science | 2016-01-08 | Paper |
Efficient primal-dual graph algorithms for MapReduce
Lecture Notes in Computer Science | 2015-09-09 | Paper |
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Local search heuristic for k-median and facility location problems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
A constant factor approximation for the single sink edge installation problems
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Value-Based Network Externalities and Optimal Auction Design
Web and Internet Economics | 2015-01-07 | Paper |
| Model-driven optimization using adaptive probes | 2014-12-18 | Paper |
How to probe for an extreme value
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Adaptive uncertainty resolution in Bayesian combinatorial optimization problems
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Budget constrained auctions with heterogeneous items
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Coevolutionary opinion formation games
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
| scientific article; zbMATH DE number 6297730 (Why is no real title available?) | 2014-05-22 | Paper |
Approximate indexability and bandit problems with concave rewards and delayed feedback
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Algorithms for cost-aware scheduling
Approximation and Online Algorithms | 2013-09-13 | Paper |
Budget-constrained auctions with heterogeneous items
Theory of Computing | 2012-09-27 | Paper |
Approximation algorithms for restless bandit problems
Journal of the ACM | 2011-05-16 | Paper |
A constant factor approximation for the single sink edge installation problem
SIAM Journal on Computing | 2010-01-06 | Paper |
Learning and approximating the optimal strategy to commit to
Algorithmic Game Theory | 2009-12-01 | Paper |
Cost-Distance: Two Metric Network Design
SIAM Journal on Computing | 2009-08-20 | Paper |
Multi-armed Bandits with Metric Switching Costs
Automata, Languages and Programming | 2009-07-14 | Paper |
| Approximation algorithms for budgeted learning problems | 2009-01-05 | Paper |
The Stochastic Machine Replenishment Problem
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Local Search Heuristics for <i>k</i>-Median and Facility Location Problems
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2119650 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2119701 (Why is no real title available?) | 2004-11-29 | Paper |
A constant factor approximation algorithm for the fault-tolerant facility location problem
Journal of Algorithms | 2004-03-14 | Paper |
| Web caching using access statistics | 2002-03-24 | Paper |
| Improved algorithms for fault tolerant facility location | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1670647 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1445350 (Why is no real title available?) | 2001-01-02 | Paper |
