Spanners with Slack. - T.-H. Hubert Chan; Michael Dinitz; Anupam Gupta 001 (ESA, 2006)

Full Rank Tilings of Finite Abelian Groups. - Michael Dinitz (SIAM J. Discret. Math., 2006)

Compact routing with slack. - Michael Dinitz (PODC, 2007)

Online and dynamic embeddings of approximate ultrametrics. - Michael Dinitz (PODC, 2008)

Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics. - Michael Dinitz (DISC, 2008)

Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory. - Matthew Andrews; Michael Dinitz (INFOCOM, 2009)

Brief announcement: distributed algorithms for approximating wireless network capacity. - Michael Dinitz (PODC, 2009)

Secretary problems: weights and discounts. - Moshe Babaioff; Michael Dinitz; Anupam Gupta 001; Nicole Immorlica; Kunal Talwar (SODA, 2009)

Distributed Algorithms for Approximating Wireless Network Capacity. - Michael Dinitz (INFOCOM, 2010)

Graphical representations of clutters. - Michael Dinitz; Jonah M. Gold; Thomas C. Sharkey; Lorenzo Traldi (Ars Comb., 2010)

Algorithms and Models for Problems in Networking. - Michael Dinitz (2010)

Fault-tolerant spanners: better and simpler. - Michael Dinitz; Robert Krauthgamer (PODC, 2011)

Directed spanners via flow-based linear programs. - Michael Dinitz; Robert Krauthgamer (STOC, 2011)

iBGP and Constrained Connectivity. - Michael Dinitz; Gordon T. Wilfong (APPROX-RANDOM, 2012)

Everywhere-Sparse Spanners via Dense Subgraphs. - Eden Chlamtac; Michael Dinitz; Robert Krauthgamer (FOCS, 2012)

Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. - Michael Dinitz; Guy Kortsarz; Ran Raz (ICALP (1), 2012)

Efficient computation of distance sketches in distributed networks. - Atish Das Sarma; Michael Dinitz; Gopal Pandurangan (SPAA, 2012)

Packing Interdiction and Partial Covering Problems. - Michael Dinitz; Anupam Gupta 001 (IPCO, 2013)

Braess's Paradox in Wireless Networks: The Danger of Improved Technology. - Michael Dinitz; Merav Parter (DISC, 2013)

Recent advances on the matroid secretary problem. - Michael Dinitz (SIGACT News, 2013)

Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. - Michael Dinitz; Guy Kortsarz; Zeev Nutov (APPROX-RANDOM, 2014)

Matroid Secretary for Regular and Decomposable Matroids. - Michael Dinitz; Guy Kortsarz (SIAM J. Comput., 2014)

Towards Resistance Sparsifiers. - Michael Dinitz; Robert Krauthgamer; Tal Wagner (APPROX-RANDOM, 2015)

Xpander: Unveiling the Secrets of High-Performance Datacenters. - Asaf Valadarsky; Michael Dinitz; Michael Schapira (HotNets, 2015)

Efficient distributed computation of distance sketches in networks. - Atish Das Sarma; Michael Dinitz; Gopal Pandurangan (Distributed Comput., 2015)

Introduction to the Special Issue on SPAA 2013. - Michael Dinitz; Torsten Hoefler (ACM Trans. Parallel Comput., 2015)

Computing Approximate PSD Factorizations. - Amitabh Basu; Michael Dinitz; Xin Li 006 (APPROX-RANDOM, 2016)

Xpander: Towards Optimal-Performance Datacenters. - Asaf Valadarsky; Gal Shahaf; Michael Dinitz; Michael Schapira (CoNEXT, 2016)

Approximating Low-Stretch Spanners. - Michael Dinitz; Zeyu Zhang 003 (SODA, 2016)

Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. - Michael Dinitz; Guy Kortsarz; Ran Raz (ACM Trans. Algorithms, 2016)

Lowest-Degree k-Spanner: Approximation and Hardness. - Eden Chlamtác; Michael Dinitz (Theory Comput., 2016)

Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs. - Amy Babay; Emily Wagner; Michael Dinitz; Yair Amir (ICDCS, 2017)

Load balancing with bounded convergence in dynamic networks. - Michael Dinitz; Jeremy T. Fineman; Seth Gilbert; Calvin Newport (INFOCOM, 2017)

