---
_id: '5404'
author:
- first_name: Patrick Irenäus
  full_name: Kolpaczki, Patrick Irenäus
  last_name: Kolpaczki
citation:
  ama: Kolpaczki PI. <i>Online Algorithmen Für Das K-Page Migration Problem</i>. Universität
    Paderborn; 2018.
  apa: Kolpaczki, P. I. (2018). <i>Online Algorithmen für das k-Page Migration Problem</i>.
    Universität Paderborn.
  bibtex: '@book{Kolpaczki_2018, title={Online Algorithmen für das k-Page Migration
    Problem}, publisher={Universität Paderborn}, author={Kolpaczki, Patrick Irenäus},
    year={2018} }'
  chicago: Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration
    Problem</i>. Universität Paderborn, 2018.
  ieee: P. I. Kolpaczki, <i>Online Algorithmen für das k-Page Migration Problem</i>.
    Universität Paderborn, 2018.
  mla: Kolpaczki, Patrick Irenäus. <i>Online Algorithmen Für Das K-Page Migration
    Problem</i>. Universität Paderborn, 2018.
  short: P.I. Kolpaczki, Online Algorithmen Für Das K-Page Migration Problem, Universität
    Paderborn, 2018.
date_created: 2018-11-07T09:23:17Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Online Algorithmen für das k-Page Migration Problem
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '1209'
abstract:
- lang: eng
  text: 'My dissertation deals with the Gathering problem for swarms of n point-shaped
    robots on a grid, in which all robots of the swarm are supposed to gather at a
    previously undefined point. Special attention is paid to the strong limitation
    of robot capabilities. These include in particular the lack of global control,
    a global compass, global visibility and (global) communication skills. Furthermore,
    all robots are identical. The robots are given only local abilities. This includes
    a constant range of vision. The robots all work completely synchronously. In this
    work we present and analyze three different Gathering strategies in different
    robot models. We formally prove correctness and total running time: Chapter 4
    focuses on minimizing the available robot capabilities. The underlying strategy
    completes the gathering in O(n^2) time. For the following Chapters 5 and 6, the
    aim is to optimize the total running time under using only local robot capabilities:
    We additionally allow a constant-sized memory and a constant number of locally
    visible statuses (lights, flags). For the strategies of both chapters we show
    an asymptotically optimal running time of O(n). Unlike in Chapters 4 and 5, we
    additionally restrict connectivity and vision to an initially given chain connectivity
    in Chapter 6, where two chain neighbors must have a distance of 1 from each other.
    A robot can only see and interact with a constant number of its direct chain neighbors.'
author:
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
citation:
  ama: Jung D. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn; 2018. doi:<a href="https://doi.org/10.17619/UNIPB/1-271">10.17619/UNIPB/1-271</a>
  apa: Jung, D. (2018). <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-271">https://doi.org/10.17619/UNIPB/1-271</a>
  bibtex: '@book{Jung_2018, title={Local Strategies for Swarm Formations on a Grid},
    DOI={<a href="https://doi.org/10.17619/UNIPB/1-271">10.17619/UNIPB/1-271</a>},
    publisher={Universität Paderborn}, author={Jung, Daniel}, year={2018} }'
  chicago: Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn, 2018. <a href="https://doi.org/10.17619/UNIPB/1-271">https://doi.org/10.17619/UNIPB/1-271</a>.
  ieee: D. Jung, <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn, 2018.
  mla: Jung, Daniel. <i>Local Strategies for Swarm Formations on a Grid</i>. Universität
    Paderborn, 2018, doi:<a href="https://doi.org/10.17619/UNIPB/1-271">10.17619/UNIPB/1-271</a>.
  short: D. Jung, Local Strategies for Swarm Formations on a Grid, Universität Paderborn,
    2018.
date_created: 2018-03-13T10:26:16Z
date_updated: 2024-07-12T12:05:00Z
department:
- _id: '63'
- _id: '26'
doi: 10.17619/UNIPB/1-271
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  grant_number: '160364472'
  name: SFB 901 - Subproject A1
publication_identifier:
  isbn:
  - 978-3-942647-99-1
