[{"publication":"Lecture Notes in Computer Science","citation":{"mla":"Dou, Jinfeng, et al. “Fast Distributed Computation of Compact Routing Schemes.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2026, doi:<a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">10.1007/978-3-032-26465-7_19</a>.","ama":"Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Fast Distributed Computation of Compact Routing Schemes. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2026. doi:<a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">10.1007/978-3-032-26465-7_19</a>","bibtex":"@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2026, place={Cham}, title={Fast Distributed Computation of Compact Routing Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">10.1007/978-3-032-26465-7_19</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}, year={2026} }","apa":"Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., &#38; Werthmann, J. (2026). Fast Distributed Computation of Compact Routing Schemes. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">https://doi.org/10.1007/978-3-032-26465-7_19</a>","ieee":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Fast Distributed Computation of Compact Routing Schemes,” 2026, doi: <a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">10.1007/978-3-032-26465-7_19</a>.","chicago":"Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler, and Julian Werthmann. “Fast Distributed Computation of Compact Routing Schemes.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2026. <a href=\"https://doi.org/10.1007/978-3-032-26465-7_19\">https://doi.org/10.1007/978-3-032-26465-7_19</a>.","short":"J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2026."},"type":"conference","department":[{"_id":"79"}],"place":"Cham","date_created":"2026-07-27T14:00:42Z","date_updated":"2026-07-27T14:40:21Z","publication_status":"published","year":"2026","status":"public","title":"Fast Distributed Computation of Compact Routing Schemes","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783032264640","9783032264657"]},"author":[{"full_name":"Dou, Jinfeng","first_name":"Jinfeng","last_name":"Dou","id":"92888"},{"last_name":"Götte","first_name":"Thorsten","full_name":"Götte, Thorsten","id":"34727"},{"last_name":"Hillebrandt","first_name":"Henning","full_name":"Hillebrandt, Henning","id":"74425"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"id":"50024","last_name":"Werthmann","first_name":"Julian","full_name":"Werthmann, Julian"}],"doi":"10.1007/978-3-032-26465-7_19","user_id":"74425","_id":"66603","publisher":"Springer Nature Switzerland","language":[{"iso":"eng"}]},{"type":"conference","department":[{"_id":"79"}],"date_created":"2026-07-27T13:56:01Z","publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","citation":{"mla":"Augustine, John, et al. “Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers.” <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, ACM, 2026, doi:<a href=\"https://doi.org/10.1145/3796701.3815939\">10.1145/3796701.3815939</a>.","ama":"Augustine J, Hillebrandt H, Kumar M, Scheideler C, Werthmann J. Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers. In: <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. ACM; 2026. doi:<a href=\"https://doi.org/10.1145/3796701.3815939\">10.1145/3796701.3815939</a>","bibtex":"@inproceedings{Augustine_Hillebrandt_Kumar_Scheideler_Werthmann_2026, title={Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers}, DOI={<a href=\"https://doi.org/10.1145/3796701.3815939\">10.1145/3796701.3815939</a>}, booktitle={Proceedings of the ACM Symposium on Principles of Distributed Computing}, publisher={ACM}, author={Augustine, John and Hillebrandt, Henning and Kumar, Manish and Scheideler, Christian and Werthmann, Julian}, year={2026} }","apa":"Augustine, J., Hillebrandt, H., Kumar, M., Scheideler, C., &#38; Werthmann, J. (2026). Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers. <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. <a href=\"https://doi.org/10.1145/3796701.3815939\">https://doi.org/10.1145/3796701.3815939</a>","ieee":"J. Augustine, H. Hillebrandt, M. Kumar, C. Scheideler, and J. Werthmann, “Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers,” 2026, doi: <a href=\"https://doi.org/10.1145/3796701.3815939\">10.1145/3796701.3815939</a>.","short":"J. Augustine, H. Hillebrandt, M. Kumar, C. Scheideler, J. Werthmann, in: Proceedings of the ACM Symposium on Principles of Distributed Computing, ACM, 2026.","chicago":"Augustine, John, Henning Hillebrandt, Manish Kumar, Christian Scheideler, and Julian Werthmann. “Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers.” In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. ACM, 2026. <a href=\"https://doi.org/10.1145/3796701.3815939\">https://doi.org/10.1145/3796701.3815939</a>."},"user_id":"74425","doi":"10.1145/3796701.3815939","_id":"66602","publisher":"ACM","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2026-07-27T14:39:53Z","status":"public","title":"Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers","year":"2026","author":[{"full_name":"Augustine, John","first_name":"John","last_name":"Augustine"},{"id":"74425","full_name":"Hillebrandt, Henning","last_name":"Hillebrandt","first_name":"Henning"},{"first_name":"Manish","last_name":"Kumar","full_name":"Kumar, Manish"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"50024","first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian"}]},{"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ITCS.2025.45","title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs","year":"2025","author":[{"id":"92888","full_name":"Dou, Jinfeng","last_name":"Dou","first_name":"Jinfeng"},{"first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten","id":"34727"},{"id":"74425","full_name":"Hillebrandt, Henning","first_name":"Henning","last_name":"Hillebrandt"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-361-4"]},"date_updated":"2025-10-15T12:57:11Z","intvolume":"       325","date_created":"2025-04-02T14:09:19Z","type":"conference","publication":"16th Innovations in Theoretical Computer Science Conference (ITCS 2025)","page":"45:1–45:26","_id":"59268","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","user_id":"34727","editor":[{"full_name":"Meka, Raghu","last_name":"Meka","first_name":"Raghu"}],"volume":325,"status":"public","place":"Dagstuhl, Germany","citation":{"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>.","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>","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.","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>.","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)} }","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>"}},{"publication":"Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23)","citation":{"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.","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.","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.","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.","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} }","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.","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."},"project":[{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"},{"_id":"1","name":"SFB 901: SFB 901"}],"date_created":"2023-05-22T14:42:31Z","type":"conference","status":"public","year":"2023","title":"Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs","conference":{"start_date":"2023-06-19","name":"ACM Symposium on Principles of Distributed Computing (PODC)","location":"Orlando, USA","end_date":"2023-06-25"},"author":[{"full_name":"Dou, Jinfeng","first_name":"Jinfeng","last_name":"Dou","id":"92888"},{"id":"34727","last_name":"Götte","first_name":"Thorsten","full_name":"Götte, Thorsten"},{"full_name":"Hillebrandt, Henning","last_name":"Hillebrandt","first_name":"Henning","id":"74425"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"id":"50024","first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian"}],"date_updated":"2025-10-15T12:57:48Z","_id":"45193","language":[{"iso":"eng"}],"user_id":"34727"}]