| Publication | Date of Publication | Type |
|---|
| Approximating Pandora's box with correlations | 2025-01-14 | Paper |
| Composition of nested embeddings with an application to outlier removal | 2024-11-28 | Paper |
| Buy-many mechanisms for many unit-demand buyers | 2024-09-20 | Paper |
| Static pricing for multi-unit prophet inequalities | 2024-09-05 | Paper |
| Individually-fair auctions for multi-slot sponsored search | 2024-04-15 | Paper |
| Individual fairness in advertising auctions through inverse proportionality | 2024-04-09 | Paper |
| Pricing ordered items | 2023-12-08 | Paper |
| Buy-many mechanisms are not much better than item pricing | 2022-07-15 | Paper |
| Simple pricing schemes for consumers with evolving values | 2022-07-15 | Paper |
| Timing matters: online dynamics in broadcast games | 2020-06-18 | Paper |
| Pricing for Online Resource Allocation: Intervals and Paths | 2019-10-15 | Paper |
| Optimal crowdsourcing contests | 2019-05-10 | Paper |
| Traffic-redundancy aware network design | 2019-05-10 | Paper |
| Packing multiway cuts in capacitated graphs | 2019-05-06 | Paper |
| Optimal crowdsourcing contests | 2019-03-29 | Paper |
| Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut | 2018-11-05 | Paper |
| Simple Pricing Schemes For Consumers With Evolving Values | 2018-07-16 | Paper |
| Revenue maximization with an uncertainty-averse buyer | 2018-03-15 | Paper |
| Stability of service under time-of-use pricing | 2017-08-17 | Paper |
| Network design with coverage costs | 2017-03-22 | Paper |
| Scaling properties of the Internet graph | 2015-09-04 | Paper |
| Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs | 2015-08-21 | Paper |
| The power of randomness in Bayesian optimal mechanism design | 2015-06-08 | Paper |
| Pricing lotteries | 2015-02-13 | Paper |
| Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut | 2014-10-13 | Paper |
| Multi-parameter mechanism design and sequential posted pricing | 2014-08-13 | Paper |
| Prior-independent mechanisms for scheduling | 2014-08-07 | Paper |
| Region growing for multi-route cuts | 2014-05-22 | Paper |
| Pricing randomized allocations | 2014-05-22 | Paper |
| On the limits of black-box reductions in mechanism design | 2014-05-13 | Paper |
| Secretary problems with convex costs | 2013-08-12 | Paper |
| A bicriteria approximation for the reordering buffer problem | 2012-09-25 | Paper |
| Threshold rules for online sample selection | 2011-03-25 | Paper |
| Approximation algorithms for deadline-TSP and vehicle routing with time-windows | 2010-08-15 | Paper |
| Threshold rules for online sample selection | 2010-07-20 | Paper |
| Scheduling for flow-time with admission control | 2010-03-03 | Paper |
| Bertrand Competition in Networks | 2008-05-02 | Paper |
| Approximation Algorithms for Orienteering and Discounted-Reward TSP | 2008-04-22 | Paper |
| On the hardness of approximating Multicut and Sparsest-Cut | 2007-11-05 | Paper |
| Single-Source Stochastic Routing | 2007-08-28 | Paper |
| Correlation clustering | 2005-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828909 | 2004-11-29 | Paper |
| Static optimality and dynamic search-optimality in lists and trees | 2003-08-17 | Paper |