publisher: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: https://doi.org/10.17619/UNIPB/1-271
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Local Strategies for Swarm Formations on a Grid
type: dissertation
user_id: '1112'
year: '2018'
...
---
_id: '2851'
author:
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
citation:
  ama: 'Markarian C. Leasing with Uncertainty. In: <i>International Conference on
    Operations Research (OR)</i>. ; 2017. doi:<a href="https://doi.org/10.1007/978-3-319-89920-6_57">10.1007/978-3-319-89920-6_57</a>'
  apa: Markarian, C. (2017). Leasing with Uncertainty. In <i>International Conference
    on Operations Research (OR)</i>. Berlin. <a href="https://doi.org/10.1007/978-3-319-89920-6_57">https://doi.org/10.1007/978-3-319-89920-6_57</a>
  bibtex: '@inproceedings{Markarian_2017, title={Leasing with Uncertainty}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-89920-6_57">10.1007/978-3-319-89920-6_57</a>},
    booktitle={International Conference on Operations Research (OR)}, author={Markarian,
    Christine}, year={2017} }'
  chicago: Markarian, Christine. “Leasing with Uncertainty.” In <i>International Conference
    on Operations Research (OR)</i>, 2017. <a href="https://doi.org/10.1007/978-3-319-89920-6_57">https://doi.org/10.1007/978-3-319-89920-6_57</a>.
  ieee: C. Markarian, “Leasing with Uncertainty,” in <i>International Conference on
    Operations Research (OR)</i>, Berlin, 2017.
  mla: Markarian, Christine. “Leasing with Uncertainty.” <i>International Conference
    on Operations Research (OR)</i>, 2017, doi:<a href="https://doi.org/10.1007/978-3-319-89920-6_57">10.1007/978-3-319-89920-6_57</a>.
  short: 'C. Markarian, in: International Conference on Operations Research (OR),
    2017.'
conference:
  end_date: Sept 8, 2017
  location: Berlin
  start_date: Sept 6, 2017
date_created: 2018-05-24T08:44:43Z
date_updated: 2022-01-06T06:58:08Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-89920-6_57
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-11-13T13:16:30Z
  date_updated: 2018-11-13T13:16:30Z
  file_id: '5537'
  file_name: Markarian2018_Chapter_LeasingWithUncertainty.pdf
  file_size: 257103
  relation: main_file
  success: 1
file_date_updated: 2018-11-13T13:16:30Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: International Conference on Operations Research (OR)
status: public
title: Leasing with Uncertainty
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '18026'
author:
- first_name: 'Michél '
  full_name: 'Burkhardt, Michél '
  last_name: Burkhardt
citation:
  ama: Burkhardt M. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn;
    2017.
  apa: Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn.
  bibtex: '@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität
    Paderborn}, author={Burkhardt, Michél }, year={2017} }'
  chicago: Burkhardt, Michél . <i>Untersuchungen Zum Cone-Hashing</i>. Universität
    Paderborn, 2017.
  ieee: M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn,
    2017.
  mla: Burkhardt, Michél. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn,
    2017.
  short: M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.
date_created: 2020-08-18T08:39:19Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Untersuchungen zum Cone-Hashing
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18028'
author:
- first_name: Andreas
  full_name: Schenk, Andreas
  last_name: Schenk
citation:
  ama: Schenk A. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>.
    Universität Paderborn; 2017.
  apa: Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten
    Datenstrukturen</i>. Universität Paderborn.
  bibtex: '@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten
    Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas},
    year={2017} }'
  chicago: Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten
    Datenstrukturen</i>. Universität Paderborn, 2017.
  ieee: A. Schenk, <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>.
    Universität Paderborn, 2017.
  mla: Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>.
    Universität Paderborn, 2017.
  short: A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen,
    Universität Paderborn, 2017.
date_created: 2020-08-18T08:41:42Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '18029'
author:
- first_name: Björn
  full_name: Beckendorf, Björn
  last_name: Beckendorf
citation:
  ama: Beckendorf B. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>.
    Universität Paderborn; 2017.
  apa: Beckendorf, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn.
  bibtex: '@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter
    Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn},
    year={2017} }'
  chicago: Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  ieee: B. Beckendorf, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  mla: Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  short: B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme,
    Universität Paderborn, 2017.
date_created: 2020-08-18T08:42:36Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Visualisierung zu Algorithmen verteilter Netzwerksysteme
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '81'
author:
- first_name: Linghui
  full_name: Luo, Linghui
  last_name: Luo
