---
_id: '17371'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Castenow J, Kling P, Knollmann T, Meyer auf der Heide F. Brief Announcement:
    A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down
    to Speed up. In: <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
    and Architectures</i>. ; 2020. doi:<a href="https://doi.org/10.1145/3350755.3400263">10.1145/3350755.3400263</a>'
  apa: 'Castenow, J., Kling, P., Knollmann, T., &#38; Meyer auf der Heide, F. (2020).
    Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation
    Problem: Slow Down to Speed up. In <i>Proceedings of the 32nd ACM Symposium on
    Parallelism in Algorithms and Architectures</i>. <a href="https://doi.org/10.1145/3350755.3400263">https://doi.org/10.1145/3350755.3400263</a>'
  bibtex: '@inproceedings{Castenow_Kling_Knollmann_Meyer auf der Heide_2020, title={Brief
    Announcement: A Discrete and Continuous Study of the Max-Chain-Formation Problem:
    Slow Down to Speed up}, DOI={<a href="https://doi.org/10.1145/3350755.3400263">10.1145/3350755.3400263</a>},
    booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
    and Architectures}, author={Castenow, Jannik and Kling, Peter and Knollmann, Till
    and Meyer auf der Heide, Friedhelm}, year={2020} }'
  chicago: 'Castenow, Jannik, Peter Kling, Till Knollmann, and Friedhelm Meyer auf
    der Heide. “Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation
    Problem: Slow Down to Speed Up.” In <i>Proceedings of the 32nd ACM Symposium on
    Parallelism in Algorithms and Architectures</i>, 2020. <a href="https://doi.org/10.1145/3350755.3400263">https://doi.org/10.1145/3350755.3400263</a>.'
  ieee: 'J. Castenow, P. Kling, T. Knollmann, and F. Meyer auf der Heide, “Brief Announcement:
    A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down
    to Speed up,” in <i>Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
    and Architectures</i>, 2020.'
  mla: 'Castenow, Jannik, et al. “Brief Announcement: A Discrete and Continuous Study
    of the Max-Chain-Formation Problem: Slow Down to Speed Up.” <i>Proceedings of
    the 32nd ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2020,
    doi:<a href="https://doi.org/10.1145/3350755.3400263">10.1145/3350755.3400263</a>.'
  short: 'J. Castenow, P. Kling, T. Knollmann, F. Meyer auf der Heide, in: Proceedings
    of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020.'
date_created: 2020-07-14T07:53:47Z
date_updated: 2022-01-06T06:53:10Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3350755.3400263
external_id:
  arxiv:
  - '2010.02043 '
file:
- access_level: closed
  content_type: application/pdf
  creator: janniksu
  date_created: 2020-07-14T07:56:04Z
  date_updated: 2020-07-14T07:56:04Z
  file_id: '17372'
  file_name: 3350755.3400263.pdf
  file_size: 1078544
  relation: main_file
  success: 1
file_date_updated: 2020-07-14T07:56:04Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
  Architectures
publication_identifier:
  isbn:
  - '9781450369350'
publication_status: published
status: public
title: 'Brief Announcement: A Discrete and Continuous Study of the Max-Chain-Formation
  Problem: Slow Down to Speed up'
type: conference
user_id: '38705'
year: '2020'
...
---
_id: '16968'
abstract:
- lang: eng
  text: "In this work, we initiate the research about the Gathering problem for robots\r\nwith
    limited viewing range in the three-dimensional Euclidean space. In the\r\nGathering
    problem, a set of initially scattered robots is required to gather at\r\nthe same
    position. The robots' capabilities are very restricted -- they do not\r\nagree
    on any coordinate system or compass, have a limited viewing range, have\r\nno
    memory of the past and cannot communicate. We study the problem in two\r\ndifferent
    time models, in FSYNC (fully synchronized discrete rounds) and the\r\ncontinuous
    time model. For FSYNC, we introduce the 3D-Go-To-The-Center-strategy\r\nand prove
    a runtime of $\\Theta(n^2)$ that matches the currently best runtime\r\nbound for
    the same model in the Euclidean plane [SPAA'11]. Our main result is\r\nthe generalization
    of contracting strategies (continuous time) from\r\n[Algosensors'17] to three
    dimensions. In contracting strategies, every robot\r\nthat is located on the global
    convex hull of all robots' positions moves with\r\nfull speed towards the inside
    of the convex hull. We prove a runtime bound of\r\n$O(\\Delta \\cdot n^{3/2})$
    for any three-dimensional contracting strategy, where\r\n$\\Delta$ denotes the
    diameter of the initial configuration. This comes up to a\r\nfactor of $\\sqrt{n}$
    close to the lower bound of $\\Omega (\\Delta \\cdot n)$\r\nwhich is already true
    in two dimensions. In general, it might be hard for\r\nrobots with limited viewing
    range to decide whether they are located on the\r\nglobal convex hull and which
    movement maintains the connectivity of the swarm,\r\nrendering the design of concrete
    contracting strategies a challenging task. We\r\nprove that the continuous variant
    of 3D-Go-To-The-Center is contracting and\r\nkeeps the swarm connected. Moreover,
    we give a simple design criterion for\r\nthree-dimensional contracting strategies
    that maintains the connectivity of the\r\nswarm and introduce an exemplary strategy
    based on this criterion."
- lang: eng
  text: Best Student Paper Award
author:
- first_name: Michael
  full_name: Braun, Michael
  last_name: Braun
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Braun M, Castenow J, Meyer auf der Heide F. Local Gathering of Mobile Robots
    in Three Dimensions. In: <i>Proceedings of the 27th Conference on Structural Information
    and Communication Complexity (SIROCCO)</i>. Springer; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-54921-3_4">10.1007/978-3-030-54921-3_4</a>'
  apa: 'Braun, M., Castenow, J., &#38; Meyer auf der Heide, F. (2020). Local Gathering
    of Mobile Robots in Three Dimensions. In <i>Proceedings of the 27th Conference
    on Structural Information and Communication Complexity (SIROCCO)</i>. Paderborn:
    Springer. <a href="https://doi.org/10.1007/978-3-030-54921-3_4">https://doi.org/10.1007/978-3-030-54921-3_4</a>'
  bibtex: '@inproceedings{Braun_Castenow_Meyer auf der Heide_2020, title={Local Gathering
    of Mobile Robots in Three Dimensions}, DOI={<a href="https://doi.org/10.1007/978-3-030-54921-3_4">10.1007/978-3-030-54921-3_4</a>},
    booktitle={Proceedings of the 27th Conference on Structural Information and Communication
    Complexity (SIROCCO)}, publisher={Springer}, author={Braun, Michael and Castenow,
    Jannik and Meyer auf der Heide, Friedhelm}, year={2020} }'
  chicago: Braun, Michael, Jannik Castenow, and Friedhelm Meyer auf der Heide. “Local
    Gathering of Mobile Robots in Three Dimensions.” In <i>Proceedings of the 27th
    Conference on Structural Information and Communication Complexity (SIROCCO)</i>.
    Springer, 2020. <a href="https://doi.org/10.1007/978-3-030-54921-3_4">https://doi.org/10.1007/978-3-030-54921-3_4</a>.
  ieee: M. Braun, J. Castenow, and F. Meyer auf der Heide, “Local Gathering of Mobile
    Robots in Three Dimensions,” in <i>Proceedings of the 27th Conference on Structural
    Information and Communication Complexity (SIROCCO)</i>, Paderborn, 2020.
  mla: Braun, Michael, et al. “Local Gathering of Mobile Robots in Three Dimensions.”
    <i>Proceedings of the 27th Conference on Structural Information and Communication
    Complexity (SIROCCO)</i>, Springer, 2020, doi:<a href="https://doi.org/10.1007/978-3-030-54921-3_4">10.1007/978-3-030-54921-3_4</a>.
  short: 'M. Braun, J. Castenow, F. Meyer auf der Heide, in: Proceedings of the 27th
    Conference on Structural Information and Communication Complexity (SIROCCO), Springer,
    2020.'
