---
_id: '59'
abstract:
- lang: eng
  text: We consider a scheduling problem on $m$ identical processors sharing an arbitrarily
    divisible resource. In addition to assigning jobs to processors, the scheduler
    must distribute the resource among the processors (e.g., for three processors
    in shares of 20\%, 15\%, and 65\%) and adjust this distribution over time. Each
    job $j$ comes with a size $p_j \in \mathbb{R}$ and a resource requirement $r_j
    > 0$. Jobs do not benefit when receiving a share larger than $r_j$ of the resource.
    But providing them with a fraction of the resource requirement causes a linear
    decrease in the processing efficiency. We seek a (non-preemptive) job and resource
    assignment minimizing the makespan.Our main result is an efficient approximation
    algorithm which achieves an approximation ratio of $2 + 1/(m-2)$. It can be improved
    to an (asymptotic) ratio of $1 + 1/(m-1)$ if all jobs have unit size. Our algorithms
    also imply new results for a well-known bin packing problem with splittable items
    and a restricted number of allowed item parts per bin.Based upon the above solution,
    we also derive an approximation algorithm with similar guarantees for a setting
    in which we introduce so-called tasks each containing several jobs and where we
    are interested in the average completion time of tasks (a task is completed when
    all its jobs are completed).
author:
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Kling P, Mäcker A, Riechers S, Skopalik A. Sharing is Caring: Multiprocessor
    Scheduling with a Sharable Resource. In: <i>Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2017:123--132. doi:<a
    href="https://doi.org/10.1145/3087556.3087578">10.1145/3087556.3087578</a>'
  apa: 'Kling, P., Mäcker, A., Riechers, S., &#38; Skopalik, A. (2017). Sharing is
    Caring: Multiprocessor Scheduling with a Sharable Resource. In <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>
    (pp. 123--132). <a href="https://doi.org/10.1145/3087556.3087578">https://doi.org/10.1145/3087556.3087578</a>'
  bibtex: '@inproceedings{Kling_Mäcker_Riechers_Skopalik_2017, title={Sharing is Caring:
    Multiprocessor Scheduling with a Sharable Resource}, DOI={<a href="https://doi.org/10.1145/3087556.3087578">10.1145/3087556.3087578</a>},
    booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Kling, Peter and Mäcker, Alexander and Riechers,
    Sören and Skopalik, Alexander}, year={2017}, pages={123--132} }'
  chicago: 'Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik.
    “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    123--132, 2017. <a href="https://doi.org/10.1145/3087556.3087578">https://doi.org/10.1145/3087556.3087578</a>.'
  ieee: 'P. Kling, A. Mäcker, S. Riechers, and A. Skopalik, “Sharing is Caring: Multiprocessor
    Scheduling with a Sharable Resource,” in <i>Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132.'
  mla: 'Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a
    Sharable Resource.” <i>Proceedings of the 29th ACM Symposium on Parallelism in
    Algorithms and Architectures (SPAA)</i>, 2017, pp. 123--132, doi:<a href="https://doi.org/10.1145/3087556.3087578">10.1145/3087556.3087578</a>.'
  short: 'P. Kling, A. Mäcker, S. Riechers, A. Skopalik, in: Proceedings of the 29th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp.
    123--132.'
date_created: 2017-10-17T12:41:02Z
date_updated: 2022-01-06T07:02:46Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1145/3087556.3087578
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:17:33Z
  date_updated: 2018-03-21T13:17:33Z
  file_id: '1578'
  file_name: 59-progress.pdf
  file_size: 784867
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:17:33Z
has_accepted_license: '1'
language:
- iso: eng
page: 123--132
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
status: public
title: 'Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource'
type: conference
user_id: '477'
year: '2017'
...
---
_id: '5946'
author:
- first_name: Sarah
  full_name: Kühn, Sarah
  last_name: Kühn
citation:
  ama: Kühn S. <i>Outsourcing Und Qualität Im Supply Chain - Eine Gleichgewichtsanalyse</i>.
    Universität Paderborn; 2017.
  apa: Kühn, S. (2017). <i>Outsourcing und Qualität im Supply Chain - Eine Gleichgewichtsanalyse</i>.
    Universität Paderborn.
  bibtex: '@book{Kühn_2017, title={Outsourcing und Qualität im Supply Chain - Eine
    Gleichgewichtsanalyse}, publisher={Universität Paderborn}, author={Kühn, Sarah},
    year={2017} }'
  chicago: Kühn, Sarah. <i>Outsourcing Und Qualität Im Supply Chain - Eine Gleichgewichtsanalyse</i>.
    Universität Paderborn, 2017.
  ieee: S. Kühn, <i>Outsourcing und Qualität im Supply Chain - Eine Gleichgewichtsanalyse</i>.
    Universität Paderborn, 2017.
  mla: Kühn, Sarah. <i>Outsourcing Und Qualität Im Supply Chain - Eine Gleichgewichtsanalyse</i>.
    Universität Paderborn, 2017.
  short: S. Kühn, Outsourcing Und Qualität Im Supply Chain - Eine Gleichgewichtsanalyse,
    Universität Paderborn, 2017.
