---
_id: '8795'
abstract:
- lang: eng
  text: "Softwarized networks are the key enabler for elastic, on-demand service deployments
    of virtualized network functions. They allow to dynamically steer traffic\r\nthrough
    the network when new network functions are instantiated, or old ones\r\nare terminated.
    These scenarios become in particular challenging when stateful functions are involved,
    necessitating state management solutions to migrate\r\nstate between the functions.
    The problem with existing solutions is that they typically embrace state migration
    and flow rerouting jointly, imposing a huge set\r\nof requirements on the on-boarded
    virtualized network functions (VNFs), eg,\r\nsolution-specific state management
    interfaces.\r\nTo change this, we introduce the seamless handover protocol (SHarP).
    An\r\neasy-to-use, loss-less, and order-preserving flow rerouting mechanism that
    is\r\nnot fixed to a single state management approach. Using SHarP, VNF vendors\r\nare
    empowered to implement or use the state management solution of their\r\nchoice.
    SHarP supports these solutions with additional information when flows\r\nare migrated.
    In this paper, we present SHarP's design, its open source prototype\r\nimplementation,
    and show how SHarP significantly reduces the buffer usage at\r\na central (SDN)
    controller, which is a typical bottleneck in state-of-the-art solutions. Our experiments
    show that SHarP uses a constant amount of controller\r\nbuffer, irrespective of
    the time taken to migrate the VNF state."
article_number: e2067
author:
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Hannes
  full_name: Küttner, Hannes
  last_name: Küttner
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Peuster M, Küttner H, Karl H. A flow handover protocol to support state migration
    in softwarized networks. <i>International Journal of Network Management</i>. 2019.
    doi:<a href="https://doi.org/10.1002/nem.2067">10.1002/nem.2067</a>
  apa: Peuster, M., Küttner, H., &#38; Karl, H. (2019). A flow handover protocol to
    support state migration in softwarized networks. <i>International Journal of Network
    Management</i>. <a href="https://doi.org/10.1002/nem.2067">https://doi.org/10.1002/nem.2067</a>
  bibtex: '@article{Peuster_Küttner_Karl_2019, title={A flow handover protocol to
    support state migration in softwarized networks}, DOI={<a href="https://doi.org/10.1002/nem.2067">10.1002/nem.2067</a>},
    number={e2067}, journal={International Journal of Network Management}, author={Peuster,
    Manuel and Küttner, Hannes and Karl, Holger}, year={2019} }'
  chicago: Peuster, Manuel, Hannes Küttner, and Holger Karl. “A Flow Handover Protocol
    to Support State Migration in Softwarized Networks.” <i>International Journal
    of Network Management</i>, 2019. <a href="https://doi.org/10.1002/nem.2067">https://doi.org/10.1002/nem.2067</a>.
  ieee: M. Peuster, H. Küttner, and H. Karl, “A flow handover protocol to support
    state migration in softwarized networks,” <i>International Journal of Network
    Management</i>, 2019.
  mla: Peuster, Manuel, et al. “A Flow Handover Protocol to Support State Migration
    in Softwarized Networks.” <i>International Journal of Network Management</i>,
    e2067, 2019, doi:<a href="https://doi.org/10.1002/nem.2067">10.1002/nem.2067</a>.
  short: M. Peuster, H. Küttner, H. Karl, International Journal of Network Management
    (2019).
date_created: 2019-04-01T17:47:36Z
date_updated: 2022-01-06T07:04:01Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1002/nem.2067
file:
- access_level: open_access
  content_type: application/pdf
  creator: peuster
  date_created: 2019-04-01T18:04:14Z
  date_updated: 2019-04-01T18:04:14Z
  file_id: '8796'
  file_name: main_for_ris.pdf
  file_size: 2571927
  relation: main_file
file_date_updated: 2019-04-01T18:04:14Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://onlinelibrary.wiley.com/doi/abs/10.1002/nem.2067
oa: '1'
project:
- _id: '28'
  grant_number: '761493'
  name: 5G Development and validation platform for global industry-specific network
    services and Apps
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: International Journal of Network Management
publication_identifier:
  issn:
  - 1055-7148
  - 1099-1190
publication_status: published
status: public
title: A flow handover protocol to support state migration in softwarized networks
type: journal_article
user_id: '13271'
year: '2019'
...
---
_id: '8833'
author:
- first_name: Ivan
  full_name: Jovanovikj, Ivan
  id: '39187'
  last_name: Jovanovikj
  orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Christian
  full_name: Gerth, Christian
  last_name: Gerth
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Jovanovikj I, Yigitbas E, Gerth C, Sauer S, Engels G. Detection and Resolution
    of Data-Flow Differences in Business Process Models. In:  Cappiello C, Ruiz M,
    eds. <i>Information Systems Engineering in Responsible Information Systems - CAiSE
    Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings</i>. Vol 350. ; 2019:145-157.'
  apa: Jovanovikj, I., Yigitbas, E., Gerth, C., Sauer, S., &#38; Engels, G. (2019).
    Detection and Resolution of Data-Flow Differences in Business Process Models.
    In C.  Cappiello &#38; M. Ruiz (Eds.), <i>Information Systems Engineering in Responsible
    Information Systems - CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings</i>
    (Vol. 350, pp. 145–157). Rome.
  bibtex: '@inproceedings{Jovanovikj_Yigitbas_Gerth_Sauer_Engels_2019, title={Detection
    and Resolution of Data-Flow Differences in Business Process Models}, volume={350},
    booktitle={Information Systems Engineering in Responsible Information Systems
    - CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings}, author={Jovanovikj,
    Ivan and Yigitbas, Enes and Gerth, Christian and Sauer, Stefan and Engels, Gregor},
    editor={ Cappiello, Cinzia and Ruiz, MarcelaEditors}, year={2019}, pages={145–157}
    }'
  chicago: Jovanovikj, Ivan, Enes Yigitbas, Christian Gerth, Stefan Sauer, and Gregor
    Engels. “Detection and Resolution of Data-Flow Differences in Business Process
    Models.” In <i>Information Systems Engineering in Responsible Information Systems
    - CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings</i>, edited by Cinzia  Cappiello
    and Marcela Ruiz, 350:145–57, 2019.
  ieee: I. Jovanovikj, E. Yigitbas, C. Gerth, S. Sauer, and G. Engels, “Detection
    and Resolution of Data-Flow Differences in Business Process Models,” in <i>Information
    Systems Engineering in Responsible Information Systems - CAiSE Forum 2019, Rome,
    Italy, June 3-7, 2019, Proceedings</i>, Rome, 2019, vol. 350, pp. 145–157.
  mla: Jovanovikj, Ivan, et al. “Detection and Resolution of Data-Flow Differences
    in Business Process Models.” <i>Information Systems Engineering in Responsible
    Information Systems - CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings</i>,
    edited by Cinzia  Cappiello and Marcela Ruiz, vol. 350, 2019, pp. 145–57.
  short: 'I. Jovanovikj, E. Yigitbas, C. Gerth, S. Sauer, G. Engels, in: C.  Cappiello,
    M. Ruiz (Eds.), Information Systems Engineering in Responsible Information Systems
    - CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings, 2019, pp. 145–157.'
conference:
  end_date: 2019-06-07
  location: Rome
  name: International Conference on Advanced Information Systems Engineering (CAiSE
    2019) - CAiSE Forum
  start_date: 2019-06-05
date_created: 2019-04-07T13:56:19Z
date_updated: 2022-01-06T07:04:02Z
department:
- _id: '66'
- _id: '534'
editor:
- first_name: Cinzia
  full_name: ' Cappiello, Cinzia'
  last_name: ' Cappiello'
- first_name: Marcela
  full_name: Ruiz, Marcela
  last_name: Ruiz
intvolume: '       350'
language:
- iso: eng
page: 145-157
publication: Information Systems Engineering in Responsible Information Systems -
  CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings
status: public
title: Detection and Resolution of Data-Flow Differences in Business Process Models
type: conference
user_id: '39187'
volume: 350
year: '2019'
...
---
_id: '8835'
author:
- first_name: Ivan
  full_name: Jovanovikj, Ivan
  id: '39187'
  last_name: Jovanovikj
  orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Marvin
  full_name: Grieger, Marvin
  last_name: Grieger
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Jovanovikj I, Yigitbas E, Grieger M, Sauer S, Engels G. Modular Construction
    of Context-Specific Test Case Migration Methods. In: <i>Proceedings of the 7th
    International Conference on Model-Driven Engineering and Software Development
    - Volume 1: MODELSWARD,</i>. SciTePress; 2019:536-543. doi:<a href="https://doi.org/10.5220/0007690205360543">10.5220/0007690205360543</a>'
  apa: 'Jovanovikj, I., Yigitbas, E., Grieger, M., Sauer, S., &#38; Engels, G. (2019).
    Modular Construction of Context-Specific Test Case Migration Methods. In <i>Proceedings
    of the 7th International Conference on Model-Driven Engineering and Software Development
    - Volume 1: MODELSWARD,</i> (pp. 536–543). Prague: SciTePress. <a href="https://doi.org/10.5220/0007690205360543">https://doi.org/10.5220/0007690205360543</a>'
  bibtex: '@inproceedings{Jovanovikj_Yigitbas_Grieger_Sauer_Engels_2019, title={Modular
    Construction of Context-Specific Test Case Migration Methods}, DOI={<a href="https://doi.org/10.5220/0007690205360543">10.5220/0007690205360543</a>},
    booktitle={Proceedings of the 7th International Conference on Model-Driven Engineering
    and Software Development - Volume 1: MODELSWARD,}, publisher={SciTePress}, author={Jovanovikj,
    Ivan and Yigitbas, Enes and Grieger, Marvin and Sauer, Stefan and Engels, Gregor},
    year={2019}, pages={536–543} }'
  chicago: 'Jovanovikj, Ivan, Enes Yigitbas, Marvin Grieger, Stefan Sauer, and Gregor
    Engels. “Modular Construction of Context-Specific Test Case Migration Methods.”
    In <i>Proceedings of the 7th International Conference on Model-Driven Engineering
    and Software Development - Volume 1: MODELSWARD,</i> 536–43. SciTePress, 2019.
    <a href="https://doi.org/10.5220/0007690205360543">https://doi.org/10.5220/0007690205360543</a>.'
  ieee: 'I. Jovanovikj, E. Yigitbas, M. Grieger, S. Sauer, and G. Engels, “Modular
    Construction of Context-Specific Test Case Migration Methods,” in <i>Proceedings
    of the 7th International Conference on Model-Driven Engineering and Software Development
    - Volume 1: MODELSWARD,</i> Prague, 2019, pp. 536–543.'
  mla: 'Jovanovikj, Ivan, et al. “Modular Construction of Context-Specific Test Case
    Migration Methods.” <i>Proceedings of the 7th International Conference on Model-Driven
    Engineering and Software Development - Volume 1: MODELSWARD,</i> SciTePress, 2019,
    pp. 536–43, doi:<a href="https://doi.org/10.5220/0007690205360543">10.5220/0007690205360543</a>.'
  short: 'I. Jovanovikj, E. Yigitbas, M. Grieger, S. Sauer, G. Engels, in: Proceedings
    of the 7th International Conference on Model-Driven Engineering and Software Development
    - Volume 1: MODELSWARD, SciTePress, 2019, pp. 536–543.'
conference:
  location: Prague
  name: 7th International Conference on Model-Driven Engineering and Software Development  (MODELSWARD'19)
date_created: 2019-04-07T14:12:34Z
date_updated: 2022-01-06T07:04:02Z
department:
- _id: '66'
- _id: '534'
doi: 10.5220/0007690205360543
language:
- iso: eng
page: 536-543
publication: 'Proceedings of the 7th International Conference on Model-Driven Engineering
  and Software Development - Volume 1: MODELSWARD,'
publication_identifier:
  isbn:
  - 978-989-758-358-2
publisher: SciTePress
status: public
title: Modular Construction of Context-Specific Test Case Migration Methods
type: conference
user_id: '39187'
year: '2019'
...
---
_id: '8861'
author:
- first_name: Anthony
  full_name: Anjorin, Anthony
  last_name: Anjorin
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Hermann
  full_name: Kaindl, Hermann
  last_name: Kaindl
citation:
  ama: 'Anjorin A, Yigitbas E, Kaindl H. Consistent Runtime Adaptation of User Interfaces
    . In: <i>Proceedings of the 8th International Workshop on Bidirectional Transformations
    (Bx 2019)</i>. Vol 2355. CEUR-WS.org; 2019:61-65.'
  apa: 'Anjorin, A., Yigitbas, E., &#38; Kaindl, H. (2019). Consistent Runtime Adaptation
    of User Interfaces . In <i>Proceedings of the 8th International Workshop on Bidirectional
    Transformations (Bx 2019)</i> (Vol. 2355, pp. 61–65). Philadelphia, PA, USA: CEUR-WS.org.'
  bibtex: '@inproceedings{Anjorin_Yigitbas_Kaindl_2019, title={Consistent Runtime
    Adaptation of User Interfaces }, volume={2355}, booktitle={Proceedings of the
    8th International Workshop on Bidirectional Transformations (Bx 2019)}, publisher={CEUR-WS.org},
    author={Anjorin, Anthony and Yigitbas, Enes and Kaindl, Hermann}, year={2019},
    pages={61–65} }'
  chicago: Anjorin, Anthony, Enes Yigitbas, and Hermann Kaindl. “Consistent Runtime
    Adaptation of User Interfaces .” In <i>Proceedings of the 8th International Workshop
    on Bidirectional Transformations (Bx 2019)</i>, 2355:61–65. CEUR-WS.org, 2019.
  ieee: A. Anjorin, E. Yigitbas, and H. Kaindl, “Consistent Runtime Adaptation of
    User Interfaces ,” in <i>Proceedings of the 8th International Workshop on Bidirectional
    Transformations (Bx 2019)</i>, Philadelphia, PA, USA, 2019, vol. 2355, pp. 61–65.
  mla: Anjorin, Anthony, et al. “Consistent Runtime Adaptation of User Interfaces
    .” <i>Proceedings of the 8th International Workshop on Bidirectional Transformations
    (Bx 2019)</i>, vol. 2355, CEUR-WS.org, 2019, pp. 61–65.
  short: 'A. Anjorin, E. Yigitbas, H. Kaindl, in: Proceedings of the 8th International
    Workshop on Bidirectional Transformations (Bx 2019), CEUR-WS.org, 2019, pp. 61–65.'
conference:
  location: Philadelphia, PA, USA
date_created: 2019-04-09T06:49:51Z
date_updated: 2022-01-06T07:04:04Z
department:
- _id: '66'
- _id: '534'
intvolume: '      2355'
language:
- iso: eng
page: 61-65
publication: Proceedings of the 8th International Workshop on Bidirectional Transformations
  (Bx 2019)
publisher: CEUR-WS.org
status: public
title: 'Consistent Runtime Adaptation of User Interfaces '
type: conference
user_id: '8447'
volume: 2355
year: '2019'
...
---
_id: '8866'
author:
- first_name: Klaus
  full_name: Jansen, Klaus
  last_name: Jansen
- first_name: Marten
  full_name: Maack, Marten
  last_name: Maack
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
citation:
  ama: 'Jansen K, Maack M, Mäcker A. Scheduling on (Un-)Related Machines with Setup
    Times. In: <i>Proceedings of the 33rd IEEE International Parallel and Distributed
    Processing Symposium (IPDPS)</i>. IEEE; 2019:145-154.'
  apa: Jansen, K., Maack, M., &#38; Mäcker, A. (2019). Scheduling on (Un-)Related
    Machines with Setup Times. In <i>Proceedings of the 33rd IEEE International Parallel
    and Distributed Processing Symposium (IPDPS)</i> (pp. 145–154). IEEE.
  bibtex: '@inproceedings{Jansen_Maack_Mäcker_2019, title={Scheduling on (Un-)Related
    Machines with Setup Times}, booktitle={Proceedings of the 33rd IEEE International
    Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Jansen,
    Klaus and Maack, Marten and Mäcker, Alexander}, year={2019}, pages={145–154} }'
  chicago: Jansen, Klaus, Marten Maack, and Alexander Mäcker. “Scheduling on (Un-)Related
    Machines with Setup Times.” In <i>Proceedings of the 33rd IEEE International Parallel
    and Distributed Processing Symposium (IPDPS)</i>, 145–54. IEEE, 2019.
  ieee: K. Jansen, M. Maack, and A. Mäcker, “Scheduling on (Un-)Related Machines with
    Setup Times,” in <i>Proceedings of the 33rd IEEE International Parallel and Distributed
    Processing Symposium (IPDPS)</i>, 2019, pp. 145–154.
  mla: Jansen, Klaus, et al. “Scheduling on (Un-)Related Machines with Setup Times.”
    <i>Proceedings of the 33rd IEEE International Parallel and Distributed Processing
    Symposium (IPDPS)</i>, IEEE, 2019, pp. 145–54.
  short: 'K. Jansen, M. Maack, A. Mäcker, in: Proceedings of the 33rd IEEE International
    Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2019, pp. 145–154.'