conference:
  end_date: 2020-07-01
  location: Paderborn
  name: SIROCCO 2020
  start_date: 2020-06-29
date_created: 2020-05-18T06:48:35Z
date_updated: 2022-01-06T06:53:00Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-030-54921-3_4
external_id:
  arxiv:
  - arXiv:2005.07495
file:
- access_level: closed
  content_type: application/pdf
  creator: janniksu
  date_created: 2020-07-31T08:22:16Z
  date_updated: 2020-07-31T08:22:16Z
  file_id: '17504'
  file_name: localGathering.pdf
  file_size: 505712
  relation: main_file
  success: 1
file_date_updated: 2020-07-31T08:22:16Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proceedings of the 27th Conference on Structural Information and Communication
  Complexity (SIROCCO)
publisher: Springer
status: public
title: Local Gathering of Mobile Robots in Three Dimensions
type: conference
user_id: '38705'
year: '2020'
...
---
_id: '16299'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Jonas
  full_name: Harbig, Jonas
  last_name: Harbig
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous,
    Oblivious Robots on a Grid. <i>Theoretical Computer Science</i>. 2020;815:289-309.
    doi:<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>
  apa: Castenow, J., Fischer, M., Harbig, J., Jung, D., &#38; Meyer auf der Heide,
    F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. <i>Theoretical Computer
    Science</i>, <i>815</i>, 289–309. <a href="https://doi.org/10.1016/j.tcs.2020.02.018">https://doi.org/10.1016/j.tcs.2020.02.018</a>
  bibtex: '@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering
    Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>},
    journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer,
    Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm},
    year={2020}, pages={289–309} }'
  chicago: 'Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm
    Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>Theoretical
    Computer Science</i> 815 (2020): 289–309. <a href="https://doi.org/10.1016/j.tcs.2020.02.018">https://doi.org/10.1016/j.tcs.2020.02.018</a>.'
  ieee: J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering
    Anonymous, Oblivious Robots on a Grid,” <i>Theoretical Computer Science</i>, vol.
    815, pp. 289–309, 2020.
  mla: Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
    <i>Theoretical Computer Science</i>, vol. 815, 2020, pp. 289–309, doi:<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>.
  short: J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical
    Computer Science 815 (2020) 289–309.
date_created: 2020-03-13T12:55:53Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.02.018
intvolume: '       815'
language:
- iso: eng
page: 289-309
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: journal_article
user_id: '38705'
volume: 815
year: '2020'
...
---
_id: '13868'
author:
- first_name: Simon
  full_name: Pukrop, Simon
  id: '44428'
  last_name: Pukrop
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Pukrop S, Mäcker A, Meyer auf der Heide F. Approximating Weighted Completion
    Time for Order Scheduling with Setup Times. In: <i>Proceedings of the 46th International
    Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>.
    ; 2020.'
  apa: Pukrop, S., Mäcker, A., &#38; Meyer auf der Heide, F. (2020). Approximating
    Weighted Completion Time for Order Scheduling with Setup Times. In <i>Proceedings
    of the 46th International Conference on Current Trends in Theory and Practice
    of Computer Science (SOFSEM)</i>.
  bibtex: '@inproceedings{Pukrop_Mäcker_Meyer auf der Heide_2020, title={Approximating
    Weighted Completion Time for Order Scheduling with Setup Times}, booktitle={Proceedings
    of the 46th International Conference on Current Trends in Theory and Practice
    of Computer Science (SOFSEM)}, author={Pukrop, Simon and Mäcker, Alexander and
    Meyer auf der Heide, Friedhelm}, year={2020} }'
  chicago: Pukrop, Simon, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Approximating
    Weighted Completion Time for Order Scheduling with Setup Times.” In <i>Proceedings
    of the 46th International Conference on Current Trends in Theory and Practice
    of Computer Science (SOFSEM)</i>, 2020.
  ieee: S. Pukrop, A. Mäcker, and F. Meyer auf der Heide, “Approximating Weighted
    Completion Time for Order Scheduling with Setup Times,” in <i>Proceedings of the
    46th International Conference on Current Trends in Theory and Practice of Computer
    Science (SOFSEM)</i>, 2020.
  mla: Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling
    with Setup Times.” <i>Proceedings of the 46th International Conference on Current
    Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020.
  short: 'S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th
    International Conference on Current Trends in Theory and Practice of Computer
    Science (SOFSEM), 2020.'
