| Publication | Date of Publication | Type |
|---|
| Maintaining matroid intersections online | 2024-11-28 | Paper |
| A (slightly) improved approximation algorithm for the metric traveling salesperson problem (invited talk) | 2024-11-14 | Paper |
| Matroid partition property and the secretary problem | 2024-09-25 | Paper |
| Combinatorial auctions with interdependent valuations: SOS to the rescue | 2024-06-27 | Paper |
| An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem | 2023-12-08 | Paper |
| A (slightly) improved approximation algorithm for metric TSP | 2023-11-14 | Paper |
| A deterministic better-than-3/2 approximation algorithm for metric TSP | 2023-11-09 | Paper |
| Competition alleviates present bias in task completion | 2023-03-21 | Paper |
| Simple pricing schemes for consumers with evolving values | 2022-07-15 | Paper |
| Beyond Competitive Analysis | 2022-02-04 | Paper |
| Matroid Partition Property and the Secretary Problem | 2021-11-24 | Paper |
| A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP | 2021-05-20 | Paper |
| An improved approximation algorithm for TSP in the half integral case | 2021-01-19 | Paper |
| A simply exponential upper bound on the maximum number of stable matchings | 2019-08-22 | Paper |
| An Improved Approximation Algorithm for TSP in the Half Integral Case | 2019-08-01 | Paper |
| Simple Pricing Schemes For Consumers With Evolving Values | 2018-07-16 | Paper |
| Carpooling in Social Networks | 2017-12-19 | Paper |
| Stability of service under time-of-use pricing | 2017-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5739092 | 2017-06-02 | Paper |
| Approaching utopia | 2017-05-16 | Paper |
| A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders | 2017-02-10 | Paper |
| On the fault tolerance of the butterfly | 2016-09-01 | Paper |
| Balanced allocations (extended abstract) | 2016-09-01 | Paper |
| Dynamic TCP acknowledgement and other stories about e/(e-1) | 2015-02-27 | Paper |
| Spectral analysis of data | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934657 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921790 | 2014-10-13 | Paper |
| Random walks with “back buttons” (extended abstract) | 2014-09-26 | Paper |
| On Revenue Maximization for Agents with Costly Information Acquisition | 2013-08-07 | Paper |
| Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack | 2011-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579478 | 2010-08-06 | Paper |
| Competitive generalized auctions | 2010-08-05 | Paper |
| Algorithms for data migration | 2010-03-23 | Paper |
| On Revenue Maximization in Second-Price Ad Auctions | 2009-10-29 | Paper |
| Approximating Matches Made in Heaven | 2009-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524722 | 2008-09-12 | Paper |
| Improved Approximation Algorithms for Budgeted Allocations | 2008-08-28 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Dynamic TCP acknowledgment and other stories about \(e/(e-1)\) | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411339 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411372 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4709172 | 2003-06-20 | Paper |
| Random walks with ``back buttons | 2003-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801193 | 2003-04-07 | Paper |
| On list update and work function algorithms. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785579 | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234112 | 2002-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768356 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230343 | 2002-01-16 | Paper |
| Markov Paging | 2000-10-18 | Paper |
| Near-Optimal Parallel Prefetching and Caching | 2000-03-19 | Paper |
| Balanced Allocations | 1999-10-28 | Paper |
| A note on the influence of an \(\epsilon\)-biased random source | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230342 | 1999-06-15 | Paper |
| Strongly Competitive Algorithms for Paging with Locality of Reference | 1997-02-03 | Paper |
| Biased random walks | 1996-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845261 | 1996-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763411 | 1995-04-11 | Paper |
| On-line load balancing | 1995-04-04 | Paper |
| Competitive randomized algorithms for nonuniform problems | 1995-02-13 | Paper |
| Dynamic Perfect Hashing: Upper and Lower Bounds | 1994-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138877 | 1994-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138907 | 1994-09-19 | Paper |
| Trading Space for Time in Undirected s-t Connectivity | 1994-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138977 | 1993-10-20 | Paper |
| Bounds on the cover time | 1989-01-01 | Paper |
| Parallel hashing | 1988-01-01 | Paper |
| Algorithms for the compilation of regular expressions into PLAs | 1987-01-01 | Paper |