citation:
  ama: 'Luo L. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
    Searchability Maintained</i>. Universität Paderborn; 2017.'
  apa: 'Luo, L. (2017). <i>MultiSkipList: A Self-stabilizing Overlay Network with
    Monotonic Searchability maintained</i>. Universität Paderborn.'
  bibtex: '@book{Luo_2017, title={MultiSkipList: A Self-stabilizing Overlay Network
    with Monotonic Searchability maintained}, publisher={Universität Paderborn}, author={Luo,
    Linghui}, year={2017} }'
  chicago: 'Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with
    Monotonic Searchability Maintained</i>. Universität Paderborn, 2017.'
  ieee: 'L. Luo, <i>MultiSkipList: A Self-stabilizing Overlay Network with Monotonic
    Searchability maintained</i>. Universität Paderborn, 2017.'
  mla: 'Luo, Linghui. <i>MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
    Searchability Maintained</i>. Universität Paderborn, 2017.'
  short: 'L. Luo, MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic
    Searchability Maintained, Universität Paderborn, 2017.'
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: 'MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability
  maintained'
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '82'
abstract:
- lang: eng
  text: Many graph problems such as maximum cut, chromatic number, hamiltonian cycle,
    and edge dominating set are known to be fixed-parameter tractable (FPT) when parameterized
    by the treewidth of the input graphs, but become W-hard with respect to the clique-width
    parameter. Recently, Gajarský et al. proposed a new parameter called modular-width
    using the notion of modular decomposition of graphs. They showed that the chromatic
    number problem and the partitioning into paths problem, and hence hamiltonian
    path and hamiltonian cycle, are FPT when parameterized by this parameter. In this
    paper, we study modular-width in parameterized parallel complexity and show that
    the weighted maximum clique problem and the maximum matching problem are fixed-parameter
    parallel-tractable (FPPT) when parameterized by this parameter.
author:
- first_name: Faisal N.
  full_name: Abu-Khzam, Faisal N.
  last_name: Abu-Khzam
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Pavel
  full_name: Podlipyan, Pavel
  last_name: Podlipyan
citation:
  ama: 'Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Modular-Width:
    An Auxiliary Parameter for Parameterized Parallel Complexity. In: <i>Proceedings
    of the 11th International Workshop on Frontiers in Algorithmics (FAW)</i>. LNCS.
    ; 2017:139-150. doi:<a href="https://doi.org/10.1007/978-3-319-59605-1_13">10.1007/978-3-319-59605-1_13</a>'
  apa: 'Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan,
    P. (2017). Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.
    In <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics
    (FAW)</i> (pp. 139–150). <a href="https://doi.org/10.1007/978-3-319-59605-1_13">https://doi.org/10.1007/978-3-319-59605-1_13</a>'
  bibtex: '@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2017,
    series={LNCS}, title={Modular-Width: An Auxiliary Parameter for Parameterized
    Parallel Complexity}, DOI={<a href="https://doi.org/10.1007/978-3-319-59605-1_13">10.1007/978-3-319-59605-1_13</a>},
    booktitle={Proceedings of the 11th International Workshop on Frontiers in Algorithmics
    (FAW)}, author={Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine
    and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2017}, pages={139–150},
    collection={LNCS} }'
  chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
    auf der Heide, and Pavel Podlipyan. “Modular-Width: An Auxiliary Parameter for
    Parameterized Parallel Complexity.” In <i>Proceedings of the 11th International
    Workshop on Frontiers in Algorithmics (FAW)</i>, 139–50. LNCS, 2017. <a href="https://doi.org/10.1007/978-3-319-59605-1_13">https://doi.org/10.1007/978-3-319-59605-1_13</a>.'
  ieee: 'F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
    “Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity,”
    in <i>Proceedings of the 11th International Workshop on Frontiers in Algorithmics
    (FAW)</i>, 2017, pp. 139–150.'
  mla: 'Abu-Khzam, Faisal N., et al. “Modular-Width: An Auxiliary Parameter for Parameterized
    Parallel Complexity.” <i>Proceedings of the 11th International Workshop on Frontiers
    in Algorithmics (FAW)</i>, 2017, pp. 139–50, doi:<a href="https://doi.org/10.1007/978-3-319-59605-1_13">10.1007/978-3-319-59605-1_13</a>.'
  short: 'F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
    in: Proceedings of the 11th International Workshop on Frontiers in Algorithmics
    (FAW), 2017, pp. 139–150.'