date_created: 2018-11-28T10:55:45Z
date_updated: 2022-01-06T07:02:48Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Outsourcing und Qualität im Supply Chain - Eine Gleichgewichtsanalyse
type: bachelorsthesis
user_id: '65453'
year: '2017'
...
---
_id: '5950'
author:
- first_name: Justine
  full_name: Gunning, Justine
  last_name: Gunning
citation:
  ama: Gunning J. <i>Crowdfunding Plattformen Als Vermittler Auf Zweiseitigen Märkten
    - Eine Mikroökonomische Analyse</i>. Universität Paderborn; 2017.
  apa: Gunning, J. (2017). <i>Crowdfunding Plattformen als Vermittler auf zweiseitigen
    Märkten - Eine mikroökonomische Analyse</i>. Universität Paderborn.
  bibtex: '@book{Gunning_2017, title={Crowdfunding Plattformen als Vermittler auf
    zweiseitigen Märkten - Eine mikroökonomische Analyse}, publisher={Universität
    Paderborn}, author={Gunning, Justine}, year={2017} }'
  chicago: Gunning, Justine. <i>Crowdfunding Plattformen Als Vermittler Auf Zweiseitigen
    Märkten - Eine Mikroökonomische Analyse</i>. Universität Paderborn, 2017.
  ieee: J. Gunning, <i>Crowdfunding Plattformen als Vermittler auf zweiseitigen Märkten
    - Eine mikroökonomische Analyse</i>. Universität Paderborn, 2017.
  mla: Gunning, Justine. <i>Crowdfunding Plattformen Als Vermittler Auf Zweiseitigen
    Märkten - Eine Mikroökonomische Analyse</i>. Universität Paderborn, 2017.
  short: J. Gunning, Crowdfunding Plattformen Als Vermittler Auf Zweiseitigen Märkten
    - Eine Mikroökonomische Analyse, Universität Paderborn, 2017.
date_created: 2018-11-28T11:29:03Z
date_updated: 2022-01-06T07:02:48Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
title: Crowdfunding Plattformen als Vermittler auf zweiseitigen Märkten - Eine mikroökonomische
  Analyse
type: bachelorsthesis
user_id: '65453'
year: '2017'
...
---
_id: '5980'
citation:
  ama: Scheideler C, Taghi Hajiaghayi M, eds. <i>Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA,
    July 24-26, 2017</i>. ACM; 2017. doi:<a href="https://doi.org/10.1145/3087556">10.1145/3087556</a>
  apa: Scheideler, C., &#38; Taghi Hajiaghayi, M. (Eds.). (2017). <i>Proceedings of
    the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017,
    Washington DC, USA, July 24-26, 2017</i>. ACM. <a href="https://doi.org/10.1145/3087556">https://doi.org/10.1145/3087556</a>
  bibtex: '@book{Scheideler_Taghi Hajiaghayi_2017, title={Proceedings of the 29th
    ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington
    DC, USA, July 24-26, 2017}, DOI={<a href="https://doi.org/10.1145/3087556">10.1145/3087556</a>},
    publisher={ACM}, year={2017} }'
  chicago: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
    2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017. <a href="https://doi.org/10.1145/3087556">https://doi.org/10.1145/3087556</a>.
  ieee: C. Scheideler and M. Taghi Hajiaghayi, Eds., <i>Proceedings of the 29th ACM
    Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington
    DC, USA, July 24-26, 2017</i>. ACM, 2017.
  mla: Scheideler, Christian, and Mohammad Taghi Hajiaghayi, editors. <i>Proceedings
    of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
    2017, Washington DC, USA, July 24-26, 2017</i>. ACM, 2017, doi:<a href="https://doi.org/10.1145/3087556">10.1145/3087556</a>.
  short: C. Scheideler, M. Taghi Hajiaghayi, eds., Proceedings of the 29th ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA,
    July 24-26, 2017, ACM, 2017.
date_created: 2018-11-29T10:23:12Z
date_updated: 2022-01-06T07:02:48Z
department:
- _id: '7'
- _id: '79'
doi: 10.1145/3087556
editor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Mohammad
  full_name: Taghi Hajiaghayi, Mohammad
  last_name: Taghi Hajiaghayi
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication_identifier:
  isbn:
  - 978-1-4503-4593-4
publisher: ACM
status: public
title: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures,
  SPAA 2017, Washington DC, USA, July 24-26, 2017
type: conference_editor
user_id: '477'
year: '2017'
...
---
_id: '60'
author:
- first_name: David
  full_name: Niehus, David
  last_name: Niehus
