{"status":"public","intvolume":" 325","page":"45:1–45:26","date_created":"2025-04-02T14:09:19Z","author":[{"first_name":"Jinfeng","last_name":"Dou","full_name":"Dou, Jinfeng","id":"92888"},{"id":"34727","full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten"},{"full_name":"Hillebrandt, Henning","last_name":"Hillebrandt","first_name":"Henning"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"}],"publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","publication_identifier":{"isbn":["978-3-95977-361-4"],"issn":["1868-8969"]},"date_updated":"2025-04-02T14:10:24Z","_id":"59268","place":"Dagstuhl, Germany","type":"conference","citation":{"mla":"Dou, Jinfeng, et al. “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs.” 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), edited by Raghu Meka, vol. 325, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, p. 45:1–45:26, doi:10.4230/LIPIcs.ITCS.2025.45.","ama":"Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. In: Meka R, ed. 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Vol 325. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2025:45:1–45:26. doi:10.4230/LIPIcs.ITCS.2025.45","ieee":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs,” in 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), 2025, vol. 325, p. 45:1–45:26, doi: 10.4230/LIPIcs.ITCS.2025.45.","chicago":"Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann. “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs.” In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), edited by Raghu Meka, 325:45:1–45:26. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.45.","apa":"Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., & Werthmann, J. (2025). Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. In R. Meka (Ed.), 16th Innovations in Theoretical Computer Science Conference (ITCS 2025) (Vol. 325, p. 45:1–45:26). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.45","bibtex":"@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2025, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs}, volume={325}, DOI={10.4230/LIPIcs.ITCS.2025.45}, booktitle={16th Innovations in Theoretical Computer Science Conference (ITCS 2025)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}, editor={Meka, Raghu}, year={2025}, pages={45:1–45:26}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: R. Meka (Ed.), 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2025, p. 45:1–45:26."},"user_id":"34727","language":[{"iso":"eng"}],"editor":[{"full_name":"Meka, Raghu","last_name":"Meka","first_name":"Raghu"}],"publication":"16th Innovations in Theoretical Computer Science Conference (ITCS 2025)","doi":"10.4230/LIPIcs.ITCS.2025.45","year":"2025","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs","volume":325}