date_created: 2017-10-17T12:41:07Z
date_updated: 2022-01-06T07:03:52Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-59605-1_13
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:07:35Z
  date_updated: 2018-11-02T15:07:35Z
  file_id: '5294'
  file_name: Modular-WidthAnAuxiliaryParame.pdf
  file_size: 238276
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:07:35Z
has_accepted_license: '1'
language:
- iso: eng
page: 139-150
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 11th International Workshop on Frontiers in Algorithmics
  (FAW)
series_title: LNCS
status: public
title: 'Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '5980'
citation:
  ama: Scheideler C, Taghi Hajiaghayi M, eds. <i>Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA,
    July 24-26, 2017</i>. ACM; 2017. doi:<a href="https://doi.org/10.1145/3087556">10.1145/3087556</a>
  apa: Scheideler, C., &#38; Taghi Hajiaghayi, M. (Eds.). (2017). <i>Proceedings of
    the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017,
    Washington DC, USA, July 24-26, 2017</i>. ACM. <a href="https://doi.org/10.1145/3087556">https://doi.org/10.1145/3087556</a>
  bibtex: '@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th
    ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington
    DC, USA, July 24-26, 2017}, DOI={<a href="https://doi.org/10.1145/3087556">10.1145/3087556</a>},
    publisher={ACM}, year={2017} }'
  chicago: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
    2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017. <a href="https://doi.org/10.1145/3087556">https://doi.org/10.1145/3087556</a>.
  ieee: C. Scheideler and M. Taghi Hajiaghayi, Eds., <i>Proceedings of the 29th ACM
    Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington
    DC, USA, July 24-26, 2017</i>. ACM, 2017.
  mla: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
    2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017, doi:<a href="https://doi.org/10.1145/3087556">10.1145/3087556</a>.
  short: C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA,
    July 24-26, 2017, ACM, 2017.
date_created: 2018-11-29T10:23:12Z
date_updated: 2022-01-06T07:02:48Z
department:
- _id: '7'
- _id: '79'
doi: 10.1145/3087556
editor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Mohammad
  full_name: Taghi Hajiaghayi, Mohammad
  last_name: Taghi Hajiaghayi
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication_identifier:
  isbn:
  - 978-1-4503-4593-4
publisher: ACM
status: public
title: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures,
  SPAA 2017, Washington DC, USA, July 24-26, 2017
type: conference_editor
user_id: '477'
year: '2017'
...
---
_id: '61'
author:
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: Strothmann TF. <i>Self-* Algorithms for Distributed Systems</i>. Universität
    Paderborn; 2017. doi:<a href="https://doi.org/10.17619/UNIPB/1-150">10.17619/UNIPB/1-150</a>
  apa: Strothmann, T. F. (2017). <i>Self-* Algorithms for Distributed Systems</i>.
    Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-150">https://doi.org/10.17619/UNIPB/1-150</a>
  bibtex: '@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems},
    DOI={<a href="https://doi.org/10.17619/UNIPB/1-150">10.17619/UNIPB/1-150</a>},
    publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017}
    }'
  chicago: Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>.
    Universität Paderborn, 2017. <a href="https://doi.org/10.17619/UNIPB/1-150">https://doi.org/10.17619/UNIPB/1-150</a>.
  ieee: T. F. Strothmann, <i>Self-* Algorithms for Distributed Systems</i>. Universität
    Paderborn, 2017.
  mla: Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>.
    Universität Paderborn, 2017, doi:<a href="https://doi.org/10.17619/UNIPB/1-150">10.17619/UNIPB/1-150</a>.
  short: T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn,
    2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:52Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-150
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Self-* Algorithms for Distributed Systems
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '699'
author:
- first_name: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: Sundermeier J. <i>Routing in Hybrid Communication Networks with Holes - Considering
    Bounding Boxes as Hole Abstractions</i>. Universität Paderborn; 2017.
  apa: Sundermeier, J. (2017). <i>Routing in Hybrid Communication Networks with Holes
    - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn.
  bibtex: '@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks
    with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität
    Paderborn}, author={Sundermeier, Jannik}, year={2017} }'
  chicago: Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes
    - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn,
    2017.
  ieee: J. Sundermeier, <i>Routing in Hybrid Communication Networks with Holes - Considering
    Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.
  mla: Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes
    - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn,
    2017.
  short: J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering
    Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.