citation:
  ama: Niehus D. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn; 2017.
  apa: Niehus, D. (2017). <i>Semantically Secure Attribute-based Searchable Encryption</i>.
    Universität Paderborn.
  bibtex: '@book{Niehus_2017, title={Semantically Secure Attribute-based Searchable
    Encryption}, publisher={Universität Paderborn}, author={Niehus, David}, year={2017}
    }'
  chicago: Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  ieee: D. Niehus, <i>Semantically Secure Attribute-based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  mla: Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  short: D. Niehus, Semantically Secure Attribute-Based Searchable Encryption, Universität
    Paderborn, 2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:49Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Semantically Secure Attribute-based Searchable Encryption
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '61'
author:
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: Strothmann TF. <i>Self-* Algorithms for Distributed Systems</i>. Universität
    Paderborn; 2017. doi:<a href="https://doi.org/10.17619/UNIPB/1-150">10.17619/UNIPB/1-150</a>
  apa: Strothmann, T. F. (2017). <i>Self-* Algorithms for Distributed Systems</i>.
    Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-150">https://doi.org/10.17619/UNIPB/1-150</a>
  bibtex: '@book{Strothmann_2017, title={Self-* Algorithms for Distributed Systems},
    DOI={<a href="https://doi.org/10.17619/UNIPB/1-150">10.17619/UNIPB/1-150</a>},
    publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2017}
    }'
  chicago: Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>.
    Universität Paderborn, 2017. <a href="https://doi.org/10.17619/UNIPB/1-150">https://doi.org/10.17619/UNIPB/1-150</a>.
  ieee: T. F. Strothmann, <i>Self-* Algorithms for Distributed Systems</i>. Universität
    Paderborn, 2017.
  mla: Strothmann, Thim Frederik. <i>Self-* Algorithms for Distributed Systems</i>.
    Universität Paderborn, 2017, doi:<a href="https://doi.org/10.17619/UNIPB/1-150">10.17619/UNIPB/1-150</a>.
  short: T.F. Strothmann, Self-* Algorithms for Distributed Systems, Universität Paderborn,
    2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:52Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-150
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Self-* Algorithms for Distributed Systems
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '62'
author:
- first_name: Eduard
  full_name: Weis, Eduard
  last_name: Weis
citation:
  ama: Weis E. <i>Searchable Encryption</i>. Universität Paderborn; 2017.
  apa: Weis, E. (2017). <i>Searchable Encryption</i>. Universität Paderborn.
  bibtex: '@book{Weis_2017, title={Searchable Encryption}, publisher={Universität
    Paderborn}, author={Weis, Eduard}, year={2017} }'
  chicago: Weis, Eduard. <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  ieee: E. Weis, <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  mla: Weis, Eduard. <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  short: E. Weis, Searchable Encryption, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:56Z
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Searchable Encryption
type: mastersthesis
user_id: '15504'
year: '2017'
...
---
_id: '64'
abstract:
- lang: eng
  text: 'A current trend in networking and cloud computing is to provide compute resources
    at widely distributed sites; this is exemplified by developments such as Network
    Function Virtualisation. This paves the way for wide-area service deployments
    with improved service quality: e.g. user-perceived response times can be reduced
    by offering services at nearby sites. But always assigning users to the nearest
    site can be a bad decision if this site is already highly utilised. This paper
    formalises two related decisions of allocating compute resources at different
    sites and assigning users to them with the goal of minimising the response times
    while the total number of resources to be allocated is limited – a non-linear
    capacitated Facility Location Problem with integrated queuing systems. To efficiently
    handle its non-linearity, we introduce five linear problem linearisations and
    adapt the currently best heuristic for a similar scenario to our scenario. All
    six approaches are compared in experiments for solution quality and solving time.
    Surprisingly, our best optimisation formulation outperforms the heuristic in both
    time and quality. Additionally, we evaluate the influence of distributions of
    available compute resources in the network on the response time: The time was
    halved for some configurations. The presented formulation techniques for our problem
    linearisations are applicable to a broader optimisation domain.'
