@inproceedings{64096,
  author       = {{Scheideler, Christian and Dou, Jinfeng and Götte, Thorsten  and Hillebrandt, Henning and Werthmann, Julian}},
  title        = {{{Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. }}},
  year         = {{2025}},
}

@inproceedings{64095,
  author       = {{Scheideler, Christian and Augustine , John  and Werthmann, Julian}},
  title        = {{{Supervised Distributed Computing. }}},
  year         = {{2025}},
}

@inproceedings{61184,
  author       = {{Augustine, John and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031998713}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Supervised Distributed Computing}}},
  doi          = {{10.1007/978-3-031-99872-0_4}},
  year         = {{2025}},
}

@inproceedings{59268,
  author       = {{Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{16th Innovations in Theoretical Computer Science Conference (ITCS 2025)}},
  editor       = {{Meka, Raghu}},
  isbn         = {{978-3-95977-361-4}},
  issn         = {{1868-8969}},
  pages        = {{45:1–45:26}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs}}},
  doi          = {{10.4230/LIPIcs.ITCS.2025.45}},
  volume       = {{325}},
  year         = {{2025}},
}

@article{64101,
  author       = {{Scheideler, Christian and Coy, Sam  and Czumaj, Arthur  and Schneider, Philipp  and Werthmann, Julian}},
  journal      = {{Routing schemes for hybrid communication networks. Theor. Comput. Sci. 985: 114352 (2024)}},
  title        = {{{Routing schemes for hybrid communication networks. }}},
  year         = {{2024}},
}

@article{61172,
  author       = {{Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{Routing Schemes for Hybrid Communication Networks}}},
  doi          = {{10.1016/j.tcs.2023.114352}},
  volume       = {{985}},
  year         = {{2024}},
}

@article{43109,
  author       = {{Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}},
  journal      = {{Theor. Comput. Sci.}},
  pages        = {{113756}},
  title        = {{{Beep-and-Sleep: Message and Energy Efficient Set Cover}}},
  doi          = {{10.1016/j.tcs.2023.113756}},
  volume       = {{950}},
  year         = {{2023}},
}

@inproceedings{45188,
  author       = {{Werthmann, Julian and Scheideler, Christian and Coy, Sam and Czumaj, Artur and Schneider, Philipp}},
  title        = {{{Routing Schemes for Hybrid Communication Networks}}},
  doi          = {{10.48550/ARXIV.2210.05333}},
  year         = {{2023}},
}

@article{45192,
  author       = {{Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}},
  journal      = {{Distributed Computing}},
  title        = {{{Time-Optimal Construction of Overlays}}},
  doi          = {{https://doi.org/10.1007/s00446-023-00442-4}},
  year         = {{2023}},
}

@inbook{45875,
  author       = {{Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{1----20}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Capabilities and Limitations of Local Strategies in Dynamic Networks}}},
  doi          = {{10.5281/zenodo.8060372}},
  volume       = {{412}},
  year         = {{2023}},
}

@inproceedings{45193,
  author       = {{Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC '23)}},
  location     = {{Orlando, USA}},
  title        = {{{Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs}}},
  year         = {{2023}},
}

@misc{21084,
  author       = {{Werthmann, Julian}},
  title        = {{{Derandomization and Local Graph Problems in the Node-Capacitated Clique}}},
  year         = {{2021}},
}

@inproceedings{22283,
  abstract     = {{    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.
    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.
    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].
    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.
    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].
    
    Additionally, we show how our algorithm can be used to efficiently solve graph problems in \emph{hybrid networks} [Augustine et al., SODA'20].
    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.
    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.
    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$.}},
  author       = {{Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)}},
  editor       = {{Censor-Hillel, Keren}},
  location     = {{Virtual}},
  publisher    = {{ACM}},
  title        = {{{Time-Optimal Construction of Overlays}}},
  doi          = {{10.1145/3465084.3467932}},
  year         = {{2021}},
}

@inbook{26888,
  author       = {{Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{Algorithms for Sensor Systems (ALGOSENSORS '21)}},
  issn         = {{0302-9743}},
  location     = {{Lisbon, Portgual}},
  title        = {{{Beep-And-Sleep: Message and Energy Efficient Set Cover}}},
  doi          = {{10.1007/978-3-030-89240-1_7}},
  year         = {{2021}},
}