---
_id: '45580'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
citation:
  ama: Castenow J. <i>Local Protocols for Contracting and Expanding Robot Formation
    Problems</i>.; 2023. doi:<a href="https://doi.org/10.17619/UNIPB/1-1750">10.17619/UNIPB/1-1750</a>
  apa: Castenow, J. (2023). <i>Local Protocols for Contracting and Expanding Robot
    Formation Problems</i>. <a href="https://doi.org/10.17619/UNIPB/1-1750">https://doi.org/10.17619/UNIPB/1-1750</a>
  bibtex: '@book{Castenow_2023, title={Local Protocols for Contracting and Expanding
    Robot Formation Problems}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-1750">10.17619/UNIPB/1-1750</a>},
    author={Castenow, Jannik}, year={2023} }'
  chicago: Castenow, Jannik. <i>Local Protocols for Contracting and Expanding Robot
    Formation Problems</i>, 2023. <a href="https://doi.org/10.17619/UNIPB/1-1750">https://doi.org/10.17619/UNIPB/1-1750</a>.
  ieee: J. Castenow, <i>Local Protocols for Contracting and Expanding Robot Formation
    Problems</i>. 2023.
  mla: Castenow, Jannik. <i>Local Protocols for Contracting and Expanding Robot Formation
    Problems</i>. 2023, doi:<a href="https://doi.org/10.17619/UNIPB/1-1750">10.17619/UNIPB/1-1750</a>.
  short: J. Castenow, Local Protocols for Contracting and Expanding Robot Formation
    Problems, 2023.
date_created: 2023-06-12T13:06:58Z
date_updated: 2023-06-13T07:43:11Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-1750
language:
- iso: eng
project:
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  grant_number: '160364472'
  name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
    Netzen (Subproject A1)'
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Local Protocols for Contracting and Expanding Robot Formation Problems
type: dissertation
user_id: '38705'
year: '2023'
...
---
_id: '45579'
author:
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
citation:
  ama: Knollmann T. <i>Online Algorithms for Allocating Heterogeneous Resources</i>.;
    2023. doi:<a href="https://doi.org/10.17619/UNIPB/1-1751">10.17619/UNIPB/1-1751</a>
  apa: Knollmann, T. (2023). <i>Online Algorithms for Allocating Heterogeneous Resources</i>.
    <a href="https://doi.org/10.17619/UNIPB/1-1751">https://doi.org/10.17619/UNIPB/1-1751</a>
  bibtex: '@book{Knollmann_2023, title={Online Algorithms for Allocating Heterogeneous
    Resources}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-1751">10.17619/UNIPB/1-1751</a>},
    author={Knollmann, Till}, year={2023} }'
  chicago: Knollmann, Till. <i>Online Algorithms for Allocating Heterogeneous Resources</i>,
    2023. <a href="https://doi.org/10.17619/UNIPB/1-1751">https://doi.org/10.17619/UNIPB/1-1751</a>.
  ieee: T. Knollmann, <i>Online Algorithms for Allocating Heterogeneous Resources</i>.
    2023.
  mla: Knollmann, Till. <i>Online Algorithms for Allocating Heterogeneous Resources</i>.
    2023, doi:<a href="https://doi.org/10.17619/UNIPB/1-1751">10.17619/UNIPB/1-1751</a>.
  short: T. Knollmann, Online Algorithms for Allocating Heterogeneous Resources, 2023.