author:
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Keller M, Karl H. Response-Time-Optimised Service Deployment: MILP Formulations
    of Piece-wise Linear Functions Approximating Non-linear Bivariate Mixed-integer
    Functions. <i>IEEE Transactions on Network and Service Management</i>. 2017;(1):121--135.
    doi:<a href="https://doi.org/10.1109/TNSM.2016.2611590">10.1109/TNSM.2016.2611590</a>'
  apa: 'Keller, M., &#38; Karl, H. (2017). Response-Time-Optimised Service Deployment:
    MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
    Mixed-integer Functions. <i>IEEE Transactions on Network and Service Management</i>,
    (1), 121--135. <a href="https://doi.org/10.1109/TNSM.2016.2611590">https://doi.org/10.1109/TNSM.2016.2611590</a>'
  bibtex: '@article{Keller_Karl_2017, title={Response-Time-Optimised Service Deployment:
    MILP Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
    Mixed-integer Functions}, DOI={<a href="https://doi.org/10.1109/TNSM.2016.2611590">10.1109/TNSM.2016.2611590</a>},
    number={1}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE},
    author={Keller, Matthias and Karl, Holger}, year={2017}, pages={121--135} }'
  chicago: 'Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment:
    MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate
    Mixed-Integer Functions.” <i>IEEE Transactions on Network and Service Management</i>,
    no. 1 (2017): 121--135. <a href="https://doi.org/10.1109/TNSM.2016.2611590">https://doi.org/10.1109/TNSM.2016.2611590</a>.'
  ieee: 'M. Keller and H. Karl, “Response-Time-Optimised Service Deployment: MILP
    Formulations of Piece-wise Linear Functions Approximating Non-linear Bivariate
    Mixed-integer Functions,” <i>IEEE Transactions on Network and Service Management</i>,
    no. 1, pp. 121--135, 2017.'
  mla: 'Keller, Matthias, and Holger Karl. “Response-Time-Optimised Service Deployment:
    MILP Formulations of Piece-Wise Linear Functions Approximating Non-Linear Bivariate
    Mixed-Integer Functions.” <i>IEEE Transactions on Network and Service Management</i>,
    no. 1, IEEE, 2017, pp. 121--135, doi:<a href="https://doi.org/10.1109/TNSM.2016.2611590">10.1109/TNSM.2016.2611590</a>.'
  short: M. Keller, H. Karl, IEEE Transactions on Network and Service Management (2017)
    121--135.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:03:03Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/TNSM.2016.2611590
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:15:53Z
  date_updated: 2018-03-21T13:15:53Z
  file_id: '1576'
  file_name: 64-07572217.pdf
  file_size: 1505773
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:15:53Z
has_accepted_license: '1'
issue: '1'
page: 121--135
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '4'
  name: SFB 901 - Project Area C
publication: IEEE Transactions on Network and Service Management
publisher: IEEE
status: public
title: 'Response-Time-Optimised Service Deployment: MILP Formulations of Piece-wise
  Linear Functions Approximating Non-linear Bivariate Mixed-integer Functions'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '45'
abstract:
- lang: eng
  text: The importance of online ratings on sales is widely acknowledged. Firms need
    to find ways of increasing the number of ratings and rating scores, but how they
    can achieve this effectively is less well established. In this paper we analyze
    the impact of an unconditional gift on customers’ rating behavior in an online
    field experiment. Contrary to prevalent advice, our results suggest that providing
    a gift is not necessarily beneficial. Younger customers are significantly less
    likely to rate when exposed to an unconditional gift. Regression analysis reveals
    that age serves as a moderator and older customers even respond slightly positive
    to a gift. Having detected a negative effect of gifts on rating behavior provides
    first indicative evidence of a possible crowding out of intrinsic motivation in
    the context of online ratings. This has direct implications for practitioners
    considering the usage of gifts to elicit online ratings.
author:
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
- first_name: Darius
  full_name: Schlangenotto, Darius
  last_name: Schlangenotto
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
citation:
  ama: 'Gutt D, Schlangenotto D, Kundisch D. You can’t buy my rating! On the pivotal
    effect of an unconditional gift on rating behavior. In: <i>Wirtschaftsinformatik
    Proceedings, St. Gallen, Switzerland</i>. ; 2017.'
  apa: Gutt, D., Schlangenotto, D., &#38; Kundisch, D. (2017). You can’t buy my rating!
    On the pivotal effect of an unconditional gift on rating behavior. In <i>Wirtschaftsinformatik
    Proceedings, St. Gallen, Switzerland</i>.
  bibtex: '@inproceedings{Gutt_Schlangenotto_Kundisch_2017, title={You can’t buy my
    rating! On the pivotal effect of an unconditional gift on rating behavior}, booktitle={Wirtschaftsinformatik
    Proceedings, St. Gallen, Switzerland}, author={Gutt, Dominik and Schlangenotto,
    Darius and Kundisch, Dennis}, year={2017} }'
  chicago: Gutt, Dominik, Darius Schlangenotto, and Dennis Kundisch. “You Can’t Buy
    My Rating! On the Pivotal Effect of an Unconditional Gift on Rating Behavior.”
    In <i>Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland</i>, 2017.
  ieee: D. Gutt, D. Schlangenotto, and D. Kundisch, “You can’t buy my rating! On the
    pivotal effect of an unconditional gift on rating behavior,” in <i>Wirtschaftsinformatik
    Proceedings, St. Gallen, Switzerland</i>, 2017.
  mla: Gutt, Dominik, et al. “You Can’t Buy My Rating! On the Pivotal Effect of an
    Unconditional Gift on Rating Behavior.” <i>Wirtschaftsinformatik Proceedings,
    St. Gallen, Switzerland</i>, 2017.
  short: 'D. Gutt, D. Schlangenotto, D. Kundisch, in: Wirtschaftsinformatik Proceedings,
    St. Gallen, Switzerland, 2017.'
