[{"year":"2025","place":"ITCS 2025: 45:1-45:26","citation":{"apa":"Scheideler, C., Dou, J., Götte, T., Hillebrandt, H., &#38; Werthmann, J. (2025). <i>Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. </i>.","bibtex":"@inproceedings{Scheideler_Dou_Götte_Hillebrandt_Werthmann_2025, place={ITCS 2025: 45:1-45:26}, title={Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. }, author={Scheideler, Christian and Dou, Jinfeng and Götte, Thorsten  and Hillebrandt, Henning and Werthmann, Julian}, year={2025} }","short":"C. Scheideler, J. Dou, T. Götte, H. Hillebrandt, J. Werthmann, in: ITCS 2025: 45:1-45:26, 2025.","mla":"Scheideler, Christian, et al. <i>Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. </i>. 2025.","ama":"Scheideler C, Dou J, Götte T, Hillebrandt H, Werthmann J. Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. . In: ; 2025.","ieee":"C. Scheideler, J. Dou, T. Götte, H. Hillebrandt, and J. Werthmann, “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. ,” 2025.","chicago":"Scheideler, Christian, Jinfeng Dou, Thorsten  Götte, Henning Hillebrandt, and Julian Werthmann. “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. .” ITCS 2025: 45:1-45:26, 2025."},"title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. ","date_updated":"2026-02-11T09:11:29Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Jinfeng","last_name":"Dou","full_name":"Dou, Jinfeng","id":"92888"},{"first_name":"Thorsten ","last_name":"Götte","full_name":"Götte, Thorsten "},{"first_name":"Henning","id":"74425","full_name":"Hillebrandt, Henning","last_name":"Hillebrandt"},{"first_name":"Julian","last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian"}],"date_created":"2026-02-10T09:10:14Z","status":"public","type":"conference","language":[{"iso":"eng"}],"_id":"64096","user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}]},{"status":"public","editor":[{"first_name":"Raghu","last_name":"Meka","full_name":"Meka, Raghu"}],"publication":"16th Innovations in Theoretical Computer Science Conference (ITCS 2025)","type":"conference","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"34727","_id":"59268","page":"45:1–45:26","intvolume":"       325","citation":{"mla":"Dou, Jinfeng, et al. “Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs.” <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i>, edited by Raghu Meka, vol. 325, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025, p. 45:1–45:26, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">10.4230/LIPIcs.ITCS.2025.45</a>.","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={<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">10.4230/LIPIcs.ITCS.2025.45</a>}, 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.","apa":"Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., &#38; Werthmann, J. (2025). Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. In R. Meka (Ed.), <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i> (Vol. 325, p. 45:1–45:26). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">https://doi.org/10.4230/LIPIcs.ITCS.2025.45</a>","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 <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i>, 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. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">https://doi.org/10.4230/LIPIcs.ITCS.2025.45</a>.","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 <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i>, 2025, vol. 325, p. 45:1–45:26, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">10.4230/LIPIcs.ITCS.2025.45</a>.","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. <i>16th Innovations in Theoretical Computer Science Conference (ITCS 2025)</i>. Vol 325. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2025:45:1–45:26. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.45\">10.4230/LIPIcs.ITCS.2025.45</a>"},"place":"Dagstuhl, Germany","year":"2025","publication_identifier":{"isbn":["978-3-95977-361-4"],"issn":["1868-8969"]},"doi":"10.4230/LIPIcs.ITCS.2025.45","title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs","volume":325,"date_created":"2025-04-02T14:09:19Z","author":[{"id":"92888","full_name":"Dou, Jinfeng","last_name":"Dou","first_name":"Jinfeng"},{"first_name":"Thorsten","id":"34727","full_name":"Götte, Thorsten","last_name":"Götte"},{"full_name":"Hillebrandt, Henning","id":"74425","last_name":"Hillebrandt","first_name":"Henning"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"}],"publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_updated":"2025-10-15T12:57:11Z"},{"language":[{"iso":"eng"}],"_id":"45193","project":[{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901: SFB 901","_id":"1"}],"user_id":"34727","status":"public","publication":"Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23)","type":"conference","title":"Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs","conference":{"name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2023-06-19","end_date":"2023-06-25","location":"Orlando, USA"},"date_updated":"2025-10-15T12:57:48Z","author":[{"first_name":"Jinfeng","full_name":"Dou, Jinfeng","id":"92888","last_name":"Dou"},{"first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten","id":"34727"},{"id":"74425","full_name":"Hillebrandt, Henning","last_name":"Hillebrandt","first_name":"Henning"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"}],"date_created":"2023-05-22T14:42:31Z","year":"2023","citation":{"apa":"Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., &#38; Werthmann, J. (2023). Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. <i>Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)</i>. ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA.","short":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.","bibtex":"@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2023, title={Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs}, booktitle={Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)}, author={Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}, year={2023} }","mla":"Dou, Jinfeng, et al. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” <i>Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)</i>, 2023.","ama":"Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. In: <i>Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)</i>. ; 2023.","ieee":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs,” presented at the ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA, 2023.","chicago":"Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann. “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.” In <i>Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23)</i>, 2023."}}]