date_created: 2017-11-14T08:03:45Z
date_updated: 2022-01-06T07:03:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Routing in Hybrid Communication Networks with Holes - Considering Bounding
  Boxes as Hole Abstractions
type: mastersthesis
user_id: '38705'
year: '2017'
...
---
_id: '70'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online
    Leasing. In: <i>Proceedings of the 11th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i>. ; 2017:17-31. doi:<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>'
  apa: Feldkord, B., Markarian, C., &#38; Meyer auf der Heide, F. (2017). Price Fluctuations
    in Online Leasing. In <i>Proceedings of the 11th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i> (pp. 17–31). <a href="https://doi.org/10.1007/978-3-319-71147-8_2">https://doi.org/10.1007/978-3-319-71147-8_2</a>
  bibtex: '@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price
    Fluctuations in Online Leasing}, DOI={<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>},
    booktitle={Proceedings of the 11th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian,
    Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }'
  chicago: Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide.
    “Price Fluctuations in Online Leasing.” In <i>Proceedings of the 11th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA)</i>, 17–31,
    2017. <a href="https://doi.org/10.1007/978-3-319-71147-8_2">https://doi.org/10.1007/978-3-319-71147-8_2</a>.
  ieee: B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations
    in Online Leasing,” in <i>Proceedings of the 11th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31.
  mla: Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” <i>Proceedings
    of the 11th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>, 2017, pp. 17–31, doi:<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>.
  short: 'B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
    11th Annual International Conference on Combinatorial Optimization and Applications
    (COCOA), 2017, pp. 17–31.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:26Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-71147-8_2
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:06:13Z
  date_updated: 2018-11-02T15:06:13Z
  file_id: '5293'
  file_name: PriceFluctuationInOnlineLeasin.pdf
  file_size: 287315
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:06:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 17 - 31
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 11th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
status: public
title: Price Fluctuations in Online Leasing
type: conference
user_id: '477'
year: '2017'
...
---
_id: '700'
author:
- first_name: Till
  full_name: Knollmann, Till
  last_name: Knollmann
citation:
  ama: Knollmann T. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn; 2017.
  apa: Knollmann, T. (2017). <i>A Self-Stabilizing Protocol for Graphs of Diameter
    Two</i>. Universität Paderborn.
  bibtex: '@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of
    Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017}
    }'
  chicago: Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter
    Two</i>. Universität Paderborn, 2017.
  ieee: T. Knollmann, <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn, 2017.
  mla: Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn, 2017.
  short: T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität
    Paderborn, 2017.
date_created: 2017-11-14T08:04:35Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: A Self-Stabilizing Protocol for Graphs of Diameter Two
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '701'
author:
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
citation:
  ama: Götte T. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn;
    2017.
  apa: Götte, T. (2017). <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn.
  bibtex: '@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität
    Paderborn}, author={Götte, Thorsten}, year={2017} }'
  chicago: Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn, 2017.
  ieee: T. Götte, <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn,
    2017.
  mla: Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn, 2017.
  short: T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn,
    2017.