date_created: 2019-04-09T11:28:46Z
date_updated: 2022-01-06T07:04:04Z
department:
- _id: '63'
language:
- iso: eng
page: 145 - 154
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '1'
  name: SFB 901
publication: Proceedings of the 33rd IEEE International Parallel and Distributed Processing
  Symposium (IPDPS)
publisher: IEEE
status: public
title: Scheduling on (Un-)Related Machines with Setup Times
type: conference
user_id: '13536'
year: '2019'
...
---
_id: '8868'
author:
- first_name: Marcel Dominik
  full_name: Wever, Marcel Dominik
  id: '33176'
  last_name: Wever
  orcid: ' https://orcid.org/0000-0001-9782-6818'
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: Alexander
  full_name: Hetzer, Alexander
  id: '38209'
  last_name: Hetzer
citation:
  ama: 'Wever MD, Mohr F, Hüllermeier E, Hetzer A. Towards Automated Machine Learning
    for Multi-Label Classification. In: ; 2019.'
  apa: Wever, M. D., Mohr, F., Hüllermeier, E., &#38; Hetzer, A. (2019). Towards Automated
    Machine Learning for Multi-Label Classification. Presented at the European Conference
    on Data Analytics (ECDA), Bayreuth, Germany.
  bibtex: '@inproceedings{Wever_Mohr_Hüllermeier_Hetzer_2019, title={Towards Automated
    Machine Learning for Multi-Label Classification}, author={Wever, Marcel Dominik
    and Mohr, Felix and Hüllermeier, Eyke and Hetzer, Alexander}, year={2019} }'
  chicago: Wever, Marcel Dominik, Felix Mohr, Eyke Hüllermeier, and Alexander Hetzer.
    “Towards Automated Machine Learning for Multi-Label Classification,” 2019.
  ieee: M. D. Wever, F. Mohr, E. Hüllermeier, and A. Hetzer, “Towards Automated Machine
    Learning for Multi-Label Classification,” presented at the European Conference
    on Data Analytics (ECDA), Bayreuth, Germany, 2019.
  mla: Wever, Marcel Dominik, et al. <i>Towards Automated Machine Learning for Multi-Label
    Classification</i>. 2019.
  short: 'M.D. Wever, F. Mohr, E. Hüllermeier, A. Hetzer, in: 2019.'
conference:
  end_date: 2019-03-20
  location: Bayreuth, Germany
  name: European Conference on Data Analytics (ECDA)
  start_date: 2019-03-18
date_created: 2019-04-10T07:17:55Z
date_updated: 2022-01-06T07:04:04Z
ddc:
- '000'
department:
- _id: '355'
file:
- access_level: closed
  content_type: application/pdf
  creator: wever
  date_created: 2019-04-10T07:17:17Z
  date_updated: 2019-04-10T07:17:17Z
  file_id: '8870'
  file_name: Towards_Automated_Machine_Learning_for_Multi_Label_Classification.pdf
  file_size: '74484'
  relation: main_file
  success: 1
file_date_updated: 2019-04-10T07:17:17Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '10'
  name: SFB 901 - Subproject B2
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
status: public
title: Towards Automated Machine Learning for Multi-Label Classification
type: conference_abstract
user_id: '49109'
year: '2019'
...
---
_id: '8871'
author:
- first_name: John
  full_name: Augustine, John
  last_name: Augustine
- first_name: Mohsen
  full_name: Ghaffari, Mohsen
  last_name: Ghaffari
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Fabian
  full_name: Kuhn, Fabian
  last_name: Kuhn
- first_name: Jason
  full_name: Li, Jason
  last_name: Li
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated
    Networks. In: <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
    and Architectures</i>. ACM; 2019:69--79. doi:<a href="https://doi.org/10.1145/3323165.3323195">10.1145/3323165.3323195</a>'
  apa: Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., &#38;
    Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In
    <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>
    (pp. 69--79). ACM. <a href="https://doi.org/10.1145/3323165.3323195">https://doi.org/10.1145/3323165.3323195</a>
  bibtex: '@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019,
    title={Distributed Computation in Node-Capacitated Networks}, DOI={<a href="https://doi.org/10.1145/3323165.3323195">10.1145/3323165.3323195</a>},
    booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
    and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen
    and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler,
    Christian}, year={2019}, pages={69--79} }'
  chicago: Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian
    Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated
    Networks.” In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
    and Architectures</i>, 69--79. ACM, 2019. <a href="https://doi.org/10.1145/3323165.3323195">https://doi.org/10.1145/3323165.3323195</a>.
  ieee: J. Augustine <i>et al.</i>, “Distributed Computation in Node-Capacitated Networks,”
    in <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>,
    2019, pp. 69--79.
  mla: Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.”
    <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>,
    ACM, 2019, pp. 69--79, doi:<a href="https://doi.org/10.1145/3323165.3323195">10.1145/3323165.3323195</a>.
  short: 'J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler,
    in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures,
    ACM, 2019, pp. 69--79.'
date_created: 2019-04-10T08:20:34Z
date_updated: 2022-01-06T07:04:04Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3323165.3323195
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T11:17:58Z
  date_updated: 2019-08-26T11:17:58Z
  file_id: '12964'
  file_name: p69-augustine.pdf
  file_size: 1275192
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T11:17:58Z
has_accepted_license: '1'
language:
- iso: eng
page: 69--79
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 31st ACM Symposium on Parallelism in Algorithms and
  Architectures
publisher: ACM
status: public
title: Distributed Computation in Node-Capacitated Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '8880'
author:
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Ivan
  full_name: Jovanovikj, Ivan
  id: '39187'
  last_name: Jovanovikj
  orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: Yigitbas E, Jovanovikj I, Sauer S, Engels G. Towards Model-based Development
    of Context-aware Augmented Reality Applications . <i>Softwaretechnik-Trends, Proceedings
    of the 21st Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 10th
    Workshop Design for Future (DFF)</i>. 2019;39(2):39-40.
  apa: Yigitbas, E., Jovanovikj, I., Sauer, S., &#38; Engels, G. (2019). Towards Model-based
    Development of Context-aware Augmented Reality Applications . <i>Softwaretechnik-Trends,
    Proceedings of the 21st Workshop Software-Reengineering &#38; Evolution (WSRE)
    &#38; 10th Workshop Design for Future (DFF)</i>, <i>39</i>(2), 39–40.
  bibtex: '@article{Yigitbas_Jovanovikj_Sauer_Engels_2019, title={Towards Model-based
    Development of Context-aware Augmented Reality Applications }, volume={39}, number={2},
    journal={Softwaretechnik-Trends, Proceedings of the 21st Workshop Software-Reengineering
    &#38; Evolution (WSRE) &#38; 10th Workshop Design for Future (DFF)}, author={Yigitbas,
    Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor}, year={2019},
    pages={39–40} }'
  chicago: 'Yigitbas, Enes, Ivan Jovanovikj, Stefan Sauer, and Gregor Engels. “Towards
    Model-Based Development of Context-Aware Augmented Reality Applications .” <i>Softwaretechnik-Trends,
    Proceedings of the 21st Workshop Software-Reengineering &#38; Evolution (WSRE)
    &#38; 10th Workshop Design for Future (DFF)</i> 39, no. 2 (2019): 39–40.'
  ieee: E. Yigitbas, I. Jovanovikj, S. Sauer, and G. Engels, “Towards Model-based
    Development of Context-aware Augmented Reality Applications ,” <i>Softwaretechnik-Trends,
    Proceedings of the 21st Workshop Software-Reengineering &#38; Evolution (WSRE)
    &#38; 10th Workshop Design for Future (DFF)</i>, vol. 39, no. 2, pp. 39–40, 2019.
  mla: Yigitbas, Enes, et al. “Towards Model-Based Development of Context-Aware Augmented
    Reality Applications .” <i>Softwaretechnik-Trends, Proceedings of the 21st Workshop
    Software-Reengineering &#38; Evolution (WSRE) &#38; 10th Workshop Design for Future
    (DFF)</i>, vol. 39, no. 2, 2019, pp. 39–40.
  short: E. Yigitbas, I. Jovanovikj, S. Sauer, G. Engels, Softwaretechnik-Trends,
    Proceedings of the 21st Workshop Software-Reengineering &#38; Evolution (WSRE)
    &#38; 10th Workshop Design for Future (DFF) 39 (2019) 39–40.
