| Publication | Date of Publication | Type |
|---|
| A case for Copeland: from theory to practice | 2025-04-29 | Paper |
Maximizing rides served for dial-a-ride on the uniform metric
Theory of Computing Systems | 2025-02-28 | Paper |
Maximizing the number of rides served for time-limited Dial-a-Ride*
Optimization Methods & Software | 2025-01-10 | Paper |
| Earliest deadline first is a 2-approximation for DARP with time windows | 2024-09-16 | Paper |
| Maximizing the number of rides served for dial-a-ride | 2024-08-22 | Paper |
| Revenue maximization in online dial-a-ride | 2024-07-11 | Paper |
New Bounds for Maximizing Revenue in Online Dial-a-Ride
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Robustly assigning unstable items
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
| Serving rides of equal importance for time-limited dial-a-ride | 2022-03-22 | Paper |
Improved bounds for revenue maximization in time-limited online dial-a-ride
SN Operations Research Forum | 2021-09-07 | Paper |
Equilibria in Doodle polls under three tie-breaking rules
Theoretical Computer Science | 2020-05-23 | Paper |
| Inefficiency of equilibria in Doodle polls | 2019-10-11 | Paper |
Robustly assigning unstable items
Combinatorial Optimization and Applications | 2019-10-11 | Paper |
Serve or skip: the power of rejection in online bottleneck matching
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
The Power of Rejection in Online Bottleneck Matching
Combinatorial Optimization and Applications | 2015-09-11 | Paper |
Competitive cost-savings in data stream management systems
Lecture Notes in Computer Science | 2014-09-26 | Paper |
| SRPT is 1.86-competitive for completion time scheduling | 2014-05-22 | Paper |
Online bottleneck matching
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Online bottleneck matching
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Completion time scheduling and the WSRPT algorithm
Lecture Notes in Computer Science | 2012-11-02 | Paper |
The power of fair pricing mechanisms
Algorithmica | 2012-04-26 | Paper |
On the price of stability for undirected network design
Approximation and Online Algorithms | 2010-05-11 | Paper |
The power of fair pricing mechanisms
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Stochastic stability in internet router congestion games
Algorithmic Game Theory | 2009-12-01 | Paper |
The Price of Stochastic Anarchy
Algorithmic Game Theory | 2008-05-02 | Paper |
The Online Transportation Problem: On the Exponential Boost of One Extra Server
Lecture Notes in Computer Science | 2008-04-15 | Paper |