date_created: 2023-06-12T13:05:04Z
date_updated: 2023-06-12T21:03:14Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-1751
language:
- iso: eng
project:
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  grant_number: '160364472'
  name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
    Netzen (Subproject A1)'
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Online Algorithms for Allocating Heterogeneous Resources
type: dissertation
user_id: '39241'
year: '2023'
...
---
_id: '45781'
author:
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
citation:
  ama: Pukrop S. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>.;
    2023. doi:<a href="https://doi.org/10.17619/UNIPB/1-1768 ">10.17619/UNIPB/1-1768
    </a>
  apa: Pukrop, S. (2023). <i>On Cloud Assisted, Restricted, and Reosurce Constrained
    Scheduling</i>. <a href="https://doi.org/10.17619/UNIPB/1-1768 ">https://doi.org/10.17619/UNIPB/1-1768
    </a>
  bibtex: '@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained
    Scheduling}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-1768 ">10.17619/UNIPB/1-1768
    </a>}, author={Pukrop, Simon}, year={2023} }'
  chicago: Pukrop, Simon. <i>On Cloud Assisted, Restricted, and Reosurce Constrained
    Scheduling</i>, 2023. <a href="https://doi.org/10.17619/UNIPB/1-1768 ">https://doi.org/10.17619/UNIPB/1-1768
    </a>.
  ieee: S. Pukrop, <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>.
    2023.
  mla: Pukrop, Simon. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>.
    2023, doi:<a href="https://doi.org/10.17619/UNIPB/1-1768 ">10.17619/UNIPB/1-1768
    </a>.
  short: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling,
    2023.
date_created: 2023-06-27T05:24:19Z
date_updated: 2023-07-14T09:27:44Z
department:
- _id: '63'
doi: '10.17619/UNIPB/1-1768 '
language:
- iso: eng
project:
- _id: '1'
  grant_number: '160364472'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
  grant_number: '160364472'
  name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
    Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling
type: dissertation
user_id: '15504'
year: '2023'
...
---
_id: '44234'
author:
- first_name: Thilo Frederik
  full_name: Berger, Thilo Frederik
  last_name: Berger
citation:
  ama: Berger TF. <i>Combining Mobility, Heterogeneity, and Leasing Approaches for
    Online Resource Allocation</i>.; 2021.
  apa: Berger, T. F. (2021). <i>Combining Mobility, Heterogeneity, and Leasing Approaches
    for Online Resource Allocation</i>.
  bibtex: '@book{Berger_2021, title={Combining Mobility, Heterogeneity, and Leasing
    Approaches for Online Resource Allocation}, author={Berger, Thilo Frederik}, year={2021}
    }'
  chicago: Berger, Thilo Frederik. <i>Combining Mobility, Heterogeneity, and Leasing
    Approaches for Online Resource Allocation</i>, 2021.
  ieee: T. F. Berger, <i>Combining Mobility, Heterogeneity, and Leasing Approaches
    for Online Resource Allocation</i>. 2021.
  mla: Berger, Thilo Frederik. <i>Combining Mobility, Heterogeneity, and Leasing Approaches
    for Online Resource Allocation</i>. 2021.
  short: T.F. Berger, Combining Mobility, Heterogeneity, and Leasing Approaches for
    Online Resource Allocation, 2021.
date_created: 2023-04-27T15:34:07Z
date_updated: 2023-04-27T15:34:17Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Combining Mobility, Heterogeneity, and Leasing Approaches for Online Resource
  Allocation
type: bachelorsthesis
user_id: '39241'
year: '2021'
...
---
_id: '44233'
author:
- first_name: Sebastian
  full_name: Pranger, Sebastian
  last_name: Pranger
citation:
  ama: Pranger S. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>.;
    2021.
  apa: Pranger, S. (2021). <i>Online k-Facility Reallocation using k-Server Algorithms</i>.
  bibtex: '@book{Pranger_2021, title={Online k-Facility Reallocation using k-Server
    Algorithms}, author={Pranger, Sebastian}, year={2021} }'
  chicago: Pranger, Sebastian. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>,
    2021.
  ieee: S. Pranger, <i>Online k-Facility Reallocation using k-Server Algorithms</i>.
    2021.
  mla: Pranger, Sebastian. <i>Online K-Facility Reallocation Using k-Server Algorithms</i>.
    2021.
  short: S. Pranger, Online K-Facility Reallocation Using k-Server Algorithms, 2021.