date_created: 2019-04-11T11:10:43Z
date_updated: 2022-01-06T07:04:05Z
department:
- _id: '66'
- _id: '534'
intvolume: '        39'
issue: '2'
language:
- iso: eng
page: 39-40
publication: Softwaretechnik-Trends, Proceedings of the 21st Workshop Software-Reengineering
  & Evolution (WSRE) & 10th Workshop Design for Future (DFF)
status: public
title: 'Towards Model-based Development of Context-aware Augmented Reality Applications '
type: journal_article
user_id: '8447'
volume: 39
year: '2019'
...
---
_id: '9620'
author:
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: 'André '
  full_name: 'Hottung, André '
  last_name: Hottung
- first_name: Sebastian
  full_name: Mansfield Rojas, Sebastian
  last_name: Mansfield Rojas
- first_name: Anthony
  full_name: Anjorin, Anthony
  last_name: Anjorin
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: Yigitbas E, Hottung A, Mansfield Rojas S, Anjorin A, Sauer S, Engels G. Context-
    and Data-driven Satisfaction Analysis of User Interface Adaptations Based on Instant
    User Feedback. <i>Proceedings of the ACM on Human-Computer Interaction</i>. 2019;3:19:1-19:20.
  apa: Yigitbas, E., Hottung, A., Mansfield Rojas, S., Anjorin, A., Sauer, S., &#38;
    Engels, G. (2019). Context- and Data-driven Satisfaction Analysis of User Interface
    Adaptations Based on Instant User Feedback. <i>Proceedings of the ACM on Human-Computer
    Interaction</i>, <i>3</i>, 19:1-19:20.
  bibtex: '@article{Yigitbas_Hottung_Mansfield Rojas_Anjorin_Sauer_Engels_2019, title={Context-
    and Data-driven Satisfaction Analysis of User Interface Adaptations Based on Instant
    User Feedback}, volume={3}, journal={Proceedings of the ACM on Human-Computer
    Interaction}, author={Yigitbas, Enes and Hottung, André  and Mansfield Rojas,
    Sebastian and Anjorin, Anthony and Sauer, Stefan and Engels, Gregor}, year={2019},
    pages={19:1-19:20} }'
  chicago: 'Yigitbas, Enes, André  Hottung, Sebastian Mansfield Rojas, Anthony Anjorin,
    Stefan Sauer, and Gregor Engels. “Context- and Data-Driven Satisfaction Analysis
    of User Interface Adaptations Based on Instant User Feedback.” <i>Proceedings
    of the ACM on Human-Computer Interaction</i> 3 (2019): 19:1-19:20.'
  ieee: E. Yigitbas, A. Hottung, S. Mansfield Rojas, A. Anjorin, S. Sauer, and G.
    Engels, “Context- and Data-driven Satisfaction Analysis of User Interface Adaptations
    Based on Instant User Feedback,” <i>Proceedings of the ACM on Human-Computer Interaction</i>,
    vol. 3, pp. 19:1-19:20, 2019.
  mla: Yigitbas, Enes, et al. “Context- and Data-Driven Satisfaction Analysis of User
    Interface Adaptations Based on Instant User Feedback.” <i>Proceedings of the ACM
    on Human-Computer Interaction</i>, vol. 3, 2019, pp. 19:1-19:20.
  short: E. Yigitbas, A. Hottung, S. Mansfield Rojas, A. Anjorin, S. Sauer, G. Engels,
    Proceedings of the ACM on Human-Computer Interaction 3 (2019) 19:1-19:20.
date_created: 2019-05-06T12:40:58Z
date_updated: 2022-01-06T07:04:17Z
department:
- _id: '66'
- _id: '534'
intvolume: '         3'
language:
- iso: eng
page: 19:1-19:20
publication: Proceedings of the ACM on Human-Computer Interaction
status: public
title: Context- and Data-driven Satisfaction Analysis of User Interface Adaptations
  Based on Instant User Feedback
type: journal_article
user_id: '8447'
volume: 3
year: '2019'
...
---
_id: '9823'
author:
- first_name: Thomas
  full_name: Soenen, Thomas
  last_name: Soenen
- first_name: Wouter
  full_name: Tavernier, Wouter
  last_name: Tavernier
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Felipe
  full_name: Vicens, Felipe
  last_name: Vicens
- first_name: George
  full_name: Xilouris, George
  last_name: Xilouris
- first_name: Stavros
  full_name: Kolometsos, Stavros
  last_name: Kolometsos
- first_name: Michail-Alexandros
  full_name: Kourtis, Michail-Alexandros
  last_name: Kourtis
- first_name: Didier
  full_name: Colle, Didier
  last_name: Colle
citation:
  ama: 'Soenen T, Tavernier W, Peuster M, et al. Empowering Network Service Developers:
    Enhanced NFV DevOps and Programmable MANO. <i>IEEE Communications Magazine</i>.
    2019:89-95. doi:<a href="https://doi.org/10.1109/mcom.2019.1800810">10.1109/mcom.2019.1800810</a>'
  apa: 'Soenen, T., Tavernier, W., Peuster, M., Vicens, F., Xilouris, G., Kolometsos,
    S., … Colle, D. (2019). Empowering Network Service Developers: Enhanced NFV DevOps
    and Programmable MANO. <i>IEEE Communications Magazine</i>, 89–95. <a href="https://doi.org/10.1109/mcom.2019.1800810">https://doi.org/10.1109/mcom.2019.1800810</a>'
  bibtex: '@article{Soenen_Tavernier_Peuster_Vicens_Xilouris_Kolometsos_Kourtis_Colle_2019,
    title={Empowering Network Service Developers: Enhanced NFV DevOps and Programmable
    MANO}, DOI={<a href="https://doi.org/10.1109/mcom.2019.1800810">10.1109/mcom.2019.1800810</a>},
    journal={IEEE Communications Magazine}, author={Soenen, Thomas and Tavernier,
    Wouter and Peuster, Manuel and Vicens, Felipe and Xilouris, George and Kolometsos,
    Stavros and Kourtis, Michail-Alexandros and Colle, Didier}, year={2019}, pages={89–95}
    }'
  chicago: 'Soenen, Thomas, Wouter Tavernier, Manuel Peuster, Felipe Vicens, George
    Xilouris, Stavros Kolometsos, Michail-Alexandros Kourtis, and Didier Colle. “Empowering
    Network Service Developers: Enhanced NFV DevOps and Programmable MANO.” <i>IEEE
    Communications Magazine</i>, 2019, 89–95. <a href="https://doi.org/10.1109/mcom.2019.1800810">https://doi.org/10.1109/mcom.2019.1800810</a>.'
  ieee: 'T. Soenen <i>et al.</i>, “Empowering Network Service Developers: Enhanced
    NFV DevOps and Programmable MANO,” <i>IEEE Communications Magazine</i>, pp. 89–95,
    2019.'
  mla: 'Soenen, Thomas, et al. “Empowering Network Service Developers: Enhanced NFV
    DevOps and Programmable MANO.” <i>IEEE Communications Magazine</i>, 2019, pp.
    89–95, doi:<a href="https://doi.org/10.1109/mcom.2019.1800810">10.1109/mcom.2019.1800810</a>.'
  short: T. Soenen, W. Tavernier, M. Peuster, F. Vicens, G. Xilouris, S. Kolometsos,
    M.-A. Kourtis, D. Colle, IEEE Communications Magazine (2019) 89–95.
date_created: 2019-05-16T09:07:19Z
date_updated: 2022-01-06T07:04:22Z
department:
- _id: '75'
doi: 10.1109/mcom.2019.1800810
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8713806
page: 89-95
project:
- _id: '28'
  grant_number: '761493'
  name: 5G Development and validation platform for global industry-specific network
    services and Apps
publication: IEEE Communications Magazine
publication_identifier:
  issn:
  - 0163-6804
  - 1558-1896
publication_status: published
status: public
title: 'Empowering Network Service Developers: Enhanced NFV DevOps and Programmable
  MANO'
