| 2025 | FOCS | Online Edge Coloring: Sharp Thresholds. | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc |
| 2025 | ICDT | Repairing Databases over Metric Spaces with Coincidence Constraints. | Youri Kaminsky, Benny Kimelfeld, Ester Livshits, Felix Naumann, David Wajc |
| 2025 | SODA | Deterministic Online Bipartite Edge Coloring. | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc |
| 2025 | SODA | New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. | Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc |
| 2025 | SODA | Online Dependent Rounding Schemes for Bipartite Matchings, with. | Joseph (Seffi) Naor, Aravind Srinivasan, David Wajc |
| 2024 | SODA | Combinatorial Stationary Prophet Inequalities. | Neel Patel, David Wajc |
| 2024 | STOC | Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. | Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc |
| 2024 | STOC | Online Edge Coloring Is (Nearly) as Easy as Offline. | Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc |
| 2023 | SODA | Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc |
| 2023 | SODA | Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). | Niv Buchbinder, Joseph (Seffi) Naor, David Wajc |
| 2021 | ICALP | Near-Optimal Schedules for Simultaneous Multicasts. | Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc |
| 2021 | ICALP | The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. | Amin Saberi, David Wajc |
| 2021 | SODA | Online Edge Coloring Algorithms via the Nibble Method. | Sayan Bhattacharya, Fabrizio Grandoni, David Wajc |
| 2021 | SODA | Streaming Submodular Matching Meets the Primal-Dual Method. | Roie Levin, David Wajc |
| 2021 | STOC | Universally-optimal distributed algorithms for known topologies. | Bernhard Haeupler, David Wajc, Goran Zuzic |
| 2020 | FOCS | Network Coding Gaps for Completion Times of Multiple Unicasts. | Bernhard Haeupler, David Wajc, Goran Zuzic |
| 2020 | STOC | Rounding dynamic matchings against an adaptive adversary. | David Wajc |
| 2019 | FOCS | Tight Bounds for Online Edge Coloring. | Ilan Reuven Cohen, Binghui Peng, David Wajc |
| 2019 | FOCS | Online Matching with General Arrivals. | Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc |
| 2019 | ICALP | Stochastic Online Metric Matching. | Anupam Gupta, Guru Guruganesh, Binghui Peng, David Wajc |
| 2019 | SODA | Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. | Mohsen Ghaffari, David Wajc |
| 2018 | AAAI | Approximation-Variance Tradeoffs in Facility Location Games. | Ariel D. Procaccia, David Wajc, Hanrui Zhang |
| 2018 | ICALP | Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. | Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc |
| 2018 | ICALP | Fully-Dynamic Bin Packing with Little Repacking. | Bjrn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sren Riechers, David Wajc |
| 2018 | PODC | Round- and Message-Optimal Distributed Graph Algorithms. | Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc |
| 2018 | SODA | Randomized Online Matching in Regular Graphs. | Ilan Reuven Cohen, David Wajc |
| 2016 | PODC | A Faster Distributed Radio Broadcast Primitive: Extended Abstract. | Bernhard Haeupler, David Wajc |
| 2015 | WWW | You Will Get Mail!Predicting the Arrival of Future Email. | Iftah Gamzu, Zohar Shay Karnin, Yoelle Maarek, David Wajc |