[{"place":"New York, NY, USA","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"quality_controlled":"1","citation":{"apa":"Blömer, J., &#38; Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i> (pp. 25:1--25:10). New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>","ieee":"J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, Hamburg, Germany, pp. 25:1--25:10.","short":"J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.","chicago":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” In <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, 25:1--25:10. New York, NY, USA: ACM, n.d. <a href=\"https://doi.org/10.1145/3230833.3230853\">https://doi.org/10.1145/3230833.3230853</a>.","mla":"Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.” <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>, ACM, pp. 25:1--25:10, doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>.","ama":"Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: <i>Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018</i>. New York, NY, USA: ACM; :25:1--25:10. doi:<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>","bibtex":"@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures for Searchable Encryption}, DOI={<a href=\"https://doi.org/10.1145/3230833.3230853\">10.1145/3230833.3230853</a>}, booktitle={Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken, Nils}, pages={25:1--25:10} }"},"file_date_updated":"2018-11-02T14:39:46Z","ddc":["000"],"user_id":"13703","_id":"2965","publisher":"ACM","page":"25:1--25:10","has_accepted_license":"1","conference":{"location":"Hamburg, Germany","name":"ARES 2018"},"status":"public","department":[{"_id":"64"},{"_id":"568"}],"type":"conference","date_created":"2018-06-04T11:33:15Z","file":[{"date_updated":"2018-11-02T14:39:46Z","relation":"main_file","access_level":"closed","file_size":769807,"file_name":"a25-Blomer.pdf","content_type":"application/pdf","success":1,"file_id":"5278","creator":"ups","date_created":"2018-11-02T14:39:46Z"}],"publication":"Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018","doi":"10.1145/3230833.3230853","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:58:49Z","publication_status":"accepted","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"last_name":"Löken","first_name":"Nils","full_name":"Löken, Nils","id":"13703"}],"publication_identifier":{"isbn":["978-1-4503-6448-5"]},"year":"2018","title":"Cloud Architectures for Searchable Encryption"},{"date_created":"2018-06-07T08:47:17Z","file":[{"creator":"abirke","date_created":"2018-11-08T13:25:52Z","date_updated":"2018-11-08T13:25:52Z","relation":"main_file","access_level":"closed","file_size":533731,"file_name":"2018-199.pdf","content_type":"application/pdf","success":1,"file_id":"5453"}],"department":[{"_id":"558"}],"type":"conference","citation":{"short":"D. Derler, T. Jager, D. Slamanig, C. Striecks, in: Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III, 2018, pp. 425--455.","chicago":"Derler, David, Tibor Jager, Daniel Slamanig, and Christoph Striecks. “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.” In <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i>, 425--455, 2018. <a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">https://doi.org/10.1007/978-3-319-78372-7_14</a>.","ieee":"D. Derler, T. Jager, D. Slamanig, and C. Striecks, “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange,” in <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i>, 2018, pp. 425--455.","apa":"Derler, D., Jager, T., Slamanig, D., &#38; Striecks, C. (2018). Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i> (pp. 425--455). <a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">https://doi.org/10.1007/978-3-319-78372-7_14</a>","bibtex":"@inproceedings{Derler_Jager_Slamanig_Striecks_2018, title={Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">10.1007/978-3-319-78372-7_14</a>}, booktitle={Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III}, author={Derler, David and Jager, Tibor and Slamanig, Daniel and Striecks, Christoph}, year={2018}, pages={425--455} }","ama":"Derler D, Jager T, Slamanig D, Striecks C. Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange. In: <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i>. ; 2018:425--455. doi:<a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">10.1007/978-3-319-78372-7_14</a>","mla":"Derler, David, et al. “Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange.” <i>Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III</i>, 2018, pp. 425--455, doi:<a href=\"https://doi.org/10.1007/978-3-319-78372-7_14\">10.1007/978-3-319-78372-7_14</a>."},"file_date_updated":"2018-11-08T13:25:52Z","publication":"Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part III","_id":"3105","language":[{"iso":"eng"}],"page":"425--455","main_file_link":[{"url":"https://eprint.iacr.org/2018/199.pdf"}],"user_id":"38235","doi":"10.1007/978-3-319-78372-7_14","ddc":["006"],"author":[{"full_name":"Derler, David","last_name":"Derler","first_name":"David"},{"id":"64669","first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"first_name":"Daniel","last_name":"Slamanig","full_name":"Slamanig, Daniel"},{"full_name":"Striecks, Christoph","first_name":"Christoph","last_name":"Striecks"}],"title":"Bloom Filter Encryption and Applications to Efficient Forward-Secret 0-RTT Key Exchange","year":"2018","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:58:56Z"},{"oa":"1","file_date_updated":"2019-01-21T16:12:36Z","citation":{"short":"S. Dräxler, H. Karl, Z.A. Mann, IEEE Transactions on Network and Service Management (2018).","chicago":"Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” <i>IEEE Transactions on Network and Service Management</i>, 2018. <a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">https://doi.org/10.1109/TNSM.2018.2846572</a>.","apa":"Dräxler, S., Karl, H., &#38; Mann, Z. A. (2018). JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. <i>IEEE Transactions on Network and Service Management</i>. <a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">https://doi.org/10.1109/TNSM.2018.2846572</a>","ieee":"S. Dräxler, H. Karl, and Z. A. Mann, “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services,” <i>IEEE Transactions on Network and Service Management</i>, 2018.","ama":"Dräxler S, Karl H, Mann ZA. JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services. <i>IEEE Transactions on Network and Service Management</i>. 2018. doi:<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>","bibtex":"@article{Dräxler_Karl_Mann_2018, title={JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>}, journal={IEEE Transactions on Network and Service Management}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2018} }","mla":"Dräxler, Sevil, et al. “JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services.” <i>IEEE Transactions on Network and Service Management</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/TNSM.2018.2846572\">10.1109/TNSM.2018.2846572</a>."},"project":[{"name":"5G Programmable Infrastructure Converging disaggregated neTwork and compUte Resources","_id":"23","grant_number":"762057"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"3152","publisher":"IEEE","urn":"31522","ddc":["000"],"user_id":"31764","status":"public","has_accepted_license":"1","file":[{"file_id":"5302","content_type":"application/pdf","success":1,"file_name":"08382313.pdf","access_level":"closed","file_size":1767054,"relation":"main_file","date_updated":"2018-11-02T15:25:49Z","date_created":"2018-11-02T15:25:49Z","creator":"ups"},{"file_id":"6950","content_type":"application/pdf","relation":"main_file","date_updated":"2019-01-21T16:12:36Z","file_name":"TNSM2846572_RIS.pdf","access_level":"open_access","file_size":2878350,"date_created":"2019-01-21T16:12:36Z","creator":"sevilmeh"}],"date_created":"2018-06-11T06:55:05Z","type":"journal_article","department":[{"_id":"75"}],"publication":"IEEE Transactions on Network and Service Management","abstract":[{"text":"To adapt to continuously changing workloads in networks, components of the running network services may need to be replicated (scaling the network service) and allocated to physical resources (placement) dynamically, also necessitating dynamic re-routing of flows between service components. In this paper, we propose JASPER, a fully automated approach to jointly optimizing scaling, placement, and routing for complex network services, consisting of multiple (virtualized) components. JASPER handles multiple network services that share the same substrate network; services can be dynamically added or removed and dynamic workload changes are handled. Our approach lets service designers specify their services on a high level of abstraction using service templates. JASPER automatically makes scaling, placement and routing decisions, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability and effectiveness of the proposed approach.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1711.10839","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1109/TNSM.2018.2846572","title":"JASPER: Joint Optimization of Scaling, Placement, and Routing of Virtual Network Services","year":"2018","author":[{"full_name":"Dräxler, Sevil","first_name":"Sevil","last_name":"Dräxler","id":"31764"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"},{"first_name":"Zoltan Adam","last_name":"Mann","full_name":"Mann, Zoltan Adam"}],"date_updated":"2022-01-06T06:59:00Z","article_type":"original"},{"date_created":"2018-06-13T07:26:35Z","department":[{"_id":"77"}],"type":"journal_article","citation":{"apa":"Doherty, S., Derrick, J., Dongol, B., &#38; Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. <i>CoRR</i>.","ieee":"S. Doherty, J. Derrick, B. Dongol, and H. Wehrheim, “Causal Linearizability: Compositionality for Partially Ordered Executions,” <i>CoRR</i>, 2018.","short":"S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018).","chicago":"Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal Linearizability: Compositionality for Partially Ordered Executions.” <i>CoRR</i>, 2018.","mla":"Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially Ordered Executions.” <i>CoRR</i>, 2018.","ama":"Doherty S, Derrick J, Dongol B, Wehrheim H. Causal Linearizability: Compositionality for Partially Ordered Executions. <i>CoRR</i>. 2018.","bibtex":"@article{Doherty_Derrick_Dongol_Wehrheim_2018, title={Causal Linearizability: Compositionality for Partially Ordered Executions}, journal={CoRR}, author={Doherty, Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}, year={2018} }"},"publication":"CoRR","_id":"3153","user_id":"29719","author":[{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"status":"public","year":"2018","title":"Causal Linearizability: Compositionality for Partially Ordered Executions","date_updated":"2022-01-06T06:59:00Z"},{"date_created":"2018-05-09T08:27:11Z","file":[{"date_created":"2018-11-21T10:49:23Z","creator":"florida","file_id":"5781","content_type":"application/pdf","success":1,"file_name":"Do Android Taint Analysis Tools Keep their Promises.pdf","file_size":1045861,"access_level":"closed","relation":"main_file","date_updated":"2018-11-21T10:49:23Z"}],"department":[{"_id":"77"},{"_id":"76"}],"type":"preprint","citation":{"ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep their Promises?,” <i>arXiv:1804.02903</i>. 2018.","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? <i>ArXiv:1804.02903</i>.","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","short":"F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018).","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","bibtex":"@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }","ama":"Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? <i>arXiv:180402903</i>. 2018."},"publication":"arXiv:1804.02903","file_date_updated":"2018-11-21T10:49:23Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"abstract":[{"lang":"eng","text":"In recent years, researchers have developed a number of tools to conduct\r\ntaint analysis of Android applications. While all the respective papers aim at\r\nproviding a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely described. In other cases, authors use an established benchmark but\r\ncover it only partially. In yet other cases, the evaluations differ in terms of\r\nthe data leaks searched for, or lack a ground truth to compare against. All\r\nthose limitations make it impossible to truly compare the tools based on those\r\npublished evaluations.\r\n  We thus present ReproDroid, a framework allowing the accurate comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers in inferring the\r\nground truth for data leaks in apps, in automatically applying tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are\r\nlargely positive although four tools violate some promises concerning features\r\nand accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na new and improved version of the open test suite DroidBench."}],"_id":"2711","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"477","author":[{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"},{"orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"status":"public","title":"Do Android Taint Analysis Tools Keep their Promises?","year":"2018","has_accepted_license":"1","date_updated":"2022-01-06T06:57:35Z"},{"type":"dissertation","department":[{"_id":"79"}],"date_created":"2018-01-31T06:04:03Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"mla":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>.","bibtex":"@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>}, publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }","ama":"Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-265\">10.17619/UNIPB/1-265</a>","ieee":"R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018.","apa":"Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>","short":"R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter, Universität Paderborn, 2018.","chicago":"Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-265\">https://doi.org/10.17619/UNIPB/1-265</a>."},"doi":"10.17619/UNIPB/1-265","user_id":"477","publisher":"Universität Paderborn","_id":"1138","date_updated":"2022-01-06T06:51:00Z","title":"Distributed Algorithms for Overlay Networks and Programmable Matter","status":"public","year":"2018","author":[{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"}]},{"date_updated":"2022-01-06T06:51:05Z","author":[{"id":"23538","first_name":"Michael","last_name":"Feldmann","full_name":"Feldmann, Michael"},{"full_name":"Kolb, Christina","last_name":"Kolb","first_name":"Christina","id":"43647"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"year":"2018","title":"Self-Stabilizing Supervised Publish-Subscribe Systems","doi":"10.1109/IPDPS.2018.00114","language":[{"iso":"eng"}],"abstract":[{"text":"In this paper we present two major results:\r\nFirst, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05}) by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system.\r\n","lang":"eng"}],"publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","department":[{"_id":"79"},{"_id":"66"}],"keyword":["Topological Self-stabilization","Supervised Overlay","Publish-Subscribe System"],"type":"conference","date_created":"2018-02-01T13:56:01Z","file":[{"date_created":"2018-10-31T13:25:37Z","creator":"mfeldma2","file_id":"5211","content_type":"application/pdf","success":1,"file_name":"08425258.pdf","file_size":239559,"access_level":"closed","relation":"main_file","date_updated":"2018-10-31T13:25:37Z"}],"has_accepted_license":"1","conference":{"end_date":"2018-5-24","location":"Vancouver","start_date":"2018-5-22","name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)"},"status":"public","ddc":["040"],"user_id":"11319","_id":"1163","publisher":"IEEE","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"citation":{"apa":"Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>","mla":"Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>.","ieee":"M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","chicago":"Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">https://doi.org/10.1109/IPDPS.2018.00114</a>.","short":"M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","ama":"Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised Publish-Subscribe Systems. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing Supervised Publish-Subscribe Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00114\">10.1109/IPDPS.2018.00114</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018} }"},"file_date_updated":"2018-10-31T13:25:37Z","external_id":{"arxiv":["1710.08128"]}},{"external_id":{"arxiv":["1802.07504"]},"citation":{"mla":"Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>.","bibtex":"@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable and Sequentially Consistent Distributed Queue}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>}, booktitle={Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and Scheideler, Christian and Setzer, Alexander}, year={2018} }","ama":"Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent Distributed Queue. In: <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">10.1109/IPDPS.2018.00113</a>","ieee":"M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.","apa":"Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>","short":"M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS), IEEE, 2018.","chicago":"Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.” In <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/IPDPS.2018.00113\">https://doi.org/10.1109/IPDPS.2018.00113</a>."},"file_date_updated":"2018-10-31T13:29:26Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"1164","publisher":"IEEE","user_id":"23538","ddc":["040"],"conference":{"name":"32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","start_date":"2018-5-22","location":"Vancouver","end_date":"2018-5-24"},"status":"public","has_accepted_license":"1","date_created":"2018-02-01T14:00:36Z","file":[{"relation":"main_file","date_updated":"2018-10-31T13:29:26Z","file_name":"08425257.pdf","access_level":"closed","file_size":218420,"file_id":"5212","success":1,"content_type":"application/pdf","creator":"mfeldma2","date_created":"2018-10-31T13:29:26Z"}],"department":[{"_id":"79"}],"type":"conference","publication":"Proceedings of the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)","abstract":[{"lang":"eng","text":"We propose a distributed protocol for a queue, called Skueue, which spreads its data fairly onto multiple processes, avoiding bottlenecks in high throughput scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability is achieved by aggregating multiple requests to a batch, which can then be processed in a distributed fashion without hurting the queue semantics.\r\nOperations in Skueue need a logarithmic number of rounds w.h.p. until they are processed, even under a high rate of incoming requests."}],"language":[{"iso":"eng"}],"doi":"10.1109/IPDPS.2018.00113","author":[{"full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael","id":"23538"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"id":"11108","first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander"}],"title":"Skueue: A Scalable and Sequentially Consistent Distributed Queue","year":"2018","date_updated":"2022-01-06T06:51:05Z"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"file_date_updated":"2018-11-26T08:00:53Z","publication":"4th Workshop On Approximate Computing (WAPCO 2018)","citation":{"chicago":"Witschen, Linus Matthias, Tobias Wiersema, and Marco Platzner. “Making the Case for Proof-Carrying Approximate Circuits.” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>, 2018.","short":"L.M. Witschen, T. Wiersema, M. Platzner, 4th Workshop On Approximate Computing (WAPCO 2018) (2018).","apa":"Witschen, L. M., Wiersema, T., &#38; Platzner, M. (2018). Making the Case for Proof-carrying Approximate Circuits. <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>.","ieee":"L. M. Witschen, T. Wiersema, and M. Platzner, “Making the Case for Proof-carrying Approximate Circuits,” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>. 2018.","ama":"Witschen LM, Wiersema T, Platzner M. Making the Case for Proof-carrying Approximate Circuits. <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>. 2018.","bibtex":"@article{Witschen_Wiersema_Platzner_2018, title={Making the Case for Proof-carrying Approximate Circuits}, journal={4th Workshop On Approximate Computing (WAPCO 2018)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Platzner, Marco}, year={2018} }","mla":"Witschen, Linus Matthias, et al. “Making the Case for Proof-Carrying Approximate Circuits.” <i>4th Workshop On Approximate Computing (WAPCO 2018)</i>, 2018."},"type":"preprint","department":[{"_id":"7"},{"_id":"34"},{"_id":"78"}],"file":[{"access_level":"closed","file_size":287224,"file_name":"WitschenWP2018[1].pdf","date_updated":"2018-11-26T08:00:53Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5821","creator":"tobias82","date_created":"2018-11-26T08:00:53Z"}],"date_created":"2018-02-01T14:24:54Z","date_updated":"2022-01-06T06:51:06Z","has_accepted_license":"1","title":"Making the Case for Proof-carrying Approximate Circuits","status":"public","year":"2018","author":[{"full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias","id":"49051"},{"last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"user_id":"49051","ddc":["000"],"_id":"1165","language":[{"iso":"eng"}]},{"conference":{"location":"Kyoto, Japan","name":"GECCO 2018","start_date":"2018-07-15","end_date":"2018-07-19"},"status":"public","has_accepted_license":"1","publisher":"ACM","_id":"2109","ddc":["000"],"user_id":"33176","citation":{"short":"M.D. Wever, F. Mohr, E. Hüllermeier, in: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018, ACM, Kyoto, Japan, 2018.","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Ensembles of Evolved Nested Dichotomies for Classification.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM, 2018. <a href=\"https://doi.org/10.1145/3205455.3205562\">https://doi.org/10.1145/3205455.3205562</a>.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Ensembles of Evolved Nested Dichotomies for Classification,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, Kyoto, Japan, 2018.","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). Ensembles of Evolved Nested Dichotomies for Classification. In <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM. <a href=\"https://doi.org/10.1145/3205455.3205562\">https://doi.org/10.1145/3205455.3205562</a>","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_2018, place={Kyoto, Japan}, title={Ensembles of Evolved Nested Dichotomies for Classification}, DOI={<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018}, publisher={ACM}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","ama":"Wever MD, Mohr F, Hüllermeier E. Ensembles of Evolved Nested Dichotomies for Classification. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>. Kyoto, Japan: ACM; 2018. doi:<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>","mla":"Wever, Marcel Dominik, et al. “Ensembles of Evolved Nested Dichotomies for Classification.” <i>Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018</i>, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3205455.3205562\">10.1145/3205455.3205562</a>."},"file_date_updated":"2018-11-02T14:33:54Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"place":"Kyoto, Japan","oa":"1","author":[{"id":"33176","first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"title":"Ensembles of Evolved Nested Dichotomies for Classification","year":"2018","date_updated":"2022-01-06T06:54:45Z","publication_status":"published","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://dl.acm.org/citation.cfm?doid=3205455.3205562"}],"doi":"10.1145/3205455.3205562","publication":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, Kyoto, Japan, July 15-19, 2018","abstract":[{"lang":"eng","text":"In multinomial classification, reduction techniques are commonly used to decompose the original learning problem into several simpler problems. For example, by recursively bisecting the original set of classes, so-called nested dichotomies define a set of binary classification problems that are organized in the structure of a binary tree. In contrast to the existing one-shot heuristics for constructing nested dichotomies and motivated by recent work on algorithm configuration, we propose a genetic algorithm for optimizing the structure of such dichotomies. A key component of this approach is the proposed genetic representation that facilitates the application of standard genetic operators, while still supporting the exchange of partial solutions under recombination. We evaluate the approach in an extensive experimental study, showing that it yields classifiers with superior generalization performance."}],"date_created":"2018-03-31T13:51:23Z","file":[{"creator":"ups","date_created":"2018-11-02T14:33:54Z","access_level":"closed","file_size":875404,"file_name":"p561-wever.pdf","date_updated":"2018-11-02T14:33:54Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"5275"}],"department":[{"_id":"355"}],"keyword":["Classification","Hierarchical Decomposition","Indirect Encoding"],"type":"conference"},{"abstract":[{"lang":"eng","text":"Predictive control of power electronic systems always requires a suitable\r\nmodel of the plant. Using typical physics-based white box models, a trade-off\r\nbetween model complexity (i.e. accuracy) and computational burden has to be\r\nmade. This is a challenging task with a lot of constraints, since the model\r\norder is directly linked to the number of system states. Even though white-box\r\nmodels show suitable performance in most cases, parasitic real-world effects\r\noften cannot be modeled satisfactorily with an expedient computational load.\r\nHence, a Koopman operator-based model reduction technique is presented which\r\ndirectly links the control action to the system's outputs in a black-box\r\nfashion. The Koopman operator is a linear but infinite-dimensional operator\r\ndescribing the dynamics of observables of nonlinear autonomous dynamical\r\nsystems which can be nicely applied to the switching principle of power\r\nelectronic devices. Following this data-driven approach, the model order and\r\nthe number of system states are decoupled which allows us to consider more\r\ncomplex systems. Extensive experimental tests with an automotive-type permanent\r\nmagnet synchronous motor fed by an IGBT 2-level inverter prove the feasibility\r\nof the proposed modeling technique in a finite-set model predictive control\r\napplication."}],"citation":{"mla":"Hanke, Sören, et al. “Koopman Operator-Based Finite-Control-Set Model Predictive Control for  Electrical Drives.” <i>ArXiv:1804.00854</i>, 2018.","bibtex":"@article{Hanke_Peitz_Wallscheid_Klus_Böcker_Dellnitz_2018, title={Koopman Operator-Based Finite-Control-Set Model Predictive Control for  Electrical Drives}, journal={arXiv:1804.00854}, author={Hanke, Sören and Peitz, Sebastian and Wallscheid, Oliver and Klus, Stefan and Böcker, Joachim and Dellnitz, Michael}, year={2018} }","ama":"Hanke S, Peitz S, Wallscheid O, Klus S, Böcker J, Dellnitz M. Koopman Operator-Based Finite-Control-Set Model Predictive Control for  Electrical Drives. <i>arXiv:180400854</i>. 2018.","ieee":"S. Hanke, S. Peitz, O. Wallscheid, S. Klus, J. Böcker, and M. Dellnitz, “Koopman Operator-Based Finite-Control-Set Model Predictive Control for  Electrical Drives,” <i>arXiv:1804.00854</i>. 2018.","apa":"Hanke, S., Peitz, S., Wallscheid, O., Klus, S., Böcker, J., &#38; Dellnitz, M. (2018). Koopman Operator-Based Finite-Control-Set Model Predictive Control for  Electrical Drives. <i>ArXiv:1804.00854</i>.","short":"S. Hanke, S. Peitz, O. Wallscheid, S. Klus, J. Böcker, M. Dellnitz, ArXiv:1804.00854 (2018).","chicago":"Hanke, Sören, Sebastian Peitz, Oliver Wallscheid, Stefan Klus, Joachim Böcker, and Michael Dellnitz. “Koopman Operator-Based Finite-Control-Set Model Predictive Control for  Electrical Drives.” <i>ArXiv:1804.00854</i>, 2018."},"publication":"arXiv:1804.00854","department":[{"_id":"101"}],"oa":"1","type":"preprint","date_created":"2021-04-19T16:17:30Z","date_updated":"2022-01-06T06:55:08Z","author":[{"last_name":"Hanke","first_name":"Sören","full_name":"Hanke, Sören"},{"orcid":"0000-0002-3389-793X","last_name":"Peitz","first_name":"Sebastian","full_name":"Peitz, Sebastian","id":"47427"},{"last_name":"Wallscheid","first_name":"Oliver","full_name":"Wallscheid, Oliver"},{"full_name":"Klus, Stefan","last_name":"Klus","first_name":"Stefan"},{"first_name":"Joachim","last_name":"Böcker","full_name":"Böcker, Joachim"},{"full_name":"Dellnitz, Michael","last_name":"Dellnitz","first_name":"Michael"}],"title":"Koopman Operator-Based Finite-Control-Set Model Predictive Control for  Electrical Drives","status":"public","year":"2018","user_id":"47427","_id":"21634","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/1804.00854.pdf","open_access":"1"}]},{"user_id":"57458","doi":"10.1109/icsa-c.2018.00009","_id":"17345","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:08Z","title":"IoT-ASAP 2018: Message from the Chairs","year":"2018","status":"public","author":[{"full_name":"Spalazzese, Romina","first_name":"Romina","last_name":"Spalazzese"},{"full_name":"Platenius, Marie C.","first_name":"Marie C.","last_name":"Platenius"},{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"publication_identifier":{"isbn":["9781538665855"]},"type":"conference","department":[{"_id":"66"}],"date_created":"2020-06-26T11:22:36Z","publication":"2018 IEEE International Conference on Software Architecture Companion (ICSA-C)","citation":{"mla":"Spalazzese, Romina, et al. “IoT-ASAP 2018: Message from the Chairs.” <i>2018 IEEE International Conference on Software Architecture Companion (ICSA-C)</i>, 2018, doi:<a href=\"https://doi.org/10.1109/icsa-c.2018.00009\">10.1109/icsa-c.2018.00009</a>.","bibtex":"@inproceedings{Spalazzese_Platenius_Becker_Engels_2018, title={IoT-ASAP 2018: Message from the Chairs}, DOI={<a href=\"https://doi.org/10.1109/icsa-c.2018.00009\">10.1109/icsa-c.2018.00009</a>}, booktitle={2018 IEEE International Conference on Software Architecture Companion (ICSA-C)}, author={Spalazzese, Romina and Platenius, Marie C. and Becker, Steffen and Engels, Gregor}, year={2018} }","ama":"Spalazzese R, Platenius MC, Becker S, Engels G. IoT-ASAP 2018: Message from the Chairs. In: <i>2018 IEEE International Conference on Software Architecture Companion (ICSA-C)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1109/icsa-c.2018.00009\">10.1109/icsa-c.2018.00009</a>","ieee":"R. Spalazzese, M. C. Platenius, S. Becker, and G. Engels, “IoT-ASAP 2018: Message from the Chairs,” in <i>2018 IEEE International Conference on Software Architecture Companion (ICSA-C)</i>, 2018.","apa":"Spalazzese, R., Platenius, M. C., Becker, S., &#38; Engels, G. (2018). IoT-ASAP 2018: Message from the Chairs. In <i>2018 IEEE International Conference on Software Architecture Companion (ICSA-C)</i>. <a href=\"https://doi.org/10.1109/icsa-c.2018.00009\">https://doi.org/10.1109/icsa-c.2018.00009</a>","short":"R. Spalazzese, M.C. Platenius, S. Becker, G. Engels, in: 2018 IEEE International Conference on Software Architecture Companion (ICSA-C), 2018.","chicago":"Spalazzese, Romina, Marie C. Platenius, Steffen Becker, and Gregor Engels. “IoT-ASAP 2018: Message from the Chairs.” In <i>2018 IEEE International Conference on Software Architecture Companion (ICSA-C)</i>, 2018. <a href=\"https://doi.org/10.1109/icsa-c.2018.00009\">https://doi.org/10.1109/icsa-c.2018.00009</a>."}},{"place":"Cham","citation":{"mla":"Polevoy, Gleb, et al. “Removing Undesirable Flows by Edge Deletion.” <i>Combinatorial Optimization and Applications</i>, edited by Donghyun Kim et al., Springer International Publishing, 2018, pp. 217–32.","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2018, place={Cham}, title={Removing Undesirable Flows by Edge Deletion}, booktitle={Combinatorial Optimization and Applications}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, editor={Kim, Donghyun and Uma, R. N. and Zelikovsky, AlexanderEditors}, year={2018}, pages={217–232} }","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Removing Undesirable Flows by Edge Deletion. In: Kim D, Uma RN, Zelikovsky A, eds. <i>Combinatorial Optimization and Applications</i>. Cham: Springer International Publishing; 2018:217-232.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Removing Undesirable Flows by Edge Deletion,” in <i>Combinatorial Optimization and Applications</i>, 2018, pp. 217–232.","apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2018). Removing Undesirable Flows by Edge Deletion. In D. Kim, R. N. Uma, &#38; A. Zelikovsky (Eds.), <i>Combinatorial Optimization and Applications</i> (pp. 217–232). Cham: Springer International Publishing.","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Removing Undesirable Flows by Edge Deletion.” In <i>Combinatorial Optimization and Applications</i>, edited by Donghyun Kim, R. N. Uma, and Alexander Zelikovsky, 217–32. Cham: Springer International Publishing, 2018.","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: D. Kim, R.N. Uma, A. Zelikovsky (Eds.), Combinatorial Optimization and Applications, Springer International Publishing, Cham, 2018, pp. 217–232."},"editor":[{"first_name":"Donghyun","last_name":"Kim","full_name":"Kim, Donghyun"},{"full_name":"Uma, R. N.","last_name":"Uma","first_name":"R. N."},{"last_name":"Zelikovsky","first_name":"Alexander","full_name":"Zelikovsky, Alexander"}],"user_id":"83983","publisher":"Springer International Publishing","_id":"17651","page":"217-232","status":"public","department":[{"_id":"63"},{"_id":"541"}],"type":"conference","keyword":["flow","Red-Blue Set Cover","Positive-Negative Partial Set Cover","approximation","tree","MAX SNP-hard","root","leaf","dynamic programming","FPT"],"date_created":"2020-08-06T15:19:36Z","abstract":[{"text":"Consider mitigating the effects of denial of service or of malicious traffic in networks by deleting edges. Edge deletion reduces the DoS or the number of the malicious flows, but it also inadvertently removes some of the desired flows. To model this important problem, we formulate two problems: (1) remove all the undesirable flows while minimizing the damage to the desirable ones and (2) balance removing the undesirable flows and not removing too many of the desirable flows. We prove these problems are equivalent to important theoretical problems, thereby being important not only practically but also theoretically, and very hard to approximate in a general network. We employ reductions to nonetheless approximate the problem and also provide a greedy approximation. When the network is a tree, the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation algorithm, where l is the longest desirable flow. We also provide an algorithm, approximating the first and the second problem within {\\$}{\\$}2 {\\backslash}sqrt{\\{} 2{\\backslash}left| E {\\backslash}right| {\\}}{\\$}{\\$}and {\\$}{\\$}2 {\\backslash}sqrt{\\{}2 ({\\backslash}left| E {\\backslash}right| + {\\backslash}left| {\\backslash}text {\\{}undesirable flows{\\}} {\\backslash}right| ){\\}}{\\$}{\\$}, respectively, where E is the set of the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm. Finally, if the tree has a root such that every flow in the tree flows on the path from the root to a leaf, we solve the problem exactly using dynamic programming.","lang":"eng"}],"extern":"1","publication":"Combinatorial Optimization and Applications","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:16Z","author":[{"last_name":"Polevoy","first_name":"Gleb","full_name":"Polevoy, Gleb","id":"83983"},{"first_name":"Stojan","last_name":"Trajanovski","full_name":"Trajanovski, Stojan"},{"full_name":"Grosso, Paola","last_name":"Grosso","first_name":"Paola"},{"first_name":"Cees","last_name":"de Laat","full_name":"de Laat, Cees"}],"publication_identifier":{"isbn":["978-3-030-04651-4"]},"title":"Removing Undesirable Flows by Edge Deletion","year":"2018"},{"keyword":["Software defined networks","Network function virtualization","Cyber attacks","Cyber security","Defense efficiency","Overlay networks"],"type":"journal_article","department":[{"_id":"63"},{"_id":"541"}],"date_created":"2020-08-06T15:23:11Z","extern":"1","abstract":[{"lang":"eng","text":"Software Defined Networks (SDN) and Network Function Virtualisation (NFV) provide the basis for autonomous response and mitigation against attacks on networked computer infrastructures. We propose a new framework that uses SDNs and NFV to achieve this goal: Secure Autonomous Response Network (SARNET). In a SARNET, an agent running a control loop constantly assesses the security state of the network by means of observables. The agent reacts to and resolves security problems, while learning from its previous decisions. Two main metrics govern the decision process in a SARNET: impact and efficiency; these metrics can be used to compare and evaluate countermeasures and are the building blocks for self-learning SARNETs that exhibit autonomous response. In this paper we present the software implementation of the SARNET framework, evaluate it in a real-life network and discuss the tradeoffs between parameters used by the SARNET agent and the efficiency of its actions."}],"publication":"Future Generation Computer Systems","citation":{"ieee":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, and P. Grosso, “Measuring the efficiency of SDN mitigations against attacks on computer infrastructures,” <i>Future Generation Computer Systems</i>, 2018.","mla":"Koning, R., et al. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” <i>Future Generation Computer Systems</i>, 2018, doi:<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>.","apa":"Koning, R., de Graaff, B., Polevoy, G., Meijer, R., de Laat, C., &#38; Grosso, P. (2018). Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. <i>Future Generation Computer Systems</i>. <a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>","bibtex":"@article{Koning_de Graaff_Polevoy_Meijer_de Laat_Grosso_2018, title={Measuring the efficiency of SDN mitigations against attacks on computer infrastructures}, DOI={<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>}, journal={Future Generation Computer Systems}, author={Koning, R. and de Graaff, B. and Polevoy, Gleb and Meijer, R. and de Laat, C. and Grosso, P.}, year={2018} }","chicago":"Koning, R., B. de Graaff, Gleb Polevoy, R. Meijer, C. de Laat, and P. Grosso. “Measuring the Efficiency of SDN Mitigations against Attacks on Computer Infrastructures.” <i>Future Generation Computer Systems</i>, 2018. <a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>.","short":"R. Koning, B. de Graaff, G. Polevoy, R. Meijer, C. de Laat, P. Grosso, Future Generation Computer Systems (2018).","ama":"Koning R, de Graaff B, Polevoy G, Meijer R, de Laat C, Grosso P. Measuring the efficiency of SDN mitigations against attacks on computer infrastructures. <i>Future Generation Computer Systems</i>. 2018. doi:<a href=\"https://doi.org/10.1016/j.future.2018.08.011\">https://doi.org/10.1016/j.future.2018.08.011</a>"},"user_id":"83983","doi":"https://doi.org/10.1016/j.future.2018.08.011","language":[{"iso":"eng"}],"_id":"17666","date_updated":"2022-01-06T06:53:16Z","year":"2018","status":"public","title":"Measuring the efficiency of SDN mitigations against attacks on computer infrastructures","author":[{"last_name":"Koning","first_name":"R.","full_name":"Koning, R."},{"full_name":"de Graaff, B.","last_name":"de Graaff","first_name":"B."},{"full_name":"Polevoy, Gleb","first_name":"Gleb","last_name":"Polevoy","id":"83983"},{"first_name":"R.","last_name":"Meijer","full_name":"Meijer, R."},{"first_name":"C.","last_name":"de Laat","full_name":"de Laat, C."},{"last_name":"Grosso","first_name":"P.","full_name":"Grosso, P."}],"publication_identifier":{"issn":["0167-739X"]}},{"date_updated":"2022-01-06T06:53:17Z","status":"public","year":"2018","title":"Automated Multi-Label Classification based on ML-Plan","author":[{"id":"33176","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"user_id":"5786","main_file_link":[{"url":"https://arxiv.org/pdf/1811.04060.pdf","open_access":"1"}],"_id":"17713","language":[{"iso":"eng"}],"publisher":"Arxiv","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"citation":{"short":"M.D. Wever, F. Mohr, E. Hüllermeier, (2018).","chicago":"Wever, Marcel Dominik, Felix Mohr, and Eyke Hüllermeier. “Automated Multi-Label Classification Based on ML-Plan.” Arxiv, 2018.","ieee":"M. D. Wever, F. Mohr, and E. Hüllermeier, “Automated Multi-Label Classification based on ML-Plan.” Arxiv, 2018.","apa":"Wever, M. D., Mohr, F., &#38; Hüllermeier, E. (2018). <i>Automated Multi-Label Classification based on ML-Plan</i>. Arxiv.","bibtex":"@article{Wever_Mohr_Hüllermeier_2018, title={Automated Multi-Label Classification based on ML-Plan}, publisher={Arxiv}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke}, year={2018} }","ama":"Wever MD, Mohr F, Hüllermeier E. Automated Multi-Label Classification based on ML-Plan. Published online 2018.","mla":"Wever, Marcel Dominik, et al. <i>Automated Multi-Label Classification Based on ML-Plan</i>. Arxiv, 2018."},"type":"preprint","oa":"1","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"date_created":"2020-08-07T11:38:10Z"},{"user_id":"5786","_id":"17714","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/pdf/1809.00486.pdf","open_access":"1"}],"date_updated":"2022-01-06T06:53:17Z","author":[{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"status":"public","year":"2018","title":"Automated machine learning service composition","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"oa":"1","type":"preprint","date_created":"2020-08-07T11:40:13Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"citation":{"mla":"Mohr, Felix, et al. <i>Automated Machine Learning Service Composition</i>. 2018.","ama":"Mohr F, Wever MD, Hüllermeier E. Automated machine learning service composition. Published online 2018.","bibtex":"@article{Mohr_Wever_Hüllermeier_2018, title={Automated machine learning service composition}, author={Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2018} }","apa":"Mohr, F., Wever, M. D., &#38; Hüllermeier, E. (2018). <i>Automated machine learning service composition</i>.","ieee":"F. Mohr, M. D. Wever, and E. Hüllermeier, “Automated machine learning service composition.” 2018.","short":"F. Mohr, M.D. Wever, E. Hüllermeier, (2018).","chicago":"Mohr, Felix, Marcel Dominik Wever, and Eyke Hüllermeier. “Automated Machine Learning Service Composition,” 2018."}},{"publication_status":"accepted","date_updated":"2022-01-06T06:53:58Z","status":"public","year":"2018","title":"Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms","author":[{"last_name":"Schwichtenberg","first_name":"Simon","full_name":"Schwichtenberg, Simon","id":"13235"},{"full_name":"Jovanovikj, Ivan","last_name":"Jovanovikj","first_name":"Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","id":"39187"},{"full_name":"Gerth, Christian","last_name":"Gerth","first_name":"Christian"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"conference":{"end_date":"2018-06-03","start_date":"2018-05-27","location":"Gothenburg, Sweden"},"user_id":"13235","_id":"1910","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Today, model-driven approaches are a cornerstone in modern software development. The Eclipse Modeling Framework (EMF) is highly adopted in practice and generates Java code from platform-independent models with embedded Object Constraint Language (OCL) expressions. However, applications that target multiple platforms like Android, iOS, Windows, web browsers usually need to be implemented in different programming languages. Feature-complete Ecore and OCL runtime APIs are not available for all these platforms, such that their functionality has to be re-implemented. In this paper, we present CrossEcore: A multi-platform enabled modeling framework that generates C#, Swift, TypeScript, and JavaScript code from Ecore models with embedded OCL. An OCL compiler translates OCL expressions into expressions of the target language. The Ecore and OCL API can be consistently used across platforms, which facilitates application portability. CrossEcore is also extendible and can be easily adopted for new programming languages."}],"publication":"Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume","citation":{"mla":"Schwichtenberg, Simon, et al. “Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms.” <i>Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume</i>.","bibtex":"@inproceedings{Schwichtenberg_Jovanovikj_Gerth_Engels, title={Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms}, booktitle={Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume}, author={Schwichtenberg, Simon and Jovanovikj, Ivan and Gerth, Christian and Engels, Gregor} }","ama":"Schwichtenberg S, Jovanovikj I, Gerth C, Engels G. Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms. In: <i>Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume</i>.","ieee":"S. Schwichtenberg, I. Jovanovikj, C. Gerth, and G. Engels, “Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms,” in <i>Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume</i>, Gothenburg, Sweden.","apa":"Schwichtenberg, S., Jovanovikj, I., Gerth, C., &#38; Engels, G. (n.d.). Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms. In <i>Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume</i>. Gothenburg, Sweden.","chicago":"Schwichtenberg, Simon, Ivan Jovanovikj, Christian Gerth, and Gregor Engels. “Poster: CrossEcore: An Extendible Framework to Use Ecore and OCL across Platforms.” In <i>Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume</i>, n.d.","short":"S. Schwichtenberg, I. Jovanovikj, C. Gerth, G. Engels, in: Proceedings of the 40th International Conference on Software Engineering, ICSE 2018 - Companion Volume, n.d."},"type":"conference","department":[{"_id":"66"}],"date_created":"2018-03-28T08:28:24Z"},{"publication_identifier":{"isbn":["978-3-88579-673-2"]},"author":[{"id":"59256","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric"},{"full_name":"Nguyen Quang Do, Lisa","last_name":"Nguyen Quang Do","first_name":"Lisa"}],"year":"2018","status":"public","title":"Explainable Static Analysis","date_updated":"2022-01-06T06:54:29Z","series_title":"{LNI}","_id":"20530","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://dl.gi.de/20.500.12116/16348"}],"page":"205-208","user_id":"5786","citation":{"ama":"Bodden E, Nguyen Quang Do L. Explainable Static Analysis. In: <i>Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\\\"{a}}rz 2018, Ulm, Germany.</i> {LNI}. ; 2018:205-208.","bibtex":"@inproceedings{Bodden_Nguyen Quang Do_2018, series={{LNI}}, title={Explainable Static Analysis}, booktitle={Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\\\"{a}}rz 2018, Ulm, Germany.}, author={Bodden, Eric and Nguyen Quang Do, Lisa}, year={2018}, pages={205–208}, collection={{LNI}} }","mla":"Bodden, Eric, and Lisa Nguyen Quang Do. “Explainable Static Analysis.” <i>Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\\\"{a}}rz 2018, Ulm, Germany.</i>, 2018, pp. 205–08.","short":"E. Bodden, L. Nguyen Quang Do, in: Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\\\"{a}}rz 2018, Ulm, Germany., 2018, pp. 205–208.","chicago":"Bodden, Eric, and Lisa Nguyen Quang Do. “Explainable Static Analysis.” In <i>Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\\\"{a}}rz 2018, Ulm, Germany.</i>, 205–8. {LNI}, 2018.","apa":"Bodden, E., &#38; Nguyen Quang Do, L. (2018). Explainable Static Analysis. <i>Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\\\"{a}}rz 2018, Ulm, Germany.</i>, 205–208.","ieee":"E. Bodden and L. Nguyen Quang Do, “Explainable Static Analysis,” in <i>Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\\\"{a}}rz 2018, Ulm, Germany.</i>, 2018, pp. 205–208."},"publication":"Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, {SE} 2018, 5.-9. M{\\\"{a}}rz 2018, Ulm, Germany.","date_created":"2020-11-27T10:24:21Z","department":[{"_id":"76"}],"type":"conference"},{"doi":"10.1109/TSE.2018.2868349","user_id":"5786","language":[{"iso":"eng"}],"_id":"20543","page":"1-1","main_file_link":[{"url":"http://www.bodden.de/pubs/tse18debugging.pdf"}],"date_updated":"2022-01-06T06:54:29Z","publication_identifier":{"issn":["2326-3881"]},"author":[{"first_name":"Lisa","last_name":"Nguyen Quang Do","full_name":"Nguyen Quang Do, Lisa"},{"first_name":"Stefan","last_name":"Krüger","full_name":"Krüger, Stefan"},{"full_name":"Hill, Patrick","first_name":"Patrick","last_name":"Hill"},{"first_name":"Karim","last_name":"Ali","full_name":"Ali, Karim"},{"full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric","id":"59256"}],"title":"Debugging Static Analysis","status":"public","year":"2018","department":[{"_id":"76"}],"keyword":["Debugging","Static analysis","Tools","Computer bugs","Standards","Writing","Encoding","Testing and Debugging","Program analysis","Development tools","Integrated environments","Graphical environments","Usability testing"],"type":"journal_article","date_created":"2020-11-30T09:32:12Z","citation":{"chicago":"Nguyen Quang Do, Lisa, Stefan Krüger, Patrick Hill, Karim Ali, and Eric Bodden. “Debugging Static Analysis.” <i>IEEE Transactions on Software Engineering</i>, 2018, 1–1. <a href=\"https://doi.org/10.1109/TSE.2018.2868349\">https://doi.org/10.1109/TSE.2018.2868349</a>.","short":"L. Nguyen Quang Do, S. Krüger, P. Hill, K. Ali, E. Bodden, IEEE Transactions on Software Engineering (2018) 1–1.","ieee":"L. Nguyen Quang Do, S. Krüger, P. Hill, K. Ali, and E. Bodden, “Debugging Static Analysis,” <i>IEEE Transactions on Software Engineering</i>, pp. 1–1, 2018, doi: <a href=\"https://doi.org/10.1109/TSE.2018.2868349\">10.1109/TSE.2018.2868349</a>.","apa":"Nguyen Quang Do, L., Krüger, S., Hill, P., Ali, K., &#38; Bodden, E. (2018). Debugging Static Analysis. <i>IEEE Transactions on Software Engineering</i>, 1–1. <a href=\"https://doi.org/10.1109/TSE.2018.2868349\">https://doi.org/10.1109/TSE.2018.2868349</a>","bibtex":"@article{Nguyen Quang Do_Krüger_Hill_Ali_Bodden_2018, title={Debugging Static Analysis}, DOI={<a href=\"https://doi.org/10.1109/TSE.2018.2868349\">10.1109/TSE.2018.2868349</a>}, journal={IEEE Transactions on Software Engineering}, author={Nguyen Quang Do, Lisa and Krüger, Stefan and Hill, Patrick and Ali, Karim and Bodden, Eric}, year={2018}, pages={1–1} }","ama":"Nguyen Quang Do L, Krüger S, Hill P, Ali K, Bodden E. Debugging Static Analysis. <i>IEEE Transactions on Software Engineering</i>. Published online 2018:1-1. doi:<a href=\"https://doi.org/10.1109/TSE.2018.2868349\">10.1109/TSE.2018.2868349</a>","mla":"Nguyen Quang Do, Lisa, et al. “Debugging Static Analysis.” <i>IEEE Transactions on Software Engineering</i>, 2018, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/TSE.2018.2868349\">10.1109/TSE.2018.2868349</a>."},"publication":"IEEE Transactions on Software Engineering"},{"editor":[{"first_name":"Matthias","last_name":"Tichy","full_name":"Tichy, Matthias"},{"id":"59256","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric"},{"full_name":"Kuhrmann, Marco","last_name":"Kuhrmann","first_name":"Marco"},{"first_name":"Stefan","last_name":"Wagner","full_name":"Wagner, Stefan"},{"first_name":"Jan-Philipp","last_name":"Steghöfer","full_name":"Steghöfer, Jan-Philipp"}],"volume":"{P-279}","user_id":"5786","language":[{"iso":"eng"}],"_id":"20544","publisher":"Gesellschaft für Informatik","series_title":"{LNI}","date_updated":"2022-01-06T06:54:29Z","publication_identifier":{"isbn":["978-3-88579-673-2"]},"status":"public","year":"2018","title":"Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany","department":[{"_id":"76"}],"type":"conference_editor","date_created":"2020-11-30T09:32:58Z","citation":{"short":"M. Tichy, E. Bodden, M. Kuhrmann, S. Wagner, J.-P. Steghöfer, eds., Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany, Gesellschaft für Informatik, 2018.","chicago":"Tichy, Matthias, Eric Bodden, Marco Kuhrmann, Stefan Wagner, and Jan-Philipp Steghöfer, eds. <i>Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany</i>. Vol. {P-279}. {LNI}. Gesellschaft für Informatik, 2018.","ieee":"M. Tichy, E. Bodden, M. Kuhrmann, S. Wagner, and J.-P. Steghöfer, Eds., <i>Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany</i>, vol. {P-279}. Gesellschaft für Informatik, 2018.","apa":"Tichy, M., Bodden, E., Kuhrmann, M., Wagner, S., &#38; Steghöfer, J.-P. (Eds.). (2018). <i>Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany: Vol. {P-279}</i>. Gesellschaft für Informatik.","bibtex":"@book{Tichy_Bodden_Kuhrmann_Wagner_Steghöfer_2018, series={{LNI}}, title={Software Engineering und Software Management 2018, Fachtagung des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany}, volume={{P-279}}, publisher={Gesellschaft für Informatik}, year={2018}, collection={{LNI}} }","ama":"Tichy M, Bodden E, Kuhrmann M, Wagner S, Steghöfer J-P, eds. <i>Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany</i>. Vol {P-279}. Gesellschaft für Informatik; 2018.","mla":"Tichy, Matthias, et al., editors. <i>Software Engineering Und Software Management 2018, Fachtagung Des GI-Fachbereichs Softwaretechnik, SE 2018, 5.-9. März 2018, Ulm, Germany</i>. Gesellschaft für Informatik, 2018."}}]