date_created: 2023-04-27T15:31:26Z
date_updated: 2023-04-27T15:31:57Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Online k-Facility Reallocation using k-Server Algorithms
type: bachelorsthesis
user_id: '39241'
year: '2021'
...
---
_id: '15631'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
citation:
  ama: Feldkord B. <i>Mobile Resource Allocation</i>. Universität Paderborn; 2020.
    doi:<a href="https://doi.org/10.17619/UNIPB/1-869">10.17619/UNIPB/1-869</a>
  apa: Feldkord, B. (2020). <i>Mobile Resource Allocation</i>. Universität Paderborn.
    <a href="https://doi.org/10.17619/UNIPB/1-869">https://doi.org/10.17619/UNIPB/1-869</a>
  bibtex: '@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource
    Allocation}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-869">10.17619/UNIPB/1-869</a>},
    author={Feldkord, Björn}, year={2020} }'
  chicago: Feldkord, Björn. <i>Mobile Resource Allocation</i>. Universität Paderborn,
    2020. <a href="https://doi.org/10.17619/UNIPB/1-869">https://doi.org/10.17619/UNIPB/1-869</a>.
  ieee: B. Feldkord, <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020.
  mla: Feldkord, Björn. <i>Mobile Resource Allocation</i>. 2020, doi:<a href="https://doi.org/10.17619/UNIPB/1-869">10.17619/UNIPB/1-869</a>.
  short: B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.
date_created: 2020-01-23T14:20:25Z
date_updated: 2022-01-06T06:52:31Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-869
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2020-01-24T08:19:38Z
  date_updated: 2020-01-24T08:19:38Z
  file_id: '15634'
  file_name: DissertationFeldkord.pdf
  file_size: 633652
  relation: main_file
  success: 1
file_date_updated: 2020-01-24T08:19:38Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Mobile Resource Allocation
type: dissertation
user_id: '15415'
year: '2020'
...
---
_id: '18975'
author:
- first_name: Manuel
  full_name: Malatyali, Manuel
  last_name: Malatyali
citation:
  ama: 'Malatyali M. <i>Big Data: Sublinear Algorithms for Distributed Data Streams</i>.
    Universität Paderborn; 2019. doi:<a href="https://doi.org/10.17619/UNIPB/1-766">10.17619/UNIPB/1-766</a>'
  apa: 'Malatyali, M. (2019). <i>Big Data: Sublinear Algorithms for Distributed Data
    Streams</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-766">https://doi.org/10.17619/UNIPB/1-766</a>'
  bibtex: '@book{Malatyali_2019, place={Universität Paderborn}, title={Big Data: Sublinear
    Algorithms for Distributed Data Streams}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-766">10.17619/UNIPB/1-766</a>},
    author={Malatyali, Manuel}, year={2019} }'
  chicago: 'Malatyali, Manuel. <i>Big Data: Sublinear Algorithms for Distributed Data
    Streams</i>. Universität Paderborn, 2019. <a href="https://doi.org/10.17619/UNIPB/1-766">https://doi.org/10.17619/UNIPB/1-766</a>.'
  ieee: 'M. Malatyali, <i>Big Data: Sublinear Algorithms for Distributed Data Streams</i>.
    Universität Paderborn, 2019.'
  mla: 'Malatyali, Manuel. <i>Big Data: Sublinear Algorithms for Distributed Data
    Streams</i>. 2019, doi:<a href="https://doi.org/10.17619/UNIPB/1-766">10.17619/UNIPB/1-766</a>.'
  short: 'M. Malatyali, Big Data: Sublinear Algorithms for Distributed Data Streams,
    Universität Paderborn, 2019.'