type: journal_article
user_id: '13271'
year: '2019'
...
---
_id: '9824'
author:
- first_name: Manuel
  full_name: Peuster, Manuel
  id: '13271'
  last_name: Peuster
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
- first_name: Mengxuan
  full_name: Zhao, Mengxuan
  last_name: Zhao
- first_name: George
  full_name: Xilouris, George
  last_name: Xilouris
- first_name: Panagiotis
  full_name: Trakadas, Panagiotis
  last_name: Trakadas
- first_name: Felipe
  full_name: Vicens, Felipe
  last_name: Vicens
- first_name: Wouter
  full_name: Tavernier, Wouter
  last_name: Tavernier
- first_name: Thomas
  full_name: Soenen, Thomas
  last_name: Soenen
- first_name: Ricard
  full_name: Vilalta, Ricard
  last_name: Vilalta
- first_name: George
  full_name: Andreou, George
  last_name: Andreou
- first_name: Dimosthenis
  full_name: Kyriazis, Dimosthenis
  last_name: Kyriazis
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: Peuster M, Schneider SB, Zhao M, et al. Introducing Automated Verification
    and Validation for Virtualized Network Functions and Services. <i>IEEE Communications
    Magazine</i>. 2019:96-102. doi:<a href="https://doi.org/10.1109/mcom.2019.1800873">10.1109/mcom.2019.1800873</a>
  apa: Peuster, M., Schneider, S. B., Zhao, M., Xilouris, G., Trakadas, P., Vicens,
    F., … Karl, H. (2019). Introducing Automated Verification and Validation for Virtualized
    Network Functions and Services. <i>IEEE Communications Magazine</i>, 96–102. <a
    href="https://doi.org/10.1109/mcom.2019.1800873">https://doi.org/10.1109/mcom.2019.1800873</a>
  bibtex: '@article{Peuster_Schneider_Zhao_Xilouris_Trakadas_Vicens_Tavernier_Soenen_Vilalta_Andreou_et
    al._2019, title={Introducing Automated Verification and Validation for Virtualized
    Network Functions and Services}, DOI={<a href="https://doi.org/10.1109/mcom.2019.1800873">10.1109/mcom.2019.1800873</a>},
    journal={IEEE Communications Magazine}, author={Peuster, Manuel and Schneider,
    Stefan Balthasar and Zhao, Mengxuan and Xilouris, George and Trakadas, Panagiotis
    and Vicens, Felipe and Tavernier, Wouter and Soenen, Thomas and Vilalta, Ricard
    and Andreou, George and et al.}, year={2019}, pages={96–102} }'
  chicago: Peuster, Manuel, Stefan Balthasar Schneider, Mengxuan Zhao, George Xilouris,
    Panagiotis Trakadas, Felipe Vicens, Wouter Tavernier, et al. “Introducing Automated
    Verification and Validation for Virtualized Network Functions and Services.” <i>IEEE
    Communications Magazine</i>, 2019, 96–102. <a href="https://doi.org/10.1109/mcom.2019.1800873">https://doi.org/10.1109/mcom.2019.1800873</a>.
  ieee: M. Peuster <i>et al.</i>, “Introducing Automated Verification and Validation
    for Virtualized Network Functions and Services,” <i>IEEE Communications Magazine</i>,
    pp. 96–102, 2019.
  mla: Peuster, Manuel, et al. “Introducing Automated Verification and Validation
    for Virtualized Network Functions and Services.” <i>IEEE Communications Magazine</i>,
    2019, pp. 96–102, doi:<a href="https://doi.org/10.1109/mcom.2019.1800873">10.1109/mcom.2019.1800873</a>.
  short: M. Peuster, S.B. Schneider, M. Zhao, G. Xilouris, P. Trakadas, F. Vicens,
    W. Tavernier, T. Soenen, R. Vilalta, G. Andreou, D. Kyriazis, H. Karl, IEEE Communications
    Magazine (2019) 96–102.
date_created: 2019-05-16T09:09:16Z
date_updated: 2022-01-06T07:04:23Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/mcom.2019.1800873
file:
- access_level: open_access
  content_type: application/pdf
  creator: peuster
  date_created: 2019-05-16T09:13:40Z
  date_updated: 2019-05-16T09:13:40Z
  description: |+
    Preprint of original article: M. Peuster et al., "Introducing Automated Verification and Validation for Virtualized Network Functions and Services," in IEEE Communications Magazine, vol. 57, no. 5, pp. 96-102, May 2019.
    doi: 10.1109/MCOM.2019.1800873

  file_id: '9825'
  file_name: main_for_ris.pdf
  file_size: 1735036
  relation: main_file
  title: Introducing Automated Verification and Validation for Virtualized Network
    Functions and Services
file_date_updated: 2019-05-16T09:13:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/8713807
oa: '1'
page: 96-102
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '16'
  name: SFB 901 - Subproject C4
publication: IEEE Communications Magazine
publication_identifier:
  issn:
  - 0163-6804
  - 1558-1896
publication_status: published
status: public
title: Introducing Automated Verification and Validation for Virtualized Network Functions
  and Services
type: journal_article
user_id: '13271'
year: '2019'
...
...
---
_id: '9939'
author:
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Ivan
  full_name: Jovanovikj, Ivan
  id: '39187'
  last_name: Jovanovikj
  orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Klementina
  full_name: Josifovska, Klementina
  id: '46265'
  last_name: Josifovska
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Yigitbas E, Jovanovikj I, Josifovska K, Sauer S, Engels G. On-the-fly Usability
    Evaluation of Mobile Adaptive UIs through Instant User Feedback . In: <i>Proceedings
    of the 17th IFIP TC.13 International Conference on Human-Computer Interaction
    (INTERACT 2019)</i>. Springer, LNCS; 2019:563-567.'
  apa: Yigitbas, E., Jovanovikj, I., Josifovska, K., Sauer, S., &#38; Engels, G. (2019).
    On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback
    . In <i>Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer
    Interaction (INTERACT 2019)</i> (pp. 563–567). Springer, LNCS.
  bibtex: '@inproceedings{Yigitbas_Jovanovikj_Josifovska_Sauer_Engels_2019, title={On-the-fly
    Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback }, booktitle={Proceedings
    of the 17th IFIP TC.13 International Conference on Human-Computer Interaction
    (INTERACT 2019)}, publisher={Springer, LNCS}, author={Yigitbas, Enes and Jovanovikj,
    Ivan and Josifovska, Klementina and Sauer, Stefan and Engels, Gregor}, year={2019},
    pages={563–567} }'
  chicago: Yigitbas, Enes, Ivan Jovanovikj, Klementina Josifovska, Stefan Sauer, and
    Gregor Engels. “On-the-Fly Usability Evaluation of Mobile Adaptive UIs through
    Instant User Feedback .” In <i>Proceedings of the 17th IFIP TC.13 International
    Conference on Human-Computer Interaction (INTERACT 2019)</i>, 563–67. Springer,
    LNCS, 2019.
  ieee: E. Yigitbas, I. Jovanovikj, K. Josifovska, S. Sauer, and G. Engels, “On-the-fly
    Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback ,” in
    <i>Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer
    Interaction (INTERACT 2019)</i>, 2019, pp. 563–567.
  mla: Yigitbas, Enes, et al. “On-the-Fly Usability Evaluation of Mobile Adaptive
    UIs through Instant User Feedback .” <i>Proceedings of the 17th IFIP TC.13 International
    Conference on Human-Computer Interaction (INTERACT 2019)</i>, Springer, LNCS,
    2019, pp. 563–67.
  short: 'E. Yigitbas, I. Jovanovikj, K. Josifovska, S. Sauer, G. Engels, in: Proceedings
    of the 17th IFIP TC.13 International Conference on Human-Computer Interaction
    (INTERACT 2019), Springer, LNCS, 2019, pp. 563–567.'
date_created: 2019-05-24T13:00:14Z
date_updated: 2020-05-07T05:33:50Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
page: 563-567
publication: Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer
  Interaction (INTERACT 2019)
publisher: Springer, LNCS
status: public
title: 'On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User
  Feedback '
