Fully Dynamic Online Selection through Online Contention Resolution Schemes. - Vashist Avadhanula; Andrea Celli; Riccardo Colini-Baldeschi; Stefano Leonardi 001; Matteo Russo 002 (AAAI, 2023)

Submodular Norms with Applications To Online Facility Location and Stochastic Probing. - Kalen Patton; Matteo Russo 002; Sahil Singla 001 (APPROX/RANDOM, 2023)

Low-Distortion Clustering with Ordinal and Limited Cardinal Information. - Jakob Burkhardt; Ioannis Caragiannis; Karl Fehrs; Matteo Russo 002; Chris Schwiegelshohn; Sudarshan Shyam (AAAI, 2024)

Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment. - Tomer Ezra; Stefano Leonardi 001; Michal Pawlowski; Matteo Russo 002; Seeun William Umboh (APPROX/RANDOM, 2024)

Online Learning with Sublinear Best-Action Queries. - Matteo Russo 002; Andrea Celli; Riccardo Colini-Baldeschi; Federico Fusco; Daniel Haimovich; Dima Karamshuk; Stefano Leonardi 001; Niek Tax (NeurIPS, 2024)

Fair Division with Interdependent Values. - Georgios Birmpas; Tomer Ezra; Stefano Leonardi 001; Matteo Russo 002 (SAGT, 2024)

Contracts with Inspections. - Tomer Ezra; Stefano Leonardi 001; Matteo Russo 002 (CoRR, 2024)

A Simple and Optimal Sublinear Algorithm for Mean Estimation. - Beatrice Bertolotti; Matteo Russo 002; Chris Schwiegelshohn (CoRR, 2024)

A Tight VC-Dimension Analysis of Clustering Coresets with Applications. - Vincent Cohen-Addad; Andrew Draganov; Matteo Russo 002; David Saulpic; Chris Schwiegelshohn (SODA, 2025)

Prophet Inequalities via the Expected Competitive Ratio. - Tomer Ezra; Stefano Leonardi 001; Rebecca Reiffenhäuser; Matteo Russo 002; Alexandros Tsigonias-Dimitriadis (ACM Trans. Economics and Comput., 2025)