[{"citation":{"ama":"Bauer M. Diaspora-Literatures in the EFL Classroom – A new Didactic Impulse? In: ; 2021.","bibtex":"@inproceedings{Bauer_2021, title={Diaspora-Literatures in the EFL Classroom – A new Didactic Impulse?}, author={Bauer, Maike}, year={2021} }","mla":"Bauer, Maike. <i>Diaspora-Literatures in the EFL Classroom – A New Didactic Impulse?</i> 2021.","chicago":"Bauer, Maike. “Diaspora-Literatures in the EFL Classroom – A New Didactic Impulse?,” 2021.","short":"M. Bauer, in: 2021.","apa":"Bauer, M. (2021). <i>Diaspora-Literatures in the EFL Classroom – A new Didactic Impulse?</i> 29. (digitalen) Kongress der Deutschen Gesellschaft für Fremdsprachenforschung (DGFF), Essen (online).","ieee":"M. Bauer, “Diaspora-Literatures in the EFL Classroom – A new Didactic Impulse?,” presented at the 29. (digitalen) Kongress der Deutschen Gesellschaft für Fremdsprachenforschung (DGFF), Essen (online), 2021."},"date_created":"2024-05-31T13:28:37Z","type":"conference","author":[{"id":"29647","last_name":"Bauer","first_name":"Maike","full_name":"Bauer, Maike"}],"conference":{"location":"Essen (online)","start_date":"2021-09-26","name":"29. (digitalen) Kongress der Deutschen Gesellschaft für Fremdsprachenforschung (DGFF)","end_date":"2021-09-29"},"status":"public","title":"Diaspora-Literatures in the EFL Classroom – A new Didactic Impulse?","year":"2021","date_updated":"2024-05-31T13:34:03Z","language":[{"iso":"eng"}],"_id":"54539","user_id":"29647"},{"date_updated":"2024-06-04T09:50:41Z","intvolume":"       104","title":"Examining the role of stress and information security policy design in information security compliance behaviour: An experimental study of in-task behaviour","status":"public","year":"2021","author":[{"id":"98948","first_name":"Simon Thanh-Nam","last_name":"Trang","orcid":"0000-0002-4784-4038","full_name":"Trang, Simon Thanh-Nam"},{"full_name":"Nastjuk, I.","first_name":"I.","last_name":"Nastjuk"}],"user_id":"98948","volume":104,"language":[{"iso":"eng"}],"_id":"49463","publication":"Computers & Security","citation":{"mla":"Trang, Simon Thanh-Nam, and I. Nastjuk. “Examining the Role of Stress and Information Security Policy Design in Information Security Compliance Behaviour: An Experimental Study of in-Task Behaviour.” <i>Computers &#38; Security</i>, vol. 104, 2021.","bibtex":"@article{Trang_Nastjuk_2021, title={Examining the role of stress and information security policy design in information security compliance behaviour: An experimental study of in-task behaviour}, volume={104}, journal={Computers &#38; Security}, author={Trang, Simon Thanh-Nam and Nastjuk, I.}, year={2021} }","ama":"Trang ST-N, Nastjuk I. Examining the role of stress and information security policy design in information security compliance behaviour: An experimental study of in-task behaviour. <i>Computers &#38; Security</i>. 2021;104.","ieee":"S. T.-N. Trang and I. Nastjuk, “Examining the role of stress and information security policy design in information security compliance behaviour: An experimental study of in-task behaviour,” <i>Computers &#38; Security</i>, vol. 104, 2021.","apa":"Trang, S. T.-N., &#38; Nastjuk, I. (2021). Examining the role of stress and information security policy design in information security compliance behaviour: An experimental study of in-task behaviour. <i>Computers &#38; Security</i>, <i>104</i>.","chicago":"Trang, Simon Thanh-Nam, and I. Nastjuk. “Examining the Role of Stress and Information Security Policy Design in Information Security Compliance Behaviour: An Experimental Study of in-Task Behaviour.” <i>Computers &#38; Security</i> 104 (2021).","short":"S.T.-N. Trang, I. Nastjuk, Computers &#38; Security 104 (2021)."},"type":"journal_article","department":[{"_id":"792"}],"date_created":"2023-12-04T13:37:54Z"},{"publication":"Computers in Human Behavior","citation":{"mla":"Trang, Simon Thanh-Nam, and W. Weiger. “The Perils of Gamification: Does Engaging with Gamified Services Increase Users’ Willingness to Disclose Personal Information?” <i>Computers in Human Behavior</i>, vol. 116, 2021.","apa":"Trang, S. T.-N., &#38; Weiger, W. (2021). The perils of gamification: Does engaging with gamified services increase users’ willingness to disclose personal information? <i>Computers in Human Behavior</i>, <i>116</i>.","ieee":"S. T.-N. Trang and W. Weiger, “The perils of gamification: Does engaging with gamified services increase users’ willingness to disclose personal information?,” <i>Computers in Human Behavior</i>, vol. 116, 2021.","ama":"Trang ST-N, Weiger W. The perils of gamification: Does engaging with gamified services increase users’ willingness to disclose personal information? <i>Computers in Human Behavior</i>. 2021;116.","short":"S.T.-N. Trang, W. Weiger, Computers in Human Behavior 116 (2021).","chicago":"Trang, Simon Thanh-Nam, and W. Weiger. “The Perils of Gamification: Does Engaging with Gamified Services Increase Users’ Willingness to Disclose Personal Information?” <i>Computers in Human Behavior</i> 116 (2021).","bibtex":"@article{Trang_Weiger_2021, title={The perils of gamification: Does engaging with gamified services increase users’ willingness to disclose personal information?}, volume={116}, journal={Computers in Human Behavior}, author={Trang, Simon Thanh-Nam and Weiger, W.}, year={2021} }"},"date_created":"2023-12-04T13:38:05Z","type":"journal_article","department":[{"_id":"792"}],"year":"2021","status":"public","title":"The perils of gamification: Does engaging with gamified services increase users’ willingness to disclose personal information?","author":[{"id":"98948","orcid":"0000-0002-4784-4038","first_name":"Simon Thanh-Nam","last_name":"Trang","full_name":"Trang, Simon Thanh-Nam"},{"first_name":"W.","last_name":"Weiger","full_name":"Weiger, W."}],"date_updated":"2024-06-04T09:50:02Z","intvolume":"       116","_id":"49464","language":[{"iso":"eng"}],"user_id":"98948","volume":116},{"department":[{"_id":"792"}],"type":"journal_article","date_created":"2023-12-04T13:37:49Z","citation":{"mla":"Brendel, A. B., et al. “Corona Tracing Apps – Eine Analyse Und Strukturierung Des Europäischen Marktes.” <i>HMD Praxis Der Wirtschaftsinformatik</i>, vol. 58, 2021, pp. 698–711.","apa":"Brendel, A. B., Greve, M., Masuch, K., &#38; Trang, S. T.-N. (2021). Corona Tracing Apps – Eine Analyse und Strukturierung des europäischen Marktes. <i>HMD Praxis Der Wirtschaftsinformatik</i>, <i>58</i>, 698–711.","ieee":"A. B. Brendel, M. Greve, K. Masuch, and S. T.-N. Trang, “Corona Tracing Apps – Eine Analyse und Strukturierung des europäischen Marktes,” <i>HMD Praxis der Wirtschaftsinformatik</i>, vol. 58, pp. 698–711, 2021.","chicago":"Brendel, A.B., M. Greve, K. Masuch, and Simon Thanh-Nam Trang. “Corona Tracing Apps – Eine Analyse Und Strukturierung Des Europäischen Marktes.” <i>HMD Praxis Der Wirtschaftsinformatik</i> 58 (2021): 698–711.","short":"A.B. Brendel, M. Greve, K. Masuch, S.T.-N. Trang, HMD Praxis Der Wirtschaftsinformatik 58 (2021) 698–711.","ama":"Brendel AB, Greve M, Masuch K, Trang ST-N. Corona Tracing Apps – Eine Analyse und Strukturierung des europäischen Marktes. <i>HMD Praxis der Wirtschaftsinformatik</i>. 2021;58:698–711.","bibtex":"@article{Brendel_Greve_Masuch_Trang_2021, title={Corona Tracing Apps – Eine Analyse und Strukturierung des europäischen Marktes}, volume={58}, journal={HMD Praxis der Wirtschaftsinformatik}, author={Brendel, A.B. and Greve, M. and Masuch, K. and Trang, Simon Thanh-Nam}, year={2021}, pages={698–711} }"},"publication":"HMD Praxis der Wirtschaftsinformatik","volume":58,"user_id":"98948","language":[{"iso":"eng"}],"_id":"49462","page":"698–711","intvolume":"        58","date_updated":"2024-06-04T09:51:15Z","author":[{"first_name":"A.B.","last_name":"Brendel","full_name":"Brendel, A.B."},{"full_name":"Greve, M.","first_name":"M.","last_name":"Greve"},{"last_name":"Masuch","first_name":"K.","full_name":"Masuch, K."},{"id":"98948","last_name":"Trang","first_name":"Simon Thanh-Nam","orcid":"0000-0002-4784-4038","full_name":"Trang, Simon Thanh-Nam"}],"title":"Corona Tracing Apps – Eine Analyse und Strukturierung des europäischen Marktes","status":"public","year":"2021"},{"status":"public","year":"2021","title":"Unsupervised Relation Extraction Using Sentence Encoding","publication_identifier":{"isbn":["9783030804176","9783030804183"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"77309","last_name":"Manzoor","first_name":"Ali","full_name":"Manzoor, Ali"},{"first_name":"Muhammad","last_name":"Saleem","full_name":"Saleem, Muhammad"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","id":"65716"}],"date_updated":"2024-06-04T12:24:52Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"54586","publisher":"Springer International Publishing","doi":"10.1007/978-3-030-80418-3_25","user_id":"77309","publication":"The Semantic Web: ESWC 2021 Satellite Events","citation":{"ama":"Manzoor A, Saleem M, Ngonga Ngomo A-C. Unsupervised Relation Extraction Using Sentence Encoding. In: <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>","bibtex":"@inbook{Manzoor_Saleem_Ngonga Ngomo_2021, place={Cham}, title={Unsupervised Relation Extraction Using Sentence Encoding}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>}, booktitle={The Semantic Web: ESWC 2021 Satellite Events}, publisher={Springer International Publishing}, author={Manzoor, Ali and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, year={2021} }","mla":"Manzoor, Ali, et al. “Unsupervised Relation Extraction Using Sentence Encoding.” <i>The Semantic Web: ESWC 2021 Satellite Events</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>.","chicago":"Manzoor, Ali, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “Unsupervised Relation Extraction Using Sentence Encoding.” In <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">https://doi.org/10.1007/978-3-030-80418-3_25</a>.","short":"A. Manzoor, M. Saleem, A.-C. Ngonga Ngomo, in: The Semantic Web: ESWC 2021 Satellite Events, Springer International Publishing, Cham, 2021.","apa":"Manzoor, A., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2021). Unsupervised Relation Extraction Using Sentence Encoding. In <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">https://doi.org/10.1007/978-3-030-80418-3_25</a>","ieee":"A. Manzoor, M. Saleem, and A.-C. Ngonga Ngomo, “Unsupervised Relation Extraction Using Sentence Encoding,” in <i>The Semantic Web: ESWC 2021 Satellite Events</i>, Cham: Springer International Publishing, 2021."},"place":"Cham","date_created":"2024-06-04T12:23:21Z","type":"book_chapter","department":[{"_id":"574"}]},{"date_created":"2023-07-03T11:33:42Z","type":"conference","publication":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","citation":{"mla":"Fichte, Johannes, et al. “Decomposition-Guided Reductions for Argumentation and Treewidth.” <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence Organization, 2021, doi:<a href=\"https://doi.org/10.24963/ijcai.2021/259\">10.24963/ijcai.2021/259</a>.","ama":"Fichte J, Hecher M, Mahmood Y, Meier A. Decomposition-Guided Reductions for Argumentation and Treewidth. In: <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2021. doi:<a href=\"https://doi.org/10.24963/ijcai.2021/259\">10.24963/ijcai.2021/259</a>","bibtex":"@inproceedings{Fichte_Hecher_Mahmood_Meier_2021, title={Decomposition-Guided Reductions for Argumentation and Treewidth}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2021/259\">10.24963/ijcai.2021/259</a>}, booktitle={Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Fichte, Johannes and Hecher, Markus and Mahmood, Yasir and Meier, Arne}, year={2021} }","apa":"Fichte, J., Hecher, M., Mahmood, Y., &#38; Meier, A. (2021). Decomposition-Guided Reductions for Argumentation and Treewidth. <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence</i>. <a href=\"https://doi.org/10.24963/ijcai.2021/259\">https://doi.org/10.24963/ijcai.2021/259</a>","ieee":"J. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Decomposition-Guided Reductions for Argumentation and Treewidth,” 2021, doi: <a href=\"https://doi.org/10.24963/ijcai.2021/259\">10.24963/ijcai.2021/259</a>.","chicago":"Fichte, Johannes, Markus Hecher, Yasir Mahmood, and Arne Meier. “Decomposition-Guided Reductions for Argumentation and Treewidth.” In <i>Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization, 2021. <a href=\"https://doi.org/10.24963/ijcai.2021/259\">https://doi.org/10.24963/ijcai.2021/259</a>.","short":"J. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2021."},"abstract":[{"lang":"eng","text":"<jats:p>Argumentation is a widely applied framework for modeling and evaluating arguments and its reasoning with various applications. Popular frameworks are abstract argumentation (Dung’s framework) or logic-based argumentation (Besnard-Hunter’s framework). Their computational complexity has been studied quite in-depth. Incorporating treewidth into the complexity analysis is particularly interesting, as solvers oftentimes employ SAT-based solvers, which can solve instances of low treewidth fast. In this paper, we address whether one can design reductions from argumentation problems to SAT-problems while linearly preserving the treewidth, which results in decomposition-guided (DG) reductions. It turns out that the linear treewidth overhead caused by our DG reductions, cannot be significantly improved under reasonable assumptions. Finally, we consider logic-based argumentation and establish new upper bounds using DG reductions and lower bounds.</jats:p>"}],"_id":"45840","language":[{"iso":"eng"}],"publisher":"International Joint Conferences on Artificial Intelligence Organization","doi":"10.24963/ijcai.2021/259","user_id":"99353","status":"public","title":"Decomposition-Guided Reductions for Argumentation and Treewidth","year":"2021","author":[{"last_name":"Fichte","first_name":"Johannes","full_name":"Fichte, Johannes"},{"last_name":"Hecher","first_name":"Markus","full_name":"Hecher, Markus"},{"id":"99353","first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"}],"date_updated":"2024-06-04T15:56:41Z","publication_status":"published"},{"citation":{"mla":"Mahmood, Yasir, et al. “Parameterized Complexity of Abduction in Schaefer’s Framework.” <i>Journal of Logic and Computation</i>, vol. 31, no. 1, Oxford University Press (OUP), 2021, pp. 266–96, doi:<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>.","bibtex":"@article{Mahmood_Meier_Schmidt_2021, title={Parameterized complexity of abduction in Schaefer’s framework}, volume={31}, DOI={<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>}, number={1}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2021}, pages={266–296} }","ama":"Mahmood Y, Meier A, Schmidt J. Parameterized complexity of abduction in Schaefer’s framework. <i>Journal of Logic and Computation</i>. 2021;31(1):266-296. doi:<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterized complexity of abduction in Schaefer’s framework,” <i>Journal of Logic and Computation</i>, vol. 31, no. 1, pp. 266–296, 2021, doi: <a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>.","apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2021). Parameterized complexity of abduction in Schaefer’s framework. <i>Journal of Logic and Computation</i>, <i>31</i>(1), 266–296. <a href=\"https://doi.org/10.1093/logcom/exaa079\">https://doi.org/10.1093/logcom/exaa079</a>","short":"Y. Mahmood, A. Meier, J. Schmidt, Journal of Logic and Computation 31 (2021) 266–296.","chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity of Abduction in Schaefer’s Framework.” <i>Journal of Logic and Computation</i> 31, no. 1 (2021): 266–96. <a href=\"https://doi.org/10.1093/logcom/exaa079\">https://doi.org/10.1093/logcom/exaa079</a>."},"volume":31,"user_id":"99353","_id":"45844","publisher":"Oxford University Press (OUP)","page":"266-296","status":"public","department":[{"_id":"574"}],"keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"type":"journal_article","date_created":"2023-07-03T11:35:23Z","abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version, asking for sets of variables as explanations, we study, besides the problem of wether there exists a set of explanations, two explanation size limited variants of this reasoning problem (less than or equal to, and equal to a given size bound). In this paper, we present a thorough two-dimensional classification of these problems: the first dimension is regarding the parameterized complexity under a wealth of different parameterizations, and the second dimension spans through all possible Boolean fragments of these problems in Schaefer’s constraint satisfaction framework with co-clones (T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1–3, 1978, San Diego, California, USA, R.J. Lipton, W.A. Burkhard, W.J. Savitch, E.P. Friedman, A.V. Aho eds, pp. 216–226. ACM, 1978). Thereby, we almost complete the parameterized complexity classification program initiated by Fellows et al. (The parameterized complexity of abduction. In Proceedings of the Twenty-Sixth AAAI Conference on Articial Intelligence, July 22–26, 2012, Toronto, Ontario, Canada, J. Homann, B. Selman eds. AAAI Press, 2012), partially building on the results by Nordh and Zanuttini (What makes propositional abduction tractable. Artificial Intelligence, 172, 1245–1284, 2008). In this process, we outline a fine-grained analysis of the inherent parameterized intractability of these problems and pinpoint their FPT parts. As the standard algebraic approach is not applicable to our problems, we develop an alternative method that makes the algebraic tools partially available again.</jats:p>","lang":"eng"}],"extern":"1","publication":"Journal of Logic and Computation","issue":"1","doi":"10.1093/logcom/exaa079","language":[{"iso":"eng"}],"intvolume":"        31","date_updated":"2024-06-04T16:03:14Z","publication_status":"published","publication_identifier":{"issn":["0955-792X","1465-363X"]},"author":[{"full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"},{"last_name":"Schmidt","first_name":"Johannes","full_name":"Schmidt, Johannes"}],"title":"Parameterized complexity of abduction in Schaefer’s framework","year":"2021"},{"issue":"7","publication":"Proceedings of the AAAI Conference on Artificial Intelligence","abstract":[{"text":"<jats:p>Logic-based argumentation is a well-established formalism modeling nonmonotonic reasoning. It has been playing a major role in AI for decades, now.  Informally, a set of formulas is the support for a given claim if it is consistent, subset-minimal, and implies the claim. In such a case, the pair of the support and the claim together is called an argument. In this paper, we study the propositional variants of the following three computational tasks studied in argumentation: ARG (exists a support for a given claim with respect to a given set of formulas), ARG-Check (is a given set a support for a given claim), and ARG-Rel (similarly as ARG plus requiring an additionally given formula to be contained in the support). ARG-Check is complete for the complexity class DP, and the other two problems are known to be complete for the second level of the polynomial hierarchy and, accordingly, are highly intractable. Analyzing the reason for this intractability, we perform a two-dimensional classification: first, we consider all possible propositional fragments of the problem within Schaefer's framework, and then study different parameterizations for each of the fragment.\r\nWe identify a list of reasonable structural parameters (size of the claim, support, knowledge-base) that are connected to the aforementioned decision problems. Eventually, we thoroughly draw a fine border of parameterized intractability for each of the problems showing where the problems are fixed-parameter tractable and when this exactly stops. Surprisingly, several cases are of very high intractability (paraNP and beyond).</jats:p>","lang":"eng"}],"date_created":"2023-07-03T11:34:49Z","keyword":["General Medicine"],"type":"conference","year":"2021","title":"Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework","publication_identifier":{"issn":["2374-3468","2159-5399"]},"author":[{"full_name":"Mahmood, Yasir","first_name":"Yasir","last_name":"Mahmood","id":"99353"},{"last_name":"Meier","first_name":"Arne","full_name":"Meier, Arne"},{"full_name":"Schmidt, Johannes","first_name":"Johannes","last_name":"Schmidt"}],"publication_status":"published","date_updated":"2024-06-04T15:59:46Z","intvolume":"        35","language":[{"iso":"eng"}],"doi":"10.1609/aaai.v35i7.16797","citation":{"ama":"Mahmood Y, Meier A, Schmidt J. Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. Association for the Advancement of Artificial Intelligence (AAAI); 2021:6426-6434. doi:<a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">10.1609/aaai.v35i7.16797</a>","bibtex":"@inproceedings{Mahmood_Meier_Schmidt_2021, title={Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework}, volume={35}, DOI={<a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">10.1609/aaai.v35i7.16797</a>}, number={7}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence}, publisher={Association for the Advancement of Artificial Intelligence (AAAI)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2021}, pages={6426–6434} }","mla":"Mahmood, Yasir, et al. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 7, Association for the Advancement of Artificial Intelligence (AAAI), 2021, pp. 6426–34, doi:<a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">10.1609/aaai.v35i7.16797</a>.","short":"Y. Mahmood, A. Meier, J. Schmidt, in: Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI), 2021, pp. 6426–6434.","chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:6426–34. Association for the Advancement of Artificial Intelligence (AAAI), 2021. <a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">https://doi.org/10.1609/aaai.v35i7.16797</a>.","apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2021). Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, <i>35</i>(7), 6426–6434. <a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">https://doi.org/10.1609/aaai.v35i7.16797</a>","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 2021, vol. 35, no. 7, pp. 6426–6434, doi: <a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">10.1609/aaai.v35i7.16797</a>."},"status":"public","page":"6426-6434","_id":"45841","publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","user_id":"99353","volume":35},{"status":"public","title":"A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises","year":"2021","author":[{"full_name":"Huaman, Nicolas","first_name":"Nicolas","last_name":"Huaman"},{"first_name":"Bennet","last_name":"von Skarczinski","full_name":"von Skarczinski, Bennet"},{"first_name":"Christian","last_name":"Stransky","full_name":"Stransky, Christian"},{"first_name":"Dominik","last_name":"Wermke","full_name":"Wermke, Dominik"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"first_name":"Arne","last_name":"Dreißigacker","full_name":"Dreißigacker, Arne"},{"full_name":"Fahl, Sascha","first_name":"Sascha","last_name":"Fahl"}],"date_updated":"2024-06-05T12:57:43Z","page":"1235–1252","_id":"47265","publisher":"USENIX Association","language":[{"iso":"eng"}],"user_id":"14931","editor":[{"first_name":"Michael","last_name":"Bailey","full_name":"Bailey, Michael"},{"full_name":"Greenstadt, Rachel","first_name":"Rachel","last_name":"Greenstadt"}],"publication":"30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021","citation":{"bibtex":"@inproceedings{Huaman_von Skarczinski_Stransky_Wermke_Acar_Dreißigacker_Fahl_2021, title={A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises}, booktitle={30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}, publisher={USENIX Association}, author={Huaman, Nicolas and von Skarczinski, Bennet and Stransky, Christian and Wermke, Dominik and Acar, Yasemin and Dreißigacker, Arne and Fahl, Sascha}, editor={Bailey, Michael and Greenstadt, Rachel}, year={2021}, pages={1235–1252} }","short":"N. Huaman, B. von Skarczinski, C. Stransky, D. Wermke, Y. Acar, A. Dreißigacker, S. Fahl, in: M. Bailey, R. Greenstadt (Eds.), 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, USENIX Association, 2021, pp. 1235–1252.","ama":"Huaman N, von Skarczinski B, Stransky C, et al. A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises. In: Bailey M, Greenstadt R, eds. <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>. USENIX Association; 2021:1235–1252.","chicago":"Huaman, Nicolas, Bennet von Skarczinski, Christian Stransky, Dominik Wermke, Yasemin Acar, Arne Dreißigacker, and Sascha Fahl. “A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-Sized Enterprises.” In <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, 1235–1252. USENIX Association, 2021.","ieee":"N. Huaman <i>et al.</i>, “A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises,” in <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, 2021, pp. 1235–1252.","apa":"Huaman, N., von Skarczinski, B., Stransky, C., Wermke, D., Acar, Y., Dreißigacker, A., &#38; Fahl, S. (2021). A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises. In M. Bailey &#38; R. Greenstadt (Eds.), <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i> (pp. 1235–1252). USENIX Association.","mla":"Huaman, Nicolas, et al. “A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-Sized Enterprises.” <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, USENIX Association, 2021, pp. 1235–1252."},"extern":"1","date_created":"2023-09-22T13:02:54Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}]},{"citation":{"short":"C. Stransky, D. Wermke, J. Schrader, N. Huaman, Y. Acar, A.L. Fehlhaber, M. Wei, B. Ur, S. Fahl, in: S. Chiasson (Ed.), Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021, USENIX Association, 2021, pp. 437–454.","chicago":"Stransky, Christian, Dominik Wermke, Johanna Schrader, Nicolas Huaman, Yasemin Acar, Anna Lena Fehlhaber, Miranda Wei, Blase Ur, and Sascha Fahl. “On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security.” In <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, edited by Sonia Chiasson, 437–454. USENIX Association, 2021.","ieee":"C. Stransky <i>et al.</i>, “On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security,” in <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, 2021, pp. 437–454.","apa":"Stransky, C., Wermke, D., Schrader, J., Huaman, N., Acar, Y., Fehlhaber, A. L., Wei, M., Ur, B., &#38; Fahl, S. (2021). On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security. In S. Chiasson (Ed.), <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i> (pp. 437–454). USENIX Association.","bibtex":"@inproceedings{Stransky_Wermke_Schrader_Huaman_Acar_Fehlhaber_Wei_Ur_Fahl_2021, title={On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security}, booktitle={Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021}, publisher={USENIX Association}, author={Stransky, Christian and Wermke, Dominik and Schrader, Johanna and Huaman, Nicolas and Acar, Yasemin and Fehlhaber, Anna Lena and Wei, Miranda and Ur, Blase and Fahl, Sascha}, editor={Chiasson, Sonia}, year={2021}, pages={437–454} }","ama":"Stransky C, Wermke D, Schrader J, et al. On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security. In: Chiasson S, ed. <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>. USENIX Association; 2021:437–454.","mla":"Stransky, Christian, et al. “On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security.” <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, edited by Sonia Chiasson, USENIX Association, 2021, pp. 437–454."},"publication":"Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021","extern":"1","date_created":"2023-09-22T13:04:56Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","author":[{"first_name":"Christian","last_name":"Stransky","full_name":"Stransky, Christian"},{"first_name":"Dominik","last_name":"Wermke","full_name":"Wermke, Dominik"},{"first_name":"Johanna","last_name":"Schrader","full_name":"Schrader, Johanna"},{"full_name":"Huaman, Nicolas","last_name":"Huaman","first_name":"Nicolas"},{"id":"94636","last_name":"Acar","first_name":"Yasemin","full_name":"Acar, Yasemin"},{"last_name":"Fehlhaber","first_name":"Anna Lena","full_name":"Fehlhaber, Anna Lena"},{"full_name":"Wei, Miranda","first_name":"Miranda","last_name":"Wei"},{"full_name":"Ur, Blase","first_name":"Blase","last_name":"Ur"},{"last_name":"Fahl","first_name":"Sascha","full_name":"Fahl, Sascha"}],"status":"public","year":"2021","title":"On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security","date_updated":"2024-06-05T13:02:20Z","_id":"47268","language":[{"iso":"eng"}],"publisher":"USENIX Association","page":"437–454","editor":[{"last_name":"Chiasson","first_name":"Sonia","full_name":"Chiasson, Sonia"}],"user_id":"14931"},{"date_created":"2023-09-22T13:04:10Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","citation":{"mla":"Huaman, Nicolas, et al. “They Would Do Better If They Worked Together: The Case of Interaction Problems Between Password Managers and Websites.” <i>2021 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00094\">10.1109/sp40001.2021.00094</a>.","bibtex":"@inproceedings{Huaman_Amft_Oltrogge_Acar_Fahl_2021, title={They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites}, DOI={<a href=\"https://doi.org/10.1109/sp40001.2021.00094\">10.1109/sp40001.2021.00094</a>}, booktitle={2021 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Huaman, Nicolas and Amft, Sabrina and Oltrogge, Marten and Acar, Yasemin and Fahl, Sascha}, year={2021} }","ama":"Huaman N, Amft S, Oltrogge M, Acar Y, Fahl S. They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites. In: <i>2021 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00094\">10.1109/sp40001.2021.00094</a>","ieee":"N. Huaman, S. Amft, M. Oltrogge, Y. Acar, and S. Fahl, “They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites,” 2021, doi: <a href=\"https://doi.org/10.1109/sp40001.2021.00094\">10.1109/sp40001.2021.00094</a>.","apa":"Huaman, N., Amft, S., Oltrogge, M., Acar, Y., &#38; Fahl, S. (2021). They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites. <i>2021 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp40001.2021.00094\">https://doi.org/10.1109/sp40001.2021.00094</a>","chicago":"Huaman, Nicolas, Sabrina Amft, Marten Oltrogge, Yasemin Acar, and Sascha Fahl. “They Would Do Better If They Worked Together: The Case of Interaction Problems Between Password Managers and Websites.” In <i>2021 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/sp40001.2021.00094\">https://doi.org/10.1109/sp40001.2021.00094</a>.","short":"N. Huaman, S. Amft, M. Oltrogge, Y. Acar, S. Fahl, in: 2021 IEEE Symposium on Security and Privacy (SP), IEEE, 2021."},"publication":"2021 IEEE Symposium on Security and Privacy (SP)","extern":"1","_id":"47267","language":[{"iso":"eng"}],"publisher":"IEEE","doi":"10.1109/sp40001.2021.00094","user_id":"14931","author":[{"full_name":"Huaman, Nicolas","last_name":"Huaman","first_name":"Nicolas"},{"full_name":"Amft, Sabrina","last_name":"Amft","first_name":"Sabrina"},{"full_name":"Oltrogge, Marten","last_name":"Oltrogge","first_name":"Marten"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"first_name":"Sascha","last_name":"Fahl","full_name":"Fahl, Sascha"}],"status":"public","title":"They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites","year":"2021","date_updated":"2024-06-05T13:02:40Z","publication_status":"published"},{"citation":{"chicago":"Haney, Julie M., Yasemin Acar, and Susanne Furman. “‘It’s the Company, the Government, You and I’: User Perceptions of Responsibility for Smart Home Privacy and Security.” In <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, 411–428. USENIX Association, 2021.","short":"J.M. Haney, Y. Acar, S. Furman, in: M. Bailey, R. Greenstadt (Eds.), 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, USENIX Association, 2021, pp. 411–428.","apa":"Haney, J. M., Acar, Y., &#38; Furman, S. (2021). “It’s the Company, the Government, You and I”: User Perceptions of Responsibility for Smart Home Privacy and Security. In M. Bailey &#38; R. Greenstadt (Eds.), <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i> (pp. 411–428). USENIX Association.","ieee":"J. M. Haney, Y. Acar, and S. Furman, “‘It’s the Company, the Government, You and I’: User Perceptions of Responsibility for Smart Home Privacy and Security,” in <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, 2021, pp. 411–428.","ama":"Haney JM, Acar Y, Furman S. “It’s the Company, the Government, You and I”: User Perceptions of Responsibility for Smart Home Privacy and Security. In: Bailey M, Greenstadt R, eds. <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>. USENIX Association; 2021:411–428.","bibtex":"@inproceedings{Haney_Acar_Furman_2021, title={“It’s the Company, the Government, You and I”: User Perceptions of Responsibility for Smart Home Privacy and Security}, booktitle={30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}, publisher={USENIX Association}, author={Haney, Julie M. and Acar, Yasemin and Furman, Susanne}, editor={Bailey, Michael and Greenstadt, Rachel}, year={2021}, pages={411–428} }","mla":"Haney, Julie M., et al. “‘It’s the Company, the Government, You and I’: User Perceptions of Responsibility for Smart Home Privacy and Security.” <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, USENIX Association, 2021, pp. 411–428."},"publication":"30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021","extern":"1","date_created":"2023-09-22T13:03:50Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","author":[{"full_name":"Haney, Julie M.","first_name":"Julie M.","last_name":"Haney"},{"first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin","id":"94636"},{"first_name":"Susanne","last_name":"Furman","full_name":"Furman, Susanne"}],"status":"public","title":"\"It’s the Company, the Government, You and I\": User Perceptions of Responsibility for Smart Home Privacy and Security","year":"2021","date_updated":"2024-06-05T13:03:16Z","_id":"47266","publisher":"USENIX Association","language":[{"iso":"eng"}],"page":"411–428","editor":[{"full_name":"Bailey, Michael","last_name":"Bailey","first_name":"Michael"},{"full_name":"Greenstadt, Rachel","first_name":"Rachel","last_name":"Greenstadt"}],"user_id":"14931"},{"editor":[{"full_name":"Bailey, Michael","first_name":"Michael","last_name":"Bailey"},{"full_name":"Greenstadt, Rachel","first_name":"Rachel","last_name":"Greenstadt"}],"user_id":"14931","language":[{"iso":"eng"}],"_id":"47264","publisher":"USENIX Association","page":"4347–4364","date_updated":"2024-06-05T13:01:22Z","author":[{"last_name":"Oltrogge","first_name":"Marten","full_name":"Oltrogge, Marten"},{"last_name":"Huaman","first_name":"Nicolas","full_name":"Huaman, Nicolas"},{"first_name":"Sabrina","last_name":"Amft","full_name":"Amft, Sabrina"},{"first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin","id":"94636"},{"full_name":"Backes, Michael","first_name":"Michael","last_name":"Backes"},{"first_name":"Sascha","last_name":"Fahl","full_name":"Fahl, Sascha"}],"year":"2021","status":"public","title":"Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","date_created":"2023-09-22T13:02:22Z","extern":"1","citation":{"ieee":"M. Oltrogge, N. Huaman, S. Amft, Y. Acar, M. Backes, and S. Fahl, “Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications,” in <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, 2021, pp. 4347–4364.","apa":"Oltrogge, M., Huaman, N., Amft, S., Acar, Y., Backes, M., &#38; Fahl, S. (2021). Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications. In M. Bailey &#38; R. Greenstadt (Eds.), <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i> (pp. 4347–4364). USENIX Association.","short":"M. Oltrogge, N. Huaman, S. Amft, Y. Acar, M. Backes, S. Fahl, in: M. Bailey, R. Greenstadt (Eds.), 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, USENIX Association, 2021, pp. 4347–4364.","chicago":"Oltrogge, Marten, Nicolas Huaman, Sabrina Amft, Yasemin Acar, Michael Backes, and Sascha Fahl. “Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications.” In <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, 4347–4364. USENIX Association, 2021.","mla":"Oltrogge, Marten, et al. “Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications.” <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, USENIX Association, 2021, pp. 4347–4364.","bibtex":"@inproceedings{Oltrogge_Huaman_Amft_Acar_Backes_Fahl_2021, title={Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications}, booktitle={30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}, publisher={USENIX Association}, author={Oltrogge, Marten and Huaman, Nicolas and Amft, Sabrina and Acar, Yasemin and Backes, Michael and Fahl, Sascha}, editor={Bailey, Michael and Greenstadt, Rachel}, year={2021}, pages={4347–4364} }","ama":"Oltrogge M, Huaman N, Amft S, Acar Y, Backes M, Fahl S. Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications. In: Bailey M, Greenstadt R, eds. <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>. USENIX Association; 2021:4347–4364."},"publication":"30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021"},{"publication":"Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021","citation":{"chicago":"Neil, Lorenzo, Elijah Bouma-Sims, Evan Lafontaine, Yasemin Acar, and Bradley Reaves. “Investigating Web Service Account Remediation Advice.” In <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, edited by Sonia Chiasson, 359–376. USENIX Association, 2021.","short":"L. Neil, E. Bouma-Sims, E. Lafontaine, Y. Acar, B. Reaves, in: S. Chiasson (Ed.), Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021, USENIX Association, 2021, pp. 359–376.","ieee":"L. Neil, E. Bouma-Sims, E. Lafontaine, Y. Acar, and B. Reaves, “Investigating Web Service Account Remediation Advice,” in <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, 2021, pp. 359–376.","apa":"Neil, L., Bouma-Sims, E., Lafontaine, E., Acar, Y., &#38; Reaves, B. (2021). Investigating Web Service Account Remediation Advice. In S. Chiasson (Ed.), <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i> (pp. 359–376). USENIX Association.","bibtex":"@inproceedings{Neil_Bouma-Sims_Lafontaine_Acar_Reaves_2021, title={Investigating Web Service Account Remediation Advice}, booktitle={Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021}, publisher={USENIX Association}, author={Neil, Lorenzo and Bouma-Sims, Elijah and Lafontaine, Evan and Acar, Yasemin and Reaves, Bradley}, editor={Chiasson, Sonia}, year={2021}, pages={359–376} }","ama":"Neil L, Bouma-Sims E, Lafontaine E, Acar Y, Reaves B. Investigating Web Service Account Remediation Advice. In: Chiasson S, ed. <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>. USENIX Association; 2021:359–376.","mla":"Neil, Lorenzo, et al. “Investigating Web Service Account Remediation Advice.” <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, edited by Sonia Chiasson, USENIX Association, 2021, pp. 359–376."},"extern":"1","date_created":"2023-09-22T13:05:16Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}],"year":"2021","status":"public","title":"Investigating Web Service Account Remediation Advice","author":[{"last_name":"Neil","first_name":"Lorenzo","full_name":"Neil, Lorenzo"},{"first_name":"Elijah","last_name":"Bouma-Sims","full_name":"Bouma-Sims, Elijah"},{"last_name":"Lafontaine","first_name":"Evan","full_name":"Lafontaine, Evan"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"last_name":"Reaves","first_name":"Bradley","full_name":"Reaves, Bradley"}],"date_updated":"2024-06-05T13:03:38Z","page":"359–376","language":[{"iso":"eng"}],"_id":"47269","publisher":"USENIX Association","user_id":"14931","editor":[{"last_name":"Chiasson","first_name":"Sonia","full_name":"Chiasson, Sonia"}]},{"date_updated":"2024-06-05T12:56:39Z","author":[{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"}],"status":"public","title":"Human Factors in Secure Software Development","year":"2021","user_id":"14931","_id":"47271","language":[{"iso":"eng"}],"publisher":"University of Marburg, Germany","extern":"1","citation":{"short":"Y. Acar, Human Factors in Secure Software Development, University of Marburg, Germany, 2021.","chicago":"Acar, Yasemin. <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany, 2021.","apa":"Acar, Y. (2021). <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany.","ieee":"Y. Acar, <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany, 2021.","ama":"Acar Y. <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany; 2021.","bibtex":"@book{Acar_2021, title={Human Factors in Secure Software Development}, publisher={University of Marburg, Germany}, author={Acar, Yasemin}, year={2021} }","mla":"Acar, Yasemin. <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany, 2021."},"department":[{"_id":"34"},{"_id":"858"}],"type":"dissertation","date_created":"2023-09-22T13:06:40Z"},{"_id":"46315","language":[{"iso":"eng"}],"page":"1-8","user_id":"15504","doi":"10.1109/SSCI50451.2021.9660174","author":[{"full_name":"Prager, Raphael Patrick","last_name":"Prager","first_name":"Raphael Patrick"},{"full_name":"Seiler, Moritz","last_name":"Seiler","first_name":"Moritz","id":"105520"},{"id":"100740","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike"},{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"}],"title":"Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization","status":"public","year":"2021","date_updated":"2024-06-07T07:12:28Z","date_created":"2023-08-04T07:25:08Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","citation":{"ieee":"R. P. Prager, M. Seiler, H. Trautmann, and P. Kerschke, “Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization,” in <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2021, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">10.1109/SSCI50451.2021.9660174</a>.","apa":"Prager, R. P., Seiler, M., Trautmann, H., &#38; Kerschke, P. (2021). Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization. <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 1–8. <a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">https://doi.org/10.1109/SSCI50451.2021.9660174</a>","short":"R.P. Prager, M. Seiler, H. Trautmann, P. Kerschke, in: 2021 IEEE Symposium Series on Computational Intelligence (SSCI), 2021, pp. 1–8.","chicago":"Prager, Raphael Patrick, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization.” In <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 1–8, 2021. <a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">https://doi.org/10.1109/SSCI50451.2021.9660174</a>.","mla":"Prager, Raphael Patrick, et al. “Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization.” <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2021, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">10.1109/SSCI50451.2021.9660174</a>.","bibtex":"@inproceedings{Prager_Seiler_Trautmann_Kerschke_2021, title={Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization}, DOI={<a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">10.1109/SSCI50451.2021.9660174</a>}, booktitle={2021 IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Prager, Raphael Patrick and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, year={2021}, pages={1–8} }","ama":"Prager RP, Seiler M, Trautmann H, Kerschke P. Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization. In: <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>. ; 2021:1-8. doi:<a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">10.1109/SSCI50451.2021.9660174</a>"},"publication":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","abstract":[{"lang":"eng","text":"We propose a novel method for automated algorithm selection in the domain of single-objective continuous black-box optimization. In contrast to existing methods, we use convolutional neural networks as the selection apparatus which bases its decision on a so-called ‘fitness map’. This fitness map is a 2D representation of a two dimensional search space where different gray scales indicate the quality of found solutions in certain areas. Our devised approach uses a modular CMA-ES framework which offers the option to create the conventional CMA-ES, CMA-ES with the alternate step-size adaptation and many other variants proposed over the years. In total, 4 608 different configurations are possible where most configurations are of complementary nature. In this proof-of-concept work, we consider a subset of 32 possible configurations. The developed method is evaluated against an excerpt of BBOB functions and its performance is compared against baselines that are commonly used in automated algorithm selection - the best standalone algorithm (configuration) and the best obtainable sequence of configurations. While the results indicate that the use of the fitness map is not superior on every benchmark problem, it indubitably shows its merit on more hard-to-solve problems. This offers a promising perspective for generalizing to other types of optimization problems and problem domains."}]},{"date_created":"2023-08-04T07:22:59Z","place":"Virtual Event","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)","citation":{"mla":"Assenmacher, Dennis, et al. “RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets.” <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>, 2021, pp. 1–14.","bibtex":"@inproceedings{Assenmacher_Niemann_Müller_Seiler_Riehle_Trautmann_2021, place={Virtual Event}, title={RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets}, booktitle={Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)}, author={Assenmacher, Dennis and Niemann, Marco and Müller, Kilian and Seiler, Moritz and Riehle, Dennis M. and Trautmann, Heike}, year={2021}, pages={1–14} }","ama":"Assenmacher D, Niemann M, Müller K, Seiler M, Riehle DM, Trautmann H. RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets. In: <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>. ; 2021:1–14.","ieee":"D. Assenmacher, M. Niemann, K. Müller, M. Seiler, D. M. Riehle, and H. Trautmann, “RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets,” in <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>, 2021, pp. 1–14.","apa":"Assenmacher, D., Niemann, M., Müller, K., Seiler, M., Riehle, D. M., &#38; Trautmann, H. (2021). RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets. <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>, 1–14.","chicago":"Assenmacher, Dennis, Marco Niemann, Kilian Müller, Moritz Seiler, Dennis M. Riehle, and Heike Trautmann. “RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets.” In <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>, 1–14. Virtual Event, 2021.","short":"D. Assenmacher, M. Niemann, K. Müller, M. Seiler, D.M. Riehle, H. Trautmann, in: Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021), Virtual Event, 2021, pp. 1–14."},"abstract":[{"lang":"eng","text":"Abuse and hate are penetrating social media and many comment sections of news media companies. These platform providers invest considerable efforts to mod- erate user-generated contributions to prevent losing readers who get appalled by inappropriate texts. This is further enforced by legislative actions, which make non-clearance of these comments a punishable action. While (semi-)automated solutions using Natural Language Processing and advanced Machine Learning techniques are getting increasingly sophisticated, the domain of abusive language detection still struggles as large non-English and well-curated datasets are scarce or not publicly available. With this work, we publish and analyse the largest annotated German abusive language comment datasets to date. In contrast to existing datasets, we achieve a high labelling standard by conducting a thorough crowd-based an- notation study that complements professional moderators’ decisions, which are also included in the dataset. We compare and cross-evaluate the performance of baseline algorithms and state-of-the-art transformer-based language models, which are fine-tuned on our datasets and an existing alternative, showing the usefulness for the community."}],"page":"1–14","_id":"46312","language":[{"iso":"eng"}],"user_id":"15504","title":"RP-Mod & RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets","status":"public","year":"2021","author":[{"first_name":"Dennis","last_name":"Assenmacher","full_name":"Assenmacher, Dennis"},{"full_name":"Niemann, Marco","first_name":"Marco","last_name":"Niemann"},{"first_name":"Kilian","last_name":"Müller","full_name":"Müller, Kilian"},{"id":"105520","last_name":"Seiler","first_name":"Moritz","full_name":"Seiler, Moritz"},{"last_name":"Riehle","first_name":"Dennis M.","full_name":"Riehle, Dennis M."},{"id":"100740","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike"}],"date_updated":"2024-06-07T07:13:04Z"},{"citation":{"ieee":"C. D. Bergmann and B. Kranemann, Eds., <i>Analogie und Differenz: Das dynamische Verhältnis von jüdischer und    \tchristlicher Liturgie // Analogy and Difference: The Ever-Changing Relationship of Jewish and Christian Liturgy</i>. Aschendorff Verlag, 2021.","mla":"Bergmann, Claudia D., and Benedikt Kranemann, editors. <i>Analogie Und Differenz: Das Dynamische Verhältnis von Jüdischer Und    \tChristlicher Liturgie // Analogy and Difference: The Ever-Changing Relationship of Jewish and Christian Liturgy</i>. Aschendorff Verlag, 2021.","apa":"Bergmann, C. D., &#38; Kranemann, B. (Eds.). (2021). <i>Analogie und Differenz: Das dynamische Verhältnis von jüdischer und    \tchristlicher Liturgie // Analogy and Difference: The Ever-Changing Relationship of Jewish and Christian Liturgy</i>. Aschendorff Verlag.","bibtex":"@book{Bergmann_Kranemann_2021, title={Analogie und Differenz: Das dynamische Verhältnis von jüdischer und    \tchristlicher Liturgie // Analogy and Difference: The Ever-Changing Relationship of Jewish and Christian Liturgy}, publisher={Aschendorff Verlag}, year={2021} }","short":"C.D. Bergmann, B. Kranemann, eds., Analogie Und Differenz: Das Dynamische Verhältnis von Jüdischer Und    \tChristlicher Liturgie // Analogy and Difference: The Ever-Changing Relationship of Jewish and Christian Liturgy, Aschendorff Verlag, 2021.","ama":"Bergmann CD, Kranemann B, eds. <i>Analogie Und Differenz: Das Dynamische Verhältnis von Jüdischer Und    \tChristlicher Liturgie // Analogy and Difference: The Ever-Changing Relationship of Jewish and Christian Liturgy</i>. Aschendorff Verlag; 2021.","chicago":"Bergmann, Claudia D., and Benedikt Kranemann, eds. <i>Analogie Und Differenz: Das Dynamische Verhältnis von Jüdischer Und    \tChristlicher Liturgie // Analogy and Difference: The Ever-Changing Relationship of Jewish and Christian Liturgy</i>. Aschendorff Verlag, 2021."},"extern":"1","date_created":"2024-06-07T12:19:17Z","type":"book_editor","year":"2021","status":"public","title":"Analogie und Differenz: Das dynamische Verhältnis von jüdischer und \t\t\t\tchristlicher Liturgie // Analogy and Difference: The Ever-Changing Relationship of Jewish and Christian Liturgy","date_updated":"2024-06-07T12:25:57Z","publisher":"Aschendorff Verlag","_id":"54654","language":[{"iso":"eng"}],"editor":[{"last_name":"Bergmann","first_name":"Claudia D.","full_name":"Bergmann, Claudia D."},{"full_name":"Kranemann, Benedikt","last_name":"Kranemann","first_name":"Benedikt"}],"user_id":"94584"},{"date_updated":"2024-06-10T11:57:04Z","author":[{"full_name":"Heins, Jonathan","first_name":"Jonathan","last_name":"Heins"},{"last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"last_name":"Pohl","first_name":"Janina","full_name":"Pohl, Janina"},{"full_name":"Seiler, Moritz","last_name":"Seiler","first_name":"Moritz","id":"105520"},{"id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"},{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"}],"status":"public","year":"2021","title":"On the Potential of Normalized TSP Features for Automated Algorithm Selection","editor":[{"full_name":"Computing Machinery Association, for","first_name":"for","last_name":"Computing Machinery Association"}],"user_id":"15504","doi":"10.1145/3450218.3477308","language":[{"iso":"eng"}],"_id":"46313","publisher":"Association for Computing Machinery","page":"1–15","abstract":[{"lang":"eng","text":"Classic automated algorithm selection (AS) for (combinatorial) optimization problems heavily relies on so-called instance features, i.e., numerical characteristics of the problem at hand ideally extracted with computationally low-demanding routines. For the traveling salesperson problem (TSP) a plethora of features have been suggested. Most of these features are, if at all, only normalized imprecisely raising the issue of feature values being strongly affected by the instance size. Such artifacts may have detrimental effects on algorithm selection models. We propose a normalization for two feature groups which stood out in multiple AS studies on the TSP: (a) features based on a minimum spanning tree (MST) and (b) a k-nearest neighbor graph (NNG) transformation of the input instance. To this end we theoretically derive minimum and maximum values for properties of MSTs and k-NNGs of Euclidean graphs. We analyze the differences in feature space between normalized versions of these features and their unnormalized counterparts. Our empirical investigations on various TSP benchmark sets point out that the feature scaling succeeds in eliminating the effect of the instance size. Eventually, a proof-of-concept AS-study shows promising results: models trained with normalized features tend to outperform those trained with the respective vanilla features."}],"citation":{"apa":"Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., &#38; Kerschke, P. (2021). On the Potential of Normalized TSP Features for Automated Algorithm Selection. In  for Computing Machinery Association (Ed.), <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)</i> (pp. 1–15). Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450218.3477308\">https://doi.org/10.1145/3450218.3477308</a>","ieee":"J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “On the Potential of Normalized TSP Features for Automated Algorithm Selection,” in <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)</i>, 2021, pp. 1–15, doi: <a href=\"https://doi.org/10.1145/3450218.3477308\">10.1145/3450218.3477308</a>.","short":"J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, in:  for Computing Machinery Association (Ed.), Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI), Association for Computing Machinery, Dornbirn, Austria, 2021, pp. 1–15.","chicago":"Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” In <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI)</i>, edited by for Computing Machinery Association, 1–15. Dornbirn, Austria: Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450218.3477308\">https://doi.org/10.1145/3450218.3477308</a>.","mla":"Heins, Jonathan, et al. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI)</i>, edited by for Computing Machinery Association, Association for Computing Machinery, 2021, pp. 1–15, doi:<a href=\"https://doi.org/10.1145/3450218.3477308\">10.1145/3450218.3477308</a>.","ama":"Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential of Normalized TSP Features for Automated Algorithm Selection. In: Computing Machinery Association  for, ed. <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI)</i>. Association for Computing Machinery; 2021:1–15. doi:<a href=\"https://doi.org/10.1145/3450218.3477308\">10.1145/3450218.3477308</a>","bibtex":"@inproceedings{Heins_Bossek_Pohl_Seiler_Trautmann_Kerschke_2021, place={Dornbirn, Austria}, title={On the Potential of Normalized TSP Features for Automated Algorithm Selection}, DOI={<a href=\"https://doi.org/10.1145/3450218.3477308\">10.1145/3450218.3477308</a>}, booktitle={Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)}, publisher={Association for Computing Machinery}, author={Heins, Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, editor={Computing Machinery Association, for}, year={2021}, pages={1–15} }"},"publication":"Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","date_created":"2023-08-04T07:23:57Z","place":"Dornbirn, Austria"},{"citation":{"bibtex":"@article{Gries_Welfens_2021, title={Testing as an approach to control the Corona epidemic dynamics and avoid lockdowns}, volume={18}, DOI={<a href=\"https://doi.org/10.1007/s10368-021-00495-5\">10.1007/s10368-021-00495-5</a>}, number={1}, journal={International Economics and Economic Policy}, publisher={Springer Science and Business Media LLC}, author={Gries, Thomas and Welfens, Paul J. J.}, year={2021}, pages={1–24} }","ama":"Gries T, Welfens PJJ. Testing as an approach to control the Corona epidemic dynamics and avoid lockdowns. <i>International Economics and Economic Policy</i>. 2021;18(1):1-24. doi:<a href=\"https://doi.org/10.1007/s10368-021-00495-5\">10.1007/s10368-021-00495-5</a>","mla":"Gries, Thomas, and Paul J. J. Welfens. “Testing as an Approach to Control the Corona Epidemic Dynamics and Avoid Lockdowns.” <i>International Economics and Economic Policy</i>, vol. 18, no. 1, Springer Science and Business Media LLC, 2021, pp. 1–24, doi:<a href=\"https://doi.org/10.1007/s10368-021-00495-5\">10.1007/s10368-021-00495-5</a>.","short":"T. Gries, P.J.J. Welfens, International Economics and Economic Policy 18 (2021) 1–24.","chicago":"Gries, Thomas, and Paul J. J. Welfens. “Testing as an Approach to Control the Corona Epidemic Dynamics and Avoid Lockdowns.” <i>International Economics and Economic Policy</i> 18, no. 1 (2021): 1–24. <a href=\"https://doi.org/10.1007/s10368-021-00495-5\">https://doi.org/10.1007/s10368-021-00495-5</a>.","ieee":"T. Gries and P. J. J. Welfens, “Testing as an approach to control the Corona epidemic dynamics and avoid lockdowns,” <i>International Economics and Economic Policy</i>, vol. 18, no. 1, pp. 1–24, 2021, doi: <a href=\"https://doi.org/10.1007/s10368-021-00495-5\">10.1007/s10368-021-00495-5</a>.","apa":"Gries, T., &#38; Welfens, P. J. J. (2021). Testing as an approach to control the Corona epidemic dynamics and avoid lockdowns. <i>International Economics and Economic Policy</i>, <i>18</i>(1), 1–24. <a href=\"https://doi.org/10.1007/s10368-021-00495-5\">https://doi.org/10.1007/s10368-021-00495-5</a>"},"publisher":"Springer Science and Business Media LLC","_id":"33668","page":"1-24","volume":18,"user_id":"186","status":"public","date_created":"2022-10-10T18:44:46Z","department":[{"_id":"475"},{"_id":"19"},{"_id":"200"}],"keyword":["Economics and Econometrics"],"type":"journal_article","publication":"International Economics and Economic Policy","issue":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Vaccinations, lockdowns and testing strategies are three potential elements of an effective anti-coronavirus, and in particular Covid-19, health policy. The following analysis considers - within a simple model - the potentially crucial role of a Corona testing approach in combination with a quarantine approach which is shown herein to be a substitute for broad lockdown measures. The cost of lockdowns/shutdowns are rather high so that – beyond progress in terms of a broad vaccination program – a rational testing strategy should also be carefully considered. Testing has to be organized on the basis of an adequate testing infrastructure which could largely be implemented in firms, schools, universities and public administration settings. As regards the cost of a systematic broad Covid-19 testing strategy, these could come close to 0.5% of national income if there are no vaccinations. The Testing &amp; Quarantine approach suggested here – with tests for symptomatic as well as asymptomatic people - is based on a random sampling and would require rather broad and frequent testing; possibly one test per person every 7–10 days. At the same time, one should consider that the cost of further lockdowns/shutdowns of a duration of 1 month could be very high, such that a standard cost benefit analysis supports the testing approach suggested herein. Also, an optimal policy mix could be designed where both vaccinations and testing play a crucial role. As of late January 2021, no further lockdowns in Germany and other OECD countries would be necessary if a broad testing infrastructure can be established rather quickly. This in turn will reinforce economic optimism and help to jumpstart economic growth in Europe, the US and Asia in a solid way. The basic logic of the testing approach pointed out here for industrialized countries could also be applied in developing countries. The approach presented is complementary to the IMF analysis of Cherif/Hasanov.</jats:p>","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10368-021-00495-5","author":[{"full_name":"Gries, Thomas","last_name":"Gries","first_name":"Thomas","id":"186"},{"first_name":"Paul J. J.","last_name":"Welfens","full_name":"Welfens, Paul J. J."}],"publication_identifier":{"issn":["1612-4804","1612-4812"]},"year":"2021","title":"Testing as an approach to control the Corona epidemic dynamics and avoid lockdowns","intvolume":"        18","publication_status":"published","date_updated":"2024-06-12T12:50:47Z"}]