[{"publication":"International Journal of Network Management","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."}],"file":[{"file_size":2571927,"access_level":"open_access","file_id":"8796","file_name":"main_for_ris.pdf","date_updated":"2019-04-01T18:04:14Z","date_created":"2019-04-01T18:04:14Z","creator":"peuster","relation":"main_file","content_type":"application/pdf"}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2019","date_created":"2019-04-01T17:47:36Z","title":"A flow handover protocol to support state migration in softwarized networks","type":"journal_article","status":"public","_id":"8795","project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"department":[{"_id":"75"}],"user_id":"13271","article_number":"e2067","file_date_updated":"2019-04-01T18:04:14Z","has_accepted_license":"1","publication_identifier":{"issn":["1055-7148","1099-1190"]},"publication_status":"published","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>","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.","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} }","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).","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>"},"date_updated":"2022-01-06T07:04:01Z","oa":"1","author":[{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"full_name":"Küttner, Hannes","last_name":"Küttner","first_name":"Hannes"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"doi":"10.1002/nem.2067","main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/abs/10.1002/nem.2067"}]},{"type":"conference","publication":"Information Systems Engineering in Responsible Information Systems - CAiSE Forum 2019, Rome, Italy, June 3-7, 2019, Proceedings","status":"public","editor":[{"last_name":" Cappiello","full_name":" Cappiello, Cinzia","first_name":"Cinzia"},{"first_name":"Marcela","last_name":"Ruiz","full_name":"Ruiz, Marcela"}],"user_id":"39187","department":[{"_id":"66"},{"_id":"534"}],"_id":"8833","language":[{"iso":"eng"}],"citation":{"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.","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.","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.","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.","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.","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} }"},"page":"145-157","intvolume":"       350","year":"2019","author":[{"id":"39187","full_name":"Jovanovikj, Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","last_name":"Jovanovikj","first_name":"Ivan"},{"full_name":"Yigitbas, Enes","id":"8447","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"full_name":"Gerth, Christian","last_name":"Gerth","first_name":"Christian"},{"first_name":"Stefan","full_name":"Sauer, Stefan","id":"447","last_name":"Sauer"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_created":"2019-04-07T13:56:19Z","volume":350,"date_updated":"2022-01-06T07:04:02Z","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"},"title":"Detection and Resolution of Data-Flow Differences in Business Process Models"},{"language":[{"iso":"eng"}],"_id":"8835","user_id":"39187","department":[{"_id":"66"},{"_id":"534"}],"status":"public","type":"conference","publication":"Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,","title":"Modular Construction of Context-Specific Test Case Migration Methods","doi":"10.5220/0007690205360543","conference":{"name":"7th International Conference on Model-Driven Engineering and Software Development  (MODELSWARD'19)","location":"Prague"},"date_updated":"2022-01-06T07:04:02Z","publisher":"SciTePress","author":[{"last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X","id":"39187","full_name":"Jovanovikj, Ivan","first_name":"Ivan"},{"first_name":"Enes","full_name":"Yigitbas, Enes","id":"8447","orcid":"0000-0002-5967-833X","last_name":"Yigitbas"},{"last_name":"Grieger","full_name":"Grieger, Marvin","first_name":"Marvin"},{"last_name":"Sauer","id":"447","full_name":"Sauer, Stefan","first_name":"Stefan"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_created":"2019-04-07T14:12:34Z","year":"2019","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>","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.","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>.","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} }","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.","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>.","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>"},"page":"536-543","publication_identifier":{"isbn":["978-989-758-358-2"]}},{"year":"2019","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.","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.","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.","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} }","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.","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."},"intvolume":"      2355","page":"61-65","publisher":"CEUR-WS.org","date_updated":"2022-01-06T07:04:04Z","author":[{"first_name":"Anthony","full_name":"Anjorin, Anthony","last_name":"Anjorin"},{"last_name":"Yigitbas","orcid":"0000-0002-5967-833X","id":"8447","full_name":"Yigitbas, Enes","first_name":"Enes"},{"full_name":"Kaindl, Hermann","last_name":"Kaindl","first_name":"Hermann"}],"date_created":"2019-04-09T06:49:51Z","volume":2355,"title":"Consistent Runtime Adaptation of User Interfaces ","conference":{"location":"Philadelphia, PA, USA"},"type":"conference","publication":"Proceedings of the 8th International Workshop on Bidirectional Transformations (Bx 2019)","status":"public","_id":"8861","user_id":"8447","department":[{"_id":"66"},{"_id":"534"}],"language":[{"iso":"eng"}]},{"status":"public","publication":"Proceedings of the 33rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","language":[{"iso":"eng"}],"_id":"8866","project":[{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"63"}],"user_id":"13536","year":"2019","page":"145 - 154","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.","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.","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.","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.","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.","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} }"},"title":"Scheduling on (Un-)Related Machines with Setup Times","date_updated":"2022-01-06T07:04:04Z","publisher":"IEEE","date_created":"2019-04-09T11:28:46Z","author":[{"full_name":"Jansen, Klaus","last_name":"Jansen","first_name":"Klaus"},{"full_name":"Maack, Marten","last_name":"Maack","first_name":"Marten"},{"first_name":"Alexander","id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker"}]},{"year":"2019","citation":{"ama":"Wever MD, Mohr F, Hüllermeier E, Hetzer A. Towards Automated Machine Learning for Multi-Label Classification. In: ; 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.","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.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, A. Hetzer, in: 2019.","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} }","mla":"Wever, Marcel Dominik, et al. <i>Towards Automated Machine Learning for Multi-Label Classification</i>. 2019."},"has_accepted_license":"1","title":"Towards Automated Machine Learning for Multi-Label Classification","conference":{"end_date":"2019-03-20","location":"Bayreuth, Germany","name":"European Conference on Data Analytics (ECDA)","start_date":"2019-03-18"},"date_updated":"2022-01-06T07:04:04Z","author":[{"last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","id":"33176","first_name":"Marcel Dominik"},{"last_name":"Mohr","full_name":"Mohr, Felix","first_name":"Felix"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"},{"first_name":"Alexander","full_name":"Hetzer, Alexander","id":"38209","last_name":"Hetzer"}],"date_created":"2019-04-10T07:17:55Z","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-04-10T07:17:17Z","date_created":"2019-04-10T07:17:17Z","creator":"wever","file_size":"74484","access_level":"closed","file_id":"8870","file_name":"Towards_Automated_Machine_Learning_for_Multi_Label_Classification.pdf"}],"type":"conference_abstract","ddc":["000"],"file_date_updated":"2019-04-10T07:17:17Z","language":[{"iso":"eng"}],"_id":"8868","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"355"}],"user_id":"49109"},{"language":[{"iso":"eng"}],"file_date_updated":"2019-08-26T11:17:58Z","ddc":["004"],"department":[{"_id":"79"}],"user_id":"477","_id":"8871","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"p69-augustine.pdf","file_id":"12964","file_size":1275192,"creator":"ups","date_created":"2019-08-26T11:17:58Z","date_updated":"2019-08-26T11:17:58Z"}],"publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures","type":"conference","doi":"10.1145/3323165.3323195","title":"Distributed Computation in Node-Capacitated Networks","date_created":"2019-04-10T08:20:34Z","author":[{"full_name":"Augustine, John","last_name":"Augustine","first_name":"John"},{"full_name":"Ghaffari, Mohsen","last_name":"Ghaffari","first_name":"Mohsen"},{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian"},{"first_name":"Fabian","full_name":"Kuhn, Fabian","last_name":"Kuhn"},{"last_name":"Li","full_name":"Li, Jason","first_name":"Jason"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"publisher":"ACM","date_updated":"2022-01-06T07:04:04Z","page":"69--79","citation":{"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} }","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.","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>","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.","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>.","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>"},"year":"2019","has_accepted_license":"1"},{"issue":"2","intvolume":"        39","page":"39-40","citation":{"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} }","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.","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.","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.","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.","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."},"year":"2019","volume":39,"date_created":"2019-04-11T11:10:43Z","author":[{"full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"first_name":"Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","last_name":"Jovanovikj","full_name":"Jovanovikj, Ivan","id":"39187"},{"id":"447","full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_updated":"2022-01-06T07:04:05Z","title":"Towards Model-based Development of Context-aware Augmented Reality Applications ","publication":"Softwaretechnik-Trends, Proceedings of the 21st Workshop Software-Reengineering & Evolution (WSRE) & 10th Workshop Design for Future (DFF)","type":"journal_article","status":"public","department":[{"_id":"66"},{"_id":"534"}],"user_id":"8447","_id":"8880","language":[{"iso":"eng"}]},{"intvolume":"         3","page":"19:1-19:20","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.","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.","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.","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.","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.","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} }","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."},"year":"2019","volume":3,"date_created":"2019-05-06T12:40:58Z","author":[{"full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"first_name":"André ","full_name":"Hottung, André ","last_name":"Hottung"},{"full_name":"Mansfield Rojas, Sebastian","last_name":"Mansfield Rojas","first_name":"Sebastian"},{"first_name":"Anthony","last_name":"Anjorin","full_name":"Anjorin, Anthony"},{"id":"447","full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"date_updated":"2022-01-06T07:04:17Z","title":"Context- and Data-driven Satisfaction Analysis of User Interface Adaptations Based on Instant User Feedback","publication":"Proceedings of the ACM on Human-Computer Interaction","type":"journal_article","status":"public","department":[{"_id":"66"},{"_id":"534"}],"user_id":"8447","_id":"9620","language":[{"iso":"eng"}]},{"publication":"IEEE Communications Magazine","type":"journal_article","status":"public","_id":"9823","project":[{"name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28","grant_number":"761493"}],"department":[{"_id":"75"}],"user_id":"13271","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0163-6804","1558-1896"]},"publication_status":"published","year":"2019","page":"89-95","citation":{"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.","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} }","short":"T. Soenen, W. Tavernier, M. Peuster, F. Vicens, G. Xilouris, S. Kolometsos, M.-A. Kourtis, D. Colle, IEEE Communications Magazine (2019) 89–95.","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>."},"date_updated":"2022-01-06T07:04:22Z","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"},{"full_name":"Vicens, Felipe","last_name":"Vicens","first_name":"Felipe"},{"first_name":"George","last_name":"Xilouris","full_name":"Xilouris, George"},{"last_name":"Kolometsos","full_name":"Kolometsos, Stavros","first_name":"Stavros"},{"full_name":"Kourtis, Michail-Alexandros","last_name":"Kourtis","first_name":"Michail-Alexandros"},{"first_name":"Didier","full_name":"Colle, Didier","last_name":"Colle"}],"date_created":"2019-05-16T09:07:19Z","title":"Empowering Network Service Developers: Enhanced NFV DevOps and Programmable MANO","doi":"10.1109/mcom.2019.1800810","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8713806"}]},{"publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0163-6804","1558-1896"]},"citation":{"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} }","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.","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>.","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>","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.","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>.","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>"},"page":"96-102","author":[{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343","first_name":"Stefan Balthasar"},{"first_name":"Mengxuan","full_name":"Zhao, Mengxuan","last_name":"Zhao"},{"first_name":"George","full_name":"Xilouris, George","last_name":"Xilouris"},{"first_name":"Panagiotis","last_name":"Trakadas","full_name":"Trakadas, Panagiotis"},{"last_name":"Vicens","full_name":"Vicens, Felipe","first_name":"Felipe"},{"first_name":"Wouter","full_name":"Tavernier, Wouter","last_name":"Tavernier"},{"first_name":"Thomas","last_name":"Soenen","full_name":"Soenen, Thomas"},{"last_name":"Vilalta","full_name":"Vilalta, Ricard","first_name":"Ricard"},{"last_name":"Andreou","full_name":"Andreou, George","first_name":"George"},{"last_name":"Kyriazis","full_name":"Kyriazis, Dimosthenis","first_name":"Dimosthenis"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"oa":"1","date_updated":"2022-01-06T07:04:23Z","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8713807"}],"doi":"10.1109/mcom.2019.1800873","type":"journal_article","status":"public","user_id":"13271","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"9824","file_date_updated":"2019-05-16T09:13:40Z","year":"2019","date_created":"2019-05-16T09:09:16Z","title":"Introducing Automated Verification and Validation for Virtualized Network Functions and Services","publication":"IEEE Communications Magazine","file":[{"date_updated":"2019-05-16T09:13:40Z","date_created":"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.\ndoi: 10.1109/MCOM.2019.1800873\n\n","title":"Introducing Automated Verification and Validation for Virtualized Network Functions and Services","file_id":"9825","access_level":"open_access","relation":"main_file","creator":"peuster","file_size":1735036,"file_name":"main_for_ris.pdf","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"ddc":["000"]},{"author":[{"id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"first_name":"Ivan","id":"39187","full_name":"Jovanovikj, Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X"},{"first_name":"Klementina","id":"46265","full_name":"Josifovska, Klementina","last_name":"Josifovska"},{"id":"447","full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"date_created":"2019-05-24T13:00:14Z","publisher":"Springer, LNCS","date_updated":"2020-05-07T05:33:50Z","title":"On-the-fly Usability Evaluation of Mobile Adaptive UIs through Instant User Feedback ","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.","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.","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.","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.","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} }","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."},"page":"563-567","year":"2019","user_id":"8447","department":[{"_id":"66"},{"_id":"534"}],"_id":"9939","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 17th IFIP TC.13 International Conference on Human-Computer Interaction (INTERACT 2019)","status":"public"},{"citation":{"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>.","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>.","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>","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} }","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.","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>"},"publication_status":"published","has_accepted_license":"1","conference":{"location":"Honolulu, Hawaii, USA","end_date":"2019-02-01","start_date":"2019-01-27","name":"Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)"},"doi":"10.1609/aaai.v33i01.33011973","date_updated":"2022-01-06T07:01:55Z","author":[{"first_name":"Philip","last_name":"Lazos","full_name":"Lazos, Philip"},{"full_name":"Goldberg, Paul","last_name":"Goldberg","first_name":"Paul"},{"first_name":"Alexander","last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander"},{"first_name":"Matthias","last_name":"Gerstgrasser","full_name":"Gerstgrasser, Matthias"},{"first_name":"Bart","last_name":"de Keijzer","full_name":"de Keijzer, Bart"}],"status":"public","type":"conference","file_date_updated":"2018-12-06T13:57:51Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5471","user_id":"15415","department":[{"_id":"541"},{"_id":"63"}],"year":"2019","title":" Multi-unit Bilateral Trade","date_created":"2018-11-12T09:38:16Z","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-12-06T13:57:51Z","creator":"feldi","date_updated":"2018-12-06T13:57:51Z","file_id":"6018","access_level":"closed","file_name":"1811.05130.pdf","file_size":315877}],"publication":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI)","ddc":["000"],"language":[{"iso":"eng"}]},{"year":"2019","place":"Las Vegas","citation":{"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.","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} }","short":"H. Afifi, H. Karl, in: 2019 16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019), IEEE, Las Vegas, n.d.","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.","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>.","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.","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."},"publication_status":"accepted","has_accepted_license":"1","title":"Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding","oa":"1","publisher":"IEEE","date_updated":"2022-01-06T07:03:22Z","date_created":"2019-01-17T15:51:34Z","author":[{"first_name":"Haitham","full_name":"Afifi, Haitham","id":"65718","last_name":"Afifi"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2019-01-17T15:49:37Z","date_created":"2019-01-17T15:49:37Z","creator":"hafifi","file_size":320283,"access_level":"open_access","file_id":"6861","file_name":"globecom.pdf"}],"status":"public","type":"conference","publication":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019)","ddc":["000"],"file_date_updated":"2019-01-17T15:49:37Z","language":[{"iso":"eng"}],"project":[{"name":"Akustische Sensornetzwerke - Teilprojekt ","_id":"27"},{"_id":"27","name":"Akustische Sensornetzwerke - Teilprojekt \"Verteilte akustische Signalverarbeitung über funkbasierte Sensornetzwerke"}],"_id":"6860","user_id":"65718","department":[{"_id":"75"}]},{"publisher":"IEEE","date_created":"2019-01-24T18:53:11Z","title":"Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary","year":"2019","ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS '19)","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2019-01-26T16:09:08Z","creator":"thgoette","date_updated":"2019-01-26T16:09:08Z","file_name":"Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf","file_id":"7007","access_level":"closed","file_size":638020}],"date_updated":"2022-01-06T07:03:25Z","author":[{"full_name":"Götte, Thorsten","id":"34727","last_name":"Götte","first_name":"Thorsten"},{"first_name":"Vipin Ravindran","full_name":"Vijayalakshmi, Vipin Ravindran","last_name":"Vijayalakshmi"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"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"},"publication_status":"accepted","has_accepted_license":"1","citation":{"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.","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} }","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.","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."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"6976","user_id":"34727","department":[{"_id":"79"}],"file_date_updated":"2019-01-26T16:09:08Z","type":"conference","status":"public"},{"publication":"Fourth Workshop on Approximate Computing (AxC 2019)","type":"preprint","abstract":[{"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.","lang":"eng"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"AxC19_paper_3.pdf","access_level":"closed","file_id":"16854","file_size":152806,"creator":"witschen","date_created":"2020-04-25T08:00:35Z","date_updated":"2020-04-25T08:00:35Z"}],"_id":"16853","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"78"}],"user_id":"49051","keyword":["Approximate computing","parameter selection","search space exploration","verification","circuit synthesis"],"ddc":["006"],"file_date_updated":"2020-04-25T08:00:35Z","language":[{"iso":"eng"}],"has_accepted_license":"1","publication_status":"accepted","year":"2019","page":"2","citation":{"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>. .","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.","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>.","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} }","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.).","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>."},"date_updated":"2022-01-06T06:52:57Z","author":[{"first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen"},{"last_name":"Ghasemzadeh Mohammadi","id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan","first_name":"Hassan"},{"first_name":"Matthias","full_name":"Artmann, Matthias","last_name":"Artmann"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_created":"2020-04-25T08:02:07Z","title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits"},{"language":[{"iso":"eng"}],"keyword":["Approximate computing","design automation","parameter selection","circuit synthesis"],"publication":"Proceedings of the 2019 on Great Lakes Symposium on VLSI  - GLSVLSI '19","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."}],"date_created":"2019-07-08T15:13:10Z","publisher":"ACM","title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits","year":"2019","user_id":"49051","department":[{"_id":"78"}],"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"10577","type":"conference","status":"public","author":[{"full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen","first_name":"Linus Matthias"},{"first_name":"Hassan","last_name":"Ghasemzadeh Mohammadi","id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan"},{"last_name":"Artmann","full_name":"Artmann, Matthias","first_name":"Matthias"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"date_updated":"2022-01-06T06:50:45Z","doi":"10.1145/3299874.3317998","conference":{"location":"Tysons Corner, VA, USA","end_date":"2019-05-11","start_date":"2019-05-09","name":"ACM Great Lakes Symposium on VLSI (GLSVLSI)"},"publication_status":"published","publication_identifier":{"isbn":["9781450362528"]},"citation":{"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} }","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.","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>.","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>","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>","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.","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>."},"place":"New York, NY, USA"},{"language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"user_id":"315","_id":"10578","status":"public","publication":"New Mathematics and Natural Computation","type":"journal_article","title":"Choice Functions Generated by Mallows and Plackett–Luce Relations","volume":15,"author":[{"full_name":"Tagne, V. K.","last_name":"Tagne","first_name":"V. K."},{"last_name":"Fotso","full_name":"Fotso, S.","first_name":"S."},{"full_name":"Fono, L. A. ","last_name":"Fono","first_name":"L. A. "},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_created":"2019-07-08T15:34:03Z","date_updated":"2022-01-06T06:50:45Z","page":"191-213","intvolume":"        15","citation":{"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.","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.","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.","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} }","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.","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."},"year":"2019","issue":"2"},{"ddc":["004"],"keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":537649,"file_name":"LIPIcs-ICALP-2019-150.pdf","access_level":"closed","file_id":"12955","date_updated":"2019-08-26T09:21:27Z","creator":"ups","date_created":"2019-08-26T09:21:27Z"}],"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","title":"On the Complexity of Local Graph Transformations","publisher":"Dagstuhl Publishing","date_created":"2019-07-08T17:19:01Z","year":"2019","file_date_updated":"2019-08-26T09:21:27Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"10586","series_title":"LIPIcs","user_id":"477","department":[{"_id":"79"}],"status":"public","type":"conference","doi":"10.4230/LIPICS.ICALP.2019.150","conference":{"location":"Patras, Greece","end_date":"2019-07-12","start_date":"2019-07-09","name":"ICALP 2019"},"date_updated":"2022-01-06T06:50:45Z","author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer","first_name":"Alexander"}],"volume":132,"citation":{"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} }","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.","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.","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>.","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>"},"intvolume":"       132","page":"150:1--150:14","publication_status":"published","has_accepted_license":"1"},{"status":"public","publication":"42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)","type":"conference","language":[{"iso":"eng"}],"_id":"11709","department":[{"_id":"600"},{"_id":"568"}],"user_id":"82920","year":"2019","page":"1117 - 1120","citation":{"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} }","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.","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>","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>","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.","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>."},"title":"Argument Search: Assessing Argument Relevance","doi":"10.1145/3331184.3331327","main_file_link":[{"url":"https://dl.acm.org/doi/pdf/10.1145/3331184.3331327"}],"date_updated":"2022-01-06T06:51:06Z","publisher":"ACM","date_created":"2019-07-11T13:09:41Z","author":[{"first_name":"Martin","last_name":"Potthast","full_name":"Potthast, Martin"},{"full_name":"Gienapp, Lukas","last_name":"Gienapp","first_name":"Lukas"},{"first_name":"Florian","last_name":"Euchner","full_name":"Euchner, Florian"},{"first_name":"Nick","full_name":"Heilenkötter, Nick","last_name":"Heilenkötter"},{"first_name":"Nico","full_name":"Weidmann, Nico","last_name":"Weidmann"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"},{"first_name":"Matthias","last_name":"Hagen","full_name":"Hagen, Matthias"}]}]