[{"citation":{"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.","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.","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>.","short":"C. Scheideler, J. Dou, T. Götte, H. Hillebrandt, J. Werthmann, in: ITCS 2025: 45:1-45:26, 2025.","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} }","mla":"Scheideler, Christian, et al. <i>Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. </i>. 2025."},"place":"ITCS 2025: 45:1-45:26","year":"2025","title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. ","author":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Jinfeng","last_name":"Dou","id":"92888","full_name":"Dou, Jinfeng"},{"full_name":"Götte, Thorsten ","last_name":"Götte","first_name":"Thorsten "},{"id":"74425","full_name":"Hillebrandt, Henning","last_name":"Hillebrandt","first_name":"Henning"},{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"}],"date_created":"2026-02-10T09:10:14Z","date_updated":"2026-02-11T09:11:29Z","status":"public","type":"conference","language":[{"iso":"eng"}],"user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"64096"},{"status":"public","type":"conference","language":[{"iso":"eng"}],"user_id":"15578","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"_id":"64095","citation":{"apa":"Scheideler, C., Augustine , J., &#38; Werthmann, J. (2025). <i>Supervised Distributed Computing. </i>.","short":"C. Scheideler, J. Augustine , J. Werthmann, in: Euro-Par (3) 2025: 48-62, 2025.","bibtex":"@inproceedings{Scheideler_Augustine _Werthmann_2025, place={Euro-Par (3) 2025: 48-62}, title={Supervised Distributed Computing. }, author={Scheideler, Christian and Augustine , John  and Werthmann, Julian}, year={2025} }","mla":"Scheideler, Christian, et al. <i>Supervised Distributed Computing. </i>. 2025.","ieee":"C. Scheideler, J. Augustine , and J. Werthmann, “Supervised Distributed Computing. ,” 2025.","chicago":"Scheideler, Christian, John  Augustine , and Julian Werthmann. “Supervised Distributed Computing. .” Euro-Par (3) 2025: 48-62, 2025.","ama":"Scheideler C, Augustine  J, Werthmann J. Supervised Distributed Computing. . In: ; 2025."},"place":"Euro-Par (3) 2025: 48-62","year":"2025","title":"Supervised Distributed Computing. ","date_created":"2026-02-10T09:04:56Z","author":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"first_name":"John ","last_name":"Augustine ","full_name":"Augustine , John "},{"first_name":"Julian","id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann"}],"date_updated":"2026-02-11T09:11:35Z"},{"_id":"61184","user_id":"50024","language":[{"iso":"eng"}],"type":"conference","publication":"Lecture Notes in Computer Science","status":"public","date_updated":"2025-09-11T08:33:27Z","publisher":"Springer Nature Switzerland","date_created":"2025-09-11T08:30:57Z","author":[{"first_name":"John","full_name":"Augustine, John","last_name":"Augustine"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian","first_name":"Julian"}],"title":"Supervised Distributed Computing","doi":"10.1007/978-3-031-99872-0_4","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031998713","9783031998720"]},"place":"Cham","year":"2025","citation":{"ama":"Augustine J, Scheideler C, Werthmann J. Supervised Distributed Computing. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">10.1007/978-3-031-99872-0_4</a>","ieee":"J. Augustine, C. Scheideler, and J. Werthmann, “Supervised Distributed Computing,” 2025, doi: <a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">10.1007/978-3-031-99872-0_4</a>.","chicago":"Augustine, John, Christian Scheideler, and Julian Werthmann. “Supervised Distributed Computing.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">https://doi.org/10.1007/978-3-031-99872-0_4</a>.","bibtex":"@inproceedings{Augustine_Scheideler_Werthmann_2025, place={Cham}, title={Supervised Distributed Computing}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">10.1007/978-3-031-99872-0_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Augustine, John and Scheideler, Christian and Werthmann, Julian}, year={2025} }","short":"J. Augustine, C. Scheideler, J. Werthmann, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","mla":"Augustine, John, et al. “Supervised Distributed Computing.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">10.1007/978-3-031-99872-0_4</a>.","apa":"Augustine, J., Scheideler, C., &#38; Werthmann, J. (2025). Supervised Distributed Computing. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-031-99872-0_4\">https://doi.org/10.1007/978-3-031-99872-0_4</a>"}},{"volume":325,"author":[{"first_name":"Jinfeng","last_name":"Dou","id":"92888","full_name":"Dou, Jinfeng"},{"last_name":"Götte","id":"34727","full_name":"Götte, Thorsten","first_name":"Thorsten"},{"full_name":"Hillebrandt, Henning","id":"74425","last_name":"Hillebrandt","first_name":"Henning"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Julian","last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian"}],"date_created":"2025-04-02T14:09:19Z","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_updated":"2025-10-15T12:57:11Z","doi":"10.4230/LIPIcs.ITCS.2025.45","title":"Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs","publication_identifier":{"isbn":["978-3-95977-361-4"],"issn":["1868-8969"]},"intvolume":"       325","page":"45:1–45:26","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>.","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.","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)} }","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>","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>","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>."},"year":"2025","place":"Dagstuhl, Germany","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"34727","_id":"59268","language":[{"iso":"eng"}],"publication":"16th Innovations in Theoretical Computer Science Conference (ITCS 2025)","type":"conference","status":"public","editor":[{"first_name":"Raghu","last_name":"Meka","full_name":"Meka, Raghu"}]},{"status":"public","publication":"Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)","type":"journal_article","language":[{"iso":"eng"}],"_id":"64101","department":[{"_id":"34"},{"_id":"7"},{"_id":"79"}],"user_id":"15578","year":"2024","citation":{"chicago":"Scheideler, Christian, Sam  Coy, Arthur  Czumaj, Philipp  Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks. .” <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.","ieee":"C. Scheideler, S. Coy, A. Czumaj, P. Schneider, and J. Werthmann, “Routing schemes for hybrid communication networks. ,” <i>Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.","ama":"Scheideler C, Coy S, Czumaj A, Schneider P, Werthmann J. Routing schemes for hybrid communication networks. . <i>Routing schemes for hybrid communication networks Theor Comput Sci 985: 114352 (2024)</i>. Published online 2024.","apa":"Scheideler, C., Coy, S., Czumaj, A., Schneider, P., &#38; Werthmann, J. (2024). Routing schemes for hybrid communication networks. . <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>.","mla":"Scheideler, Christian, et al. “Routing Schemes for Hybrid Communication Networks. .” <i>Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024)</i>, 2024.","short":"C. Scheideler, S. Coy, A. Czumaj, P. Schneider, J. Werthmann, Routing Schemes for Hybrid Communication Networks. Theor. Comput. Sci. 985: 114352 (2024) (2024).","bibtex":"@article{Scheideler_Coy_Czumaj_Schneider_Werthmann_2024, title={Routing schemes for hybrid communication networks. }, journal={Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)}, author={Scheideler, Christian and Coy, Sam  and Czumaj, Arthur  and Schneider, Philipp  and Werthmann, Julian}, year={2024} }"},"title":"Routing schemes for hybrid communication networks. ","date_updated":"2026-02-11T09:12:57Z","date_created":"2026-02-10T10:00:43Z","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Coy, Sam ","last_name":"Coy","first_name":"Sam "},{"first_name":"Arthur ","full_name":"Czumaj, Arthur ","last_name":"Czumaj"},{"full_name":"Schneider, Philipp ","last_name":"Schneider","first_name":"Philipp "},{"last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024","first_name":"Julian"}]},{"language":[{"iso":"eng"}],"article_number":"114352","user_id":"50024","department":[{"_id":"79"}],"project":[{"_id":"5","name":"SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen"}],"_id":"61172","status":"public","type":"journal_article","publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2023.114352","title":"Routing Schemes for Hybrid Communication Networks","author":[{"full_name":"Coy, Sam","last_name":"Coy","first_name":"Sam"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Schneider","full_name":"Schneider, Philipp","first_name":"Philipp"},{"first_name":"Julian","last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian"}],"date_created":"2025-09-10T14:26:11Z","volume":985,"publisher":"Elsevier BV","date_updated":"2025-09-10T14:52:21Z","citation":{"chicago":"Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian Werthmann. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i> 985 (2024). <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>.","ieee":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing Schemes for Hybrid Communication Networks,” <i>Theoretical Computer Science</i>, vol. 985, Art. no. 114352, 2024, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","ama":"Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>. 2024;985. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>","short":"S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical Computer Science 985 (2024).","bibtex":"@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing Schemes for Hybrid Communication Networks}, volume={985}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>}, number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}, year={2024} }","mla":"Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical Computer Science</i>, vol. 985, 114352, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">10.1016/j.tcs.2023.114352</a>.","apa":"Coy, S., Czumaj, A., Scheideler, C., Schneider, P., &#38; Werthmann, J. (2024). Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>, <i>985</i>, Article 114352. <a href=\"https://doi.org/10.1016/j.tcs.2023.114352\">https://doi.org/10.1016/j.tcs.2023.114352</a>"},"intvolume":"       985","year":"2024","publication_status":"published","publication_identifier":{"issn":["0304-3975"]}},{"type":"journal_article","publication":"Theor. Comput. Sci.","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"43109","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"year":"2023","citation":{"bibtex":"@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message and Energy Efficient Set Cover}, volume={950}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>}, journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }","mla":"Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i>, vol. 950, 2023, p. 113756, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>.","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023) 113756.","apa":"Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor. Comput. Sci.</i>, <i>950</i>, 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-and-Sleep: Message and Energy Efficient Set Cover. <i>Theor Comput Sci</i>. 2023;950:113756. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,” <i>Theor. Comput. Sci.</i>, vol. 950, p. 113756, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">10.1016/j.tcs.2023.113756</a>.","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-and-Sleep: Message and Energy Efficient Set Cover.” <i>Theor. Comput. Sci.</i> 950 (2023): 113756. <a href=\"https://doi.org/10.1016/j.tcs.2023.113756\">https://doi.org/10.1016/j.tcs.2023.113756</a>."},"page":"113756","intvolume":"       950","date_updated":"2023-03-27T09:55:04Z","date_created":"2023-03-27T07:45:44Z","author":[{"first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten","id":"34727"},{"full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"id":"50024","full_name":"Werthmann, Julian","last_name":"Werthmann","first_name":"Julian"}],"volume":950,"title":"Beep-and-Sleep: Message and Energy Efficient Set Cover","doi":"10.1016/j.tcs.2023.113756"},{"date_updated":"2023-05-22T09:37:25Z","date_created":"2023-05-22T09:17:50Z","author":[{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Sam","full_name":"Coy, Sam","last_name":"Coy"},{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Philipp","full_name":"Schneider, Philipp","last_name":"Schneider"}],"title":"Routing Schemes for Hybrid Communication Networks","doi":"10.48550/ARXIV.2210.05333","year":"2023","citation":{"ama":"Werthmann J, Scheideler C, Coy S, Czumaj A, Schneider P. Routing Schemes for Hybrid Communication Networks. In: ; 2023. doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>","ieee":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,” 2023, doi: <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>.","chicago":"Werthmann, Julian, Christian Scheideler, Sam Coy, Artur Czumaj, and Philipp Schneider. “Routing Schemes for Hybrid Communication Networks,” 2023. <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">https://doi.org/10.48550/ARXIV.2210.05333</a>.","apa":"Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., &#38; Schneider, P. (2023). <i>Routing Schemes for Hybrid Communication Networks</i>. <a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">https://doi.org/10.48550/ARXIV.2210.05333</a>","mla":"Werthmann, Julian, et al. <i>Routing Schemes for Hybrid Communication Networks</i>. 2023, doi:<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>.","short":"J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, P. Schneider, in: 2023.","bibtex":"@inproceedings{Werthmann_Scheideler_Coy_Czumaj_Schneider_2023, title={Routing Schemes for Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2210.05333\">10.48550/ARXIV.2210.05333</a>}, author={Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}, year={2023} }"},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"45188","user_id":"50024","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"conference","status":"public"},{"citation":{"apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (2023). Time-Optimal Construction of Overlays. <i>Distributed Computing</i>. <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>","bibtex":"@article{Götte_Hinnenthal_Scheideler_Werthmann_2023, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>}, journal={Distributed Computing}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, year={2023} }","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Distributed Computing</i>, 2023, doi:<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023).","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. <i>Distributed Computing</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” <i>Distributed Computing</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” <i>Distributed Computing</i>, 2023. <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>."},"year":"2023","doi":"https://doi.org/10.1007/s00446-023-00442-4","title":"Time-Optimal Construction of Overlays","date_created":"2023-05-22T14:34:34Z","author":[{"id":"34727","full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten"},{"last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Werthmann, Julian","id":"50024","last_name":"Werthmann","first_name":"Julian"}],"date_updated":"2023-05-23T12:38:57Z","status":"public","type":"journal_article","publication":"Distributed Computing","language":[{"iso":"eng"}],"user_id":"477","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"45192"},{"ddc":["004"],"language":[{"iso":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":543715,"access_level":"open_access","file_name":"A1-Chapter-SFB-Buch-Final.pdf","file_id":"45876","date_updated":"2023-07-07T06:20:43Z","date_created":"2023-07-07T06:20:43Z","creator":"ups"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","title":"Capabilities and Limitations of Local Strategies in Dynamic Networks","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T06:21:38Z","year":"2023","file_date_updated":"2023-07-07T06:20:43Z","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","grant_number":"160364472"}],"_id":"45875","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","department":[{"_id":"7"}],"editor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"status":"public","type":"book_chapter","doi":"10.5281/zenodo.8060372","oa":"1","date_updated":"2023-07-07T06:21:57Z","author":[{"first_name":"Thorsten","last_name":"Götte","full_name":"Götte, Thorsten","id":"34727"},{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Julian","full_name":"Werthmann, Julian","id":"50024","last_name":"Werthmann"}],"volume":412,"place":"Paderborn","citation":{"ama":"Götte T, Knollmann T, Meyer auf der Heide F, Scheideler C, Werthmann J. Capabilities and Limitations of Local Strategies in Dynamic Networks. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:1--20. doi:<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>","ieee":"T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann, “Capabilities and Limitations of Local Strategies in Dynamic Networks,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20.","chicago":"Götte, Thorsten, Till Knollmann, Friedhelm Meyer auf der Heide, Christian Scheideler, and Julian Werthmann. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:1--20. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8060372\">https://doi.org/10.5281/zenodo.8060372</a>.","mla":"Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in Dynamic Networks.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20, doi:<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>.","short":"T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.","bibtex":"@inbook{Götte_Knollmann_Meyer auf der Heide_Scheideler_Werthmann_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Capabilities and Limitations of Local Strategies in Dynamic Networks}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8060372\">10.5281/zenodo.8060372</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Werthmann, Julian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={1--20}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","apa":"Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., &#38; Werthmann, J. (2023). Capabilities and Limitations of Local Strategies in Dynamic Networks. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8060372\">https://doi.org/10.5281/zenodo.8060372</a>"},"page":"1--20","intvolume":"       412","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"user_id":"34727","_id":"45193","project":[{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"},{"name":"SFB 901: SFB 901","_id":"1"}],"status":"public","publication":"Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23)","type":"conference","conference":{"location":"Orlando, USA","end_date":"2023-06-25","start_date":"2023-06-19","name":"ACM Symposium on Principles of Distributed Computing (PODC)"},"title":"Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs","author":[{"first_name":"Jinfeng","id":"92888","full_name":"Dou, Jinfeng","last_name":"Dou"},{"first_name":"Thorsten","last_name":"Götte","id":"34727","full_name":"Götte, Thorsten"},{"last_name":"Hillebrandt","full_name":"Hillebrandt, Henning","id":"74425","first_name":"Henning"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian","first_name":"Julian"}],"date_created":"2023-05-22T14:42:31Z","date_updated":"2025-10-15T12:57:48Z","citation":{"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.","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.","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.","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} }"},"year":"2023"},{"date_updated":"2022-01-06T06:54:44Z","author":[{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"}],"date_created":"2021-01-26T13:58:14Z","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"title":"Derandomization and Local Graph Problems in the Node-Capacitated Clique","year":"2021","citation":{"ama":"Werthmann J. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>.; 2021.","chicago":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>, 2021.","ieee":"J. Werthmann, <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021.","mla":"Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>. 2021.","bibtex":"@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }","short":"J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.","apa":"Werthmann, J. (2021). <i>Derandomization and Local Graph Problems in the Node-Capacitated Clique</i>."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"21084","user_id":"15504","department":[{"_id":"79"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"title":"Time-Optimal Construction of Overlays","publisher":"ACM","date_created":"2021-06-06T19:10:26Z","year":"2021","ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"    We show how to construct an overlay network of constant degree and diameter $O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected graph.\r\n    We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.\r\n    If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\\log n)$ messages in each round in time $O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].\r\n    Since the problem cannot be solved faster than by using pointer jumping for $O(\\log n)$ rounds (which would even require each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n    We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].\r\n    \r\n    Additionally, we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid networks} [Augustine et al., SODA'20].\r\n    Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.\r\n    For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\\log n)$, w.h.p.\r\n    Furthermore, we show how to compute an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial degree of $G$."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2021-06-06T19:12:49Z","date_created":"2021-06-06T19:12:49Z","creator":"thgoette","file_size":590875,"access_level":"closed","file_id":"22284","file_name":"Wicked_Fast_Overlay_Construction(1).pdf"}],"publication":"Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)","conference":{"end_date":"2021-07-30","location":"Virtual","name":"ACM Symposium on Principles of Distributed Computing (PODC)","start_date":"2021-07-26"},"doi":"10.1145/3465084.3467932","date_updated":"2022-01-06T06:55:30Z","author":[{"first_name":"Thorsten","last_name":"Götte","id":"34727","full_name":"Götte, Thorsten"},{"first_name":"Kristian","id":"32229","full_name":"Hinnenthal, Kristian","last_name":"Hinnenthal"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Julian","last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024"}],"place":"New York","citation":{"ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>","chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel. New York: ACM, n.d. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>.","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, Virtual.","apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>. New York: ACM. <a href=\"https://doi.org/10.1145/3465084.3467932\">https://doi.org/10.1145/3465084.3467932</a>","bibtex":"@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>}, booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor} }","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)</i>, edited by Keren Censor-Hillel, ACM, doi:<a href=\"https://doi.org/10.1145/3465084.3467932\">10.1145/3465084.3467932</a>.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d."},"has_accepted_license":"1","publication_status":"accepted","file_date_updated":"2021-06-06T19:12:49Z","_id":"22283","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"34"}],"user_id":"477","editor":[{"full_name":"Censor-Hillel, Keren","last_name":"Censor-Hillel","first_name":"Keren"}],"status":"public","type":"conference"},{"language":[{"iso":"eng"}],"user_id":"477","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901: SFB 901","_id":"1"}],"_id":"26888","status":"public","type":"book_chapter","publication":"Algorithms for Sensor Systems (ALGOSENSORS '21)","doi":"10.1007/978-3-030-89240-1_7","conference":{"name":"ALGOSENSORS 2021","location":"Lisbon, Portgual"},"title":"Beep-And-Sleep: Message and Energy Efficient Set Cover","date_created":"2021-10-26T12:06:04Z","author":[{"first_name":"Thorsten","full_name":"Götte, Thorsten","id":"34727","last_name":"Götte"},{"first_name":"Christina","last_name":"Kolb","full_name":"Kolb, Christina","id":"43647"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Werthmann","id":"50024","full_name":"Werthmann, Julian","first_name":"Julian"}],"date_updated":"2022-11-18T10:01:36Z","citation":{"chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” In <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">https://doi.org/10.1007/978-3-030-89240-1_7</a>.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>, Cham, 2021.","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy Efficient Set Cover. In: <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.","bibtex":"@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep: Message and Energy Efficient Set Cover}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>}, booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021} }","mla":"Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">10.1007/978-3-030-89240-1_7</a>.","apa":"Götte, T., Kolb, C., Scheideler, C., &#38; Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In <i>Algorithms for Sensor Systems (ALGOSENSORS ’21)</i>. ALGOSENSORS 2021, Lisbon, Portgual. <a href=\"https://doi.org/10.1007/978-3-030-89240-1_7\">https://doi.org/10.1007/978-3-030-89240-1_7</a>"},"year":"2021","place":"Cham","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]}}]