@inbook{21078,
  author       = {{Menke, Peter}},
  booktitle    = {{Kommunikationsdynamiken zwischen Mündlichkeit und Schriftlichkeit. Festschrift für Barbara Job zum 60. Geburtstag}},
  editor       = {{Kluge, Bettina and Mihatsch, Wiltrud and Schaller, Birte}},
  pages        = {{225–244}},
  publisher    = {{Narr Francke Attempto}},
  title        = {{{»ich wusste doch irgendwas war zu einfach«. Gesprächsanalytische Betrachtungen von Proberunden zum Lernen von Gesellschaftsspielen}}},
  year         = {{2020}},
}

@inproceedings{17370,
  abstract     = {{ We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \( S \) of commodities.
  Ravi and Sinha (SODA 2004) introduced the model as the \emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem.
  The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances.
  In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$.
  A request has to be connected to a set of facilities jointly offering the commodities demanded by it.
  In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each.

  To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time.
  We present results regarding the competitive ratio.
  On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \( \Omega (  \sqrt{|S|} + \frac{\log n}{\log \log n}  ) \) that already holds for simple line metrics.
  Here, \( n \) is the number of requests.
  On the other side, we establish a deterministic \( \mathcal{O}(\sqrt{|S|} \cdot \log n) \)-competitive algorithm and a randomized \( \mathcal{O}(\sqrt{|S|} \cdot \frac{\log n}{\log \log n} ) \)-competitive algorithm.
  Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function.}},
  author       = {{Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures}},
  isbn         = {{9781450369350}},
  keywords     = {{Online Multi-Commodity Facility Location, Competitive Ratio, Online Optimization, Facility Location Problem}},
  title        = {{{The Online Multi-Commodity Facility Location Problem}}},
  doi          = {{10.1145/3350755.3400281}},
  year         = {{2020}},
}

@proceedings{17836,
  editor       = {{Werneck Richa, Andrea and Scheideler, Christian}},
  isbn         = {{978-3-030-54920-6}},
  publisher    = {{Springer}},
  title        = {{{Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings}}},
  doi          = {{10.1007/978-3-030-54921-3}},
  volume       = {{12156}},
  year         = {{2020}},
}

@proceedings{17839,
  editor       = {{Scheideler, Christian and Spear, Michael}},
  isbn         = {{978-1-4503-6935-0}},
  publisher    = {{ACM}},
  title        = {{{SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020}}},
  doi          = {{10.1145/3350755}},
  year         = {{2020}},
}

@book{19051,
  editor       = {{Eke, Norbert Otto}},
  pages        = {{1054}},
  publisher    = {{Aisthesis}},
  title        = {{{Vormärz-Handbuch}}},
  year         = {{2020}},
}

@inbook{19093,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Georg Büchner und die Romantik}},
  editor       = {{Borgards, Roland and Dedner, Burghard}},
  pages        = {{13--32}},
  publisher    = {{de Gruyter}},
  title        = {{{„Romantik“ und „Vormärz“. Ein Streitfall}}},
  year         = {{2020}},
}

@inbook{19094,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Peter Weiss erinnernd – Ansichten und Einsichten}},
  editor       = {{Stillmark, Hans-Christian}},
  pages        = {{51--65}},
  publisher    = {{Weidler}},
  title        = {{{Ethische Erinnerungskultur. Peter Weiss‘ Memorial des ‚ganzen‘ Widerstands}}},
  year         = {{2020}},
}

@inbook{19095,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Vormärz-Handbuch}},
  editor       = {{Eke, Norbert Otto}},
  pages        = {{9--18}},
  publisher    = {{Aisthesis}},
  title        = {{{Vormärz – Prolegomenon einer Epochendarstellung}}},
  year         = {{2020}},
}

@inbook{19097,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Vormärz-Handbuch}},
  editor       = {{Eke, Norbert Otto}},
  pages        = {{155--164}},
  publisher    = {{Aisthesis}},
  title        = {{{Vormärz und Klassik}}},
  year         = {{2020}},
}

@inbook{19098,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Vormärz-Handbuch}},
  editor       = {{Eke, Norbert Otto}},
  pages        = {{171--178}},
  publisher    = {{Aisthesis}},
  title        = {{{Vormärz und Aufklärung}}},
  year         = {{2020}},
}