type: conference
user_id: '8447'
year: '2019'
...
---
_id: '5471'
abstract:
- lang: eng
  text: "We characterise the set of dominant strategy incentive compatible (DSIC),
    strongly budget balanced (SBB), and ex-post individually rational (IR) mechanisms
    for the multi-unit bilateral trade setting. In such a setting there is a single
    buyer and a single seller who holds a finite number k of identical items. The
    mechanism has to decide how many units of the item are transferred from the seller
    to the buyer and how much money is transferred from the buyer to the seller. We
    consider two classes of valuation functions for the buyer and seller: Valuations
    that are increasing in the number of units in possession, and the more specific
    class of valuations that are increasing and submodular. \r\nFurthermore, we present
    some approximation results about the performance of certain such mechanisms, in
    terms of social welfare: For increasing submodular valuation functions, we show
    the existence of a deterministic 2-approximation mechanism and a randomised e/(1-e)
    approximation mechanism, matching the best known bounds for the single-item setting."
author:
- first_name: Philip
  full_name: Lazos, Philip
  last_name: Lazos
- first_name: Paul
  full_name: Goldberg, Paul
  last_name: Goldberg
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
- first_name: Matthias
  full_name: Gerstgrasser, Matthias
  last_name: Gerstgrasser
- first_name: Bart
  full_name: de Keijzer, Bart
  last_name: de Keijzer
citation:
  ama: 'Lazos P, Goldberg P, Skopalik A, Gerstgrasser M, de Keijzer B.  Multi-unit
    Bilateral Trade. In: <i>Proceedings of the Thirty-Third AAAI Conference on Artificial
    Intelligence (AAAI)</i>. ; 2019. doi:<a href="https://doi.org/10.1609/aaai.v33i01.33011973">10.1609/aaai.v33i01.33011973</a>'
  apa: Lazos, P., Goldberg, P., Skopalik, A., Gerstgrasser, M., &#38; de Keijzer,
    B. (2019).  Multi-unit Bilateral Trade. <i>Proceedings of the Thirty-Third AAAI
    Conference on Artificial Intelligence (AAAI)</i>. Thirty-Third AAAI Conference
    on Artificial Intelligence (AAAI), Honolulu, Hawaii, USA. <a href="https://doi.org/10.1609/aaai.v33i01.33011973">https://doi.org/10.1609/aaai.v33i01.33011973</a>
  bibtex: '@inproceedings{Lazos_Goldberg_Skopalik_Gerstgrasser_de Keijzer_2019, title={
    Multi-unit Bilateral Trade}, DOI={<a href="https://doi.org/10.1609/aaai.v33i01.33011973">10.1609/aaai.v33i01.33011973</a>},
    booktitle={Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence
    (AAAI)}, author={Lazos, Philip and Goldberg, Paul and Skopalik, Alexander and
    Gerstgrasser, Matthias and de Keijzer, Bart}, year={2019} }'
  chicago: Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser,
    and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In <i>Proceedings of the Thirty-Third
    AAAI Conference on Artificial Intelligence (AAAI)</i>, 2019. <a href="https://doi.org/10.1609/aaai.v33i01.33011973">https://doi.org/10.1609/aaai.v33i01.33011973</a>.
  ieee: 'P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, and B. de Keijzer, “
    Multi-unit Bilateral Trade,” presented at the Thirty-Third AAAI Conference on
    Artificial Intelligence (AAAI), Honolulu, Hawaii, USA, 2019, doi: <a href="https://doi.org/10.1609/aaai.v33i01.33011973">10.1609/aaai.v33i01.33011973</a>.'
  mla: Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” <i>Proceedings of the
    Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)</i>, 2019, doi:<a
    href="https://doi.org/10.1609/aaai.v33i01.33011973">10.1609/aaai.v33i01.33011973</a>.
  short: 'P. Lazos, P. Goldberg, A. Skopalik, M. Gerstgrasser, B. de Keijzer, in:
    Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI),
    2019.'
conference:
  end_date: 2019-02-01
  location: Honolulu, Hawaii, USA
  name: Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)
  start_date: 2019-01-27
date_created: 2018-11-12T09:38:16Z
date_updated: 2022-01-06T07:01:55Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1609/aaai.v33i01.33011973
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-12-06T13:57:51Z
  date_updated: 2018-12-06T13:57:51Z
  file_id: '6018'
  file_name: 1811.05130.pdf
  file_size: 315877
  relation: main_file
  success: 1
file_date_updated: 2018-12-06T13:57:51Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence
  (AAAI)
publication_status: published
status: public
title: ' Multi-unit Bilateral Trade'
type: conference
user_id: '15415'
year: '2019'
...
---
_id: '6860'
author:
- first_name: Haitham
  full_name: Afifi, Haitham
  id: '65718'
  last_name: Afifi
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Afifi H, Karl H. Power Allocation with a Wireless Multi-cast Aware Routing
    for Virtual Network Embedding. In: <i>2019 16th IEEE Annual Consumer Communications
    &#38; Networking Conference (CCNC2019)</i>. Las Vegas: IEEE.'
  apa: 'Afifi, H., &#38; Karl, H. (n.d.). Power Allocation with a Wireless Multi-cast
    Aware Routing for Virtual Network Embedding. In <i>2019 16th IEEE Annual Consumer
    Communications &#38; Networking Conference (CCNC2019)</i>. Las Vegas: IEEE.'
  bibtex: '@inproceedings{Afifi_Karl, place={Las Vegas}, title={Power Allocation with
    a Wireless Multi-cast Aware Routing for Virtual Network Embedding}, booktitle={2019
    16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019)},
    publisher={IEEE}, author={Afifi, Haitham and Karl, Holger} }'
  chicago: 'Afifi, Haitham, and Holger Karl. “Power Allocation with a Wireless Multi-Cast
    Aware Routing for Virtual Network Embedding.” In <i>2019 16th IEEE Annual Consumer
    Communications &#38; Networking Conference (CCNC2019)</i>. Las Vegas: IEEE, n.d.'
  ieee: H. Afifi and H. Karl, “Power Allocation with a Wireless Multi-cast Aware Routing
    for Virtual Network Embedding,” in <i>2019 16th IEEE Annual Consumer Communications
    &#38; Networking Conference (CCNC2019)</i>.
  mla: Afifi, Haitham, and Holger Karl. “Power Allocation with a Wireless Multi-Cast
    Aware Routing for Virtual Network Embedding.” <i>2019 16th IEEE Annual Consumer
    Communications &#38; Networking Conference (CCNC2019)</i>, IEEE.
  short: 'H. Afifi, H. Karl, in: 2019 16th IEEE Annual Consumer Communications &#38;
    Networking Conference (CCNC2019), IEEE, Las Vegas, n.d.'
date_created: 2019-01-17T15:51:34Z
date_updated: 2022-01-06T07:03:22Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: open_access
  content_type: application/pdf
  creator: hafifi
  date_created: 2019-01-17T15:49:37Z
  date_updated: 2019-01-17T15:49:37Z
  file_id: '6861'
  file_name: globecom.pdf
  file_size: 320283
  relation: main_file
file_date_updated: 2019-01-17T15:49:37Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Las Vegas
project:
- _id: '27'
  name: 'Akustische Sensornetzwerke - Teilprojekt '
- _id: '27'
  name: Akustische Sensornetzwerke - Teilprojekt "Verteilte akustische Signalverarbeitung
    über funkbasierte Sensornetzwerke
publication: 2019 16th IEEE Annual Consumer Communications & Networking Conference
  (CCNC2019)
publication_status: accepted
publisher: IEEE
status: public
title: Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network
  Embedding
type: conference
user_id: '65718'
year: '2019'
...
---
_id: '6976'
abstract:
- lang: eng
  text: "We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes
    joining and leaving the network. We assume an adversary that may churn a\r\nconstant
    fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds.
    In particular, the adversary has an almost up-to-date information of\r\nthe network
    topology as it can observe an only slightly outdated topology that\r\nis at least
    $2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction
    that new nodes can only join the network via nodes that have taken\r\npart in
    the network for at least one round.\r\n  Our contributions are as follows: First,
    we show that it is impossible to\r\nmaintain a connected topology if adversary
    has up-to-date information about the\r\nnodes' connections. Further, we show that
    our restriction concerning the join\r\nis also necessary. As our main result present
    an algorithm that constructs a\r\nnew overlay- completely independent of all previous
    overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only
    $\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose
    the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which
    will be maintained by the\r\nalgorithm. However, our approaches can be transferred
    to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."