date_created: 2019-10-15T12:19:49Z
date_updated: 2022-01-06T06:51:45Z
department:
- _id: '63'
language:
- iso: eng
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subproject C4
publication: Proceedings of the 46th International Conference on Current Trends in
  Theory and Practice of Computer Science (SOFSEM)
status: public
title: Approximating Weighted Completion Time for Order Scheduling with Setup Times
type: conference
user_id: '44428'
year: '2020'
...
---
_id: '13770'
author:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT
    Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>.
    2020;62(6):467-481. doi:<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>'
  apa: 'Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020).
    A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information
    Systems Engineering</i>, <i>62</i>(6), 467–481. <a href="https://doi.org/10.1007/s12599-019-00627-x">https://doi.org/10.1007/s12599-019-00627-x</a>'
  bibtex: '@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case
    for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>},
    number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer},
    author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and
    Wehrheim, Heike}, year={2020}, pages={467–481} }'
  chicago: 'Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike
    Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38;
    Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href="https://doi.org/10.1007/s12599-019-00627-x">https://doi.org/10.1007/s12599-019-00627-x</a>.'
  ieee: 'H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for
    a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems
    Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>.'
  mla: 'Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.”
    <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer,
    2020, pp. 467–81, doi:<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>.'
  short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38;
    Information Systems Engineering 62 (2020) 467–481.
date_created: 2019-10-10T13:41:06Z
date_updated: 2022-12-02T09:27:17Z
ddc:
- '004'
department:
- _id: '276'
- _id: '75'
- _id: '63'
- _id: '77'
doi: 10.1007/s12599-019-00627-x
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-12-12T10:24:47Z
  date_updated: 2019-12-12T10:24:47Z
  file_id: '15311'
  file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf
  file_size: 454532
  relation: main_file
  success: 1
file_date_updated: 2019-12-12T10:24:47Z
has_accepted_license: '1'
intvolume: '        62'
issue: '6'
language:
- iso: eng
page: 467-481
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '82'
  name: SFB 901 - Project Area T
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '6'
  name: SFB 901 - Subproject A2
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '8'
  name: SFB 901 - Subproject A4
- _id: '9'
  name: SFB 901 - Subproject B1
- _id: '10'
  name: SFB 901 - Subproject B2
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '12'
  name: SFB 901 - Subproject B4
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '14'
  name: SFB 901 - Subproject C2
- _id: '15'
  name: SFB 901 - Subproject C3
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '17'
  name: SFB 901 - Subproject C5
- _id: '83'
  name: SFB 901 -Subproject T1
- _id: '84'
  name: SFB 901 -Subproject T2
- _id: '107'
  name: SFB 901 -Subproject T3
- _id: '158'
  name: 'SFB 901 - T4: SFB 901 -Subproject T4'
publication: Business & Information Systems Engineering
publication_status: published
publisher: Springer
status: public
title: 'A Case for a New IT Ecosystem: On-The-Fly Computing'
type: journal_article
user_id: '477'
volume: 62
year: '2020'
...
---
_id: '12870'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Manuel
  full_name: Malatyali, Manuel
  last_name: Malatyali
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple
    Mobile Resources. In: <i>Proceedings of the 17th Workshop on Approximation and
    Online Algorithms (WAOA)</i>. Springer; 2019:120-137. doi:<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>'
  apa: Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2019).
    Managing Multiple Mobile Resources. In <i>Proceedings of the 17th Workshop on
    Approximation and Online Algorithms (WAOA)</i> (pp. 120–137). Springer. <a href="https://doi.org/10.1007/978-3-030-39479-0_9">https://doi.org/10.1007/978-3-030-39479-0_9</a>
  bibtex: '@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing
    Multiple Mobile Resources}, DOI={<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>},
    booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms
    (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and
    Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137}
    }'
  chicago: Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer
    auf der Heide. “Managing Multiple Mobile Resources.” In <i>Proceedings of the
    17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 120–37. Springer,
    2019. <a href="https://doi.org/10.1007/978-3-030-39479-0_9">https://doi.org/10.1007/978-3-030-39479-0_9</a>.
  ieee: B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing
    Multiple Mobile Resources,” in <i>Proceedings of the 17th Workshop on Approximation
    and Online Algorithms (WAOA)</i>, 2019, pp. 120–137.
  mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Proceedings
    of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, Springer,
    2019, pp. 120–37, doi:<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>.
  short: 'B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
    of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer,
    2019, pp. 120–137.'
date_created: 2019-07-22T09:00:05Z
date_updated: 2022-01-06T06:51:20Z
department:
- _id: '63'
doi: 10.1007/978-3-030-39479-0_9
external_id:
  arxiv:
  - '1907.09834'
language:
- iso: eng
page: 120 - 137
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 17th Workshop on Approximation and Online Algorithms
  (WAOA)
publication_status: published
publisher: Springer
status: public
title: Managing Multiple Mobile Resources
type: conference
user_id: '22704'
year: '2019'
...
---
_id: '16337'
author:
- first_name: Sascha
  full_name: Brandt, Sascha
  id: '11648'
  last_name: Brandt
  orcid: https://orcid.org/0000-0003-3546-203X