@inbook{19099,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Vormärz-Handbuch}},
  editor       = {{Eke, Norbert Otto}},
  pages        = {{289--297}},
  publisher    = {{Aisthesis}},
  title        = {{{Exil}}},
  year         = {{2020}},
}

@inbook{19101,
  author       = {{Eke, Norbert Otto}},
  booktitle    = {{Zwischen Emanzipation und Sozialdisziplinierung: Pädagogik im Vormärz}},
  editor       = {{Gather, Katharina}},
  pages        = {{231--258}},
  publisher    = {{Aisthesis}},
  title        = {{{Habitueller Antiklassizismus. Christian Dietrich Grabbe und die Kritik an Klassik und Romantik im Vormärz}}},
  year         = {{2020}},
}

@article{19103,
  author       = {{Eke, Norbert Otto}},
  journal      = {{Zeitschrift für deutsche Philologie}},
  number       = {{1}},
  pages        = {{1--3}},
  title        = {{{Nachruf: Hartmut Steinecke zum Gedenken}}},
  volume       = {{139}},
  year         = {{2020}},
}

@article{19153,
  author       = {{Eke, Norbert Otto}},
  journal      = {{German Life and Letters (Special Issue: Herta Müller and the Currents of European History)}},
  number       = {{1}},
  pages        = {{72--84}},
  title        = {{{Der ‚Eigene Kalender‘ des Erinnerns: Die Wahrheit der erfundenen Erinnerung in Herta Müllers Romanen, Erzählungen und Essays}}},
  volume       = {{73}},
  year         = {{2020}},
}

@article{23517,
  author       = {{Gräßler, Iris and Hentze, Julian}},
  issn         = {{ISSN: 2196-677X}},
  journal      = {{at-Automatisierungstechnik 68(5)}},
  number       = {{68(5)}},
  pages        = {{312--324}},
  title        = {{{The new V-Model of 2206 and its validation}}},
  year         = {{2020}},
}

@misc{23853,
  booktitle    = {{edition text + kritik }},
  editor       = {{Eke, Norbert Otto}},
  pages        = {{227 }},
  publisher    = {{Richard Boorberg Verlag }},
  title        = {{{Herta Müller. Text + Kritik 155/2020. 2. Auflage: Neufassung. Hg. von Norbert Otto Eke und Christof Hamann. }}},
  year         = {{2020}},
}

@misc{20495,
  author       = {{Jochmaring, Moritz}},
  title        = {{{A self stabilizing protocol for well-formed trees in hybrid networks}}},
  year         = {{2020}},
}

@inproceedings{20755,
  abstract     = {{We consider the problem of computing shortest paths in \emph{hybrid networks}, in which nodes can make use of different communication modes. For example, mobile phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular network to solve tasks more efficiently. Like in this case, the different communication modes may differ considerably in range, bandwidth, and flexibility. We build upon the model of Augustine et al. [SODA '20], which captures these differences by a \emph{local} and a \emph{global} mode. Specifically, the local edges model a fixed communication network in which $O(1)$ messages of size $O(\log n)$ can be sent over every edge in each synchronous round. The global edges form a clique, but nodes are only allowed to send and receive a total of at most $O(\log n)$ messages over global edges, which restricts the nodes to use these edges only very sparsely.

We demonstrate the power of hybrid networks by presenting algorithms to compute Single-Source Shortest Paths and the diameter very efficiently in \emph{sparse graphs}. Specifically, we present exact $O(\log n)$ time algorithms for cactus graphs (i.e., graphs in which each edge is contained in at most one cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges and arboricity $O(\log n)$. For these graph classes, our algorithms provide exponentially faster solutions than the best known algorithms for general graphs in this model.
Beyond shortest paths, we also provide a variety of useful tools and techniques for hybrid networks, which may be of independent interest.
}},
  author       = {{Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS)}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs}}},
  doi          = {{10.4230/LIPIcs.OPODIS.2020.31}},
  year         = {{2020}},
}

@misc{18066,
  author       = {{Skowronek, Michael}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks}}},
  year         = {{2020}},
}

@misc{18648,
  author       = {{Guggenmos, Andreas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Algorithmen für selbststabilisierende Skip+-Delaunaygraphen}}},
  year         = {{2020}},
}