date_created: 2017-10-17T12:40:59Z
date_updated: 2022-01-06T07:01:07Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:20:05Z
  date_updated: 2018-03-21T13:20:05Z
  file_id: '1582'
  file_name: 45-You_cant_buy_my_rating__On_the_pivotal_effect_of_an_unconditiona.pdf
  file_size: 1446372
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:20:05Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publication: Wirtschaftsinformatik Proceedings, St. Gallen, Switzerland
status: public
title: You can’t buy my rating! On the pivotal effect of an unconditional gift on
  rating behavior
type: conference
user_id: '477'
year: '2017'
...
---
_id: '46'
author:
- first_name: Florian
  full_name: Grobbel, Florian
  last_name: Grobbel
citation:
  ama: Grobbel F. <i>Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen
    Softwareanforderungsbeschreibungen</i>. Universität Paderborn; 2017.
  apa: Grobbel, F. (2017). <i>Was kommt zuerst? Erkennung von zeitlichen Abläufen
    infunktionalen Softwareanforderungsbeschreibungen</i>. Universität Paderborn.
  bibtex: '@book{Grobbel_2017, title={Was kommt zuerst? Erkennung von zeitlichen Abläufen
    infunktionalen Softwareanforderungsbeschreibungen}, publisher={Universität Paderborn},
    author={Grobbel, Florian}, year={2017} }'
  chicago: Grobbel, Florian. <i>Was kommt zuerst? Erkennung von zeitlichen Abläufen
    infunktionalen Softwareanforderungsbeschreibungen</i>. Universität Paderborn,
    2017.
  ieee: F. Grobbel, <i>Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen
    Softwareanforderungsbeschreibungen</i>. Universität Paderborn, 2017.
  mla: Grobbel, Florian. <i>Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen
    Softwareanforderungsbeschreibungen</i>. Universität Paderborn, 2017.
  short: F. Grobbel, Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen
    Softwareanforderungsbeschreibungen, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:14Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Was kommt zuerst? Erkennung von zeitlichen Abläufen infunktionalen Softwareanforderungsbeschreibungen
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '4674'
author:
- first_name: Anica
  full_name: Rose, Anica
  last_name: Rose
citation:
  ama: 'Rose A. <i>The Performance of Individuals, Teams, and Organizations: Empirical
    Evidence from the Field</i>. Universität Paderborn; 2017.'
  apa: 'Rose, A. (2017). <i>The Performance of Individuals, Teams, and Organizations:
    Empirical Evidence from the Field</i>. Universität Paderborn.'
  bibtex: '@book{Rose_2017, title={The Performance of Individuals, Teams, and Organizations:
    Empirical Evidence from the Field}, publisher={Universität Paderborn}, author={Rose,
    Anica}, year={2017} }'
  chicago: 'Rose, Anica. <i>The Performance of Individuals, Teams, and Organizations:
    Empirical Evidence from the Field</i>. Universität Paderborn, 2017.'
  ieee: 'A. Rose, <i>The Performance of Individuals, Teams, and Organizations: Empirical
    Evidence from the Field</i>. Universität Paderborn, 2017.'
  mla: 'Rose, Anica. <i>The Performance of Individuals, Teams, and Organizations:
    Empirical Evidence from the Field</i>. Universität Paderborn, 2017.'
  short: 'A. Rose, The Performance of Individuals, Teams, and Organizations: Empirical
    Evidence from the Field, Universität Paderborn, 2017.'
date_created: 2018-10-12T06:31:07Z
date_updated: 2022-01-06T07:01:18Z
ddc:
- '040'
department:
- _id: '183'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-10-12T06:28:46Z
  date_updated: 2018-10-12T06:28:46Z
  file_id: '4675'
  file_name: Dissertation_Anica Rose.pdf
  file_size: 1907117
  relation: main_file
file_date_updated: 2018-10-12T06:28:46Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '8'
  name: SFB 901 - Subproject A4
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Bernd
  full_name: Frick, Bernd
  last_name: Frick
title: 'The Performance of Individuals, Teams, and Organizations: Empirical Evidence
  from the Field'
type: dissertation
user_id: '477'
year: '2017'
...
---
_id: '47'
author:
- first_name: Mona
  full_name: Theda, Mona
  last_name: Theda
