On the complexity of vertex-coloring edge-weightings. - Andrzej Dudek; David Wajc (Discret. Math. Theor. Comput. Sci., 2011)

Best-response dynamics out of sync: complexity and characterization. - Roee Engelberg; Alex Fabrikant; Michael Schapira; David Wajc (EC, 2013)

You Will Get Mail!Predicting the Arrival of Future Email. - Iftah Gamzu; Zohar Shay Karnin; Yoelle Maarek; David Wajc (WWW (Companion Volume), 2015)

A Faster Distributed Radio Broadcast Primitive: Extended Abstract. - Bernhard Haeupler; David Wajc (PODC, 2016)

Fully-Dynamic Bin Packing with Limited Repacking. - Anupam Gupta 001; Guru Guruganesh; Amit Kumar 001; David Wajc (CoRR, 2017)

Approximation-Variance Tradeoffs in Facility Location Games. - Ariel D. Procaccia; David Wajc; Hanrui Zhang 001 (AAAI, 2018)

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. - Moab Arar; Shiri Chechik; Sarel Cohen; Cliff Stein 001; David Wajc (ICALP, 2018)

Fully-Dynamic Bin Packing with Little Repacking. - Björn Feldkord; Matthias Feldotto; Anupam Gupta 001; Guru Guruganesh; Amit Kumar 001; Sören Riechers; David Wajc (ICALP, 2018)

Round- and Message-Optimal Distributed Graph Algorithms. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (PODC, 2018)

Randomized Online Matching in Regular Graphs. - Ilan Reuven Cohen; David Wajc (SODA, 2018)

Round- and Message-Optimal Distributed Part-Wise Aggregation. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (CoRR, 2018)

Near-Optimum Online Ad Allocation for Targeted Advertising. - Joseph (Seffi) Naor; David Wajc (ACM Trans. Economics and Comput., 2018)

Tight Bounds for Online Edge Coloring. - Ilan Reuven Cohen; Binghui Peng; David Wajc (FOCS, 2019)

Online Matching with General Arrivals. - Buddhima Gamlath; Michael Kapralov; Andreas Maggiori; Ola Svensson; David Wajc (FOCS, 2019)

Stochastic Online Metric Matching. - Anupam Gupta 001; Guru Guruganesh; Binghui Peng; David Wajc (ICALP, 2019)

Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. - Mohsen Ghaffari 001; David Wajc (SOSA, 2019)

Network Coding Gaps for Completion Times of Multiple Unicasts. - Bernhard Haeupler; David Wajc; Goran Zuzic (FOCS, 2020)

Rounding dynamic matchings against an adaptive adversary. - David Wajc (STOC, 2020)

Near-Optimal Schedules for Simultaneous Multicasts. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (ICALP, 2021)

The Greedy Algorithm Is not Optimal for On-Line Edge Coloring. - Amin Saberi; David Wajc (ICALP, 2021)

Online Edge Coloring Algorithms via the Nibble Method. - Sayan Bhattacharya; Fabrizio Grandoni 001; David Wajc (SODA, 2021)

Streaming Submodular Matching Meets the Primal-Dual Method. - Roie Levin; David Wajc (SODA, 2021)

Universally-optimal distributed algorithms for known topologies. - Bernhard Haeupler; David Wajc; Goran Zuzic (STOC, 2021)

The Greedy Algorithm is emph{not} Optimal for On-Line Edge Coloring. - Amin Saberi; David Wajc (CoRR, 2021)

A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. - Niv Buchbinder; Joseph Naor; David Wajc (CoRR, 2021)

Matching Theory Under Uncertainty. - David Wajc (2021)

Beating the Folklore Algorithm for Dynamic Matching. - Mohammad Roghani; Amin Saberi; David Wajc (ITCS, 2022)

The Stationary Prophet Inequality Problem. - Kristen Kessel; Ali Shameli; Amin Saberi; David Wajc (EC, 2022)

Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). - Niv Buchbinder; Joseph (Seffi) Naor; David Wajc (SODA, 2023)

Online Dependent Rounding Schemes. - Joseph Naor; Aravind Srinivasan; David Wajc (CoRR, 2023)

The Average-Value Allocation Problem. - Kshipra Bhawalkar; Zhe Feng 004; Anupam Gupta 001; Aranyak Mehta; David Wajc; Di Wang 005 (APPROX/RANDOM, 2024)

Combinatorial Stationary Prophet Inequalities. - Neel Patel; David Wajc (SODA, 2024)

Simple and Asymptotically Optimal Online Bipartite Edge Coloring. - Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc (SOSA, 2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. - Sayan Bhattacharya; Peter Kiss; Aaron Sidford; David Wajc (STOC, 2024)

Online Edge Coloring Is (Nearly) as Easy as Offline. - Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc (STOC, 2024)

Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities. - Christos H. Papadimitriou; Tristan Pollner; Amin Saberi; David Wajc (Math. Oper. Res., 2024)

Improved Online Contention Resolution for Matchings and Applications to the Gig Economy. - Tristan Pollner; Mohammad Roghani; Amin Saberi; David Wajc (Math. Oper. Res., 2024)

Online Matching: A Brief Survey. - Zhiyi Huang 002; Zhihao Gavin Tang; David Wajc (SIGecom Exch., 2024)

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak; David Wajc (J. ACM, 2024)

Repairing Databases over Metric Spaces with Coincidence Constraints. - Youri Kaminsky; Benny Kimelfeld; Ester Livshits; Felix Naumann; David Wajc (ICDT, 2025)

Deterministic Online Bipartite Edge Coloring. - Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc (SODA, 2025)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. - Mark Braverman; Mahsa Derakhshan; Tristan Pollner; Amin Saberi; David Wajc (SODA, 2025)

Online Dependent Rounding Schemes for Bipartite Matchings, with. - Joseph (Seffi) Naor; Aravind Srinivasan; David Wajc (SODA, 2025)

Online Edge Coloring: Sharp Thresholds. - Joakim Blikstad; Ola Svensson; Radu Vintan; David Wajc (CoRR, 2025)