date_created: 2020-09-04T07:39:47Z
date_updated: 2022-01-06T06:53:56Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-766
language:
- iso: eng
place: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: https://doi.org/10.17619/UNIPB/1-766
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: 'Big Data: Sublinear Algorithms for Distributed Data Streams'
type: dissertation
user_id: '15415'
year: '2019'
...
---
_id: '14851'
author:
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
citation:
  ama: Mäcker A. <i>On Scheduling with Setup Times</i>. Universität Paderborn; 2019.
    doi:<a href="https://doi.org/10.17619/UNIPB/1-828">10.17619/UNIPB/1-828</a>
  apa: Mäcker, A. (2019). <i>On Scheduling with Setup Times</i>. Universität Paderborn.
    <a href="https://doi.org/10.17619/UNIPB/1-828">https://doi.org/10.17619/UNIPB/1-828</a>
  bibtex: '@book{Mäcker_2019, place={Universität Paderborn}, title={On Scheduling
    with Setup Times}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-828">10.17619/UNIPB/1-828</a>},
    author={Mäcker, Alexander}, year={2019} }'
  chicago: Mäcker, Alexander. <i>On Scheduling with Setup Times</i>. Universität Paderborn,
    2019. <a href="https://doi.org/10.17619/UNIPB/1-828">https://doi.org/10.17619/UNIPB/1-828</a>.
  ieee: A. Mäcker, <i>On Scheduling with Setup Times</i>. Universität Paderborn, 2019.
  mla: Mäcker, Alexander. <i>On Scheduling with Setup Times</i>. 2019, doi:<a href="https://doi.org/10.17619/UNIPB/1-828">10.17619/UNIPB/1-828</a>.
  short: A. Mäcker, On Scheduling with Setup Times, Universität Paderborn, 2019.
date_created: 2019-11-07T14:17:05Z
date_updated: 2022-01-06T06:52:08Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-828
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '4'
  name: SFB 901 - Project Area C
related_material:
  link:
  - relation: confirmation
    url: https://doi.org/10.17619/UNIPB/1-828
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: On Scheduling with Setup Times
type: dissertation
user_id: '15415'
year: '2019'
...
---
_id: '10344'
author:
- first_name: Simon
  full_name: Pukrop, Simon
  last_name: Pukrop
citation:
  ama: Pukrop S. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on
    a Single Machine</i>. Universität Paderborn; 2019.
  apa: Pukrop, S. (2019). <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. Universität Paderborn.
  bibtex: '@book{Pukrop_2019, title={Scheduling Algorithms for Multi-Operation Jobs
    with Setups on a Single Machine}, publisher={Universität Paderborn}, author={Pukrop,
    Simon}, year={2019} }'
  chicago: Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. Universität Paderborn, 2019.
  ieee: S. Pukrop, <i>Scheduling Algorithms for Multi-Operation Jobs with Setups on
    a Single Machine</i>. Universität Paderborn, 2019.
  mla: Pukrop, Simon. <i>Scheduling Algorithms for Multi-Operation Jobs with Setups
    on a Single Machine</i>. Universität Paderborn, 2019.
  short: S. Pukrop, Scheduling Algorithms for Multi-Operation Jobs with Setups on
    a Single Machine, Universität Paderborn, 2019.
date_created: 2019-07-04T07:21:19Z
date_updated: 2022-01-06T06:50:37Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
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: Scheduling Algorithms for Multi-Operation Jobs with Setups on a Single Machine
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '25121'
abstract:
- lang: eng
  text: We consider a group of $n$ autonomous mobile robots of which $m$ are stationary
    thus cannot move. Robots are represented by points in the Euclidean plane. They
    have no memory, do not communicate or share a common coordinate system and they
    move solely based on the positioning of other robots within their limited viewing
    range of 1. The goal is to gather the robots inside of the convex hull of all
    stationary robots. A variant of this problem, the general gathering problem, has
    been studied in various different time models. In this work, we consider a continuous
    time model, where robots continuously observe their neighbors, compute the next
    target of movement and move with a speed limit of 1 at any time. Regarding the
    robots' local strategy, we only study contracting algorithms in which every robot
    that is positioned on the border of the convex hull of all robots moves into this
    hull. We present a time bound of $\mathcal{O}(nd)$ for any general contracting
    algorithms in a configuration with only a single stationary robot. For configurations
    with more stationary robots, we prove that robots converge against the convex
    hull of all stationary robots and that no upper bound on the runtime exists. For
    the specific contracting algorithms Go-To-The-Left, Go-On-Bisector and Go-To-The-Middle,
    we provide linear time bounds.