citation:
  ama: Theda M. <i>Was ist gemeint? Strukturell ambige Sätze als Herausforderung für
    Parsing-Ansätze</i>. Universität Paderborn; 2017.
  apa: Theda, M. (2017). <i>Was ist gemeint? Strukturell ambige Sätze als Herausforderung
    für Parsing-Ansätze</i>. Universität Paderborn.
  bibtex: '@book{Theda_2017, title={Was ist gemeint? Strukturell ambige Sätze als
    Herausforderung für Parsing-Ansätze}, publisher={Universität Paderborn}, author={Theda,
    Mona}, year={2017} }'
  chicago: Theda, Mona. <i>Was ist gemeint? Strukturell ambige Sätze als Herausforderung
    für Parsing-Ansätze</i>. Universität Paderborn, 2017.
  ieee: M. Theda, <i>Was ist gemeint? Strukturell ambige Sätze als Herausforderung
    für Parsing-Ansätze</i>. Universität Paderborn, 2017.
  mla: Theda, Mona. <i>Was ist gemeint? Strukturell ambige Sätze als Herausforderung
    für Parsing-Ansätze</i>. Universität Paderborn, 2017.
  short: M. Theda, Was ist gemeint? Strukturell ambige Sätze als Herausforderung für
    Parsing-Ansätze, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:18Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Was ist gemeint? Strukturell ambige Sätze als Herausforderung für Parsing-Ansätze
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '48'
author:
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Dominik
  full_name: Gutt, Dominik
  id: '14368'
  last_name: Gutt
citation:
  ama: 'Kundisch D, Gutt D. Was bedeutet die Transformation der Märkte im digitalen
    Zeitalter? Ökonomische Grundlagen. In: Hannappel S, Rehm R, eds. <i>Digitale Ökonomie
    - Wie verändern sich die Märkte?</i>. ; 2017.'
  apa: Kundisch, D., &#38; Gutt, D. (2017). Was bedeutet die Transformation der Märkte
    im digitalen Zeitalter? Ökonomische Grundlagen. In S. Hannappel &#38; R. Rehm
    (Eds.), <i>Digitale Ökonomie - Wie verändern sich die Märkte?</i>
  bibtex: '@inbook{Kundisch_Gutt_2017, title={Was bedeutet die Transformation der
    Märkte im digitalen Zeitalter? Ökonomische Grundlagen}, booktitle={Digitale Ökonomie
    - Wie verändern sich die Märkte?}, author={Kundisch, Dennis and Gutt, Dominik},
    editor={Hannappel, Sandra and Rehm, RebekkaEditors}, year={2017} }'
  chicago: Kundisch, Dennis, and Dominik Gutt. “Was bedeutet die Transformation der
    Märkte im digitalen Zeitalter? Ökonomische Grundlagen.” In <i>Digitale Ökonomie
    - Wie verändern sich die Märkte?</i>, edited by Sandra Hannappel and Rebekka Rehm,
    2017.
  ieee: D. Kundisch and D. Gutt, “Was bedeutet die Transformation der Märkte im digitalen
    Zeitalter? Ökonomische Grundlagen,” in <i>Digitale Ökonomie - Wie verändern sich
    die Märkte?</i>, S. Hannappel and R. Rehm, Eds. 2017.
  mla: Kundisch, Dennis, and Dominik Gutt. “Was bedeutet die Transformation der Märkte
    im digitalen Zeitalter? Ökonomische Grundlagen.” <i>Digitale Ökonomie - Wie verändern
    sich die Märkte?</i>, edited by Sandra Hannappel and Rebekka Rehm, 2017.
  short: 'D. Kundisch, D. Gutt, in: S. Hannappel, R. Rehm (Eds.), Digitale Ökonomie
    - Wie verändern sich die Märkte?, 2017.'
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:24Z
ddc:
- '040'
department:
- _id: '276'
editor:
- first_name: Sandra
  full_name: Hannappel, Sandra
  last_name: Hannappel
- first_name: Rebekka
  full_name: Rehm, Rebekka
  last_name: Rehm
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T13:19:30Z
  date_updated: 2018-03-21T13:19:30Z
  file_id: '1581'
  file_name: 48-Digitale_Oekonomie_2017.pdf
  file_size: 18583012
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T13:19:30Z
has_accepted_license: '1'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '8'
  name: SFB 901 - Subprojekt A4
- _id: '2'
  name: SFB 901 - Project Area A
publication: Digitale Ökonomie - Wie verändern sich die Märkte?
status: public
title: Was bedeutet die Transformation der Märkte im digitalen Zeitalter? Ökonomische
  Grundlagen
type: book_chapter
user_id: '477'
year: '2017'
...
---
_id: '49'
abstract:
- lang: eng
  text: A multiplicity of visual languages have been proposed for representing business
    models. These languages are claimed to facilitate tasks such as understanding,
    communicating, and innovating a business model; and have been developed rather
    independently by scholars from accounting, computer science, information systems,
    and strategy. Consequently, the existing approaches greatly differ and to some
    extent contradict each other, for example, regarding their understanding of the
    business model concept, their terminology, and their visual notations – which
    means there is little common ground for developing a cumulative stream of research.
    Therefore, we provide a systematic, cross-disciplinary review of this emerging
    field and synthesize the pragmatic, semantic, and syntactic foundations of the
    proposed approaches. Further, we derive an agenda for future research and discuss
    the challenges that lie ahead to advance the field.
