| Online matching with general arrivals B Gamlath, M Kapralov, A Maggiori, O Svensson, D Wajc 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 26-37, 2019 | 100 | 2019 |
| On the complexity of vertex-coloring edge-weightings A Dudek, D Wajc Discrete Mathematics and Theoretical Computer Science 13 (3), 45--50, 2011 | 86 | 2011 |
| Rounding dynamic matchings against an adaptive adversary D Wajc Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 76 | 2020 |
| Online stochastic max-weight bipartite matching: Beyond prophet inequalities C Papadimitriou, T Pollner, A Saberi, D Wajc Mathematics of Operations Research 49 (3), 1607-1628, 2024 | 65 | 2024 |
| Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms M Arar, S Chechik, S Cohen, C Stein, D Wajc In 45th International Colloquium on Automata, Languages, and Programming …, 2018 | 58 | 2018 |
| Fully-Dynamic Bin Packing with Little Repacking B Feldkord, M Feldotto, A Gupta, G Guruganesh, A Kumar, S Riechers, ... 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 57* | 2018 |
| The greedy algorithm is not optimal for on-line edge coloring A Saberi, D Wajc In 48th International Colloquium on Automata, Languages, and Programming …, 2021 | 55 | 2021 |
| Round-and message-optimal distributed graph algorithms B Haeupler, DE Hershkowitz, D Wajc Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 53 | 2018 |
| Universally-optimal distributed algorithms for known topologies B Haeupler, D Wajc, G Zuzic Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 47 | 2021 |
| Tight bounds for online edge coloring IR Cohen, B Peng, D Wajc 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 1-25, 2019 | 47 | 2019 |
| Online Edge Coloring Algorithms via the Nibble Method S Bhattacharya, F Grandoni, D Wajc Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 46 | 2021 |
| Randomized Online Matching in Regular Graphs IR Cohen, D Wajc Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 46 | 2018 |
| Near-optimum online ad allocation for targeted advertising J Naor, D Wajc ACM Transactions on Economics and Computation (TEAC) 6 (3-4), 1-20, 2018 | 45 | 2018 |
| Stochastic Online Metric Matching A Gupta, G Guruganesh, B Peng, D Wajc 46th International Colloquium on Automata, Languages, and Programming, ICALP …, 2019 | 44 | 2019 |
| Negative Association-Definition, Properties, and Applications D Wajc | 43* | |
| Dynamic matching with better-than-2 approximation in polylogarithmic update time S Bhattacharya, P Kiss, T Saranurak, D Wajc Journal of the ACM 71 (5), 1-32, 2024 | 41 | 2024 |
| Simplified and Space-Optimal Semi-Streaming (2+ ε)-Approximate Matching M Ghaffari, D Wajc 2nd Symposium on Simplicity in Algorithms (SOSA 2019), 2018 | 40 | 2018 |
| Streaming submodular matching meets the primal-dual method R Levin, D Wajc Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 39 | 2021 |
| Online matching: A brief survey Z Huang, ZG Tang, D Wajc ACM SIGecom Exchanges 22 (1), 135-158, 2024 | 38 | 2024 |
| Improved online contention resolution for matchings and applications to the gig economy T Pollner, M Roghani, A Saberi, D Wajc Mathematics of Operations Research 49 (3), 1582-1606, 2024 | 38 | 2024 |
Amin SaberiProfessor, Stanford UniversityVerified email at stanford.edu