Approximating Approximate Distance Oracles. - Michael Dinitz; Zeyu Zhang 003 (ITCS, 2017)

Distributed Distance-Bounded Network Design Through Distributed Convex Programming. - Michael Dinitz; Yasamin Nazari (OPODIS, 2017)

Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. - Eden Chlamtác; Michael Dinitz; Yury Makarychev (SODA, 2017)

Explicit Expanding Expanders. - Michael Dinitz; Michael Schapira; Asaf Valadarsky (Algorithmica, 2017)

Multicast Capacity Through Perfect Domination. - Michael Dinitz; Naomi Ephraim (CoRR, 2017)

Approximating k-spanners in the LOCAL model. - Michael Dinitz; Yasamin Nazari (CoRR, 2017)

Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. - Michael Dinitz; Guy Kortsarz; Zeev Nutov (ACM Trans. Algorithms, 2017)

Large Low-Diameter Graphs are Good Expanders. - Michael Dinitz; Michael Schapira; Gal Shahaf (ESA, 2018)

Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. - Amy Babay; Michael Dinitz; Zeyu Zhang 003 (FSTTCS, 2018)

Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. - Amy Babay; Michael Dinitz; Zeyu Zhang 003 (ICALP, 2018)

Policy Regret in Repeated Games. - Raman Arora; Michael Dinitz; Teodor Vanislavov Marinov; Mehryar Mohri (NeurIPS, 2018)

Optimal Vertex Fault Tolerant Spanners (for fixed stretch). - Greg Bodwin; Michael Dinitz; Merav Parter; Virginia Vassilevska Williams (SODA, 2018)

Distributed Algorithms for Minimum Degree Spanning Trees. - Michael Dinitz; Magnús M. Halldórsson; Calvin Newport (CoRR, 2018)

Distributed Approximate Distance Oracles. - Michael Dinitz; Yasamin Nazari (CoRR, 2018)

Smoothed analysis of dynamic networks. - Michael Dinitz; Jeremy T. Fineman; Seth Gilbert; Calvin Newport (Distributed Comput., 2018)

The Densest k-Subhypergraph Problem. - Eden Chlamtác; Michael Dinitz; Christian Konrad 001; Guy Kortsarz; George Rabanca (SIAM J. Discret. Math., 2018)

Reception Capacity: Definitions, Game Theory and Hardness. - Michael Dinitz; Naomi Ephraim (ALGOSENSORS, 2019)

Approximating the Norms of Graph Spanners. - Eden Chlamtác; Michael Dinitz; Thomas Robinson (APPROX-RANDOM, 2019)

The Norms of Graph Spanners. - Eden Chlamtác; Michael Dinitz; Thomas Robinson (ICALP, 2019)

Massively Parallel Approximate Distance Sketches. - Michael Dinitz; Yasamin Nazari (OPODIS, 2019)

Distributed Minimum Degree Spanning Trees. - Michael Dinitz; Magnús M. Halldórsson; Taisuke Izumi; Calvin Newport (PODC, 2019)

The Capacity of Smartphone Peer-To-Peer Networks. - Michael Dinitz; Magnús M. Halldórsson; Calvin Newport; Alex Weaver (DISC, 2019)

Brief Announcement: Massively Parallel Approximate Distance Sketches. - Michael Dinitz; Yasamin Nazari (DISC, 2019)

Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks. - Michael Dinitz; Benjamin Moseley (INFOCOM, 2020)

Efficient and Simple Algorithms for Fault-Tolerant Spanners. - Michael Dinitz; Caleb Robelle (PODC, 2020)

Lasserre Integrality Gaps for Graph Spanners and Related Problems. - Michael Dinitz; Yasamin Nazari; Zeyu Zhang 003 (WAOA, 2020)

Approximate Moore Graphs are good expanders. - Michael Dinitz; Michael Schapira; Gal Shahaf (J. Comb. Theory B, 2020)

Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. - Eden Chlamtác; Michael Dinitz; Guy Kortsarz; Bundit Laekhanukit (ACM Trans. Algorithms, 2020)

Faster Matchings via Learned Duals. - Michael Dinitz; Sungjin Im; Thomas Lavastida; Benjamin Moseley; Sergei Vassilvitskii (NeurIPS, 2021)

Optimal Vertex Fault-Tolerant Spanners in Polynomial Time. - Greg Bodwin; Michael Dinitz; Caleb Robelle (SODA, 2021)