- first_name: Claudius
  full_name: Jähn, Claudius
  last_name: Jähn
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Brandt S, Jähn C, Fischer M, Meyer auf der Heide F. Visibility‐Aware Progressive
    Farthest Point Sampling on the GPU. <i>Computer Graphics Forum</i>. 2019;38(7):413-424.
    doi:<a href="https://doi.org/10.1111/cgf.13848">10.1111/cgf.13848</a>
  apa: Brandt, S., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2019). Visibility‐Aware
    Progressive Farthest Point Sampling on the GPU. <i>Computer Graphics Forum</i>,
    <i>38</i>(7), 413–424. <a href="https://doi.org/10.1111/cgf.13848">https://doi.org/10.1111/cgf.13848</a>
  bibtex: '@article{Brandt_Jähn_Fischer_Meyer auf der Heide_2019, title={Visibility‐Aware
    Progressive Farthest Point Sampling on the GPU}, volume={38}, DOI={<a href="https://doi.org/10.1111/cgf.13848">10.1111/cgf.13848</a>},
    number={7}, journal={Computer Graphics Forum}, author={Brandt, Sascha and Jähn,
    Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2019},
    pages={413–424} }'
  chicago: 'Brandt, Sascha, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf
    der Heide. “Visibility‐Aware Progressive Farthest Point Sampling on the GPU.”
    <i>Computer Graphics Forum</i> 38, no. 7 (2019): 413–24. <a href="https://doi.org/10.1111/cgf.13848">https://doi.org/10.1111/cgf.13848</a>.'
  ieee: S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Visibility‐Aware
    Progressive Farthest Point Sampling on the GPU,” <i>Computer Graphics Forum</i>,
    vol. 38, no. 7, pp. 413–424, 2019.
  mla: Brandt, Sascha, et al. “Visibility‐Aware Progressive Farthest Point Sampling
    on the GPU.” <i>Computer Graphics Forum</i>, vol. 38, no. 7, 2019, pp. 413–24,
    doi:<a href="https://doi.org/10.1111/cgf.13848">10.1111/cgf.13848</a>.
  short: S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, Computer Graphics
    Forum 38 (2019) 413–424.
conference:
  end_date: 2019-10-17
  location: Seoul, South Korea
  name: Pacific Graphics 2019
  start_date: 2019-10-14
date_created: 2020-03-24T08:24:11Z
date_updated: 2022-01-06T06:52:49Z
doi: 10.1111/cgf.13848
intvolume: '        38'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://onlinelibrary.wiley.com/doi/pdf/10.1111/cgf.13848
oa: '1'
page: 413-424
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 0167-7055
  - 1467-8659
publication_status: published
status: public
title: Visibility‐Aware Progressive Farthest Point Sampling on the GPU
type: journal_article
user_id: '11648'
volume: 38
year: '2019'
...
---
_id: '16341'
abstract:
- lang: eng
  text: "We present a technique for rendering highly complex 3D scenes in real-time
    by\r\ngenerating uniformly distributed points on the scene's visible surfaces.
    The\r\ntechnique is applicable to a wide range of scene types, like scenes directly\r\nbased
    on complex and detailed CAD data consisting of billions of polygons (in\r\ncontrast
    to scenes handcrafted solely for visualization). This allows to\r\nvisualize such
    scenes smoothly even in VR on a HMD with good image quality,\r\nwhile maintaining
    the necessary frame-rates. In contrast to other point based\r\nrendering methods,
    we place points in an approximated blue noise distribution\r\nonly on visible
    surfaces and store them in a highly GPU efficient data\r\nstructure, allowing
    to progressively refine the number of rendered points to\r\nmaximize the image
    quality for a given target frame rate. Our evaluation shows\r\nthat scenes consisting
    of a high amount of polygons can be rendered with\r\ninteractive frame rates with
    good visual quality on standard hardware."
author:
- first_name: Sascha
  full_name: Brandt, Sascha
  id: '11648'
  last_name: Brandt
  orcid: 0000-0003-3546-203X
- first_name: Claudius
  full_name: Jähn, Claudius
  last_name: Jähn
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Brandt S, Jähn C, Fischer M, Meyer auf der Heide F. Rendering of Complex Heterogenous
    Scenes using Progressive Blue Surfels. <i>arXiv:190408225</i>. 2019.
  apa: Brandt, S., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2019). Rendering
    of Complex Heterogenous Scenes using Progressive Blue Surfels. <i>ArXiv:1904.08225</i>.
  bibtex: '@article{Brandt_Jähn_Fischer_Meyer auf der Heide_2019, title={Rendering
    of Complex Heterogenous Scenes using Progressive Blue Surfels}, journal={arXiv:1904.08225},
    author={Brandt, Sascha and Jähn, Claudius and Fischer, Matthias and Meyer auf
    der Heide, Friedhelm}, year={2019} }'
  chicago: Brandt, Sascha, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf
    der Heide. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.”
    <i>ArXiv:1904.08225</i>, 2019.
  ieee: S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Rendering of
    Complex Heterogenous Scenes using Progressive Blue Surfels,” <i>arXiv:1904.08225</i>.
    2019.
  mla: Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive
    Blue Surfels.” <i>ArXiv:1904.08225</i>, 2019.
  short: S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, ArXiv:1904.08225
    (2019).
date_created: 2020-03-24T08:59:44Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
external_id:
  arxiv:
  - '1904.08225'
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
publication: arXiv:1904.08225
status: public
title: Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels
type: preprint
user_id: '15415'
year: '2019'
...
---
_id: '13873'
article_number: '14'
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. <i>ACM Transactions
    on Parallel Computing (TOPC)</i>. 2019;6(3). doi:<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>
  apa: Feldkord, B., &#38; Meyer auf der Heide, F. (2019). The Mobile Server Problem.
    <i>ACM Transactions on Parallel Computing (TOPC)</i>, <i>6</i>(3). <a href="https://doi.org/10.1145/3364204">https://doi.org/10.1145/3364204</a>
  bibtex: '@article{Feldkord_Meyer auf der Heide_2019, title={The Mobile Server Problem},
    volume={6}, DOI={<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>},
    number={314}, journal={ACM Transactions on Parallel Computing (TOPC)}, author={Feldkord,
    Björn and Meyer auf der Heide, Friedhelm}, year={2019} }'
  chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server
    Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i> 6, no. 3 (2019).
    <a href="https://doi.org/10.1145/3364204">https://doi.org/10.1145/3364204</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” <i>ACM
    Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 2019.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”
    <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 14, 2019,
    doi:<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>.
  short: B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing
    (TOPC) 6 (2019).
date_created: 2019-10-16T07:06:22Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3364204
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2020-01-24T08:12:58Z
  date_updated: 2020-01-24T08:12:58Z
  file_id: '15632'
  file_name: DissertationFeldkord.pdf
  file_size: 633652
  relation: main_file
  success: 1