author:
- first_name: Thomas
  full_name: John, Thomas
  id: '3952'
  last_name: John
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Daniel
  full_name: Szopinski, Daniel
  id: '36372'
  last_name: Szopinski
citation:
  ama: 'John T, Kundisch D, Szopinski D. Visual Languages for Modeling Business Models:
    A Critical Review and Future Research Directions. In: <i>Proceedings of the 38th
    International Conference on Information Systems (ICIS), Seoul, South Korea</i>.
    ; 2017.'
  apa: 'John, T., Kundisch, D., &#38; Szopinski, D. (2017). Visual Languages for Modeling
    Business Models: A Critical Review and Future Research Directions. In <i>Proceedings
    of the 38th International Conference on Information Systems (ICIS), Seoul, South
    Korea</i>.'
  bibtex: '@inproceedings{John_Kundisch_Szopinski_2017, title={Visual Languages for
    Modeling Business Models: A Critical Review and Future Research Directions}, booktitle={Proceedings
    of the 38th International Conference on Information Systems (ICIS), Seoul, South
    Korea}, author={John, Thomas and Kundisch, Dennis and Szopinski, Daniel}, year={2017}
    }'
  chicago: 'John, Thomas, Dennis Kundisch, and Daniel Szopinski. “Visual Languages
    for Modeling Business Models: A Critical Review and Future Research Directions.”
    In <i>Proceedings of the 38th International Conference on Information Systems
    (ICIS), Seoul, South Korea</i>, 2017.'
  ieee: 'T. John, D. Kundisch, and D. Szopinski, “Visual Languages for Modeling Business
    Models: A Critical Review and Future Research Directions,” in <i>Proceedings of
    the 38th International Conference on Information Systems (ICIS), Seoul, South
    Korea</i>, 2017.'
  mla: 'John, Thomas, et al. “Visual Languages for Modeling Business Models: A Critical
    Review and Future Research Directions.” <i>Proceedings of the 38th International
    Conference on Information Systems (ICIS), Seoul, South Korea</i>, 2017.'
  short: 'T. John, D. Kundisch, D. Szopinski, in: Proceedings of the 38th International
    Conference on Information Systems (ICIS), Seoul, South Korea, 2017.'
date_created: 2017-10-17T12:41:00Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '040'
department:
- _id: '276'
file:
- access_level: closed
  content_type: application/pdf
  creator: dsz
  date_created: 2018-11-12T13:21:25Z
  date_updated: 2018-11-12T13:21:25Z
  file_id: '5501'
  file_name: ICIS2017_BMML.pdf
  file_size: 754019
  relation: main_file
  success: 1
file_date_updated: 2018-11-12T13:21:25Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '17'
  name: SFB 901 - Subprojekt C5
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 38th International Conference on Information Systems
  (ICIS), Seoul, South Korea
status: public
title: 'Visual Languages for Modeling Business Models: A Critical Review and Future
  Research Directions'
type: conference
user_id: '16205'
year: '2017'
...
---
_id: '698'
author:
- first_name: Ngoc Chi
  full_name: Banh, Ngoc Chi
  last_name: Banh
citation:
  ama: Banh NC. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn; 2017.
  apa: Banh, N. C. (2017). <i>As Asynchronous Adaption of a Churn-resistant Overlay
    Network</i>. Universität Paderborn.
  bibtex: '@book{Banh_2017, title={As Asynchronous Adaption of a Churn-resistant Overlay
    Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017}
    }'
  chicago: Banh, Ngoc Chi. <i>As Asynchronous Adaption of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  ieee: N. C. Banh, <i>As Asynchronous Adaption of a Churn-resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  mla: Banh, Ngoc Chi. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  short: N.C. Banh, As Asynchronous Adaption of a Churn-Resistant Overlay Network,
    Universität Paderborn, 2017.
date_created: 2017-11-14T08:02:46Z
date_updated: 2022-01-06T07:03:25Z
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: As Asynchronous Adaption of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '15504'
year: '2017'
...
---
_id: '699'
author:
- first_name: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: Sundermeier J. <i>Routing in Hybrid Communication Networks with Holes - Considering
    Bounding Boxes as Hole Abstractions</i>. Universität Paderborn; 2017.
  apa: Sundermeier, J. (2017). <i>Routing in Hybrid Communication Networks with Holes
    - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn.
  bibtex: '@book{Sundermeier_2017, title={Routing in Hybrid Communication Networks
    with Holes - Considering Bounding Boxes as Hole Abstractions}, publisher={Universität
    Paderborn}, author={Sundermeier, Jannik}, year={2017} }'
  chicago: Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes
    - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn,
    2017.
  ieee: J. Sundermeier, <i>Routing in Hybrid Communication Networks with Holes - Considering
    Bounding Boxes as Hole Abstractions</i>. Universität Paderborn, 2017.
  mla: Sundermeier, Jannik. <i>Routing in Hybrid Communication Networks with Holes
    - Considering Bounding Boxes as Hole Abstractions</i>. Universität Paderborn,
    2017.
  short: J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering
    Bounding Boxes as Hole Abstractions, Universität Paderborn, 2017.
