| No. |
Title |
Author |
Year |
| 1 |
Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free |
Bodwin, Greg et al. |
2023 |
| 2 |
Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies |
Dai, Wenkai et al. |
2022 |
| 3 |
Relative Survivable Network Design |
Dinitz, Michael et al. |
2022 |
| 4 |
Smoothed Analysis of Information Spreading in Dynamic Networks |
Dinitz, Michael et al. |
2022 |
| 5 |
Vertex Fault-Tolerant Emulators |
Bodwin, Greg et al. |
2022 |
| 6 |
Massively Parallel Approximate Distance Sketches |
Dinitz, Michael et al. |
2020 |
| 7 |
Approximating the Norms of Graph Spanners |
Chlamtác, Eden et al. |
2019 |
| 8 |
Brief Announcement: Massively Parallel Approximate Distance Sketches |
Dinitz, Michael et al. |
2019 |
| 9 |
The Capacity of Smartphone Peer-To-Peer Networks |
Dinitz, Michael et al. |
2019 |
| 10 |
The Norms of Graph Spanners |
Chlamtác, Eden et al. |
2019 |
| 11 |
Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network |
Babay, Amy et al. |
2018 |
| 12 |
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network |
Babay, Amy et al. |
2018 |
| 13 |
Distributed Distance-Bounded Network Design Through Distributed Convex Programming |
Dinitz, Michael et al. |
2018 |
| 14 |
Large Low-Diameter Graphs are Good Expanders |
Dinitz, Michael et al. |
2018 |
| 15 |
Approximating Approximate Distance Oracles |
Dinitz, Michael et al. |
2017 |
| 16 |
Computing Approximate PSD Factorizations |
Basu, Amitabh et al. |
2016 |
| 17 |
The Densest k-Subhypergraph Problem |
Chlamtac, Eden et al. |
2016 |
| 18 |
Towards Resistance Sparsifiers |
Dinitz, Michael et al. |
2015 |
| 19 |
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights |
Dinitz, Michael et al. |
2014 |
| 20 |
Lowest Degree k-Spanner: Approximation and Hardness |
Chlamtác, Eden et al. |
2014 |