file_date_updated: 2020-01-24T08:12:58Z
has_accepted_license: '1'
intvolume: '         6'
issue: '3'
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: ACM Transactions on Parallel Computing (TOPC)
publication_status: published
status: public
title: The Mobile Server Problem
type: journal_article
user_id: '15504'
volume: 6
year: '2019'
...
---
_id: '13937'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Meyer auf der Heide F. Paul Curzon, Peter W. McOwan: Computational Thinking;
    Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln. <i>Mathematische
    Semesterberichte</i>. 2019;66(2):259-260. doi:<a href="https://doi.org/10.1007/s00591-019-00249-0">10.1007/s00591-019-00249-0</a>'
  apa: 'Meyer auf der Heide, F. (2019). Paul Curzon, Peter W. McOwan: Computational
    Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und
    Rätseln. <i>Mathematische Semesterberichte</i>, <i>66</i>(2), 259–260. <a href="https://doi.org/10.1007/s00591-019-00249-0">https://doi.org/10.1007/s00591-019-00249-0</a>'
  bibtex: '@article{Meyer auf der Heide_2019, title={Paul Curzon, Peter W. McOwan:
    Computational Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks
    und Rätseln}, volume={66}, DOI={<a href="https://doi.org/10.1007/s00591-019-00249-0">10.1007/s00591-019-00249-0</a>},
    number={2}, journal={Mathematische Semesterberichte}, author={Meyer auf der Heide,
    Friedhelm}, year={2019}, pages={259–260} }'
  chicago: 'Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational
    Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und
    Rätseln.” <i>Mathematische Semesterberichte</i> 66, no. 2 (2019): 259–60. <a href="https://doi.org/10.1007/s00591-019-00249-0">https://doi.org/10.1007/s00591-019-00249-0</a>.'
  ieee: 'F. Meyer auf der Heide, “Paul Curzon, Peter W. McOwan: Computational Thinking;
    Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und Rätseln,”
    <i>Mathematische Semesterberichte</i>, vol. 66, no. 2, pp. 259–260, 2019.'
  mla: 'Meyer auf der Heide, Friedhelm. “Paul Curzon, Peter W. McOwan: Computational
    Thinking; Die Welt des algorithmischen Denkens – in Spielen, Zaubertricks und
    Rätseln.” <i>Mathematische Semesterberichte</i>, vol. 66, no. 2, 2019, pp. 259–60,
    doi:<a href="https://doi.org/10.1007/s00591-019-00249-0">10.1007/s00591-019-00249-0</a>.'
  short: F. Meyer auf der Heide, Mathematische Semesterberichte 66 (2019) 259–260.
date_created: 2019-10-21T08:54:14Z
date_updated: 2022-01-06T06:51:47Z
department:
- _id: '63'
doi: 10.1007/s00591-019-00249-0
intvolume: '        66'
issue: '2'
language:
- iso: ger
page: 259-260
publication: Mathematische Semesterberichte
publication_status: published
status: public
title: 'Paul Curzon, Peter W. McOwan: Computational Thinking; Die Welt des algorithmischen
  Denkens – in Spielen, Zaubertricks und Rätseln'
type: journal_article
user_id: '15415'
volume: 66
year: '2019'
...
---
_id: '13939'
author:
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Kling P, Meyer auf der Heide F. Continuous Protocols for Swarm Robotics. In:
    <i>Distributed Computing by Mobile Entities, Current Research in Moving and Computing</i>.
    Vol 11340. Lecture Notes in Computer Science. Springer; 2019:317-334. doi:<a href="https://doi.org/10.1007/978-3-030-11072-7\_13">10.1007/978-3-030-11072-7\_13</a>'
  apa: Kling, P., &#38; Meyer auf der Heide, F. (2019). Continuous Protocols for Swarm
    Robotics. In <i>Distributed Computing by Mobile Entities, Current Research in
    Moving and Computing</i> (Vol. 11340, pp. 317–334). Springer. <a href="https://doi.org/10.1007/978-3-030-11072-7\_13">https://doi.org/10.1007/978-3-030-11072-7\_13</a>
  bibtex: '@inbook{Kling_Meyer auf der Heide_2019, series={Lecture Notes in Computer
    Science}, title={Continuous Protocols for Swarm Robotics}, volume={11340}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-11072-7\_13">10.1007/978-3-030-11072-7\_13</a>},
    booktitle={Distributed Computing by Mobile Entities, Current Research in Moving
    and Computing}, publisher={Springer}, author={Kling, Peter and Meyer auf der Heide,
    Friedhelm}, year={2019}, pages={317–334}, collection={Lecture Notes in Computer
    Science} }'
  chicago: Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols
    for Swarm Robotics.” In <i>Distributed Computing by Mobile Entities, Current Research
    in Moving and Computing</i>, 11340:317–34. Lecture Notes in Computer Science.
    Springer, 2019. <a href="https://doi.org/10.1007/978-3-030-11072-7\_13">https://doi.org/10.1007/978-3-030-11072-7\_13</a>.
  ieee: P. Kling and F. Meyer auf der Heide, “Continuous Protocols for Swarm Robotics,”
    in <i>Distributed Computing by Mobile Entities, Current Research in Moving and
    Computing</i>, vol. 11340, Springer, 2019, pp. 317–334.
  mla: Kling, Peter, and Friedhelm Meyer auf der Heide. “Continuous Protocols for
    Swarm Robotics.” <i>Distributed Computing by Mobile Entities, Current Research
    in Moving and Computing</i>, vol. 11340, Springer, 2019, pp. 317–34, doi:<a href="https://doi.org/10.1007/978-3-030-11072-7\_13">10.1007/978-3-030-11072-7\_13</a>.
  short: 'P. Kling, F. Meyer auf der Heide, in: Distributed Computing by Mobile Entities,
    Current Research in Moving and Computing, Springer, 2019, pp. 317–334.'