date_created: 2017-11-14T08:03:45Z
date_updated: 2022-01-06T07:03:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Routing in Hybrid Communication Networks with Holes - Considering Bounding
  Boxes as Hole Abstractions
type: mastersthesis
user_id: '38705'
year: '2017'
...
---
_id: '70'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Feldkord B, Markarian C, Meyer auf der Heide F. Price Fluctuations in Online
    Leasing. In: <i>Proceedings of the 11th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i>. ; 2017:17-31. doi:<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>'
  apa: Feldkord, B., Markarian, C., &#38; Meyer auf der Heide, F. (2017). Price Fluctuations
    in Online Leasing. In <i>Proceedings of the 11th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i> (pp. 17–31). <a href="https://doi.org/10.1007/978-3-319-71147-8_2">https://doi.org/10.1007/978-3-319-71147-8_2</a>
  bibtex: '@inproceedings{Feldkord_Markarian_Meyer auf der Heide_2017, title={Price
    Fluctuations in Online Leasing}, DOI={<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>},
    booktitle={Proceedings of the 11th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={Feldkord, Björn and Markarian,
    Christine and Meyer auf der Heide, Friedhelm}, year={2017}, pages={17–31} }'
  chicago: Feldkord, Björn, Christine Markarian, and Friedhelm Meyer auf der Heide.
    “Price Fluctuations in Online Leasing.” In <i>Proceedings of the 11th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA)</i>, 17–31,
    2017. <a href="https://doi.org/10.1007/978-3-319-71147-8_2">https://doi.org/10.1007/978-3-319-71147-8_2</a>.
  ieee: B. Feldkord, C. Markarian, and F. Meyer auf der Heide, “Price Fluctuations
    in Online Leasing,” in <i>Proceedings of the 11th Annual International Conference
    on Combinatorial Optimization and Applications (COCOA)</i>, 2017, pp. 17–31.
  mla: Feldkord, Björn, et al. “Price Fluctuations in Online Leasing.” <i>Proceedings
    of the 11th Annual International Conference on Combinatorial Optimization and
    Applications (COCOA)</i>, 2017, pp. 17–31, doi:<a href="https://doi.org/10.1007/978-3-319-71147-8_2">10.1007/978-3-319-71147-8_2</a>.
  short: 'B. Feldkord, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
    11th Annual International Conference on Combinatorial Optimization and Applications
    (COCOA), 2017, pp. 17–31.'
date_created: 2017-10-17T12:41:05Z
date_updated: 2022-01-06T07:03:26Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-71147-8_2
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:06:13Z
  date_updated: 2018-11-02T15:06:13Z
  file_id: '5293'
  file_name: PriceFluctuationInOnlineLeasin.pdf
  file_size: 287315
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:06:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 17 - 31
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 11th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
status: public
title: Price Fluctuations in Online Leasing
type: conference
user_id: '477'
year: '2017'
...
---
_id: '700'
author:
- first_name: Till
  full_name: Knollmann, Till
  last_name: Knollmann
citation:
  ama: Knollmann T. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn; 2017.
  apa: Knollmann, T. (2017). <i>A Self-Stabilizing Protocol for Graphs of Diameter
    Two</i>. Universität Paderborn.
  bibtex: '@book{Knollmann_2017, title={A Self-Stabilizing Protocol for Graphs of
    Diameter Two}, publisher={Universität Paderborn}, author={Knollmann, Till}, year={2017}
    }'
  chicago: Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter
    Two</i>. Universität Paderborn, 2017.
  ieee: T. Knollmann, <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn, 2017.
  mla: Knollmann, Till. <i>A Self-Stabilizing Protocol for Graphs of Diameter Two</i>.
    Universität Paderborn, 2017.
  short: T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two, Universität
    Paderborn, 2017.
date_created: 2017-11-14T08:04:35Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: A Self-Stabilizing Protocol for Graphs of Diameter Two
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '701'
author:
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
citation:
  ama: Götte T. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn;
    2017.
  apa: Götte, T. (2017). <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn.
  bibtex: '@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität
    Paderborn}, author={Götte, Thorsten}, year={2017} }'
  chicago: Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn, 2017.
  ieee: T. Götte, <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität Paderborn,
    2017.
  mla: Götte, Thorsten. <i>Self-Stabilizing Spanners for Tree Metrics</i>. Universität
    Paderborn, 2017.
  short: T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn,
    2017.
date_created: 2017-11-14T09:32:39Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Self-Stabilizing Spanners for Tree Metrics
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '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'
...