default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Michael Dinitz
@article{DBLP:journals/jacm/DinitzFGN24,
author = {Michael Dinitz and
Jeremy T. Fineman and
Seth Gilbert and
Calvin Newport},
title = {Smoothed Analysis of Information Spreading in Dynamic Networks},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {17},
year = {2024},
url = {https://doi.org/10.1145/3661831},
doi = {10.1145/3661831},
timestamp = {Fri, 19 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DinitzFGN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinitzK024,
author = {Michael Dinitz and
Guy Kortsarz and
Shi Li},
editor = {Amit Kumar and
Noga Ron{-}Zewi},
title = {Degrees and Network Design: New Problems and Approximations},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2024, August 28-30, 2024, London School
of Economics, London, {UK}},
series = {LIPIcs},
volume = {317},
pages = {3:1--3:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.3},
doi = {10.4230/LIPICS.APPROX/RANDOM.2024.3},
timestamp = {Mon, 16 Sep 2024 17:07:54 +0200},
biburl = {https://dblp.org/rec/conf/approx/DinitzK024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/DaiDFL024,
author = {Wenkai Dai and
Michael Dinitz and
Klaus{-}Tycho Foerster and
Long Luo and
Stefan Schmid},
title = {Approximation Algorithms for Minimizing Congestion in Demand-Aware
Networks},
booktitle = {{IEEE} {INFOCOM} 2024 - {IEEE} Conference on Computer Communications,
Vancouver, BC, Canada, May 20-23, 2024},
pages = {1461--1470},
publisher = {{IEEE}},
year = {2024},
url = {https://doi.org/10.1109/INFOCOM52122.2024.10621340},
doi = {10.1109/INFOCOM52122.2024.10621340},
timestamp = {Tue, 20 Aug 2024 13:54:36 +0200},
biburl = {https://dblp.org/rec/conf/infocom/DaiDFL024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DinitzILMV24,
author = {Michael Dinitz and
Sungjin Im and
Thomas Lavastida and
Benjamin Moseley and
Sergei Vassilvitskii},
editor = {David P. Woodruff},
title = {Controlling Tail Risk in Online Ski-Rental},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {4247--4263},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.147},
doi = {10.1137/1.9781611977912.147},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/DinitzILMV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-04638,
author = {Wenkai Dai and
Michael Dinitz and
Klaus{-}Tycho Foerster and
Long Luo and
Stefan Schmid},
title = {Approximation Algorithms for Minimizing Congestion in Demand-Aware
Networks},
journal = {CoRR},
volume = {abs/2401.04638},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.04638},
doi = {10.48550/ARXIV.2401.04638},
eprinttype = {arXiv},
eprint = {2401.04638},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-04638.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2407-06911,
author = {Rishi Chandra and
Michael Dinitz and
Chenglin Fan and
Zongrui Zou},
title = {Differentially Private Multiway and k-Cut},
journal = {CoRR},
volume = {abs/2407.06911},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2407.06911},
doi = {10.48550/ARXIV.2407.06911},
eprinttype = {arXiv},
eprint = {2407.06911},
timestamp = {Fri, 16 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2407-06911.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BodwinDN23,
author = {Greg Bodwin and
Michael Dinitz and
Yasamin Nazari},
editor = {Yael Tauman Kalai},
title = {Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for
Free},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {20:1--20:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.20},
doi = {10.4230/LIPICS.ITCS.2023.20},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BodwinDN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DinitzKKN23,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz and
Zeev Nutov},
editor = {Jaroslaw Byrka and
Andreas Wiese},
title = {Improved Approximations for Relative Survivable Network Design},
booktitle = {Approximation and Online Algorithms - 21st International Workshop,
{WAOA} 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14297},
pages = {190--204},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49815-2\_14},
doi = {10.1007/978-3-031-49815-2\_14},
timestamp = {Thu, 11 Jan 2024 22:28:02 +0100},
biburl = {https://dblp.org/rec/conf/waoa/DinitzKKN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11475,
author = {Michael Dinitz and
Guy Kortsarz and
Shi Li},
title = {Degrees and Network Design: New Problems and Approximations},
journal = {CoRR},
volume = {abs/2302.11475},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.11475},
doi = {10.48550/ARXIV.2302.11475},
eprinttype = {arXiv},
eprint = {2302.11475},
timestamp = {Fri, 24 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-11475.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-06656,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz and
Zeev Nutov},
title = {Improved Approximations for Relative Survivable Network Design},
journal = {CoRR},
volume = {abs/2304.06656},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.06656},
doi = {10.48550/ARXIV.2304.06656},
eprinttype = {arXiv},
eprint = {2304.06656},
timestamp = {Wed, 19 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-06656.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-05067,
author = {Michael Dinitz and
Sungjin Im and
Thomas Lavastida and
Benjamin Moseley and
Sergei Vassilvitskii},
title = {Controlling Tail Risk in Online Ski-Rental},
journal = {CoRR},
volume = {abs/2308.05067},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.05067},
doi = {10.48550/ARXIV.2308.05067},
eprinttype = {arXiv},
eprint = {2308.05067},
timestamp = {Tue, 22 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-05067.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-10316,
author = {Michael Dinitz and
Satyen Kale and
Silvio Lattanzi and
Sergei Vassilvitskii},
title = {Improved Differentially Private Densest Subgraph: Local and Purely
Additive},
journal = {CoRR},
volume = {abs/2308.10316},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.10316},
doi = {10.48550/ARXIV.2308.10316},
eprinttype = {arXiv},
eprint = {2308.10316},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-10316.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/DinitzSTV22,
author = {Michael Dinitz and
Aravind Srinivasan and
Leonidas Tsepenekas and
Anil Vullikanti},
editor = {Gustau Camps{-}Valls and
Francisco J. R. Ruiz and
Isabel Valera},
title = {Fair Disaster Containment via Graph-Cut Problems},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2022, 28-30 March 2022, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {151},
pages = {6321--6333},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v151/dinitz22a.html},
timestamp = {Sat, 30 Sep 2023 09:34:08 +0200},
biburl = {https://dblp.org/rec/conf/aistats/DinitzSTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aistats/BabayDSTV22,
author = {Amy E. Babay and
Michael Dinitz and
Aravind Srinivasan and
Leonidas Tsepenekas and
Anil Vullikanti},
editor = {Gustau Camps{-}Valls and
Francisco J. R. Ruiz and
Isabel Valera},
title = {Controlling Epidemic Spread using Probabilistic Diffusion Models on
Networks},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2022, 28-30 March 2022, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {151},
pages = {11641--11654},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v151/babay22a.html},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aistats/BabayDSTV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinitzKK22,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Relative Survivable Network Design},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {41:1--41:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.41},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.41},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DinitzKK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BodwinDN22,
author = {Greg Bodwin and
Michael Dinitz and
Yasamin Nazari},
editor = {Mark Braverman},
title = {Vertex Fault-Tolerant Emulators},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {25:1--25:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.25},
doi = {10.4230/LIPICS.ITCS.2022.25},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BodwinDN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/DinitzILMV22,
author = {Michael Dinitz and
Sungjin Im and
Thomas Lavastida and
Benjamin Moseley and
Sergei Vassilvitskii},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Algorithms with Prediction Portfolios},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/7f9220f90cc85b0da693643add6618e6-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/DinitzILMV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BodwinDR22,
author = {Greg Bodwin and
Michael Dinitz and
Caleb Robelle},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Partially Optimal Edge Fault-Tolerant Spanners},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {3272--3286},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.129},
doi = {10.1137/1.9781611977073.129},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/BodwinDR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DinitzFGN22,
author = {Michael Dinitz and
Jeremy T. Fineman and
Seth Gilbert and
Calvin Newport},
editor = {Christian Scheideler},
title = {Smoothed Analysis of Information Spreading in Dynamic Networks},
booktitle = {36th International Symposium on Distributed Computing, {DISC} 2022,
October 25-27, 2022, Augusta, Georgia, {USA}},
series = {LIPIcs},
volume = {246},
pages = {18:1--18:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.DISC.2022.18},
doi = {10.4230/LIPICS.DISC.2022.18},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DinitzFGN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DaiDF022,
author = {Wenkai Dai and
Michael Dinitz and
Klaus{-}Tycho Foerster and
Stefan Schmid},
editor = {Christian Scheideler},
title = {Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network
Topologies},
booktitle = {36th International Symposium on Distributed Computing, {DISC} 2022,
October 25-27, 2022, Augusta, Georgia, {USA}},
series = {LIPIcs},
volume = {246},
pages = {42:1--42:3},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.DISC.2022.42},
doi = {10.4230/LIPICS.DISC.2022.42},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DaiDF022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-08296,
author = {Amy Babay and
Michael Dinitz and
Aravind Srinivasan and
Leonidas Tsepenekas and
Anil Vullikanti},
title = {Controlling Epidemic Spread using Probabilistic Diffusion Models on
Networks},
journal = {CoRR},
volume = {abs/2202.08296},
year = {2022},
url = {https://arxiv.org/abs/2202.08296},
eprinttype = {arXiv},
eprint = {2202.08296},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-08296.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-12245,
author = {Michael Dinitz and
Ama Koranteng and
Guy Kortsarz},
title = {Relative Survivable Network Design},
journal = {CoRR},
volume = {abs/2206.12245},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.12245},
doi = {10.48550/ARXIV.2206.12245},
eprinttype = {arXiv},
eprint = {2206.12245},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-12245.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-05998,
author = {Michael Dinitz and
Jeremy T. Fineman and
Seth Gilbert and
Calvin Newport},
title = {Smoothed Analysis of Information Spreading in Dynamic Networks},
journal = {CoRR},
volume = {abs/2208.05998},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.05998},
doi = {10.48550/ARXIV.2208.05998},
eprinttype = {arXiv},
eprint = {2208.05998},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-05998.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-03675,
author = {Greg Bodwin and
Michael Dinitz and
Yasamin Nazari},
title = {Epic Fail: Emulators can tolerate polynomially many edge faults for
free},
journal = {CoRR},
volume = {abs/2209.03675},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.03675},
doi = {10.48550/ARXIV.2209.03675},
eprinttype = {arXiv},
eprint = {2209.03675},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-03675.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-12438,
author = {Michael Dinitz and
Sungjin Im and
Thomas Lavastida and
Benjamin Moseley and
Sergei Vassilvitskii},
title = {Algorithms with Prediction Portfolios},
journal = {CoRR},
volume = {abs/2210.12438},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.12438},
doi = {10.48550/ARXIV.2210.12438},
eprinttype = {arXiv},
eprint = {2210.12438},
timestamp = {Fri, 28 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-12438.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/DinitzILMV21,
author = {Michael Dinitz and
Sungjin Im and
Thomas Lavastida and
Benjamin Moseley and
Sergei Vassilvitskii},
editor = {Marc'Aurelio Ranzato and
Alina Beygelzimer and
Yann N. Dauphin and
Percy Liang and
Jennifer Wortman Vaughan},
title = {Faster Matchings via Learned Duals},
booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference
on Neural Information Processing Systems 2021, NeurIPS 2021, December
6-14, 2021, virtual},
pages = {10393--10406},
year = {2021},
url = {https://proceedings.neurips.cc/paper/2021/hash/5616060fb8ae85d93f334e7267307664-Abstract.html},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/DinitzILMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BodwinDR21,
author = {Greg Bodwin and
Michael Dinitz and
Caleb Robelle},
editor = {D{\'{a}}niel Marx},
title = {Optimal Vertex Fault-Tolerant Spanners in Polynomial Time},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2924--2938},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.174},
doi = {10.1137/1.9781611976465.174},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BodwinDR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-11360,
author = {Greg Bodwin and
Michael Dinitz and
Caleb Robelle},
title = {Partially Optimal Edge Fault-Tolerant Spanners},
journal = {CoRR},
volume = {abs/2102.11360},
year = {2021},
url = {https://arxiv.org/abs/2102.11360},
eprinttype = {arXiv},
eprint = {2102.11360},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-11360.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-05424,
author = {Amy Babay and
Michael Dinitz and
Prathyush Sambaturu and
Aravind Srinivasan and
Leonidas Tsepenekas and
Anil Vullikanti},
title = {Fair Disaster Containment via Graph-Cut Problems},
journal = {CoRR},
volume = {abs/2106.05424},
year = {2021},
url = {https://arxiv.org/abs/2106.05424},
eprinttype = {arXiv},
eprint = {2106.05424},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-05424.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-09770,
author = {Michael Dinitz and
Sungjin Im and
Thomas Lavastida and
Benjamin Moseley and
Sergei Vassilvitskii},
title = {Faster Matchings via Learned Duals},
journal = {CoRR},
volume = {abs/2107.09770},
year = {2021},
url = {https://arxiv.org/abs/2107.09770},
eprinttype = {arXiv},
eprint = {2107.09770},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-09770.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-08042,
author = {Greg Bodwin and
Michael Dinitz and
Yasamin Nazari},
title = {Vertex Fault-Tolerant Emulators},
journal = {CoRR},
volume = {abs/2109.08042},
year = {2021},
url = {https://arxiv.org/abs/2109.08042},
eprinttype = {arXiv},
eprint = {2109.08042},
timestamp = {Wed, 22 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-08042.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DinitzSS20,
author = {Michael Dinitz and
Michael Schapira and
Gal Shahaf},
title = {Approximate Moore Graphs are good expanders},
journal = {J. Comb. Theory {B}},
volume = {141},
pages = {240--263},
year = {2020},
url = {https://doi.org/10.1016/j.jctb.2019.08.003},
doi = {10.1016/J.JCTB.2019.08.003},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/DinitzSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChlamtacDKL20,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Guy Kortsarz and
Bundit Laekhanukit},
title = {Approximating Spanners and Directed Steiner Forest: Upper and Lower
Bounds},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {3},
pages = {33:1--33:31},
year = {2020},
url = {https://doi.org/10.1145/3381451},
doi = {10.1145/3381451},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChlamtacDKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/DinitzM20,
author = {Michael Dinitz and
Benjamin Moseley},
title = {Scheduling for Weighted Flow and Completion Times in Reconfigurable
Networks},
booktitle = {39th {IEEE} Conference on Computer Communications, {INFOCOM} 2020,
Toronto, ON, Canada, July 6-9, 2020},
pages = {1043--1052},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/INFOCOM41043.2020.9155537},
doi = {10.1109/INFOCOM41043.2020.9155537},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/infocom/DinitzM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/DinitzR20,
author = {Michael Dinitz and
Caleb Robelle},
editor = {Yuval Emek and
Christian Cachin},
title = {Efficient and Simple Algorithms for Fault-Tolerant Spanners},
booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, August 3-7, 2020},
pages = {493--500},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3382734.3405735},
doi = {10.1145/3382734.3405735},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/DinitzR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DinitzNZ20,
author = {Michael Dinitz and
Yasamin Nazari and
Zeyu Zhang},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {Lasserre Integrality Gaps for Graph Spanners and Related Problems},
booktitle = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
pages = {97--112},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_7},
doi = {10.1007/978-3-030-80879-2\_7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/DinitzNZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-07784,
author = {Michael Dinitz and
Benjamin Moseley},
title = {Scheduling for Weighted Flow and Completion Times in Reconfigurable
Networks},
journal = {CoRR},
volume = {abs/2001.07784},
year = {2020},
url = {https://arxiv.org/abs/2001.07784},
eprinttype = {arXiv},
eprint = {2001.07784},
timestamp = {Fri, 24 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-07784.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-10889,
author = {Michael Dinitz and
Caleb Robelle},
title = {Efficient and Simple Algorithms for Fault Tolerant Spanners},
journal = {CoRR},
volume = {abs/2002.10889},
year = {2020},
url = {https://arxiv.org/abs/2002.10889},
eprinttype = {arXiv},
eprint = {2002.10889},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-10889.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-08401,
author = {Greg Bodwin and
Michael Dinitz and
Caleb Robelle},
title = {Optimal Vertex Fault-Tolerant Spanners in Polynomial Time},
journal = {CoRR},
volume = {abs/2007.08401},
year = {2020},
url = {https://arxiv.org/abs/2007.08401},
eprinttype = {arXiv},
eprint = {2007.08401},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-08401.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/DinitzE19,
author = {Michael Dinitz and
Naomi Ephraim},
editor = {Falko Dressler and
Christian Scheideler},
title = {Reception Capacity: Definitions, Game Theory and Hardness},
booktitle = {Algorithms for Sensor Systems - 15th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, {ALGOSENSORS} 2019,
Munich, Germany, September 12-13, 2019, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {11931},
pages = {96--115},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-34405-4\_6},
doi = {10.1007/978-3-030-34405-4\_6},
timestamp = {Tue, 19 Nov 2019 17:03:02 +0100},
biburl = {https://dblp.org/rec/conf/algosensors/DinitzE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChlamtacDR19,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Thomas Robinson},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Approximating the Norms of Graph Spanners},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {11:1--11:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.11},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.11},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChlamtacDR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChlamtacDR19,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Thomas Robinson},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {The Norms of Graph Spanners},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {40:1--40:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.40},
doi = {10.4230/LIPICS.ICALP.2019.40},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChlamtacDR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/DinitzN19,
author = {Michael Dinitz and
Yasamin Nazari},
editor = {Pascal Felber and
Roy Friedman and
Seth Gilbert and
Avery Miller},
title = {Massively Parallel Approximate Distance Sketches},
booktitle = {23rd International Conference on Principles of Distributed Systems,
{OPODIS} 2019, December 17-19, 2019, Neuch{\^{a}}tel, Switzerland},
series = {LIPIcs},
volume = {153},
pages = {35:1--35:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2019.35},
doi = {10.4230/LIPICS.OPODIS.2019.35},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/opodis/DinitzN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/DinitzHIN19,
author = {Michael Dinitz and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Taisuke Izumi and
Calvin Newport},
editor = {Peter Robinson and
Faith Ellen},
title = {Distributed Minimum Degree Spanning Trees},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {511--520},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3331604},
doi = {10.1145/3293611.3331604},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/DinitzHIN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DinitzHNW19,
author = {Michael Dinitz and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Calvin Newport and
Alex Weaver},
editor = {Jukka Suomela},
title = {The Capacity of Smartphone Peer-To-Peer Networks},
booktitle = {33rd International Symposium on Distributed Computing, {DISC} 2019,
October 14-18, 2019, Budapest, Hungary},
series = {LIPIcs},
volume = {146},
pages = {14:1--14:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.DISC.2019.14},
doi = {10.4230/LIPICS.DISC.2019.14},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DinitzHNW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DinitzN19,
author = {Michael Dinitz and
Yasamin Nazari},
editor = {Jukka Suomela},
title = {Brief Announcement: Massively Parallel Approximate Distance Sketches},
booktitle = {33rd International Symposium on Distributed Computing, {DISC} 2019,
October 14-18, 2019, Budapest, Hungary},
series = {LIPIcs},
volume = {146},
pages = {42:1--42:3},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.DISC.2019.42},
doi = {10.4230/LIPICS.DISC.2019.42},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DinitzN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-07418,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Thomas Robinson},
title = {The Norms of Graph Spanners},
journal = {CoRR},
volume = {abs/1903.07418},
year = {2019},
url = {http://arxiv.org/abs/1903.07418},
eprinttype = {arXiv},
eprint = {1903.07418},
timestamp = {Mon, 01 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-07418.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-07468,
author = {Michael Dinitz and
Yasamin Nazari and
Zeyu Zhang},
title = {Lasserre Integrality Gaps for Graph Spanners and Related Problems},
journal = {CoRR},
volume = {abs/1905.07468},
year = {2019},
url = {http://arxiv.org/abs/1905.07468},
eprinttype = {arXiv},
eprint = {1905.07468},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-07468.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-01894,
author = {Michael Dinitz and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Calvin Newport and
Alex Weaver},
title = {The Capacity of Smartphone Peer-to-Peer Networks},
journal = {CoRR},
volume = {abs/1908.01894},
year = {2019},
url = {http://arxiv.org/abs/1908.01894},
eprinttype = {arXiv},
eprint = {1908.01894},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-01894.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/DinitzFGN18,
author = {Michael Dinitz and
Jeremy T. Fineman and
Seth Gilbert and
Calvin Newport},
title = {Smoothed analysis of dynamic networks},
journal = {Distributed Comput.},
volume = {31},
number = {4},
pages = {273--287},
year = {2018},
url = {https://doi.org/10.1007/s00446-017-0300-8},
doi = {10.1007/S00446-017-0300-8},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/DinitzFGN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChlamtacDKKR18,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Christian Konrad and
Guy Kortsarz and
George Rabanca},
title = {The Densest k-Subhypergraph Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {2},
pages = {1458--1477},
year = {2018},
url = {https://doi.org/10.1137/16M1096402},
doi = {10.1137/16M1096402},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/ChlamtacDKKR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DinitzSS18,
author = {Michael Dinitz and
Michael Schapira and
Gal Shahaf},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Large Low-Diameter Graphs are Good Expanders},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {71:1--71:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.71},
doi = {10.4230/LIPICS.ESA.2018.71},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/DinitzSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BabayDZ18,
author = {Amy Babay and
Michael Dinitz and
Zeyu Zhang},
editor = {Sumit Ganguly and
Paritosh K. Pandya},
title = {Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner
Network},
booktitle = {38th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018,
Ahmedabad, India},
series = {LIPIcs},
volume = {122},
pages = {33:1--33:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.33},
doi = {10.4230/LIPICS.FSTTCS.2018.33},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BabayDZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BabayDZ18,
author = {Amy Babay and
Michael Dinitz and
Zeyu Zhang},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter)
Shallow-Light Steiner Network},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {104:1--104:4},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.104},
doi = {10.4230/LIPICS.ICALP.2018.104},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BabayDZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AroraDMM18,
author = {Raman Arora and
Michael Dinitz and
Teodor Vanislavov Marinov and
Mehryar Mohri},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {Policy Regret in Repeated Games},
booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
on Neural Information Processing Systems 2018, NeurIPS 2018, December
3-8, 2018, Montr{\'{e}}al, Canada},
pages = {6733--6742},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/8643c8e2107ba86c47371e037059c4b7-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/AroraDMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BodwinDPW18,
author = {Greg Bodwin and
Michael Dinitz and
Merav Parter and
Virginia {Vassilevska Williams}},
editor = {Artur Czumaj},
title = {Optimal Vertex Fault Tolerant Spanners (for fixed stretch)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1884--1900},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.123},
doi = {10.1137/1.9781611975031.123},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BodwinDPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-10566,
author = {Amy Babay and
Michael Dinitz and
Zeyu Zhang},
title = {Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner
Network},
journal = {CoRR},
volume = {abs/1802.10566},
year = {2018},
url = {http://arxiv.org/abs/1802.10566},
eprinttype = {arXiv},
eprint = {1802.10566},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-10566.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03365,
author = {Michael Dinitz and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Calvin Newport},
title = {Distributed Algorithms for Minimum Degree Spanning Trees},
journal = {CoRR},
volume = {abs/1806.03365},
year = {2018},
url = {http://arxiv.org/abs/1806.03365},
eprinttype = {arXiv},
eprint = {1806.03365},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-03365.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-09027,
author = {Michael Dinitz and
Yasamin Nazari},
title = {Distributed Approximate Distance Oracles},
journal = {CoRR},
volume = {abs/1810.09027},
year = {2018},
url = {http://arxiv.org/abs/1810.09027},
eprinttype = {arXiv},
eprint = {1810.09027},
timestamp = {Wed, 31 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-09027.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04127,
author = {Raman Arora and
Michael Dinitz and
Teodor V. Marinov and
Mehryar Mohri},
title = {Policy Regret in Repeated Games},
journal = {CoRR},
volume = {abs/1811.04127},
year = {2018},
url = {http://arxiv.org/abs/1811.04127},
eprinttype = {arXiv},
eprint = {1811.04127},
timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04127.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DinitzSV17,
author = {Michael Dinitz and
Michael Schapira and
Asaf Valadarsky},
title = {Explicit Expanding Expanders},
journal = {Algorithmica},
volume = {78},
number = {4},
pages = {1225--1245},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0269-x},
doi = {10.1007/S00453-016-0269-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DinitzSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DinitzKN17,
author = {Michael Dinitz and
Guy Kortsarz and
Zeev Nutov},
title = {Improved Approximation Algorithm for Steiner \emph{k}-Forest with
Nearly Uniform Weights},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {3},
pages = {40:1--40:16},
year = {2017},
url = {https://doi.org/10.1145/3077581},
doi = {10.1145/3077581},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/DinitzKN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcs/BabayWDA17,
author = {Amy Babay and
Emily Wagner and
Michael Dinitz and
Yair Amir},
editor = {Kisung Lee and
Ling Liu},
title = {Timely, Reliable, and Cost-Effective Internet Transport Service Using
Dissemination Graphs},
booktitle = {37th {IEEE} International Conference on Distributed Computing Systems,
{ICDCS} 2017, Atlanta, GA, USA, June 5-8, 2017},
pages = {1--12},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/ICDCS.2017.63},
doi = {10.1109/ICDCS.2017.63},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcs/BabayWDA17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/DinitzFGN17,
author = {Michael Dinitz and
Jeremy T. Fineman and
Seth Gilbert and
Calvin Newport},
title = {Load balancing with bounded convergence in dynamic networks},
booktitle = {2017 {IEEE} Conference on Computer Communications, {INFOCOM} 2017,
Atlanta, GA, USA, May 1-4, 2017},
pages = {1--9},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/INFOCOM.2017.8057000},
doi = {10.1109/INFOCOM.2017.8057000},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/DinitzFGN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DinitzZ17,
author = {Michael Dinitz and
Zeyu Zhang},
editor = {Christos H. Papadimitriou},
title = {Approximating Approximate Distance Oracles},
booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS}
2017, January 9-11, 2017, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {67},
pages = {52:1--52:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.52},
doi = {10.4230/LIPICS.ITCS.2017.52},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/DinitzZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/DinitzN17,
author = {Michael Dinitz and
Yasamin Nazari},
editor = {James Aspnes and
Alysson Bessani and
Pascal Felber and
Jo{\~{a}}o Leit{\~{a}}o},
title = {Distributed Distance-Bounded Network Design Through Distributed Convex
Programming},
booktitle = {21st International Conference on Principles of Distributed Systems,
{OPODIS} 2017, Lisbon, Portugal, December 18-20, 2017},
series = {LIPIcs},
volume = {95},
pages = {5:1--5:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2017.5},
doi = {10.4230/LIPICS.OPODIS.2017.5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/opodis/DinitzN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChlamtacDKL17,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Guy Kortsarz and
Bundit Laekhanukit},
editor = {Philip N. Klein},
title = {Approximating Spanners and Directed Steiner Forest: Upper and Lower
Bounds},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {534--553},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.34},
doi = {10.1137/1.9781611974782.34},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChlamtacDKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChlamtacDM17,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Yury Makarychev},
editor = {Philip N. Klein},
title = {Minimizing the Union: Tight Approximations for Small Set Bipartite
Vertex Expansion},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {881--899},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.56},
doi = {10.1137/1.9781611974782.56},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChlamtacDM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinitzE17,
author = {Michael Dinitz and
Naomi Ephraim},
title = {Multicast Capacity Through Perfect Domination},
journal = {CoRR},
volume = {abs/1702.03978},
year = {2017},
url = {http://arxiv.org/abs/1702.03978},
eprinttype = {arXiv},
eprint = {1702.03978},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DinitzE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinitzN17,
author = {Michael Dinitz and
Yasamin Nazari},
title = {Approximating k-spanners in the {LOCAL} model},
journal = {CoRR},
volume = {abs/1703.07417},
year = {2017},
url = {http://arxiv.org/abs/1703.07417},
eprinttype = {arXiv},
eprint = {1703.07417},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DinitzN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-03164,
author = {Greg Bodwin and
Michael Dinitz and
Merav Parter and
Virginia {Vassilevska Williams}},
title = {Optimal Vertex Fault Tolerant Spanners (for fixed stretch)},
journal = {CoRR},
volume = {abs/1710.03164},
year = {2017},
url = {http://arxiv.org/abs/1710.03164},
eprinttype = {arXiv},
eprint = {1710.03164},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-03164.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DinitzKR16,
author = {Michael Dinitz and
Guy Kortsarz and
Ran Raz},
title = {Label Cover Instances with Large Girth and the Hardness of Approximating
Basic \emph{k}-Spanner},
journal = {{ACM} Trans. Algorithms},
volume = {12},
number = {2},
pages = {25:1--25:16},
year = {2016},
url = {https://doi.org/10.1145/2818375},
doi = {10.1145/2818375},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/DinitzKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChlamtacD16,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz},
title = {Lowest-Degree k-Spanner: Approximation and Hardness},
journal = {Theory Comput.},
volume = {12},
number = {1},
pages = {1--29},
year = {2016},
url = {https://doi.org/10.4086/toc.2016.v012a015},
doi = {10.4086/TOC.2016.V012A015},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChlamtacD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BasuD016,
author = {Amitabh Basu and
Michael Dinitz and
Xin Li},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {Computing Approximate {PSD} Factorizations},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {2:1--2:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.2},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.2},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/BasuD016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChlamtacDKKR16,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Christian Konrad and
Guy Kortsarz and
George Rabanca},
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {The Densest k-Subhypergraph Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
pages = {6:1--6:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.6},
doi = {10.4230/LIPICS.APPROX-RANDOM.2016.6},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/ChlamtacDKKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/conext/ValadarskySDS16,
author = {Asaf Valadarsky and
Gal Shahaf and
Michael Dinitz and
Michael Schapira},
editor = {Athina Markopoulou and
Michalis Faloutsos and
Vyas Sekar and
Dejan Kostic},
title = {Xpander: Towards Optimal-Performance Datacenters},
booktitle = {Proceedings of the 12th International on Conference on emerging Networking
EXperiments and Technologies, CoNEXT 2016, Irvine, California, USA,
December 12-15, 2016},
pages = {205--219},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2999572.2999580},
doi = {10.1145/2999572.2999580},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/conext/ValadarskySDS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DinitzZ16,
author = {Michael Dinitz and
Zeyu Zhang},
editor = {Robert Krauthgamer},
title = {Approximating Low-Stretch Spanners},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {821--840},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch59},
doi = {10.1137/1.9781611974331.CH59},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DinitzZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasuDL16,
author = {Amitabh Basu and
Michael Dinitz and
Xin Li},
title = {Computing approximate {PSD} factorizations},
journal = {CoRR},
volume = {abs/1602.07351},
year = {2016},
url = {http://arxiv.org/abs/1602.07351},
eprinttype = {arXiv},
eprint = {1602.07351},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BasuDL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChlamtacDKKR16,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Christian Konrad and
Guy Kortsarz and
George Rabanca},
title = {The Densest k-Subhypergraph Problem},
journal = {CoRR},
volume = {abs/1605.04284},
year = {2016},
url = {http://arxiv.org/abs/1605.04284},
eprinttype = {arXiv},
eprint = {1605.04284},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ChlamtacDKKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChlamtacDKL16,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Guy Kortsarz and
Bundit Laekhanukit},
title = {Approximating Spanners and Directed Steiner Forest: Upper and Lower
Bounds},
journal = {CoRR},
volume = {abs/1607.06068},
year = {2016},
url = {http://arxiv.org/abs/1607.06068},
eprinttype = {arXiv},
eprint = {1607.06068},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChlamtacDKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChlamtacDM16,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz and
Yury Makarychev},
title = {Minimizing the Union: Tight Approximations for Small Set Bipartite
Vertex Expansion},
journal = {CoRR},
volume = {abs/1611.07866},
year = {2016},
url = {http://arxiv.org/abs/1611.07866},
eprinttype = {arXiv},
eprint = {1611.07866},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChlamtacDM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinitzZ16,
author = {Michael Dinitz and
Zeyu Zhang},
title = {Approximating Approximate Distance Oracles},
journal = {CoRR},
volume = {abs/1612.05623},
year = {2016},
url = {http://arxiv.org/abs/1612.05623},
eprinttype = {arXiv},
eprint = {1612.05623},
timestamp = {Tue, 11 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/DinitzZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/SarmaDP15,
author = {Atish Das Sarma and
Michael Dinitz and
Gopal Pandurangan},
title = {Efficient distributed computation of distance sketches in networks},
journal = {Distributed Comput.},
volume = {28},
number = {5},
pages = {309--320},
year = {2015},
url = {https://doi.org/10.1007/s00446-015-0246-7},
doi = {10.1007/S00446-015-0246-7},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/SarmaDP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/topc/DinitzH15,
author = {Michael Dinitz and
Torsten Hoefler},
title = {Introduction to the Special Issue on {SPAA} 2013},
journal = {{ACM} Trans. Parallel Comput.},
volume = {2},
number = {3},
pages = {14e:1--14e:2},
year = {2015},
url = {https://doi.org/10.1145/2809923},
doi = {10.1145/2809923},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/topc/DinitzH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinitzKW15,
author = {Michael Dinitz and
Robert Krauthgamer and
Tal Wagner},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Towards Resistance Sparsifiers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {738--755},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.738},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.738},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DinitzKW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DinitzSV15,
author = {Michael Dinitz and
Michael Schapira and
Asaf Valadarsky},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Explicit Expanding Expanders},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {399--410},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_34},
doi = {10.1007/978-3-662-48350-3\_34},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/DinitzSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hotnets/ValadarskyDS15,
author = {Asaf Valadarsky and
Michael Dinitz and
Michael Schapira},
editor = {Jaudelice de Oliveira and
Jonathan Smith and
Katerina J. Argyraki and
Philip Alexander Levis},
title = {Xpander: Unveiling the Secrets of High-Performance Datacenters},
booktitle = {Proceedings of the 14th {ACM} Workshop on Hot Topics in Networks,
Philadelphia, PA, USA, November 16 - 17, 2015},
pages = {16:1--16:7},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2834050.2834059},
doi = {10.1145/2834050.2834059},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/hotnets/ValadarskyDS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DinitzFGN15,
author = {Michael Dinitz and
Jeremy T. Fineman and
Seth Gilbert and
Calvin C. Newport},
editor = {Yoram Moses},
title = {Smoothed Analysis of Dynamic Networks},
booktitle = {Distributed Computing - 29th International Symposium, {DISC} 2015,
Tokyo, Japan, October 7-9, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9363},
pages = {513--527},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48653-5\_34},
doi = {10.1007/978-3-662-48653-5\_34},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wdag/DinitzFGN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinitzKW15,
author = {Michael Dinitz and
Robert Krauthgamer and
Tal Wagner},
title = {Towards Resistance Sparsifiers},
journal = {CoRR},
volume = {abs/1506.07568},
year = {2015},
url = {http://arxiv.org/abs/1506.07568},
eprinttype = {arXiv},
eprint = {1506.07568},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DinitzKW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinitzSV15,
author = {Michael Dinitz and
Michael Schapira and
Asaf Valadarsky},
title = {Explicit Expanding Expanders},
journal = {CoRR},
volume = {abs/1507.01196},
year = {2015},
url = {http://arxiv.org/abs/1507.01196},
eprinttype = {arXiv},
eprint = {1507.01196},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DinitzSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinitzFGN15,
author = {Michael Dinitz and
Jeremy T. Fineman and
Seth Gilbert and
Calvin Newport},
title = {Smoothed Analysis of Dynamic Networks},
journal = {CoRR},
volume = {abs/1508.03579},
year = {2015},
url = {http://arxiv.org/abs/1508.03579},
eprinttype = {arXiv},
eprint = {1508.03579},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DinitzFGN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DinitzK14,
author = {Michael Dinitz and
Guy Kortsarz},
title = {Matroid Secretary for Regular and Decomposable Matroids},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {5},
pages = {1807--1830},
year = {2014},
url = {https://doi.org/10.1137/13094030X},
doi = {10.1137/13094030X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DinitzK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChlamtacD14,
author = {Eden Chlamt{\'{a}}c and
Michael Dinitz},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Lowest Degree k-Spanner: Approximation and Hardness},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {80--95},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.80},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.80},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChlamtacD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinitzKN14,
author = {Michael Dinitz and
Guy Kortsarz and
Zeev Nutov},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Improved Approximation Algorithm for Steiner k-Forest with Nearly
Uniform Weights},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {115--127},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.115},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.115},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DinitzKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Dinitz13,
author = {Michael Dinitz},
title = {Recent advances on the matroid secretary problem},
journal = {{SIGACT} News},
volume = {44},
number = {2},
pages = {126--142},
year = {2013},
url = {https://doi.org/10.1145/2491533.2491557},
doi = {10.1145/2491533.2491557},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Dinitz13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/DinitzG13,
author = {Michael Dinitz and
Anupam Gupta},
editor = {Michel X. Goemans and
Jos{\'{e}} Correa},
title = {Packing Interdiction and Partial Covering Problems},
booktitle = {Integer Programming and Combinatorial Optimization - 16th International
Conference, {IPCO} 2013, Valpara{\'{\i}}so, Chile, March 18-20,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7801},
pages = {157--168},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36694-9\_14},
doi = {10.1007/978-3-642-36694-9\_14},
timestamp = {Wed, 03 Apr 2024 19:56:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/DinitzG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DinitzK13,
author = {Michael Dinitz and
Guy Kortsarz},
editor = {Sanjeev Khanna},
title = {Matroid Secretary for Regular and Decomposable Matroids},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {108--117},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.8},
doi = {10.1137/1.9781611973105.8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DinitzK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DinitzP13,
author = {Michael Dinitz and
Merav Parter},
editor = {Yehuda Afek},
title = {Braess's Paradox in Wireless Networks: The Danger of Improved Technology},
booktitle = {Distributed Computing - 27th International Symposium, {DISC} 2013,
Jerusalem, Israel, October 14-18, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8205},
pages = {477--491},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41527-2\_33},
doi = {10.1007/978-3-642-41527-2\_33},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DinitzP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DinitzP13,
author = {Michael Dinitz and
Merav Parter},
title = {Braess's Paradox in Wireless Networks: The Danger of Improved Technology},
journal = {CoRR},
volume = {abs/1308.0173},
year = {2013},
url = {http://arxiv.org/abs/1308.0173},
eprinttype = {arXiv},
eprint = {1308.0173},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DinitzP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DinitzW12,
author = {Michael Dinitz and
Gordon T. Wilfong},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {iBGP and Constrained Connectivity},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {122--133},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_11},
doi = {10.1007/978-3-642-32512-0\_11},
timestamp = {Sun, 04 Aug 2024 19:37:16 +0200},
biburl = {https://dblp.org/rec/conf/approx/DinitzW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChlamtacDK12,
author = {Eden Chlamtac and
Michael Dinitz and
Robert Krauthgamer},
title = {Everywhere-Sparse Spanners via Dense Subgraphs},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {758--767},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.61},
doi = {10.1109/FOCS.2012.61},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChlamtacDK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DinitzKR12,
author = {Michael Dinitz and
Guy Kortsarz and
Ran Raz},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Label Cover Instances with Large Girth and the Hardness of Approximating
Basic k-Spanner},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {290--301},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_25},
doi = {10.1007/978-3-642-31594-7\_25},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DinitzKR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/SarmaDP12,
author = {Atish Das Sarma and
Michael Dinitz and
Gopal Pandurangan},
editor = {Guy E. Blelloch and
Maurice Herlihy},
title = {Efficient computation of distance sketches in distributed networks},
booktitle = {24th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '12, Pittsburgh, PA, USA, June 25-27, 2012},
pages = {318--326},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2312005.2312060},
doi = {10.1145/2312005.2312060},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/SarmaDP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-0224,
author = {Michael Dinitz and
Guy Kortsarz and
Ran Raz},
title = {Label Cover instances with large girth and the hardness of approximating
basic k-spanner},
journal = {CoRR},
volume = {abs/1203.0224},
year = {2012},
url = {http://arxiv.org/abs/1203.0224},
eprinttype = {arXiv},
eprint = {1203.0224},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-0224.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-0144,
author = {Eden Chlamtac and
Michael Dinitz and
Robert Krauthgamer},
title = {Everywhere-Sparse Spanners via Dense Subgraphs},
journal = {CoRR},
volume = {abs/1205.0144},
year = {2012},
url = {http://arxiv.org/abs/1205.0144},
eprinttype = {arXiv},
eprint = {1205.0144},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-0144.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-5146,
author = {Michael Dinitz and
Guy Kortsarz},
title = {Matroid Secretary for Regular and Decomposable Matroids},
journal = {CoRR},
volume = {abs/1207.5146},
year = {2012},
url = {http://arxiv.org/abs/1207.5146},
eprinttype = {arXiv},
eprint = {1207.5146},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-5146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/DinitzK11,
author = {Michael Dinitz and
Robert Krauthgamer},
editor = {Cyril Gavoille and
Pierre Fraigniaud},
title = {Fault-tolerant spanners: better and simpler},
booktitle = {Proceedings of the 30th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2011, San Jose, CA, USA, June 6-8, 2011},
pages = {169--178},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993806.1993830},
doi = {10.1145/1993806.1993830},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/DinitzK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DinitzK11,
author = {Michael Dinitz and
Robert Krauthgamer},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Directed spanners via flow-based linear programs},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {323--332},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993680},
doi = {10.1145/1993636.1993680},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DinitzK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-5753,
author = {Michael Dinitz and
Robert Krauthgamer},
title = {Fault-Tolerant Spanners: Better and Simpler},
journal = {CoRR},
volume = {abs/1101.5753},
year = {2011},
url = {http://arxiv.org/abs/1101.5753},
eprinttype = {arXiv},
eprint = {1101.5753},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-5753.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-2299,
author = {Michael Dinitz and
Gordon T. Wilfong},
title = {iBGP and Constrained Connectivity},
journal = {CoRR},
volume = {abs/1107.2299},
year = {2011},
url = {http://arxiv.org/abs/1107.2299},
eprinttype = {arXiv},
eprint = {1107.2299},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-2299.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-1210,
author = {Atish Das Sarma and
Michael Dinitz and
Gopal Pandurangan},
title = {Efficient Computation of Distance Sketches in Distributed Networks},
journal = {CoRR},
volume = {abs/1112.1210},
year = {2011},
url = {http://arxiv.org/abs/1112.1210},
eprinttype = {arXiv},
eprint = {1112.1210},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-1210.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Dinitz18,
author = {Michael Dinitz},
title = {Algorithms and Models for Problems in Networking},
school = {Carnegie Mellon University, {USA}},
year = {2010},
url = {https://doi.org/10.1184/r1/6714641.v1},
doi = {10.1184/R1/6714641.V1},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Dinitz18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/DinitzGST10,
author = {Michael Dinitz and
Jonah M. Gold and
Thomas C. Sharkey and
Lorenzo Traldi},
title = {Graphical representations of clutters},
journal = {Ars Comb.},
volume = {94},
year = {2010},
timestamp = {Wed, 06 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/DinitzGST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/Dinitz10,
author = {Michael Dinitz},
title = {Distributed Algorithms for Approximating Wireless Network Capacity},
booktitle = {{INFOCOM} 2010. 29th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
15-19 March 2010, San Diego, CA, {USA}},
pages = {1397--1405},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/INFCOM.2010.5461905},
doi = {10.1109/INFCOM.2010.5461905},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/infocom/Dinitz10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-3701,
author = {Michael Dinitz and
Robert Krauthgamer},
title = {Directed Spanners via Flow-Based Linear Programs},
journal = {CoRR},
volume = {abs/1011.3701},
year = {2010},
url = {http://arxiv.org/abs/1011.3701},
eprinttype = {arXiv},
eprint = {1011.3701},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-3701.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/AndrewsD09,
author = {Matthew Andrews and
Michael Dinitz},
title = {Maximizing Capacity in Arbitrary Wireless Networks in the {SINR} Model:
Complexity and Game Theory},
booktitle = {{INFOCOM} 2009. 28th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
19-25 April 2009, Rio de Janeiro, Brazil},
pages = {1332--1340},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/INFCOM.2009.5062048},
doi = {10.1109/INFCOM.2009.5062048},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/infocom/AndrewsD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Dinitz09,
author = {Michael Dinitz},
editor = {Srikanta Tirthapura and
Lorenzo Alvisi},
title = {Brief announcement: distributed algorithms for approximating wireless
network capacity},
booktitle = {Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009},
pages = {328--329},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1582716.1582792},
doi = {10.1145/1582716.1582792},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/Dinitz09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BabaioffDGIT09,
author = {Moshe Babaioff and
Michael Dinitz and
Anupam Gupta and
Nicole Immorlica and
Kunal Talwar},
editor = {Claire Mathieu},
title = {Secretary problems: weights and discounts},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {1245--1254},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.135},
doi = {10.1137/1.9781611973068.135},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BabaioffDGIT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Dinitz08,
author = {Michael Dinitz},
editor = {Rida A. Bazzi and
Boaz Patt{-}Shamir},
title = {Online and dynamic embeddings of approximate ultrametrics},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2008, Toronto, Canada, August 18-21,
2008},
pages = {416},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1400751.1400807},
doi = {10.1145/1400751.1400807},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/Dinitz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Dinitz08,
author = {Michael Dinitz},
editor = {Gadi Taubenfeld},
title = {Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics},
booktitle = {Distributed Computing, 22nd International Symposium, {DISC} 2008,
Arcachon, France, September 22-24, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5218},
pages = {152--166},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87779-0\_11},
doi = {10.1007/978-3-540-87779-0\_11},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/Dinitz08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Dinitz07,
author = {Michael Dinitz},
editor = {Indranil Gupta and
Roger Wattenhofer},
title = {Compact routing with slack},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August
12-15, 2007},
pages = {81--88},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1281100.1281114},
doi = {10.1145/1281100.1281114},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/Dinitz07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Dinitz06,
author = {Michael Dinitz},
title = {Full Rank Tilings of Finite Abelian Groups},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {1},
pages = {160--170},
year = {2006},
url = {https://doi.org/10.1137/S0895480104445794},
doi = {10.1137/S0895480104445794},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Dinitz06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChanDG06,
author = {T.{-}H. Hubert Chan and
Michael Dinitz and
Anupam Gupta},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Spanners with Slack},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {196--207},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_20},
doi = {10.1007/11841036\_20},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChanDG06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-18 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