date_created: 2019-10-21T13:20:43Z
date_updated: 2022-01-06T06:51:47Z
department:
- _id: '63'
doi: 10.1007/978-3-030-11072-7\_13
intvolume: '     11340'
language:
- iso: eng
page: 317-334
publication: Distributed Computing by Mobile Entities, Current Research in Moving
  and Computing
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Continuous Protocols for Swarm Robotics
type: book_chapter
user_id: '15415'
volume: 11340
year: '2019'
...
---
_id: '13942'
author:
- 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: 'Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover
    and Leasing Non-metric Facility Location. In: <i>Proceedings of the 8th International
    Conference on Operations Research and Enterprise Systems</i>. SciTePress; 2019:315-321.
    doi:<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>'
  apa: Markarian, C., &#38; Meyer auf der Heide, F. (2019). Online Algorithms for
    Leasing Vertex Cover and Leasing Non-metric Facility Location. In <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>
    (pp. 315–321). SciTePress. <a href="https://doi.org/10.5220/0007369503150321">https://doi.org/10.5220/0007369503150321</a>
  bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms
    for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>},
    booktitle={Proceedings of the 8th International Conference on Operations Research
    and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine
    and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }'
  chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms
    for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>,
    315–21. SciTePress, 2019. <a href="https://doi.org/10.5220/0007369503150321">https://doi.org/10.5220/0007369503150321</a>.
  ieee: C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex
    Cover and Leasing Non-metric Facility Location,” in <i>Proceedings of the 8th
    International Conference on Operations Research and Enterprise Systems</i>, 2019,
    pp. 315–321.
  mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms
    for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>,
    SciTePress, 2019, pp. 315–21, doi:<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>.
  short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International
    Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp.
    315–321.'
date_created: 2019-10-21T13:42:50Z
date_updated: 2022-01-06T06:51:47Z
department:
- _id: '63'
doi: 10.5220/0007369503150321
language:
- iso: eng
page: 315-321
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 8th International Conference on Operations Research
  and Enterprise Systems
publisher: SciTePress
status: public
title: Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility
  Location
type: conference
user_id: '477'
year: '2019'
...
---
_id: '13946'
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. Efficient
    parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>.
    2019;786:2-12. doi:<a href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>
  apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan,
    P. (2019). Efficient parallel algorithms for parameterized problems. <i>Theoretical
    Computer Science</i>, <i>786</i>, 2–12. <a href="https://doi.org/10.1016/j.tcs.2018.11.006">https://doi.org/10.1016/j.tcs.2018.11.006</a>
  bibtex: '@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient
    parallel algorithms for parameterized problems}, volume={786}, DOI={<a href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>},
    journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei
    and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
    year={2019}, pages={2–12} }'
  chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
    auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized
    Problems.” <i>Theoretical Computer Science</i> 786 (2019): 2–12. <a href="https://doi.org/10.1016/j.tcs.2018.11.006">https://doi.org/10.1016/j.tcs.2018.11.006</a>.'
  ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
    “Efficient parallel algorithms for parameterized problems,” <i>Theoretical Computer
    Science</i>, vol. 786, pp. 2–12, 2019.
  mla: Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized
    Problems.” <i>Theoretical Computer Science</i>, vol. 786, 2019, pp. 2–12, doi:<a
    href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>.
  short: F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
    Theoretical Computer Science 786 (2019) 2–12.
date_created: 2019-10-21T13:57:06Z
date_updated: 2022-01-06T06:51:48Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2018.11.006
intvolume: '       786'
language:
- iso: eng
page: 2-12
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theoretical Computer Science
status: public
title: Efficient parallel algorithms for parameterized problems
type: journal_article
user_id: '15415'
volume: 786
year: '2019'
...
---
_id: '2485'
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. Online Facility Location with Mobile Facilities.
    In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
    Architectures (SPAA)</i>. ACM; 2018:373-381. doi:<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>'
  apa: 'Feldkord, B., &#38; Meyer auf der Heide, F. (2018). Online Facility Location
    with Mobile Facilities. In <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i> (pp. 373–381). Wien: ACM. <a href="https://doi.org/10.1145/3210377.3210389">https://doi.org/10.1145/3210377.3210389</a>'
  bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility
    Location with Mobile Facilities}, DOI={<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>},
    booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer
    auf der Heide, Friedhelm}, year={2018}, pages={373–381} }'
  chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
    with Mobile Facilities.” In <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, 373–81. ACM, 2018. <a href="https://doi.org/10.1145/3210377.3210389">https://doi.org/10.1145/3210377.3210389</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile
    Facilities,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, Wien, 2018, pp. 373–381.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
    with Mobile Facilities.” <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, ACM, 2018, pp. 373–81, doi:<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>.
  short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.'
conference:
  location: Wien
  name: SPAA'18
date_created: 2018-04-25T08:49:43Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210389
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:42:33Z
  date_updated: 2018-11-02T14:42:33Z
  file_id: '5280'
  file_name: p373-feldkord.pdf
  file_size: 1207546
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:42:33Z
has_accepted_license: '1'
language:
- iso: eng
page: '373 - 381 '
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 30th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publication_status: published
publisher: ACM
status: public
title: Online Facility Location with Mobile Facilities
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2848'
author:
- 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
citation:
  ama: Li S, Markarian C, Meyer auf der Heide F. Towards Flexible Demands in Online
    Leasing Problems. . <i>Algorithmica</i>. 2018;80(5):1556–1574. doi:<a href="https://doi.org/10.1007/s00453-018-0420-y">10.1007/s00453-018-0420-y</a>
  apa: Li, S., Markarian, C., &#38; Meyer auf der Heide, F. (2018). Towards Flexible
    Demands in Online Leasing Problems. . <i>Algorithmica</i>, <i>80</i>(5), 1556–1574.
    <a href="https://doi.org/10.1007/s00453-018-0420-y">https://doi.org/10.1007/s00453-018-0420-y</a>
  bibtex: '@article{Li_Markarian_Meyer auf der Heide_2018, title={Towards Flexible
    Demands in Online Leasing Problems. }, volume={80}, DOI={<a href="https://doi.org/10.1007/s00453-018-0420-y">10.1007/s00453-018-0420-y</a>},
    number={5}, journal={Algorithmica}, publisher={Springer}, author={Li, Shouwei
    and Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2018}, pages={1556–1574}
    }'
  chicago: 'Li, Shouwei, Christine Markarian, and Friedhelm Meyer auf der Heide. “Towards
    Flexible Demands in Online Leasing Problems. .” <i>Algorithmica</i> 80, no. 5
    (2018): 1556–1574. <a href="https://doi.org/10.1007/s00453-018-0420-y">https://doi.org/10.1007/s00453-018-0420-y</a>.'
  ieee: S. Li, C. Markarian, and F. Meyer auf der Heide, “Towards Flexible Demands
    in Online Leasing Problems. ,” <i>Algorithmica</i>, vol. 80, no. 5, pp. 1556–1574,
    2018.
  mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems. .”
    <i>Algorithmica</i>, vol. 80, no. 5, Springer, 2018, pp. 1556–1574, doi:<a href="https://doi.org/10.1007/s00453-018-0420-y">10.1007/s00453-018-0420-y</a>.
  short: S. Li, C. Markarian, F. Meyer auf der Heide, Algorithmica 80 (2018) 1556–1574.