author:
- first_name: David Jan
  full_name: Liedtke, David Jan
  id: '55557'
  last_name: Liedtke
citation:
  ama: Liedtke DJ. <i>Influence of Stationary Robots on Continuous Robot Formation
    Problems</i>.; 2018.
  apa: Liedtke, D. J. (2018). <i>Influence of Stationary Robots on Continuous Robot
    Formation Problems</i>.
  bibtex: '@book{Liedtke_2018, title={Influence of Stationary Robots on Continuous
    Robot Formation Problems}, author={Liedtke, David Jan}, year={2018} }'
  chicago: Liedtke, David Jan. <i>Influence of Stationary Robots on Continuous Robot
    Formation Problems</i>, 2018.
  ieee: D. J. Liedtke, <i>Influence of Stationary Robots on Continuous Robot Formation
    Problems</i>. 2018.
  mla: Liedtke, David Jan. <i>Influence of Stationary Robots on Continuous Robot Formation
    Problems</i>. 2018.
  short: D.J. Liedtke, Influence of Stationary Robots on Continuous Robot Formation
    Problems, 2018.
date_created: 2021-09-29T12:30:40Z
date_updated: 2022-01-06T06:56:52Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: local
  content_type: application/pdf
  creator: liedtke
  date_created: 2021-09-29T12:21:24Z
  date_updated: 2021-09-29T12:21:24Z
  file_id: '25124'
  file_name: Bachelor - Thesis.pdf
  file_size: 6746519
  relation: main_file
file_date_updated: 2021-09-29T12:21:24Z
has_accepted_license: '1'
language:
- iso: eng
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Influence of Stationary Robots on Continuous Robot Formation Problems
type: bachelorsthesis
user_id: '55557'
year: '2018'
...
---
_id: '5403'
author:
- first_name: Marcel
  full_name: Geromel, Marcel
  last_name: Geromel
citation:
  ama: Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.
  apa: Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.
  bibtex: '@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität
    Paderborn}, author={Geromel, Marcel}, year={2018} }'
  chicago: Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn,
    2018.
  ieee: M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.
  mla: Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.
  short: M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.
date_created: 2018-11-07T09:20:59Z
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: Mobile Facility Leasing
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_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: '19604'
author:
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
citation:
  ama: Li S. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität Paderborn;
    2017. doi:<a href="https://doi.org/10.17619/UNIPB/1-252">10.17619/UNIPB/1-252</a>
  apa: Li, S. (2017). <i>Parallel fixed parameter tractable problems</i>. Universität
    Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-252">https://doi.org/10.17619/UNIPB/1-252</a>
  bibtex: '@book{Li_2017, place={Universität Paderborn}, title={Parallel fixed parameter
    tractable problems}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-252">10.17619/UNIPB/1-252</a>},
    author={Li, Shouwei}, year={2017} }'
  chicago: Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. Universität
    Paderborn, 2017. <a href="https://doi.org/10.17619/UNIPB/1-252">https://doi.org/10.17619/UNIPB/1-252</a>.
  ieee: S. Li, <i>Parallel fixed parameter tractable problems</i>. Universität Paderborn,
    2017.
  mla: Li, Shouwei. <i>Parallel Fixed Parameter Tractable Problems</i>. 2017, doi:<a
    href="https://doi.org/10.17619/UNIPB/1-252">10.17619/UNIPB/1-252</a>.
  short: S. Li, Parallel Fixed Parameter Tractable Problems, Universität Paderborn,
    2017.
date_created: 2020-09-21T13:52:09Z
date_updated: 2022-01-06T06:54:07Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-252
language:
- iso: eng
place: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: '10.17619/UNIPB/1-252 '
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Parallel fixed parameter tractable problems
type: dissertation
user_id: '15415'
year: '2017'
...
---
_id: '703'
author:
- first_name: Pavel
  full_name: Podlipyan, Pavel
  last_name: Podlipyan