Fair Disaster Containment via Graph-Cut Problems. - Amy Babay; Michael Dinitz; Prathyush Sambaturu; Aravind Srinivasan; Leonidas Tsepenekas; Anil Vullikanti (CoRR, 2021)

Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. - Amy E. Babay; Michael Dinitz; Aravind Srinivasan; Leonidas Tsepenekas; Anil Vullikanti (AISTATS, 2022)

Fair Disaster Containment via Graph-Cut Problems. - Michael Dinitz; Aravind Srinivasan; Leonidas Tsepenekas; Anil Vullikanti (AISTATS, 2022)

Relative Survivable Network Design. - Michael Dinitz; Ama Koranteng; Guy Kortsarz (APPROX/RANDOM, 2022)

Vertex Fault-Tolerant Emulators. - Greg Bodwin; Michael Dinitz; Yasamin Nazari (ITCS, 2022)

Algorithms with Prediction Portfolios. - Michael Dinitz; Sungjin Im; Thomas Lavastida; Benjamin Moseley; Sergei Vassilvitskii (NeurIPS, 2022)

Partially Optimal Edge Fault-Tolerant Spanners. - Greg Bodwin; Michael Dinitz; Caleb Robelle (SODA, 2022)

Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies. - Wenkai Dai; Michael Dinitz; Klaus-Tycho Foerster; Stefan Schmid 001 (DISC, 2022)

Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free. - Greg Bodwin; Michael Dinitz; Yasamin Nazari (ITCS, 2023)

Improved Approximations for Relative Survivable Network Design. - Michael Dinitz; Ama Koranteng; Guy Kortsarz; Zeev Nutov (WAOA, 2023)

Improved Differentially Private Densest Subgraph: Local and Purely Additive. - Michael Dinitz; Satyen Kale; Silvio Lattanzi; Sergei Vassilvitskii (CoRR, 2023)

Degrees and Network Design: New Problems and Approximations. - Michael Dinitz; Guy Kortsarz; Shi Li 001 (APPROX/RANDOM, 2024)

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks. - Wenkai Dai; Michael Dinitz; Klaus-Tycho Foerster; Long Luo; Stefan Schmid 001 (INFOCOM, 2024)

Binary Search with Distributional Predictions. - Michael Dinitz; Sungjin Im; Thomas Lavastida; Benjamin Moseley; Aidin Niaparast; Sergei Vassilvitskii (NeurIPS, 2024)

Controlling Tail Risk in Online Ski-Rental. - Michael Dinitz; Sungjin Im; Thomas Lavastida; Benjamin Moseley; Sergei Vassilvitskii (SODA, 2024)

Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. - Laxman Dhulipala; Michael Dinitz; Jakub Lacki; Slobodan Mitrovic (DISC, 2024)

Differentially Private Multiway and k-Cut. - Rishi Chandra; Michael Dinitz; Chenglin Fan; Zongrui Zou (CoRR, 2024)

Noise is All You Need: Private Second-Order Convergence of Noisy SGD. - Dmitrii Avdiukhin; Michael Dinitz; Chenglin Fan; Grigory Yaroslavtsev (CoRR, 2024)

Smoothed Analysis of Information Spreading in Dynamic Networks. - Michael Dinitz; Jeremy T. Fineman; Seth Gilbert; Calvin Newport (J. ACM, 2024)

Light Edge Fault Tolerant Graph Spanners. - Greg Bodwin; Michael Dinitz; Ama Koranteng; Lily Wang (ICALP, 2025)

Approximation Algorithms for Optimal Hopsets. - Michael Dinitz; Ama Koranteng; Yasamin Nazari (ICALP, 2025)

Almost Tight Bounds for Differentially Private Densest Subgraph. - Michael Dinitz; Satyen Kale; Silvio Lattanzi; Sergei Vassilvitskii (SODA, 2025)

Differentially Private Matchings. - Michael Dinitz; George Z. Li; Quanquan C. Liu; Felix Zhou 002 (CoRR, 2025)

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances. - Michael Dinitz; Chenglin Fan; Jingcheng Liu 001; Jalaj Upadhyay; Zongrui Zou (CoRR, 2025)

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks. - Miguel Alves Ferreira; Nirav Atre; Justine Sherry; Michael Dinitz; João L. Sobrinho (CoRR, 2025)