date_created: 2018-05-24T08:32:38Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00453-018-0420-y
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:18:16Z
  date_updated: 2018-11-02T15:18:16Z
  file_id: '5298'
  file_name: TowardsFlexibleDemandsInOnline.pdf
  file_size: 600583
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:18:16Z
has_accepted_license: '1'
intvolume: '        80'
issue: '5'
language:
- iso: eng
page: 1556–1574
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: Algorithmica
publisher: Springer
status: public
title: 'Towards Flexible Demands in Online Leasing Problems. '
type: journal_article
user_id: '477'
volume: 80
year: '2018'
...
---
_id: '2849'
author:
- first_name: 'Faisal N. '
  full_name: 'Abu-Khzam, Faisal N. '
  last_name: Abu-Khzam
- 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: Michael
  full_name: Schubert, Michael
  last_name: Schubert
citation:
  ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.
    <i>Theory of Computing Systems</i>. 2018. doi:<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>
  apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M.
    (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
    Ad-hoc Networks. <i>Theory of Computing Systems</i>. <a href="https://doi.org/10.1007/s00224-017-9836-z">https://doi.org/10.1007/s00224-017-9836-z</a>
  bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks},
    DOI={<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>},
    journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam,
    Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
    Michael}, year={2018} }'
  chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
    and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
    in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, 2018. <a href="https://doi.org/10.1007/s00224-017-9836-z">https://doi.org/10.1007/s00224-017-9836-z</a>.
  ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,”
    <i>Theory of Computing Systems</i>, 2018.
  mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
    Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>,
    Springer, 2018, doi:<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>.
  short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory
    of Computing Systems (2018).
date_created: 2018-05-24T08:39:15Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00224-017-9836-z
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:24:32Z
  date_updated: 2018-11-02T15:24:32Z
  file_id: '5301'
  file_name: ApproximationAndHeuristicAlgor.pdf
  file_size: 1371624
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:24:32Z
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: Theory of Computing Systems
publication_identifier:
  unknown:
  - 1432-4350
publisher: Springer
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
  Ad-hoc Networks
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '2850'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- 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: Mostafa
  full_name: Wahby, Mostafa
  last_name: Wahby
citation:
  ama: 'Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive:
    Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.
    In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018.
    doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>'
  apa: 'Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018).
    Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online
    Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>'
  bibtex: '@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick,
    Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets}, DOI={<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>},
    booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann,
    Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
    year={2018} }'
  chicago: 'Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and
    Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse
    Based on Online Connected Dominating Sets.” In <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.'
  ieee: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack,
    &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>, 2018.'
  mla: 'Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern
    Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018, doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>.'
  short: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International
    Conference on Fun with Algorithms (FUN), 2018.'
date_created: 2018-05-24T08:41:48Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '000'
department:
- _id: '63'
- _id: '238'
doi: 10.4230/LIPIcs.FUN.2018.22
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-11-13T13:15:19Z
  date_updated: 2018-11-13T13:15:19Z
  file_id: '5536'
  file_name: LIPIcs-FUN-2018-22.pdf
  file_size: 554298
  relation: main_file
  success: 1
file_date_updated: 2018-11-13T13:15:19Z
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: Ninth International Conference on Fun with Algorithms (FUN)
status: public
title: 'Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
  Connected Dominating Sets'
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '3551'
author:
- first_name: Jürgen
  full_name: König, Jürgen
  id: '22358'
  last_name: König
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with interjob
    communication on parallel processors. <i>Journal of Combinatorial Optimization</i>.
    2018;36(4):1356-1379. doi:<a href="https://doi.org/10.1007/s10878-018-0325-3">10.1007/s10878-018-0325-3</a>
  apa: König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2018).
    Scheduling with interjob communication on parallel processors. <i>Journal of Combinatorial
    Optimization</i>, <i>36</i>(4), 1356–1379. <a href="https://doi.org/10.1007/s10878-018-0325-3">https://doi.org/10.1007/s10878-018-0325-3</a>
  bibtex: '@article{König_Mäcker_Meyer auf der Heide_Riechers_2018, title={Scheduling
    with interjob communication on parallel processors}, volume={36}, DOI={<a href="https://doi.org/10.1007/s10878-018-0325-3">10.1007/s10878-018-0325-3</a>},
    number={4}, journal={Journal of Combinatorial Optimization}, author={König, Jürgen
    and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören},
    year={2018}, pages={1356–1379} }'
  chicago: 'König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
    Riechers. “Scheduling with Interjob Communication on Parallel Processors.” <i>Journal
    of Combinatorial Optimization</i> 36, no. 4 (2018): 1356–79. <a href="https://doi.org/10.1007/s10878-018-0325-3">https://doi.org/10.1007/s10878-018-0325-3</a>.'
  ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
    with interjob communication on parallel processors,” <i>Journal of Combinatorial
    Optimization</i>, vol. 36, no. 4, pp. 1356–1379, 2018.
  mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
    <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, 2018, pp. 1356–79,
    doi:<a href="https://doi.org/10.1007/s10878-018-0325-3">10.1007/s10878-018-0325-3</a>.
  short: J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial
    Optimization 36 (2018) 1356–1379.
date_created: 2018-07-13T09:57:48Z
date_updated: 2022-01-06T06:59:24Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-018-0325-3
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:20:24Z
  date_updated: 2018-11-02T15:20:24Z
  file_id: '5299'
  file_name: SchedulingWithInterjobCommunic.pdf
  file_size: 745708
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:20:24Z
has_accepted_license: '1'
intvolume: '        36'
issue: '4'
language:
- iso: eng
page: 1356-1379
project:
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
status: public
title: Scheduling with interjob communication on parallel processors
type: journal_article
user_id: '477'
volume: 36
year: '2018'
...
---
_id: '63'
author:
- first_name: Ernst
  full_name: Althaus, Ernst
  last_name: Althaus
