| 2026 | ICALP | Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines. | Michael Dinitz, Jeremy T. Fineman, Seeun William Umboh |
| 2026 | SODA | Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More. | Rishi Chandra, Michael Dinitz, Chenglin Fan, Zongrui Zou |
| 2025 | ICALP | Light Edge Fault Tolerant Graph Spanners. | Greg Bodwin, Michael Dinitz, Ama Koranteng, Lily Wang |
| 2025 | ICALP | Approximation Algorithms for Optimal Hopsets. | Michael Dinitz, Ama Koranteng, Yasamin Nazari |
| 2025 | SODA | Almost Tight Bounds for Differentially Private Densest Subgraph. | Michael Dinitz, Satyen Kale, Silvio Lattanzi, Sergei Vassilvitskii |
| 2025 | WAOA | Controlling Tail Risk in Two-Slope Ski Rental. | Qiming Cui, Michael Dinitz |
| 2024 | INFOCOM | Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. | Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Long Luo, Stefan Schmid |
| 2024 | SODA | Controlling Tail Risk in Online Ski-Rental. | Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii |
| 2023 | WAOA | Improved Approximations for Relative Survivable Network Design. | Michael Dinitz, Ama Koranteng, Guy Kortsarz, Zeev Nutov |
| 2022 | AISTATS | Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. | Amy E. Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti |
| 2022 | AISTATS | Fair Disaster Containment via Graph-Cut Problems. | Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti |
| 2022 | SODA | Partially Optimal Edge Fault-Tolerant Spanners. | Greg Bodwin, Michael Dinitz, Caleb Robelle |
| 2021 | SODA | Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. | Greg Bodwin, Michael Dinitz, Caleb Robelle |
| 2020 | INFOCOM | Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks. | Michael Dinitz, Benjamin Moseley |
| 2020 | PODC | Efficient and Simple Algorithms for Fault-Tolerant Spanners. | Michael Dinitz, Caleb Robelle |
| 2020 | WAOA | Lasserre Integrality Gaps for Graph Spanners and Related Problems. | Michael Dinitz, Yasamin Nazari, Zeyu Zhang |
| 2019 | Algosensors | Reception Capacity: Definitions, Game Theory and Hardness. | Michael Dinitz, Naomi Ephraim |
| 2019 | ICALP | The Norms of Graph Spanners. | Eden Chlamtc, Michael Dinitz, Thomas Robinson |
| 2019 | OPODIS | Massively Parallel Approximate Distance Sketches. | Michael Dinitz, Yasamin Nazari |
| 2019 | PODC | Distributed Minimum Degree Spanning Trees. | Michael Dinitz, Magns M. Halldrsson, Taisuke Izumi, Calvin Newport |
| 2018 | ESA | Large Low-Diameter Graphs are Good Expanders. | Michael Dinitz, Michael Schapira, Gal Shahaf |
| 2018 | ICALP | Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. | Amy Babay, Michael Dinitz, Zeyu Zhang |
| 2018 | SODA | Optimal Vertex Fault Tolerant Spanners (for fixed stretch). | Greg Bodwin, Michael Dinitz, Merav Parter, Virginia Vassilevska Williams |
| 2017 | ICDCS | Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs. | Amy Babay, Emily Wagner, Michael Dinitz, Yair Amir |
| 2017 | INFOCOM | Load balancing with bounded convergence in dynamic networks. | Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport |
| 2017 | OPODIS | Distributed Distance-Bounded Network Design Through Distributed Convex Programming. | Michael Dinitz, Yasamin Nazari |
| 2017 | SODA | Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. | Eden Chlamtc, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit |
| 2017 | SODA | Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. | Eden Chlamtc, Michael Dinitz, Yury Makarychev |
| 2016 | CoNEXT | Xpander: Towards Optimal-Performance Datacenters. | Asaf Valadarsky, Gal Shahaf, Michael Dinitz, Michael Schapira |
| 2016 | SODA | Approximating Low-Stretch Spanners. | Michael Dinitz, Zeyu Zhang |
| 2015 | ESA | Explicit Expanding Expanders. | Michael Dinitz, Michael Schapira, Asaf Valadarsky |
| 2015 | HOTNETS | Xpander: Unveiling the Secrets of High-Performance Datacenters. | Asaf Valadarsky, Michael Dinitz, Michael Schapira |
| 2013 | IPCO | Packing Interdiction and Partial Covering Problems. | Michael Dinitz, Anupam Gupta |
| 2013 | SODA | Matroid Secretary for Regular and Decomposable Matroids. | Michael Dinitz, Guy Kortsarz |
| 2012 | FOCS | Everywhere-Sparse Spanners via Dense Subgraphs. | Eden Chlamtac, Michael Dinitz, Robert Krauthgamer |
| 2012 | ICALP | Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. | Michael Dinitz, Guy Kortsarz, Ran Raz |
| 2012 | SPAA | Efficient computation of distance sketches in distributed networks. | Atish Das Sarma, Michael Dinitz, Gopal Pandurangan |
| 2011 | PODC | Fault-tolerant spanners: better and simpler. | Michael Dinitz, Robert Krauthgamer |
| 2011 | STOC | Directed spanners via flow-based linear programs. | Michael Dinitz, Robert Krauthgamer |
| 2010 | INFOCOM | Distributed Algorithms for Approximating Wireless Network Capacity. | Michael Dinitz |
| 2009 | INFOCOM | Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory. | Matthew Andrews, Michael Dinitz |
| 2009 | PODC | Brief announcement: distributed algorithms for approximating wireless network capacity. | Michael Dinitz |
| 2009 | SODA | Secretary problems: weights and discounts. | Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar |
| 2008 | PODC | Online and dynamic embeddings of approximate ultrametrics. | Michael Dinitz |
| 2007 | PODC | Compact routing with slack. | Michael Dinitz |
| 2006 | ESA | Spanners with Slack. | T.-H. Hubert Chan, Michael Dinitz, Anupam Gupta |