News:
(More or Less) Recent Service:
I will/did serve on the PC for ITCS 2025, STOC 2024, APPROX 2024, WAOA 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 Survey:
Survey on online matching, with Zhiyi Huang and Zhihao Gavin Tang, published in SIGecom Exchanges 2024.
Recent Papers:
Oct 24: SODA 2025 accepts:
"New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling” with Mark Braverman, Mahsa Derakhshan, Tristan Pollner, and Amin Saberi.
"Online Dependent Rounding Schemes for Bipartite Matchings, with Applications” with Joseph (Seffi) Naor and Aravind Srinivasan.
"Deterministic Online Bipartite Edge Coloring” with Joakim Blikstad, Ola Svensson and Radu Vintan.
July 24: APPROX 2024 accepts: "The Average-Value Allocation Problem" with Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta and Di Wang.
(Invited to ToC special issue for APPROX24.)
Feb 24: STOC 2024 accepts:
"Online Edge-Coloring is (Nearly) as Easy as Offline” with Joakim Blikstad, Ola Svensson and Radu Vintan.
(Invited to SICOMP special issue for STOC24.)"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.
Oct 22: SODA 2023 accepts:
“Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time”, with Sayan Bhattacharya, Peter Kiss and Thatchaphol Saranurak
(Best paper award.)accepts “Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)” with Niv Buchbinder and Joseph (Seffi) Naor.