[{"department":[{"_id":"76"}],"citation":{"ieee":"J. Späth, L. Nguyen Quang Do, K. Ali, and E. Bodden, “Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java,” in <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2016.","chicago":"Späth, Johannes, Lisa Nguyen Quang Do, Karim Ali, and Eric Bodden. “Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java.” In <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2016.","apa":"Späth, J., Nguyen Quang Do, L., Ali, K., &#38; Bodden, E. (2016). Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java. In <i>European Conference on Object-Oriented Programming (ECOOP)</i>.","ama":"Späth J, Nguyen Quang Do L, Ali K, Bodden E. Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java. In: <i>European Conference on Object-Oriented Programming (ECOOP)</i>. ; 2016.","short":"J. Späth, L. Nguyen Quang Do, K. Ali, E. Bodden, in: European Conference on Object-Oriented Programming (ECOOP), 2016.","bibtex":"@inproceedings{Späth_Nguyen Quang Do_Ali_Bodden_2016, title={Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java}, booktitle={European Conference on Object-Oriented Programming (ECOOP)}, author={Späth, Johannes and Nguyen Quang Do, Lisa and Ali, Karim and Bodden, Eric}, year={2016} }","mla":"Späth, Johannes, et al. “Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java.” <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2016."},"user_id":"477","keyword":["ATTRACT","ITSECWEBSITE"],"main_file_link":[{"url":"http://www.bodden.de/pubs/sna+16boomerang.pdf"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"has_accepted_license":"1","title":"Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java","file":[{"file_size":1921617,"file_name":"sna+16boomerang.pdf","creator":"ups","date_created":"2018-11-02T14:13:19Z","file_id":"5265","content_type":"application/pdf","access_level":"closed","relation":"main_file","date_updated":"2018-11-02T14:13:19Z","success":1}],"author":[{"first_name":"Johannes","full_name":"Späth, Johannes","last_name":"Späth"},{"last_name":"Nguyen Quang Do","first_name":"Lisa","full_name":"Nguyen Quang Do, Lisa"},{"first_name":"Karim","full_name":"Ali, Karim","last_name":"Ali"},{"orcid":"0000-0003-3470-3647","id":"59256","last_name":"Bodden","first_name":"Eric","full_name":"Bodden, Eric"}],"date_updated":"2022-01-06T07:01:45Z","_id":"5205","file_date_updated":"2018-11-02T14:13:19Z","year":"2016","type":"conference","language":[{"iso":"eng"}],"status":"public","publication":"European Conference on Object-Oriented Programming (ECOOP)","ddc":["000"],"date_created":"2018-10-31T12:51:26Z"},{"user_id":"477","citation":{"mla":"Koepe, Jörn. <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016.","bibtex":"@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität Paderborn}, author={Koepe, Jörn}, year={2016} }","short":"J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016.","ama":"Koepe J. <i>Price-Based Allocation Games</i>. Universität Paderborn; 2016.","apa":"Koepe, J. (2016). <i>Price-Based Allocation Games</i>. Universität Paderborn.","chicago":"Koepe, Jörn. <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016.","ieee":"J. Koepe, <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016."},"department":[{"_id":"63"}],"author":[{"last_name":"Koepe","full_name":"Koepe, Jörn","first_name":"Jörn"}],"title":"Price-Based Allocation Games","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"5407","date_updated":"2022-01-06T07:01:51Z","publisher":"Universität Paderborn","date_created":"2018-11-07T09:45:57Z","status":"public","language":[{"iso":"eng"}],"year":"2016","type":"bachelorsthesis"},{"_id":"5418","date_updated":"2022-01-06T07:01:52Z","publisher":"Universität Paderborn","date_created":"2018-11-07T16:10:00Z","status":"public","year":"2016","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","citation":{"apa":"Tölke, C. (2016). <i>Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung</i>. Universität Paderborn.","ama":"Tölke C. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn; 2016.","ieee":"C. Tölke, <i>Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung</i>. Universität Paderborn, 2016.","chicago":"Tölke, Christian. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn, 2016.","bibtex":"@book{Tölke_2016, title={Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung}, publisher={Universität Paderborn}, author={Tölke, Christian}, year={2016} }","mla":"Tölke, Christian. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn, 2016.","short":"C. Tölke, Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung, Universität Paderborn, 2016."},"department":[{"_id":"27"},{"_id":"518"}],"author":[{"first_name":"Christian","full_name":"Tölke, Christian","last_name":"Tölke"}],"title":"Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung","supervisor":[{"orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","first_name":"Christian","id":"16153","last_name":"Plessl"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C2","_id":"14"}]},{"date_updated":"2022-01-06T07:01:53Z","_id":"5420","language":[{"iso":"eng"}],"year":"2016","type":"mastersthesis","status":"public","date_created":"2018-11-07T16:15:51Z","publisher":"Universität Paderborn","department":[{"_id":"27"},{"_id":"518"}],"citation":{"short":"G. Wüllrich, Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment, Universität Paderborn, 2016.","bibtex":"@book{Wüllrich_2016, title={Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment}, publisher={Universität Paderborn}, author={Wüllrich, Gunnar}, year={2016} }","mla":"Wüllrich, Gunnar. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","ieee":"G. Wüllrich, <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","chicago":"Wüllrich, Gunnar. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","ama":"Wüllrich G. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn; 2016.","apa":"Wüllrich, G. (2016). <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn."},"user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"supervisor":[{"full_name":"Plessl, Christian","first_name":"Christian","last_name":"Plessl","id":"16153","orcid":"0000-0001-5728-9982"}],"title":"Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment","author":[{"last_name":"Wüllrich","first_name":"Gunnar","full_name":"Wüllrich, Gunnar"}]},{"publisher":"Universität Paderborn","date_created":"2017-11-14T06:50:35Z","status":"public","language":[{"iso":"eng"}],"year":"2016","type":"mastersthesis","_id":"688","date_updated":"2022-01-06T07:03:23Z","author":[{"first_name":"Damian","full_name":"Kutzias, Damian","last_name":"Kutzias"}],"title":"Friendship Processes in Network Creation Games","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477","citation":{"short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }","mla":"Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","ieee":"D. Kutzias, <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","chicago":"Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","ama":"Kutzias D. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn; 2016.","apa":"Kutzias, D. (2016). <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn."},"department":[{"_id":"63"}]},{"title":"Routing Algorithms on Delayed Networks for Disaster Management Support","author":[{"first_name":"Johannes Sebastian","full_name":"Schaefer, Johannes Sebastian","last_name":"Schaefer","id":"30291"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"bibtex":"@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }","mla":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","short":"J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016.","ama":"Schaefer JS. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn; 2016.","apa":"Schaefer, J. S. (2016). <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn.","ieee":"J. S. Schaefer, <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","chicago":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016."},"user_id":"477","department":[{"_id":"63"}],"date_created":"2017-11-14T06:51:37Z","publisher":"Universität Paderborn","year":"2016","type":"mastersthesis","language":[{"iso":"eng"}],"status":"public","_id":"689","date_updated":"2022-01-06T07:03:23Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"},{"call_identifier":"5G PPP Phase 1","grant_number":"671517","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","_id":"25"}],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We present a YANG model for describing the service structure in deployment requests in a flexible way that enables changing the order of functions in case the order of traversing them does not affect the functionality of the service. Upon receiving such requests, the network orchestration system can choose the optimal composition of service components that gives the best results for placement of services in the network. This introduces new complexities to the placement problem by greatly increasing the number of possible ways a service can be composed. In this paper, we describe a heuristic solution that selects a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different resource requirements of the services. Our evaluations show that the selected combinations consist of representative samples of possible structures and requirements and therefore, can result in optimal or close-to-optimal placement results."}],"doi":"10.1109/NETSOFT.2016.7502412","title":"Placement of Services with Flexible Structures Specified by a YANG Data Model","file":[{"creator":"sevilmeh","file_name":"RIS.pdf","file_size":1471937,"content_type":"application/pdf","access_level":"open_access","file_id":"3322","date_created":"2018-06-25T07:53:54Z","date_updated":"2018-06-25T07:53:54Z","relation":"main_file"}],"main_file_link":[{"url":"http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=10.1109%2FNETSOFT.2016.7502412"}],"oa":"1","user_id":"31764","type":"conference","publication":"Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)","ddc":["040"],"page":"184--192","urn":"1665","author":[{"full_name":"Dräxler, Sevil","first_name":"Sevil","last_name":"Dräxler","id":"31764"},{"id":"126","last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"}],"department":[{"_id":"75"}],"citation":{"apa":"Dräxler, S., &#38; Karl, H. (2016). Placement of Services with Flexible Structures Specified by a YANG Data Model. In <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i> (pp. 184--192). <a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">https://doi.org/10.1109/NETSOFT.2016.7502412</a>","ama":"Dräxler S, Karl H. Placement of Services with Flexible Structures Specified by a YANG Data Model. In: <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>. ; 2016:184--192. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>","chicago":"Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” In <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 184--192, 2016. <a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">https://doi.org/10.1109/NETSOFT.2016.7502412</a>.","ieee":"S. Dräxler and H. Karl, “Placement of Services with Flexible Structures Specified by a YANG Data Model,” in <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 2016, pp. 184--192.","mla":"Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 2016, pp. 184--192, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>.","bibtex":"@inproceedings{Dräxler_Karl_2016, title={Placement of Services with Flexible Structures Specified by a YANG Data Model}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>}, booktitle={Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}, author={Dräxler, Sevil and Karl, Holger}, year={2016}, pages={184--192} }","short":"S. Dräxler, H. Karl, in: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192."},"year":"2016","status":"public","date_created":"2017-10-17T12:41:24Z","date_updated":"2022-01-06T06:52:53Z","file_date_updated":"2018-06-25T07:53:54Z","_id":"166"},{"department":[{"_id":"64"}],"user_id":"25078","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853"}],"citation":{"mla":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","bibtex":"@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }","short":"P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.","apa":"Günther, P. (2016). <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn.","ama":"Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn; 2016.","chicago":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","ieee":"P. Günther, <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn, 2016."},"supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file":[{"relation":"main_file","date_updated":"2018-03-21T12:43:21Z","success":1,"creator":"florida","file_name":"167-thesis_peter_guenther.pdf","file_size":9456552,"access_level":"closed","content_type":"application/pdf","file_id":"1542","date_created":"2018-03-21T12:43:21Z"}],"author":[{"last_name":"Günther","first_name":"Peter","full_name":"Günther, Peter"}],"title":"Physical attacks on pairing-based cryptography","date_updated":"2022-01-06T06:52:54Z","_id":"167","file_date_updated":"2018-03-21T12:43:21Z","status":"public","type":"dissertation","year":"2016","publisher":"Universität Paderborn","ddc":["040"],"date_created":"2017-10-17T12:41:24Z"},{"author":[{"last_name":"Kühne","id":"49079","first_name":"Thomas","full_name":"Kühne, Thomas"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Svetlana","full_name":"Arifulina, Svetlana","last_name":"Arifulina"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"series_title":"LNCS 9594","citation":{"ama":"Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In: <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>. LNCS 9594. ; 2016:278--293. doi:<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>","apa":"Kühne, T., Hamann, H., Arifulina, S., &#38; Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i> (pp. 278--293). <a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">https://doi.org/10.1007/978-3-319-30668-1_18</a>","ieee":"T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application,” in <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 2016, pp. 278--293.","chicago":"Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” In <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 278--293. LNCS 9594, 2016. <a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">https://doi.org/10.1007/978-3-319-30668-1_18</a>.","bibtex":"@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594}, title={Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>}, booktitle={Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }","mla":"Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 2016, pp. 278--293, doi:<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>.","short":"T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293."},"department":[{"_id":"66"},{"_id":"238"},{"_id":"63"}],"date_created":"2017-10-17T12:41:25Z","status":"public","year":"2016","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T12:41:08Z","_id":"169","date_updated":"2022-01-06T06:52:58Z","file":[{"date_created":"2018-03-21T12:41:08Z","content_type":"application/pdf","access_level":"closed","file_id":"1540","file_name":"169-kuehne.pdf","file_size":2069427,"creator":"florida","success":1,"date_updated":"2018-03-21T12:41:08Z","relation":"main_file"}],"title":"Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application","abstract":[{"text":"We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study.","lang":"eng"}],"doi":"10.1007/978-3-319-30668-1_18","has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"user_id":"57458","ddc":["040"],"publication":"Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)","type":"conference","page":"278--293"},{"status":"public","year":"2016","related_material":{"link":[{"url":"https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf","relation":"contains"}]},"date_created":"2017-10-17T12:41:25Z","date_updated":"2022-01-06T06:53:01Z","file_date_updated":"2018-03-21T12:40:27Z","_id":"170","author":[{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"full_name":"Töws, Manuel","first_name":"Manuel","id":"11315","last_name":"Töws"},{"id":"22398","last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"}],"editor":[{"last_name":"Ishikawa F, Romanovsky A","first_name":"Troubitsyna E","full_name":"Ishikawa F, Romanovsky A, Troubitsyna E"}],"department":[{"_id":"77"}],"citation":{"short":"M.-C. Jakobs, M. Töws, F. Pauck, in: T.E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, 2016.","bibtex":"@inproceedings{Jakobs_Töws_Pauck_2016, series={School of Computing Science Technical Report Series}, title={PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)}, booktitle={Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems}, author={Jakobs, Marie-Christine and Töws, Manuel and Pauck, Felix}, editor={Ishikawa F, Romanovsky A, Troubitsyna EEditor}, year={2016}, collection={School of Computing Science Technical Report Series} }","mla":"Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, edited by Troubitsyna E Ishikawa F, Romanovsky A, 2016.","ieee":"M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper),” in <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, 2016.","chicago":"Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” In <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, edited by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical Report Series, 2016.","ama":"Jakobs M-C, Töws M, Pauck F. PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In: Ishikawa F, Romanovsky A TE, ed. <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>. School of Computing Science Technical Report Series. ; 2016.","apa":"Jakobs, M.-C., Töws, M., &#38; Pauck, F. (2016). PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky A (Ed.), <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>."},"series_title":"School of Computing Science Technical Report Series","type":"conference","publication":"Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems","ddc":["040"],"abstract":[{"lang":"eng","text":"We present PAndA2, an extendable, static analysis tool for Android  apps  which  examines  permission  related security  threats  like overprivilege, existence of permission redelegation and permission flows. PAndA2 comes along with a textual and graphical visualization of the analysis result and even supports the comparison of analysis results for different android app versions."}],"has_accepted_license":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file":[{"relation":"main_file","date_updated":"2018-03-21T12:40:27Z","success":1,"creator":"florida","file_name":"170-main_04.pdf","file_size":285299,"content_type":"application/pdf","file_id":"1539","access_level":"closed","date_created":"2018-03-21T12:40:27Z"}],"title":"PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)","user_id":"15504"},{"type":"dissertation","year":"2016","status":"public","date_created":"2017-10-17T12:41:25Z","ddc":["040"],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:06Z","_id":"172","file_date_updated":"2018-03-21T12:39:19Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"has_accepted_license":"1","supervisor":[{"full_name":"Suhl, Lena","first_name":"Lena","last_name":"Suhl"}],"title":"Ontology-based representation of abstract optimization models for model formulation and system generation","file":[{"success":1,"date_updated":"2018-03-21T12:39:19Z","relation":"main_file","date_created":"2018-03-21T12:39:19Z","content_type":"application/pdf","file_id":"1537","access_level":"closed","file_size":9301431,"file_name":"172-FStapelDissertation.pdf","creator":"florida"}],"author":[{"last_name":"Stapel","first_name":"Florian","full_name":"Stapel, Florian"}],"department":[{"_id":"19"}],"citation":{"bibtex":"@book{Stapel_2016, title={Ontology-based representation of abstract optimization models for model formulation and system generation}, publisher={Universität Paderborn}, author={Stapel, Florian}, year={2016} }","mla":"Stapel, Florian. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn, 2016.","short":"F. Stapel, Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation, Universität Paderborn, 2016.","apa":"Stapel, F. (2016). <i>Ontology-based representation of abstract optimization models for model formulation and system generation</i>. Universität Paderborn.","ama":"Stapel F. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn; 2016.","ieee":"F. Stapel, <i>Ontology-based representation of abstract optimization models for model formulation and system generation</i>. Universität Paderborn, 2016.","chicago":"Stapel, Florian. <i>Ontology-Based Representation of Abstract Optimization Models for Model Formulation and System Generation</i>. Universität Paderborn, 2016."},"user_id":"477"},{"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","citation":{"mla":"Handirk, Tobias. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn, 2016.","bibtex":"@book{Handirk_2016, title={Über die Rolle von Informationen in Verkehrsnetzwerken}, publisher={Universität Paderborn}, author={Handirk, Tobias}, year={2016} }","short":"T. Handirk, Über die Rolle von Informationen in Verkehrsnetzwerken, Universität Paderborn, 2016.","ama":"Handirk T. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn; 2016.","apa":"Handirk, T. (2016). <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn.","chicago":"Handirk, Tobias. <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn, 2016.","ieee":"T. Handirk, <i>Über die Rolle von Informationen in Verkehrsnetzwerken</i>. Universität Paderborn, 2016."},"supervisor":[{"id":"40384","last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"author":[{"last_name":"Handirk","first_name":"Tobias","full_name":"Handirk, Tobias"}],"title":"Über die Rolle von Informationen in Verkehrsnetzwerken","date_updated":"2022-01-06T06:50:51Z","_id":"1082","status":"public","language":[{"iso":"ger"}],"year":"2016","type":"bachelorsthesis","publisher":"Universität Paderborn","date_created":"2017-12-19T10:10:17Z"},{"file_date_updated":"2018-03-08T09:14:11Z","_id":"1190","date_updated":"2022-01-06T06:51:12Z","publisher":"Universität Paderborn","date_created":"2018-03-05T10:11:48Z","ddc":["040"],"status":"public","year":"2016","type":"dissertation","user_id":"477","citation":{"ieee":"T. Isenberg, <i>Induction-based Verification of Timed Systems</i>. Universität Paderborn, 2016.","chicago":"Isenberg, Tobias. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn, 2016.","ama":"Isenberg T. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn; 2016.","apa":"Isenberg, T. (2016). <i>Induction-based Verification of Timed Systems</i>. Universität Paderborn.","short":"T. Isenberg, Induction-Based Verification of Timed Systems, Universität Paderborn, 2016.","bibtex":"@book{Isenberg_2016, title={Induction-based Verification of Timed Systems}, publisher={Universität Paderborn}, author={Isenberg, Tobias}, year={2016} }","mla":"Isenberg, Tobias. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn, 2016."},"department":[{"_id":"77"}],"file":[{"date_updated":"2018-03-08T09:14:11Z","relation":"main_file","creator":"florida","file_name":"1190-thesis_abgabeversion.pdf","file_size":3354335,"file_id":"1195","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-08T06:23:21Z"}],"author":[{"full_name":"Isenberg, Tobias","first_name":"Tobias","last_name":"Isenberg"}],"title":"Induction-based Verification of Timed Systems","has_accepted_license":"1","supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"date_created":"2017-10-17T12:41:16Z","publisher":"Universität Paderborn","type":"bachelorsthesis","year":"2016","language":[{"iso":"ger"}],"status":"public","_id":"128","date_updated":"2022-01-06T06:51:20Z","title":"Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen","author":[{"last_name":"Bernhardt","first_name":"Katharina","full_name":"Bernhardt, Katharina"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@book{Bernhardt_2016, title={Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen}, publisher={Universität Paderborn}, author={Bernhardt, Katharina}, year={2016} }","mla":"Bernhardt, Katharina. <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn, 2016.","short":"K. Bernhardt, Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen, Universität Paderborn, 2016.","ama":"Bernhardt K. <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn; 2016.","apa":"Bernhardt, K. (2016). <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn.","ieee":"K. Bernhardt, <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn, 2016.","chicago":"Bernhardt, Katharina. <i>Zertifikate als Qualitätssignal – Wie die Zertifizierung von Produkten und Verkäufern das Vertrauen von Kunden im Onlinehandel beeinflussen</i>. Universität Paderborn, 2016."},"user_id":"477"},{"_id":"129","date_updated":"2022-01-06T06:51:24Z","date_created":"2017-10-17T12:41:16Z","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"type":"bachelorsthesis","year":"2016","status":"public","citation":{"short":"A. Schmidt, Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings, Universität Paderborn, 2016.","bibtex":"@book{Schmidt_2016, title={Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings}, publisher={Universität Paderborn}, author={Schmidt, Alexander}, year={2016} }","mla":"Schmidt, Alexander. <i>Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn, 2016.","ieee":"A. Schmidt, <i>Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn, 2016.","chicago":"Schmidt, Alexander. <i>Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn, 2016.","ama":"Schmidt A. <i>Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn; 2016.","apa":"Schmidt, A. (2016). <i>Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings</i>. Universität Paderborn."},"user_id":"16205","title":"Wie entsteht Kreativität? Ein Überblick über vergleichende Studien zu verschiedenen Formen des Brainstormings","author":[{"last_name":"Schmidt","full_name":"Schmidt, Alexander","first_name":"Alexander"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"17","name":"SFB 901 - Subprojekt C5"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"date_updated":"2022-01-06T06:51:27Z","_id":"130","language":[{"iso":"ger"}],"type":"mastersthesis","year":"2016","status":"public","date_created":"2017-10-17T12:41:17Z","publisher":"Universität Paderborn","department":[{"_id":"280"}],"citation":{"bibtex":"@book{Kaczorkowski_2016, title={Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce}, publisher={Universität Paderborn}, author={Kaczorkowski, Jessica}, year={2016} }","mla":"Kaczorkowski, Jessica. <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn, 2016.","short":"J. Kaczorkowski, Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce, Universität Paderborn, 2016.","apa":"Kaczorkowski, J. (2016). <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn.","ama":"Kaczorkowski J. <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn; 2016.","ieee":"J. Kaczorkowski, <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn, 2016.","chicago":"Kaczorkowski, Jessica. <i>Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce</i>. Universität Paderborn, 2016."},"user_id":"42447","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","id":"37339"}],"title":"Wettbewerb im Internet - Eine wettbewerbspolitische Analyse des E-Commerce","author":[{"full_name":"Kaczorkowski, Jessica","first_name":"Jessica","last_name":"Kaczorkowski"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"title":"Shared Resource Scheduling with Interconnected Services","author":[{"full_name":"König, Jürgen","first_name":"Jürgen","last_name":"König"}],"citation":{"chicago":"König, Jürgen. <i>Shared Resource Scheduling with Interconnected Services</i>. Universität Paderborn, 2016.","ieee":"J. König, <i>Shared Resource Scheduling with Interconnected Services</i>. Universität Paderborn, 2016.","ama":"König J. <i>Shared Resource Scheduling with Interconnected Services</i>. Universität Paderborn; 2016.","apa":"König, J. (2016). <i>Shared Resource Scheduling with Interconnected Services</i>. Universität Paderborn.","short":"J. König, Shared Resource Scheduling with Interconnected Services, Universität Paderborn, 2016.","mla":"König, Jürgen. <i>Shared Resource Scheduling with Interconnected Services</i>. Universität Paderborn, 2016.","bibtex":"@book{König_2016, title={Shared Resource Scheduling with Interconnected Services}, publisher={Universität Paderborn}, author={König, Jürgen}, year={2016} }"},"user_id":"15504","year":"2016","type":"mastersthesis","status":"public","date_created":"2017-10-17T12:41:21Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:20Z","_id":"153"},{"ddc":["040"],"type":"dissertation","volume":353,"title":"Selfish Network Creation - On Variants of Network Creation Games","file":[{"creator":"florida","file_size":800101,"file_name":"154-dissertation.pdf","file_id":"1551","content_type":"application/pdf","access_level":"closed","date_created":"2018-03-21T12:52:03Z","date_updated":"2018-03-21T12:52:03Z","relation":"main_file","success":1}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"has_accepted_license":"1","user_id":"5786","related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24089","relation":"confirmation"}]},"date_created":"2017-10-17T12:41:22Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publication_identifier":{"isbn":["978-3-942647-72-4"]},"year":"2016","language":[{"iso":"eng"}],"status":"public","file_date_updated":"2018-03-21T12:52:03Z","_id":"154","date_updated":"2022-01-06T06:52:23Z","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"}],"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"intvolume":"       353","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","citation":{"chicago":"Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Vol. 353. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","ieee":"A. Cord-Landwehr, <i>Selfish Network Creation - On Variants of Network Creation Games</i>, vol. 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","apa":"Cord-Landwehr, A. (2016). <i>Selfish Network Creation - On Variants of Network Creation Games</i> (Vol. 353). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Cord-Landwehr A. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Vol 353. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2016.","short":"A. Cord-Landwehr, Selfish Network Creation - On Variants of Network Creation Games, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","mla":"Cord-Landwehr, Andreas. <i>Selfish Network Creation - On Variants of Network Creation Games</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2016.","bibtex":"@book{Cord-Landwehr_2016, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Selfish Network Creation - On Variants of Network Creation Games}, volume={353}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Cord-Landwehr, Andreas}, year={2016}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"department":[{"_id":"63"},{"_id":"26"}]},{"page":"248--262","type":"conference","ddc":["040"],"publication":"Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round."}],"doi":"10.1007/978-3-319-49259-9_20","title":"Self-stabilizing Metric Graphs","file":[{"file_size":389136,"file_name":"155-SSS16-GLS.pdf","creator":"florida","date_created":"2018-03-21T12:51:24Z","access_level":"closed","content_type":"application/pdf","file_id":"1550","date_updated":"2018-03-21T12:51:24Z","relation":"main_file","success":1}],"date_updated":"2022-01-06T06:52:28Z","_id":"155","file_date_updated":"2018-03-21T12:51:24Z","year":"2016","status":"public","date_created":"2017-10-17T12:41:22Z","department":[{"_id":"79"}],"citation":{"short":"R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262.","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262, doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>.","bibtex":"@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing Metric Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>}, booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS} }","chicago":"Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 248--262. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>.","ieee":"R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,” in <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262.","apa":"Gmyr, R., Lefèvre, J., &#38; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 248--262). <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>","ama":"Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2016:248--262. doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>"},"series_title":"LNCS","author":[{"full_name":"Gmyr, Robert","first_name":"Robert","last_name":"Gmyr"},{"last_name":"Lefèvre","first_name":"Jonas","full_name":"Lefèvre, Jonas"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}]},{"department":[{"_id":"63"}],"citation":{"bibtex":"@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS}, title={Scheduling with Interjob Communication on Parallel Processors}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577}, collection={LNCS} }","mla":"König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>.","short":"J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 563--577.","ama":"König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob Communication on Parallel Processors. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:563--577. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">10.1007/978-3-319-48749-6_41</a>","apa":"König, J., Mäcker, A., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Scheduling with Interjob Communication on Parallel Processors. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 563--577). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>","ieee":"J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling with Interjob Communication on Parallel Processors,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 563--577.","chicago":"König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 563--577. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_41\">https://doi.org/10.1007/978-3-319-48749-6_41</a>."},"series_title":"LNCS","author":[{"last_name":"König","first_name":"Jürgen","full_name":"König, Jürgen"},{"id":"13536","last_name":"Mäcker","first_name":"Alexander","full_name":"Mäcker, Alexander"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"date_updated":"2022-01-06T06:52:32Z","_id":"157","file_date_updated":"2018-03-21T12:50:29Z","year":"2016","status":"public","date_created":"2017-10-17T12:41:22Z","user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"text":"Consider a scheduling problem in which a set of jobs with interjob communication, canonically represented by a weighted tree, needs to be scheduled on m parallel processors interconnected by a shared communication channel. In each time step, we may allow any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in parallel. The goal is to find a schedule that minimizes the makespan and in which communication demands of all jobs are satisfied.We show that this problem is NP-hard in the strong sense even if the number of processors and the maximum degree of the underlying tree is constant.Consequently, we design and analyze simple approximation algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio of 5/2 in case of arbitrary trees.","lang":"eng"}],"has_accepted_license":"1","doi":"10.1007/978-3-319-48749-6_41","title":"Scheduling with Interjob Communication on Parallel Processors","file":[{"success":1,"relation":"main_file","date_updated":"2018-03-21T12:50:29Z","date_created":"2018-03-21T12:50:29Z","access_level":"closed","file_id":"1549","content_type":"application/pdf","file_name":"157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf","file_size":753147,"creator":"florida"}],"page":"563--577","type":"conference","ddc":["040"],"publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)"}]