citation:
  ama: Podlipyan P. <i>Local Algorithms for the Continuous Gathering Problem</i>.
    Universität Paderborn; 2017. doi:<a href="https://doi.org/10.17619/UNIPB/1-230">10.17619/UNIPB/1-230</a>
  apa: Podlipyan, P. (2017). <i>Local Algorithms for the Continuous Gathering Problem</i>.
    Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-230">https://doi.org/10.17619/UNIPB/1-230</a>
  bibtex: '@book{Podlipyan_2017, title={Local Algorithms for the Continuous Gathering
    Problem}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-230">10.17619/UNIPB/1-230</a>},
    publisher={Universität Paderborn}, author={Podlipyan, Pavel}, year={2017} }'
  chicago: Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>.
    Universität Paderborn, 2017. <a href="https://doi.org/10.17619/UNIPB/1-230">https://doi.org/10.17619/UNIPB/1-230</a>.
  ieee: P. Podlipyan, <i>Local Algorithms for the Continuous Gathering Problem</i>.
    Universität Paderborn, 2017.
  mla: Podlipyan, Pavel. <i>Local Algorithms for the Continuous Gathering Problem</i>.
    Universität Paderborn, 2017, doi:<a href="https://doi.org/10.17619/UNIPB/1-230">10.17619/UNIPB/1-230</a>.
  short: P. Podlipyan, Local Algorithms for the Continuous Gathering Problem, Universität
    Paderborn, 2017.
date_created: 2017-11-14T14:13:21Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '63'
doi: 10.17619/UNIPB/1-230
language:
- iso: eng
publisher: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: https://doi.org/10.17619/UNIPB/1-230
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Local Algorithms for the Continuous Gathering Problem
type: dissertation
user_id: '15415'
year: '2017'
...
---
_id: '704'
author:
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: Riechers S. <i>Scheduling with Scarce Resources</i>. Universität Paderborn;
    2017. doi:<a href="https://doi.org/10.17619/UNIPB/1-231">10.17619/UNIPB/1-231</a>
  apa: Riechers, S. (2017). <i>Scheduling with Scarce Resources</i>. Universität Paderborn.
    <a href="https://doi.org/10.17619/UNIPB/1-231">https://doi.org/10.17619/UNIPB/1-231</a>
  bibtex: '@book{Riechers_2017, title={Scheduling with Scarce Resources}, DOI={<a
    href="https://doi.org/10.17619/UNIPB/1-231">10.17619/UNIPB/1-231</a>}, publisher={Universität
    Paderborn}, author={Riechers, Sören}, year={2017} }'
  chicago: Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn,
    2017. <a href="https://doi.org/10.17619/UNIPB/1-231">https://doi.org/10.17619/UNIPB/1-231</a>.
  ieee: S. Riechers, <i>Scheduling with Scarce Resources</i>. Universität Paderborn,
    2017.
  mla: Riechers, Sören. <i>Scheduling with Scarce Resources</i>. Universität Paderborn,
    2017, doi:<a href="https://doi.org/10.17619/UNIPB/1-231">10.17619/UNIPB/1-231</a>.
  short: S. Riechers, Scheduling with Scarce Resources, Universität Paderborn, 2017.
date_created: 2017-11-15T07:51:07Z
date_updated: 2022-01-06T07:03:27Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-231
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-11-14T15:18:37Z
  date_updated: 2018-11-14T15:18:37Z
  file_id: '5673'
  file_name: thesisStable.pdf
  file_size: 1491627
  relation: main_file
  success: 1
file_date_updated: 2018-11-14T15:18:37Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
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: Scheduling with Scarce Resources
type: dissertation
user_id: '14052'
year: '2017'
...
---
_id: '688'
author:
- first_name: Damian
  full_name: Kutzias, Damian
  last_name: Kutzias