- first_name: Andre
  full_name: Brinkmann, Andre
  last_name: Brinkmann
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Lars
  full_name: Nagel, Lars
  last_name: Nagel
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: Jiri
  full_name: Sgall, Jiri
  last_name: Sgall
- first_name: Tim
  full_name: Suess, Tim
  last_name: Suess
citation:
  ama: Althaus E, Brinkmann A, Kling P, et al. Scheduling Shared Continuous Resources
    on Many-Cores. <i>Journal of Scheduling</i>. 2018;21(1):77-92. doi:<a href="https://doi.org/10.1007/s10951-017-0518-0">10.1007/s10951-017-0518-0</a>
  apa: Althaus, E., Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L.,
    Riechers, S., Sgall, J., &#38; Suess, T. (2018). Scheduling Shared Continuous
    Resources on Many-Cores. <i>Journal of Scheduling</i>, <i>21</i>(1), 77–92. <a
    href="https://doi.org/10.1007/s10951-017-0518-0">https://doi.org/10.1007/s10951-017-0518-0</a>
  bibtex: '@article{Althaus_Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Sgall_Suess_2018,
    title={Scheduling Shared Continuous Resources on Many-Cores}, volume={21}, DOI={<a
    href="https://doi.org/10.1007/s10951-017-0518-0">10.1007/s10951-017-0518-0</a>},
    number={1}, journal={Journal of Scheduling}, publisher={Springer}, author={Althaus,
    Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm
    and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}, year={2018},
    pages={77–92} }'
  chicago: 'Althaus, Ernst, Andre Brinkmann, Peter Kling, Friedhelm Meyer auf der
    Heide, Lars Nagel, Sören Riechers, Jiri Sgall, and Tim Suess. “Scheduling Shared
    Continuous Resources on Many-Cores.” <i>Journal of Scheduling</i> 21, no. 1 (2018):
    77–92. <a href="https://doi.org/10.1007/s10951-017-0518-0">https://doi.org/10.1007/s10951-017-0518-0</a>.'
  ieee: 'E. Althaus <i>et al.</i>, “Scheduling Shared Continuous Resources on Many-Cores,”
    <i>Journal of Scheduling</i>, vol. 21, no. 1, pp. 77–92, 2018, doi: <a href="https://doi.org/10.1007/s10951-017-0518-0">10.1007/s10951-017-0518-0</a>.'
  mla: Althaus, Ernst, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
    <i>Journal of Scheduling</i>, vol. 21, no. 1, Springer, 2018, pp. 77–92, doi:<a
    href="https://doi.org/10.1007/s10951-017-0518-0">10.1007/s10951-017-0518-0</a>.
  short: E. Althaus, A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S.
    Riechers, J. Sgall, T. Suess, Journal of Scheduling 21 (2018) 77–92.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:00Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/s10951-017-0518-0
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:16:59Z
  date_updated: 2018-03-21T13:16:59Z
  file_id: '1577'
  file_name: 63-main_05.pdf
  file_size: 466808
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:16:59Z
has_accepted_license: '1'
intvolume: '        21'
issue: '1'
language:
- iso: eng
page: 77-92
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: Journal of Scheduling
publisher: Springer
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: journal_article
user_id: '15415'
volume: 21
year: '2018'
...
---
_id: '7570'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Johannes Sebastian
  full_name: Schaefer, Johannes Sebastian
  id: '30291'
  last_name: Schaefer
citation:
  ama: 'Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems
    of Home Based Mobile Agents. In: <i>Proceedings of the 30th on Symposium on Parallelism
    in Algorithms and Architectures  - SPAA ’18</i>. ACM Press; 2018. doi:<a href="https://doi.org/10.1145/3210377.3210662">10.1145/3210377.3210662</a>'
  apa: 'Meyer auf der Heide, F., &#38; Schaefer, J. S. (2018). Brief Announcement:
    Communication in Systems of Home Based Mobile Agents. In <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>.
    Vienna: ACM Press. <a href="https://doi.org/10.1145/3210377.3210662">https://doi.org/10.1145/3210377.3210662</a>'
  bibtex: '@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement:
    Communication in Systems of Home Based Mobile Agents}, DOI={<a href="https://doi.org/10.1145/3210377.3210662">10.1145/3210377.3210662</a>},
    booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
    Architectures  - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide,
    Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }'
  chicago: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief
    Announcement: Communication in Systems of Home Based Mobile Agents.” In <i>Proceedings
    of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA
    ’18</i>. ACM Press, 2018. <a href="https://doi.org/10.1145/3210377.3210662">https://doi.org/10.1145/3210377.3210662</a>.'
  ieee: 'F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication
    in Systems of Home Based Mobile Agents,” in <i>Proceedings of the 30th on Symposium
    on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, Vienna, 2018.'
  mla: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement:
    Communication in Systems of Home Based Mobile Agents.” <i>Proceedings of the 30th
    on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, ACM
    Press, 2018, doi:<a href="https://doi.org/10.1145/3210377.3210662">10.1145/3210377.3210662</a>.'
  short: 'F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium
    on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018.'
conference:
  end_date: 2018-07-18
  location: Vienna
  name: 30th Symposium on Parallelism in Algorithms and Architectures
  start_date: 2018-07-16
date_created: 2019-02-06T14:16:19Z
date_updated: 2022-01-06T07:03:40Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210662
file:
- access_level: closed
  content_type: application/pdf
  creator: jschaef
  date_created: 2019-02-06T14:18:35Z
  date_updated: 2019-02-06T14:18:35Z
  file_id: '7576'
  file_name: p359-meyer-auf-der-heide.pdf
  file_size: 1504739
  relation: main_file
file_date_updated: 2019-02-06T14:18:35Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
  Architectures  - SPAA '18
publication_identifier:
  isbn:
  - '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Communication in Systems of Home Based Mobile Agents'
type: conference
user_id: '30291'
year: '2018'
...