author:
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
- first_name: Vipin Ravindran
  full_name: Vijayalakshmi, Vipin Ravindran
  last_name: Vijayalakshmi
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your
    Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date
    Adversary. In: <i>Proceedings of the 2019 IEEE 33rd International Parallel  and
    Distributed Processing Symposium (IPDPS ’19)</i>. IEEE.'
  apa: 'Götte, T., Vijayalakshmi, V. R., &#38; Scheideler, C. (n.d.). Always be Two
    Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn
    with an Almost Up-to-date Adversary. In <i>Proceedings of the 2019 IEEE 33rd International
    Parallel  and Distributed Processing Symposium (IPDPS ’19)</i>. Rio de Janeiro,
    Brazil: IEEE.'
  bibtex: '@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps
    Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with
    an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd
    International Parallel  and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE},
    author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}
    }'
  chicago: Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler.
    “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
    Massive Churn with an Almost Up-to-Date Adversary.” In <i>Proceedings of the 2019
    IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS
    ’19)</i>. IEEE, n.d.
  ieee: T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead
    of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost
    Up-to-date Adversary,” in <i>Proceedings of the 2019 IEEE 33rd International Parallel 
    and Distributed Processing Symposium (IPDPS ’19)</i>, Rio de Janeiro, Brazil.
  mla: Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining
    a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” <i>Proceedings
    of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium
    (IPDPS ’19)</i>, IEEE.
  short: 'T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019
    IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS
    ’19), IEEE, n.d.'
conference:
  end_date: 24.05.19
  location: Rio de Janeiro, Brazil
  name: 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium
    (IPDPS '19)
  start_date: 20.05.19
date_created: 2019-01-24T18:53:11Z
date_updated: 2022-01-06T07:03:25Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: thgoette
  date_created: 2019-01-26T16:09:08Z
  date_updated: 2019-01-26T16:09:08Z
  file_id: '7007'
  file_name: Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf
  file_size: 638020
  relation: main_file
  success: 1
file_date_updated: 2019-01-26T16:09:08Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed
  Processing Symposium (IPDPS '19)
publication_status: accepted
publisher: IEEE
status: public
title: Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
  Massive Churn with an Almost Up-to-date Adversary
type: conference
user_id: '34727'
year: '2019'
...
---
_id: '16853'
abstract:
- lang: eng
  text: State-of-the-art frameworks for generating approximate circuits usually rely
    on information gained through circuit synthesis and/or verification to explore
    the search space and to find an optimal solution. Throughout the process, a large
    number of circuits may be subject to processing, leading to considerable runtimes.
    In this work, we propose a search which takes error bounds and pre-computed impact
    factors into account to reduce the number of invoked synthesis and verification
    processes. In our experimental results, we achieved speed-ups of up to 76x while
    area savings remain comparable to the reference search method, simulated annealing.
author:
- first_name: Linus Matthias
  full_name: Witschen, Linus Matthias
  id: '49051'
  last_name: Witschen
- first_name: Hassan
  full_name: Ghasemzadeh Mohammadi, Hassan
  id: '61186'
  last_name: Ghasemzadeh Mohammadi
- first_name: Matthias
  full_name: Artmann, Matthias
  last_name: Artmann
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search:
    A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop
    on Approximate Computing (AxC 2019)</i>.'
  apa: 'Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M.
    (n.d.). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.
    <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.'
  bibtex: '@article{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner, title={Jump Search:
    A Fast Technique for the Synthesis of Approximate Circuits}, journal={Fourth Workshop
    on Approximate Computing (AxC 2019)}, author={Witschen, Linus Matthias and Ghasemzadeh
    Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco} }'
  chicago: 'Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann,
    and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate
    Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>, n.d.'
  ieee: 'L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump
    Search: A Fast Technique for the Synthesis of Approximate Circuits,” <i>Fourth
    Workshop on Approximate Computing (AxC 2019)</i>. .'
  mla: 'Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis
    of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.'
  short: L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, Fourth
    Workshop on Approximate Computing (AxC 2019) (n.d.).
date_created: 2020-04-25T08:02:07Z
date_updated: 2022-01-06T06:52:57Z
ddc:
- '006'
department:
- _id: '78'
file:
- access_level: closed
  content_type: application/pdf
  creator: witschen
  date_created: 2020-04-25T08:00:35Z
  date_updated: 2020-04-25T08:00:35Z
  file_id: '16854'
  file_name: AxC19_paper_3.pdf
  file_size: 152806
  relation: main_file
  success: 1
file_date_updated: 2020-04-25T08:00:35Z
has_accepted_license: '1'
keyword:
- Approximate computing
- parameter selection
- search space exploration
- verification
- circuit synthesis
language:
- iso: eng
page: '2'
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Fourth Workshop on Approximate Computing (AxC 2019)
publication_status: accepted
status: public
title: 'Jump Search: A Fast Technique for the Synthesis of Approximate Circuits'
type: preprint
user_id: '49051'
year: '2019'
...
---
_id: '10577'
abstract:
- lang: eng
  text: "State-of-the-art frameworks for generating approximate circuits automatically
    explore the search space in an iterative process - often greedily. Synthesis and
    verification processes are invoked in each iteration to evaluate the found solutions
    and to guide the search algorithm. As a result, a large number of approximate
    circuits is subjected to analysis - leading to long runtimes - but only a few
    approximate circuits might form an acceptable solution.\r\n\r\nIn this paper,
    we present our Jump Search (JS) method which seeks to reduce the runtime of an
    approximation process by reducing the number of expensive synthesis and verification
    steps. To reduce the runtime, JS computes impact factors for each approximation
    candidate in the circuit to create a selection of approximate circuits without
    invoking synthesis or verification processes. We denote the selection as path
    from which JS determines the final solution. In our experimental results, JS achieved
    speed-ups of up to 57x while area savings remain comparable to the reference search
    method, Simulated Annealing."
author:
- first_name: Linus Matthias
  full_name: Witschen, Linus Matthias
  id: '49051'
  last_name: Witschen
- first_name: Hassan
  full_name: Ghasemzadeh Mohammadi, Hassan
  id: '61186'
  last_name: Ghasemzadeh Mohammadi
- first_name: Matthias
  full_name: Artmann, Matthias
  last_name: Artmann
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search:
    A Fast Technique for the Synthesis of Approximate Circuits. In: <i>Proceedings
    of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>. New York, NY,
    USA: ACM; 2019. doi:<a href="https://doi.org/10.1145/3299874.3317998">10.1145/3299874.3317998</a>'
  apa: 'Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M.
    (2019). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.
    In <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>.
    New York, NY, USA: ACM. <a href="https://doi.org/10.1145/3299874.3317998">https://doi.org/10.1145/3299874.3317998</a>'
  bibtex: '@inproceedings{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner_2019, place={New
    York, NY, USA}, title={Jump Search: A Fast Technique for the Synthesis of Approximate
    Circuits}, DOI={<a href="https://doi.org/10.1145/3299874.3317998">10.1145/3299874.3317998</a>},
    booktitle={Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI
    ’19}, publisher={ACM}, author={Witschen, Linus Matthias and Ghasemzadeh Mohammadi,
    Hassan and Artmann, Matthias and Platzner, Marco}, year={2019} }'
  chicago: 'Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann,
    and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate
    Circuits.” In <i>Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI
    ’19</i>. New York, NY, USA: ACM, 2019. <a href="https://doi.org/10.1145/3299874.3317998">https://doi.org/10.1145/3299874.3317998</a>.'
  ieee: 'L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump
    Search: A Fast Technique for the Synthesis of Approximate Circuits,” in <i>Proceedings
    of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19</i>, Tysons Corner,
    VA, USA, 2019.'
  mla: 'Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis
    of Approximate Circuits.” <i>Proceedings of the 2019 on Great Lakes Symposium
    on VLSI  - GLSVLSI ’19</i>, ACM, 2019, doi:<a href="https://doi.org/10.1145/3299874.3317998">10.1145/3299874.3317998</a>.'
  short: 'L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, in: Proceedings
    of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI ’19, ACM, New York, NY,
    USA, 2019.'
conference:
  end_date: 2019-05-11
  location: Tysons Corner, VA, USA
  name: ACM Great Lakes Symposium on VLSI (GLSVLSI)
  start_date: 2019-05-09
date_created: 2019-07-08T15:13:10Z
date_updated: 2022-01-06T06:50:45Z
department:
- _id: '78'
doi: 10.1145/3299874.3317998
keyword:
- Approximate computing
- design automation
- parameter selection
- circuit synthesis
language:
- iso: eng
place: New York, NY, USA
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI '19
publication_identifier:
  isbn:
  - '9781450362528'
publication_status: published
publisher: ACM
status: public
title: 'Jump Search: A Fast Technique for the Synthesis of Approximate Circuits'
type: conference
user_id: '49051'
year: '2019'
...
---
_id: '10578'
author:
- first_name: V. K.
  full_name: Tagne, V. K.
  last_name: Tagne