citation:
  ama: Kutzias D. <i>Friendship Processes in Network Creation Games</i>. Universität
    Paderborn; 2016.
  apa: Kutzias, D. (2016). <i>Friendship Processes in Network Creation Games</i>.
    Universität Paderborn.
  bibtex: '@book{Kutzias_2016, title={Friendship Processes in Network Creation Games},
    publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }'
  chicago: Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>.
    Universität Paderborn, 2016.
  ieee: D. Kutzias, <i>Friendship Processes in Network Creation Games</i>. Universität
    Paderborn, 2016.
  mla: Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität
    Paderborn, 2016.
  short: D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn,
    2016.
date_created: 2017-11-14T06:50:35Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
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: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Friendship Processes in Network Creation Games
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '689'
author:
- first_name: Johannes Sebastian
  full_name: Schaefer, Johannes Sebastian
  id: '30291'
  last_name: Schaefer
citation:
  ama: Schaefer JS. <i>Routing Algorithms on Delayed Networks for Disaster Management
    Support</i>. Universität Paderborn; 2016.
  apa: Schaefer, J. S. (2016). <i>Routing Algorithms on Delayed Networks for Disaster
    Management Support</i>. Universität Paderborn.
  bibtex: '@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for
    Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer,
    Johannes Sebastian}, year={2016} }'
  chicago: Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks
    for Disaster Management Support</i>. Universität Paderborn, 2016.
  ieee: J. S. Schaefer, <i>Routing Algorithms on Delayed Networks for Disaster Management
    Support</i>. Universität Paderborn, 2016.
  mla: Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for
    Disaster Management Support</i>. Universität Paderborn, 2016.
  short: J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management
    Support, Universität Paderborn, 2016.
date_created: 2017-11-14T06:51:37Z
date_updated: 2022-01-06T07:03:23Z
department:
- _id: '63'
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: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Routing Algorithms on Delayed Networks for Disaster Management Support
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '154'
author:
- first_name: Andreas
  full_name: Cord-Landwehr, Andreas
  last_name: Cord-Landwehr
citation:
  ama: Cord-Landwehr A. <i>Selfish Network Creation - On Variants of Network Creation
    Games</i>. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
    2016.
  apa: Cord-Landwehr, A. (2016). <i>Selfish Network Creation - On Variants of Network
    Creation Games</i> (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn.
  bibtex: '@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf
    Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network
    Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf
    Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn} }'
  chicago: Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network
    Creation Games</i>. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
    Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
  ieee: A. Cord-Landwehr, <i>Selfish Network Creation - On Variants of Network Creation
    Games</i>, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
    2016.
  mla: Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network
    Creation Games</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
    2016.
  short: A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation
    Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:23Z
ddc:
- '040'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:52:03Z
  date_updated: 2018-03-21T12:52:03Z
  file_id: '1551'
  file_name: 154-dissertation.pdf
  file_size: 800101
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:52:03Z
has_accepted_license: '1'
intvolume: '       353'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication_identifier:
  isbn:
  - 978-3-942647-72-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Selfish Network Creation - On Variants of Network Creation Games
type: dissertation
user_id: '5786'
volume: 353
year: '2016'
...
---
_id: '267'
author:
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
citation:
  ama: Markarian C. <i>Online Resource Leasing</i>. Universität Paderborn; 2015.
  apa: Markarian, C. (2015). <i>Online Resource Leasing</i>. Universität Paderborn.
  bibtex: '@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität
    Paderborn}, author={Markarian, Christine}, year={2015} }'
  chicago: Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn,
    2015.
  ieee: C. Markarian, <i>Online Resource Leasing</i>. Universität Paderborn, 2015.
  mla: Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn,
    2015.
  short: C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:26Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:33:41Z
  date_updated: 2018-03-21T09:33:41Z
  file_id: '1479'
  file_name: 267-Dissertation_-_Markarian.pdf
  file_size: 1328685
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:33:41Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Online Resource Leasing
type: dissertation
user_id: '15415'
year: '2015'
...