News:
(More or Less) Recent Service:
I will/did serve on the PC for STOC 2024, APPROX 2024, ICALP 2023, TheWebConf (WWW) 2023, FSTTCS 2022, SODA 2022, HALG 2021, and ESA 2020.
Zhiyi Huang and I co-organized the FOCS 2023 workshop on "Online Algorithms and Online Rounding: Recent Progress".
I previously co-organized the TCS+ online seminar series.
Recent Papers:
Feb 24: STOC 2024 accepts:
"Online Edge-Coloring is (Nearly) as Easy as Offline” with Joakim Blikstad, Ola Svensson and Radu Vintan.
"Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs” with Sayan Bhattacharya, Peter Kiss and Aaron Sidford
Oct 23: SODA 2024 accepts: "Combinatorial Stationary Prophet Inequalities", with Neel Patel.
Oct 23: SOSA 2024 accepts: "Simple and Asymptotically Optimal Online Bipartite Edge Coloring", with Joakim Blikstad, Ola Svensson and Radu Vintan.
Recent Papers:
Oct 22: SODA 2023...:
awards best paper award to: “Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time”, with Sayan Bhattacharya, Peter Kiss and Thatchaphol Saranurak
accepts “Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)” with Niv Buchbinder and Joseph (Seffi) Naor.
Recent Papers:
May 22: EC 2022 accepts:
"The Stationary Prophet Inequality Problem", with Kristen Kessel, Ali Shameli and Amin Saberi.
"Improved Online Contention Resolution for Matchings and Applications to the Gig Economy", with Tristan Pollner, Mohammad Roghani and Amin Saberi.