- first_name: S.
  full_name: Fotso, S.
  last_name: Fotso
- first_name: 'L. A. '
  full_name: 'Fono, L. A. '
  last_name: Fono
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: Tagne VK, Fotso S, Fono LA, Hüllermeier E. Choice Functions Generated by Mallows
    and Plackett–Luce Relations. <i>New Mathematics and Natural Computation</i>. 2019;15(2):191-213.
  apa: Tagne, V. K., Fotso, S., Fono, L. A., &#38; Hüllermeier, E. (2019). Choice
    Functions Generated by Mallows and Plackett–Luce Relations. <i>New Mathematics
    and Natural Computation</i>, <i>15</i>(2), 191–213.
  bibtex: '@article{Tagne_Fotso_Fono_Hüllermeier_2019, title={Choice Functions Generated
    by Mallows and Plackett–Luce Relations}, volume={15}, number={2}, journal={New
    Mathematics and Natural Computation}, author={Tagne, V. K. and Fotso, S. and Fono,
    L. A.  and Hüllermeier, Eyke}, year={2019}, pages={191–213} }'
  chicago: 'Tagne, V. K., S. Fotso, L. A.  Fono, and Eyke Hüllermeier. “Choice Functions
    Generated by Mallows and Plackett–Luce Relations.” <i>New Mathematics and Natural
    Computation</i> 15, no. 2 (2019): 191–213.'
  ieee: V. K. Tagne, S. Fotso, L. A. Fono, and E. Hüllermeier, “Choice Functions Generated
    by Mallows and Plackett–Luce Relations,” <i>New Mathematics and Natural Computation</i>,
    vol. 15, no. 2, pp. 191–213, 2019.
  mla: Tagne, V. K., et al. “Choice Functions Generated by Mallows and Plackett–Luce
    Relations.” <i>New Mathematics and Natural Computation</i>, vol. 15, no. 2, 2019,
    pp. 191–213.
  short: V.K. Tagne, S. Fotso, L.A. Fono, E. Hüllermeier, New Mathematics and Natural
    Computation 15 (2019) 191–213.
date_created: 2019-07-08T15:34:03Z
date_updated: 2022-01-06T06:50:45Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
intvolume: '        15'
issue: '2'
language:
- iso: eng
page: 191-213
publication: New Mathematics and Natural Computation
status: public
title: Choice Functions Generated by Mallows and Plackett–Luce Relations
type: journal_article
user_id: '315'
volume: 15
year: '2019'
...
---
_id: '10586'
abstract:
- lang: eng
  text: We consider the problem of transforming a given graph G_s into a desired graph
    G_t by applying a minimum number of primitives from a particular set of local
    graph transformation primitives. These primitives are local in the sense that
    each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
    Although the specific set of primitives we consider makes it possible to transform
    any (weakly) connected graph into any other (weakly) connected graph consisting
    of the same nodes, they cannot disconnect the graph or introduce new nodes into
    the graph, making them ideal in the context of supervised overlay network transformations.
    We prove that computing a minimum sequence of primitive applications (even centralized)
    for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
    of local graph transformation primitives satisfying the aforementioned properties.
    On the other hand, we show that this problem admits a polynomial time algorithm
    with a constant approximation ratio.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
    In: <i>Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
    doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>'
  apa: 'Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph
    Transformations. In <i>Proceedings of the 46th International Colloquium on Automata,
    Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece:
    Dagstuhl Publishing. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>'
  bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
    of Local Graph Transformations}, volume={132}, DOI={<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>},
    booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
    and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
    }'
  chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
    Graph Transformations.” In <i>Proceedings of the 46th International Colloquium
    on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl
    Publishing, 2019. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>.
  ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
    in <i>Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
  mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
    Transformations.” <i>Proceedings of the 46th International Colloquium on Automata,
    Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
    doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>.
  short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
    on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
  end_date: 2019-07-12
  location: Patras, Greece
  name: ICALP 2019
  start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T09:21:27Z
  date_updated: 2019-08-26T09:21:27Z
  file_id: '12955'
  file_name: LIPIcs-ICALP-2019-150.pdf
  file_size: 537649
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: '       132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
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 46th International Colloquium on Automata, Languages,
  and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '11709'
author:
- first_name: Martin
  full_name: Potthast, Martin
  last_name: Potthast
- first_name: Lukas
  full_name: Gienapp, Lukas
  last_name: Gienapp
- first_name: Florian
  full_name: Euchner, Florian
  last_name: Euchner
- first_name: Nick
  full_name: Heilenkötter, Nick
  last_name: Heilenkötter
- first_name: Nico
  full_name: Weidmann, Nico
  last_name: Weidmann
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
- first_name: Benno
  full_name: Stein, Benno
  last_name: Stein
- first_name: Matthias
  full_name: Hagen, Matthias
  last_name: Hagen
citation:
  ama: 'Potthast M, Gienapp L, Euchner F, et al. Argument Search: Assessing Argument
    Relevance. In: <i>42nd International ACM Conference on Research and Development
    in Information Retrieval (SIGIR 2019)</i>. ACM; 2019:1117-1120. doi:<a href="https://doi.org/10.1145/3331184.3331327">10.1145/3331184.3331327</a>'
  apa: 'Potthast, M., Gienapp, L., Euchner, F., Heilenkötter, N., Weidmann, N., Wachsmuth,
    H., … Hagen, M. (2019). Argument Search: Assessing Argument Relevance. In <i>42nd
    International ACM Conference on Research and Development in Information Retrieval
    (SIGIR 2019)</i> (pp. 1117–1120). ACM. <a href="https://doi.org/10.1145/3331184.3331327">https://doi.org/10.1145/3331184.3331327</a>'
  bibtex: '@inproceedings{Potthast_Gienapp_Euchner_Heilenkötter_Weidmann_Wachsmuth_Stein_Hagen_2019,
    title={Argument Search: Assessing Argument Relevance}, DOI={<a href="https://doi.org/10.1145/3331184.3331327">10.1145/3331184.3331327</a>},
    booktitle={42nd International ACM Conference on Research and Development in Information
    Retrieval (SIGIR 2019)}, publisher={ACM}, author={Potthast, Martin and Gienapp,
    Lukas and Euchner, Florian and Heilenkötter, Nick and Weidmann, Nico and Wachsmuth,
    Henning and Stein, Benno and Hagen, Matthias}, year={2019}, pages={1117–1120}
    }'
  chicago: 'Potthast, Martin, Lukas Gienapp, Florian Euchner, Nick Heilenkötter, Nico
    Weidmann, Henning Wachsmuth, Benno Stein, and Matthias Hagen. “Argument Search:
    Assessing Argument Relevance.” In <i>42nd International ACM Conference on Research
    and Development in Information Retrieval (SIGIR 2019)</i>, 1117–20. ACM, 2019.
    <a href="https://doi.org/10.1145/3331184.3331327">https://doi.org/10.1145/3331184.3331327</a>.'
  ieee: 'M. Potthast <i>et al.</i>, “Argument Search: Assessing Argument Relevance,”
    in <i>42nd International ACM Conference on Research and Development in Information
    Retrieval (SIGIR 2019)</i>, 2019, pp. 1117–1120.'
  mla: 'Potthast, Martin, et al. “Argument Search: Assessing Argument Relevance.”
    <i>42nd International ACM Conference on Research and Development in Information
    Retrieval (SIGIR 2019)</i>, ACM, 2019, pp. 1117–20, doi:<a href="https://doi.org/10.1145/3331184.3331327">10.1145/3331184.3331327</a>.'
  short: 'M. Potthast, L. Gienapp, F. Euchner, N. Heilenkötter, N. Weidmann, H. Wachsmuth,
    B. Stein, M. Hagen, in: 42nd International ACM Conference on Research and Development
    in Information Retrieval (SIGIR 2019), ACM, 2019, pp. 1117–1120.'
date_created: 2019-07-11T13:09:41Z
date_updated: 2022-01-06T06:51:06Z
department:
- _id: '600'
- _id: '568'
doi: 10.1145/3331184.3331327
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/pdf/10.1145/3331184.3331327
page: 1117 - 1120
publication: 42nd International ACM Conference on Research and Development in Information
  Retrieval (SIGIR 2019)
publisher: ACM
status: public
title: 'Argument Search: Assessing Argument Relevance'
type: conference
user_id: '82920'
year: '2019'
...