date_created: 2017-11-14T09:32:39Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Self-Stabilizing Spanners for Tree Metrics
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '55'
abstract:
- lang: eng
  text: We introduce the mobile server problem, inspired by current trends to move
    computational tasks from cloud structures to multiple devices close to the end
    user. An example for this are embedded systems in autonomous cars that communicate
    in order to coordinate their actions. Our model is a variant of the classical
    Page Migration Problem. Moreformally, we consider a mobile server holding a data
    page.The server can move in the Euclidean space (of arbitrary dimension). In every
    round, requests for data items from the page pop up at arbitrary points in the
    space. The requests are served, each at a cost of the distance from the requesting
    point and the server, and the mobile server may move, at a cost D times the distance
    traveled for some constant D . We assume a maximum distance m the server is allowed
    to move per round. We show that no online algorithm can achieve a competitive
    ratio independent of the length of the input sequence in this setting. Hence we
    augment the maximum movement distance of the online algorithms to ( 1 + δ) times
    the maximum distance of the offline solution. We provide a deterministic algorithm
    which is simple to describe and works for multiple variants of our problem. The
    algorithm achieves almost tight competitive ratios independent of the length of
    the input sequence.
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.
    ; 2017:313-319. doi:<a href="https://doi.org/10.1145/3087556.3087575">10.1145/3087556.3087575</a>'
  apa: Feldkord, B., &#38; Meyer auf der Heide, F. (2017). The Mobile Server Problem.
    In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i> (pp. 313–319). <a href="https://doi.org/10.1145/3087556.3087575">https://doi.org/10.1145/3087556.3087575</a>
  bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server
    Problem}, DOI={<a href="https://doi.org/10.1145/3087556.3087575">10.1145/3087556.3087575</a>},
    booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm},
    year={2017}, pages={313–319} }'
  chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server
    Problem.” In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, 313–19, 2017. <a href="https://doi.org/10.1145/3087556.3087575">https://doi.org/10.1145/3087556.3087575</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    2017, pp. 313–319.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”
    <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, 2017, pp. 313–19, doi:<a href="https://doi.org/10.1145/3087556.3087575">10.1145/3087556.3087575</a>.
  short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:01:56Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3087556.3087575
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:55:10Z
  date_updated: 2018-11-02T14:55:10Z
  file_id: '5288'
  file_name: p313-feldkord.pdf
  file_size: 691691
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:55:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 313-319
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
status: public
title: The Mobile Server Problem
type: conference
user_id: '477'
year: '2017'
...
---
_id: '696'
author:
- first_name: Lennart
  full_name: Wachowiak, Lennart
  last_name: Wachowiak
citation:
  ama: Wachowiak L. <i>Das Mobile Server Problem in Netzwerken</i>. Universität Paderborn;
    2017.
  apa: Wachowiak, L. (2017). <i>Das Mobile Server Problem in Netzwerken</i>. Universität
    Paderborn.
  bibtex: '@book{Wachowiak_2017, title={Das Mobile Server Problem in Netzwerken},
    publisher={Universität Paderborn}, author={Wachowiak, Lennart}, year={2017} }'
  chicago: Wachowiak, Lennart. <i>Das Mobile Server Problem in Netzwerken</i>. Universität
    Paderborn, 2017.
  ieee: L. Wachowiak, <i>Das Mobile Server Problem in Netzwerken</i>. Universität
    Paderborn, 2017.
  mla: Wachowiak, Lennart. <i>Das Mobile Server Problem in Netzwerken</i>. Universität
    Paderborn, 2017.
  short: L. Wachowiak, Das Mobile Server Problem in Netzwerken, Universität Paderborn,
    2017.
date_created: 2017-11-14T06:58:39Z
date_updated: 2022-01-06T07:03:24Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Das Mobile Server Problem in Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '697'
author:
- first_name: Michel
  full_name: Burkhardt, Michel
  last_name: Burkhardt
citation:
  ama: Burkhardt M. <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn;
    2017.
  apa: Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn.
  bibtex: '@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität
    Paderborn}, author={Burkhardt, Michel}, year={2017} }'
  chicago: Burkhardt, Michel. <i>Untersuchungen zum Cone-Hashing</i>. Universität
    Paderborn, 2017.
  ieee: M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn,
    2017.
  mla: Burkhardt, Michel. <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn,
    2017.
  short: M. Burkhardt, Untersuchungen zum Cone-Hashing, Universität Paderborn, 2017.
date_created: 2017-11-14T08:01:41Z
date_updated: 2022-01-06T07:03:24Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Untersuchungen zum Cone-Hashing
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1048'
author:
- first_name: Andreas
  full_name: Schenk, Andreas
  last_name: Schenk
citation:
  ama: Schenk A. <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>.
    Universität Paderborn; 2017.
  apa: Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten
    Datenstrukturen</i>. Universität Paderborn.
  bibtex: '@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten
    Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas},
    year={2017} }'
  chicago: Schenk, Andreas. <i>Monotone Suchbarkeit in mehrdimensionalen verteilten
    Datenstrukturen</i>. Universität Paderborn, 2017.
  ieee: A. Schenk, <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>.
    Universität Paderborn, 2017.
  mla: Schenk, Andreas. <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>.
    Universität Paderborn, 2017.
  short: A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen,
    Universität Paderborn, 2017.
date_created: 2017-12-13T10:14:30Z
date_updated: 2022-01-06T06:50:41Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
title: Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1049'
author:
- first_name: Björn
  full_name: Beckendorfer, Björn
  last_name: Beckendorfer
citation:
  ama: Beckendorfer B. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn; 2017.
  apa: Beckendorfer, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn.
  bibtex: '@book{Beckendorfer_2017, title={Visualisierung zu Algorithmen verteilter
    Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorfer, Björn},
    year={2017} }'
  chicago: Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  ieee: B. Beckendorfer, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  mla: Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  short: B. Beckendorfer, Visualisierung zu Algorithmen verteilter Netzwerksysteme,
    Universität Paderborn, 2017.
date_created: 2017-12-13T10:17:43Z
date_updated: 2022-01-06T06:50:42Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Visualisierung zu Algorithmen verteilter Netzwerksysteme
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '105'
abstract:
- lang: eng
  text: We initiate the study of network monitoring algorithms in a class of hybrid
    networks in which the nodes are connected by an external network and an internal
    network (as a short form for externally and internally controlled network). While
    the external network lies outside of the control of the nodes (or in our case,
    the monitoring protocol running in them) and might be exposed to continuous changes,
    the internal network is fully under the control of the nodes. As an example, consider
    a group of users with mobile devices having access to the cell phone infrastructure.
    While the network formed by the WiFi connections of the devices is an external
    network (as its structure is not necessarily under the control of the monitoring
    protocol), the connections between the devices via the cell phone infrastructure
    represent an internal network (as it can be controlled by the monitoring protocol).
    Our goal is to continuously monitor properties of the external network with the
    help of the internal network. We present scalable distributed algorithms that
    efficiently monitor the number of edges, the average node degree, the clustering
    coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their
    performance bounds demonstrate that monitoring the external network state with
    the help of an internal network can be done much more efficiently than just using
    the external network, as is usually done in the literature.
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: 'Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network
    Properties: The Power of Hybrid Networks. In: <i>Proceedings of the 44th International
    Colloquium on Automata, Languages, and Programming (ICALP)</i>. Leibniz International
    Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">10.4230/LIPIcs.ICALP.2017.137</a>'
  apa: 'Gmyr, R., Hinnenthal, K., Scheideler, C., &#38; Sohler, C. (2017). Distributed
    Monitoring of Network Properties: The Power of Hybrid Networks. In <i>Proceedings
    of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>
    (pp. 137:1--137:15). <a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">https://doi.org/10.4230/LIPIcs.ICALP.2017.137</a>'
  bibtex: '@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz
    International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring
    of Network Properties: The Power of Hybrid Networks}, DOI={<a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">10.4230/LIPIcs.ICALP.2017.137</a>},
    booktitle={Proceedings of the 44th International Colloquium on Automata, Languages,
    and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler,
    Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz
    International Proceedings in Informatics (LIPIcs)} }'
  chicago: 'Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian
    Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.”
    In <i>Proceedings of the 44th International Colloquium on Automata, Languages,
    and Programming (ICALP)</i>, 137:1--137:15. Leibniz International Proceedings
    in Informatics (LIPIcs), 2017. <a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">https://doi.org/10.4230/LIPIcs.ICALP.2017.137</a>.'
  ieee: 'R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring
    of Network Properties: The Power of Hybrid Networks,” in <i>Proceedings of the
    44th International Colloquium on Automata, Languages, and Programming (ICALP)</i>,
    2017, pp. 137:1--137:15.'
  mla: 'Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power
    of Hybrid Networks.” <i>Proceedings of the 44th International Colloquium on Automata,
    Languages, and Programming (ICALP)</i>, 2017, pp. 137:1--137:15, doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2017.137">10.4230/LIPIcs.ICALP.2017.137</a>.'
  short: 'R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the
    44th International Colloquium on Automata, Languages, and Programming (ICALP),
    2017, pp. 137:1--137:15.'
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.ICALP.2017.137
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-13T09:23:11Z
  date_updated: 2018-03-13T09:23:11Z
  file_id: '1207'
  file_name: 105-ICALP17-GHSS.pdf
  file_size: 504161
  relation: main_file
  success: 1
file_date_updated: 2018-03-13T09:23:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 137:1--137:15
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 44th International Colloquium on Automata, Languages,
  and Programming (ICALP)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Distributed Monitoring of Network Properties: The Power of Hybrid Networks'
type: conference
user_id: '20792'
year: '2017'
...