[{"place":"Cham","date_created":"2023-07-03T11:41:58Z","type":"conference","citation":{"short":"Y. Mahmood, A. Meier, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2020.","chicago":"Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">https://doi.org/10.1007/978-3-030-39951-1_10</a>.","apa":"Mahmood, Y., &#38; Meier, A. (2020). Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">https://doi.org/10.1007/978-3-030-39951-1_10</a>","ieee":"Y. Mahmood and A. Meier, “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic,” 2020, doi: <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>.","ama":"Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>","bibtex":"@inproceedings{Mahmood_Meier_2020, place={Cham}, title={Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne}, year={2020} }","mla":"Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>."},"publication":"Lecture Notes in Computer Science","publisher":"Springer International Publishing","_id":"45848","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-39951-1_10","user_id":"99353","author":[{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"last_name":"Meier","first_name":"Arne","full_name":"Meier, Arne"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030399504","9783030399511"]},"status":"public","year":"2020","title":"Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic","date_updated":"2024-06-04T15:56:56Z","publication_status":"published"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030367541","9783030367558"]},"author":[{"id":"99353","first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"},{"full_name":"Schmidt, Johannes","last_name":"Schmidt","first_name":"Johannes"}],"status":"public","year":"2020","title":"Parameterised Complexity of Abduction in Schaefer’s Framework","publication_status":"published","date_updated":"2024-06-04T16:02:33Z","language":[{"iso":"eng"}],"_id":"45818","publisher":"Springer International Publishing","user_id":"99353","doi":"10.1007/978-3-030-36755-8_13","citation":{"mla":"Mahmood, Yasir, et al. “Parameterised Complexity of Abduction in Schaefer’s Framework.” <i>Logical Foundations of Computer Science</i>, Springer International Publishing, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">10.1007/978-3-030-36755-8_13</a>.","bibtex":"@inproceedings{Mahmood_Meier_Schmidt_2020, place={Cham}, title={Parameterised Complexity of Abduction in Schaefer’s Framework}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">10.1007/978-3-030-36755-8_13</a>}, booktitle={Logical Foundations of Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2020} }","ama":"Mahmood Y, Meier A, Schmidt J. Parameterised Complexity of Abduction in Schaefer’s Framework. In: <i>Logical Foundations of Computer Science</i>. Springer International Publishing; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">10.1007/978-3-030-36755-8_13</a>","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterised Complexity of Abduction in Schaefer’s Framework,” 2020, doi: <a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">10.1007/978-3-030-36755-8_13</a>.","apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2020). Parameterised Complexity of Abduction in Schaefer’s Framework. <i>Logical Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">https://doi.org/10.1007/978-3-030-36755-8_13</a>","short":"Y. Mahmood, A. Meier, J. Schmidt, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2020.","chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterised Complexity of Abduction in Schaefer’s Framework.” In <i>Logical Foundations of Computer Science</i>. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">https://doi.org/10.1007/978-3-030-36755-8_13</a>."},"publication":"Logical Foundations of Computer Science","extern":"1","date_created":"2023-06-30T11:51:03Z","place":"Cham","type":"conference"},{"citation":{"ieee":"J. M. Haney, S. M. Furman, and Y. Acar, “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges,” in <i>HCI for Cybersecurity, Privacy and Trust</i>, Cham: Springer International Publishing, 2020.","apa":"Haney, J. M., Furman, S. M., &#38; Acar, Y. (2020). Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In <i>HCI for Cybersecurity, Privacy and Trust</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">https://doi.org/10.1007/978-3-030-50309-3_26</a>","chicago":"Haney, Julie M., Susanne M. Furman, and Yasemin Acar. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” In <i>HCI for Cybersecurity, Privacy and Trust</i>. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">https://doi.org/10.1007/978-3-030-50309-3_26</a>.","short":"J.M. Haney, S.M. Furman, Y. Acar, in: HCI for Cybersecurity, Privacy and Trust, Springer International Publishing, Cham, 2020.","mla":"Haney, Julie M., et al. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” <i>HCI for Cybersecurity, Privacy and Trust</i>, Springer International Publishing, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">10.1007/978-3-030-50309-3_26</a>.","bibtex":"@inbook{Haney_Furman_Acar_2020, place={Cham}, title={Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">10.1007/978-3-030-50309-3_26</a>}, booktitle={HCI for Cybersecurity, Privacy and Trust}, publisher={Springer International Publishing}, author={Haney, Julie M. and Furman, Susanne M. and Acar, Yasemin}, year={2020} }","ama":"Haney JM, Furman SM, Acar Y. Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In: <i>HCI for Cybersecurity, Privacy and Trust</i>. Springer International Publishing; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">10.1007/978-3-030-50309-3_26</a>"},"publication":"HCI for Cybersecurity, Privacy and Trust","extern":"1","date_created":"2023-09-22T12:59:53Z","place":"Cham","department":[{"_id":"34"},{"_id":"858"}],"type":"book_chapter","publication_identifier":{"isbn":["9783030503086","9783030503093"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Haney, Julie M.","first_name":"Julie M.","last_name":"Haney"},{"full_name":"Furman, Susanne M.","first_name":"Susanne M.","last_name":"Furman"},{"id":"94636","last_name":"Acar","first_name":"Yasemin","full_name":"Acar, Yasemin"}],"title":"Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges","status":"public","year":"2020","publication_status":"published","date_updated":"2024-06-05T13:04:23Z","_id":"47261","publisher":"Springer International Publishing","language":[{"iso":"eng"}],"user_id":"14931","doi":"10.1007/978-3-030-50309-3_26"},{"extern":"1","citation":{"mla":"Wermke, Dominik, et al. “Cloudy with a Chance of Misconceptions: Exploring Users’ Perceptions and Expectations of Security and Privacy in Cloud Office Suites.” <i>Sixteenth Symposium on Usable Privacy and Security, SOUPS 2020, August 7-11, 2020</i>, edited by Heather Richter Lipford and Sonia Chiasson, USENIX Association, 2020, pp. 359–377.","ama":"Wermke D, Huaman N, Stransky C, Busch N, Acar Y, Fahl S. Cloudy with a Chance of Misconceptions: Exploring Users’ Perceptions and Expectations of Security and Privacy in Cloud Office Suites. In: Lipford HR, Chiasson S, eds. <i>Sixteenth Symposium on Usable Privacy and Security, SOUPS 2020, August 7-11, 2020</i>. USENIX Association; 2020:359–377.","bibtex":"@inproceedings{Wermke_Huaman_Stransky_Busch_Acar_Fahl_2020, title={Cloudy with a Chance of Misconceptions: Exploring Users’ Perceptions and Expectations of Security and Privacy in Cloud Office Suites}, booktitle={Sixteenth Symposium on Usable Privacy and Security, SOUPS 2020, August 7-11, 2020}, publisher={USENIX Association}, author={Wermke, Dominik and Huaman, Nicolas and Stransky, Christian and Busch, Niklas and Acar, Yasemin and Fahl, Sascha}, editor={Lipford, Heather Richter and Chiasson, Sonia}, year={2020}, pages={359–377} }","apa":"Wermke, D., Huaman, N., Stransky, C., Busch, N., Acar, Y., &#38; Fahl, S. (2020). Cloudy with a Chance of Misconceptions: Exploring Users’ Perceptions and Expectations of Security and Privacy in Cloud Office Suites. In H. R. Lipford &#38; S. Chiasson (Eds.), <i>Sixteenth Symposium on Usable Privacy and Security, SOUPS 2020, August 7-11, 2020</i> (pp. 359–377). USENIX Association.","ieee":"D. Wermke, N. Huaman, C. Stransky, N. Busch, Y. Acar, and S. Fahl, “Cloudy with a Chance of Misconceptions: Exploring Users’ Perceptions and Expectations of Security and Privacy in Cloud Office Suites,” in <i>Sixteenth Symposium on Usable Privacy and Security, SOUPS 2020, August 7-11, 2020</i>, 2020, pp. 359–377.","chicago":"Wermke, Dominik, Nicolas Huaman, Christian Stransky, Niklas Busch, Yasemin Acar, and Sascha Fahl. “Cloudy with a Chance of Misconceptions: Exploring Users’ Perceptions and Expectations of Security and Privacy in Cloud Office Suites.” In <i>Sixteenth Symposium on Usable Privacy and Security, SOUPS 2020, August 7-11, 2020</i>, edited by Heather Richter Lipford and Sonia Chiasson, 359–377. USENIX Association, 2020.","short":"D. Wermke, N. Huaman, C. Stransky, N. Busch, Y. Acar, S. Fahl, in: H.R. Lipford, S. Chiasson (Eds.), Sixteenth Symposium on Usable Privacy and Security, SOUPS 2020, August 7-11, 2020, USENIX Association, 2020, pp. 359–377."},"publication":"Sixteenth Symposium on Usable Privacy and Security, SOUPS 2020, August 7-11, 2020","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","date_created":"2023-09-22T12:59:31Z","date_updated":"2024-06-05T13:04:48Z","author":[{"last_name":"Wermke","first_name":"Dominik","full_name":"Wermke, Dominik"},{"first_name":"Nicolas","last_name":"Huaman","full_name":"Huaman, Nicolas"},{"last_name":"Stransky","first_name":"Christian","full_name":"Stransky, Christian"},{"last_name":"Busch","first_name":"Niklas","full_name":"Busch, Niklas"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"title":"Cloudy with a Chance of Misconceptions: Exploring Users’ Perceptions and Expectations of Security and Privacy in Cloud Office Suites","year":"2020","status":"public","editor":[{"last_name":"Lipford","first_name":"Heather Richter","full_name":"Lipford, Heather Richter"},{"full_name":"Chiasson, Sonia","last_name":"Chiasson","first_name":"Sonia"}],"user_id":"14931","_id":"47260","publisher":"USENIX Association","language":[{"iso":"eng"}],"page":"359–377"},{"date_updated":"2024-06-05T13:05:10Z","publication_status":"published","year":"2020","title":"Listen to Developers! A Participatory Design Study on Security Warnings for Cryptographic APIs","status":"public","author":[{"last_name":"Gorski","first_name":"Peter Leo","full_name":"Gorski, Peter Leo"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"full_name":"Lo Iacono, Luigi","last_name":"Lo Iacono","first_name":"Luigi"},{"first_name":"Sascha","last_name":"Fahl","full_name":"Fahl, Sascha"}],"doi":"10.1145/3313831.3376142","user_id":"14931","language":[{"iso":"eng"}],"_id":"47262","publisher":"ACM","extern":"1","publication":"Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems","citation":{"mla":"Gorski, Peter Leo, et al. “Listen to Developers! A Participatory Design Study on Security Warnings for Cryptographic APIs.” <i>Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems</i>, ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3313831.3376142\">10.1145/3313831.3376142</a>.","ama":"Gorski PL, Acar Y, Lo Iacono L, Fahl S. Listen to Developers! A Participatory Design Study on Security Warnings for Cryptographic APIs. In: <i>Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems</i>. ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3313831.3376142\">10.1145/3313831.3376142</a>","bibtex":"@inproceedings{Gorski_Acar_Lo Iacono_Fahl_2020, title={Listen to Developers! A Participatory Design Study on Security Warnings for Cryptographic APIs}, DOI={<a href=\"https://doi.org/10.1145/3313831.3376142\">10.1145/3313831.3376142</a>}, booktitle={Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems}, publisher={ACM}, author={Gorski, Peter Leo and Acar, Yasemin and Lo Iacono, Luigi and Fahl, Sascha}, year={2020} }","apa":"Gorski, P. L., Acar, Y., Lo Iacono, L., &#38; Fahl, S. (2020). Listen to Developers! A Participatory Design Study on Security Warnings for Cryptographic APIs. <i>Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems</i>. <a href=\"https://doi.org/10.1145/3313831.3376142\">https://doi.org/10.1145/3313831.3376142</a>","ieee":"P. L. Gorski, Y. Acar, L. Lo Iacono, and S. Fahl, “Listen to Developers! A Participatory Design Study on Security Warnings for Cryptographic APIs,” 2020, doi: <a href=\"https://doi.org/10.1145/3313831.3376142\">10.1145/3313831.3376142</a>.","short":"P.L. Gorski, Y. Acar, L. Lo Iacono, S. Fahl, in: Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems, ACM, 2020.","chicago":"Gorski, Peter Leo, Yasemin Acar, Luigi Lo Iacono, and Sascha Fahl. “Listen to Developers! A Participatory Design Study on Security Warnings for Cryptographic APIs.” In <i>Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems</i>. ACM, 2020. <a href=\"https://doi.org/10.1145/3313831.3376142\">https://doi.org/10.1145/3313831.3376142</a>."},"type":"conference","department":[{"_id":"34"},{"_id":"858"}],"date_created":"2023-09-22T13:00:15Z"},{"date_created":"2023-10-09T13:20:44Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}],"citation":{"short":"J. Haney, S. Furman, Y. Acar, in: International Conference on Human-Computer Interaction, Copenhagen, -1, 2020.","chicago":"Haney, Julie, Susanne Furman, and Yasemin Acar. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” International Conference on Human-Computer Interaction, Copenhagen, -1, 2020.","apa":"Haney, J., Furman, S., &#38; Acar, Y. (2020). <i>Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges</i>.","ieee":"J. Haney, S. Furman, and Y. Acar, “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges,” 2020.","ama":"Haney J, Furman S, Acar Y. Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In: International Conference on Human-Computer Interaction, Copenhagen, -1; 2020.","bibtex":"@inproceedings{Haney_Furman_Acar_2020, title={Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges}, publisher={International Conference on Human-Computer Interaction, Copenhagen, -1}, author={Haney, Julie and Furman, Susanne and Acar, Yasemin}, year={2020} }","mla":"Haney, Julie, et al. <i>Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges</i>. International Conference on Human-Computer Interaction, Copenhagen, -1, 2020."},"extern":"1","_id":"47879","publisher":"International Conference on Human-Computer Interaction, Copenhagen, -1","language":[{"iso":"eng"}],"user_id":"14931","status":"public","year":"2020","title":"Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges","author":[{"full_name":"Haney, Julie","last_name":"Haney","first_name":"Julie"},{"full_name":"Furman, Susanne","first_name":"Susanne","last_name":"Furman"},{"full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar","id":"94636"}],"date_updated":"2024-06-05T13:04:04Z"},{"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T07:39:48Z","place":"Glasgow, UK","abstract":[{"lang":"eng","text":"Artificial neural networks in general and deep learning networks in particular established themselves as popular and powerful machine learning algorithms. While the often tremendous sizes of these networks are beneficial when solving complex tasks, the tremendous number of parameters also causes such networks to be vulnerable to malicious behavior such as adversarial perturbations. These perturbations can change a model's classification decision. Moreover, while single-step adversaries can easily be transferred from network to network, the transfer of more powerful multi-step adversaries has - usually - been rather difficult.In this work, we introduce a method for generating strong adversaries that can easily (and frequently) be transferred between different models. This method is then used to generate a large set of adversaries, based on which the effects of selected defense methods are experimentally assessed. At last, we introduce a novel, simple, yet effective approach to enhance the resilience of neural networks against adversaries and benchmark it against established defense methods. In contrast to the already existing methods, our proposed defense approach is much more efficient as it only requires a single additional forward-pass to achieve comparable performance results."}],"publication":"Proceedings of the International Joint Conference on Neural Networks (IJCNN)","citation":{"apa":"Seiler, M., Trautmann, H., &#38; Kerschke, P. (2020). Enhancing Resilience of Deep Learning Networks By Means of Transferable Adversaries. <i>Proceedings of the International Joint Conference on Neural Networks (IJCNN)</i>, 1–8. <a href=\"https://doi.org/10.1109/IJCNN48605.2020.9207338\">https://doi.org/10.1109/IJCNN48605.2020.9207338</a>","ieee":"M. Seiler, H. Trautmann, and P. Kerschke, “Enhancing Resilience of Deep Learning Networks By Means of Transferable Adversaries,” in <i>Proceedings of the International Joint Conference on Neural Networks (IJCNN)</i>, 2020, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/IJCNN48605.2020.9207338\">10.1109/IJCNN48605.2020.9207338</a>.","short":"M. Seiler, H. Trautmann, P. Kerschke, in: Proceedings of the International Joint Conference on Neural Networks (IJCNN), Glasgow, UK, 2020, pp. 1–8.","chicago":"Seiler, Moritz, Heike Trautmann, and Pascal Kerschke. “Enhancing Resilience of Deep Learning Networks By Means of Transferable Adversaries.” In <i>Proceedings of the International Joint Conference on Neural Networks (IJCNN)</i>, 1–8. Glasgow, UK, 2020. <a href=\"https://doi.org/10.1109/IJCNN48605.2020.9207338\">https://doi.org/10.1109/IJCNN48605.2020.9207338</a>.","mla":"Seiler, Moritz, et al. “Enhancing Resilience of Deep Learning Networks By Means of Transferable Adversaries.” <i>Proceedings of the International Joint Conference on Neural Networks (IJCNN)</i>, 2020, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/IJCNN48605.2020.9207338\">10.1109/IJCNN48605.2020.9207338</a>.","ama":"Seiler M, Trautmann H, Kerschke P. Enhancing Resilience of Deep Learning Networks By Means of Transferable Adversaries. In: <i>Proceedings of the International Joint Conference on Neural Networks (IJCNN)</i>. ; 2020:1–8. doi:<a href=\"https://doi.org/10.1109/IJCNN48605.2020.9207338\">10.1109/IJCNN48605.2020.9207338</a>","bibtex":"@inproceedings{Seiler_Trautmann_Kerschke_2020, place={Glasgow, UK}, title={Enhancing Resilience of Deep Learning Networks By Means of Transferable Adversaries}, DOI={<a href=\"https://doi.org/10.1109/IJCNN48605.2020.9207338\">10.1109/IJCNN48605.2020.9207338</a>}, booktitle={Proceedings of the International Joint Conference on Neural Networks (IJCNN)}, author={Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, year={2020}, pages={1–8} }"},"user_id":"15504","doi":"10.1109/IJCNN48605.2020.9207338","page":"1–8","_id":"46331","language":[{"iso":"eng"}],"date_updated":"2024-06-07T07:11:53Z","title":"Enhancing Resilience of Deep Learning Networks By Means of Transferable Adversaries","status":"public","year":"2020","author":[{"id":"105520","full_name":"Seiler, Moritz","first_name":"Moritz","last_name":"Seiler"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"}]},{"date_created":"2024-06-07T12:37:51Z","type":"misc","citation":{"bibtex":"@book{Eikermann_Hansell_2020, title={Unterrichtsmaterial Erzgebirge - World Heritage Education}, author={Eikermann, Larissa and Hansell, Friederike}, year={2020} }","ama":"Eikermann L, Hansell F. <i>Unterrichtsmaterial Erzgebirge - World Heritage Education</i>.; 2020.","mla":"Eikermann, Larissa, and Friederike Hansell. <i>Unterrichtsmaterial Erzgebirge - World Heritage Education</i>. 2020.","short":"L. Eikermann, F. Hansell, Unterrichtsmaterial Erzgebirge - World Heritage Education, 2020.","chicago":"Eikermann, Larissa, and Friederike Hansell. <i>Unterrichtsmaterial Erzgebirge - World Heritage Education</i>, 2020.","ieee":"L. Eikermann and F. Hansell, <i>Unterrichtsmaterial Erzgebirge - World Heritage Education</i>. 2020.","apa":"Eikermann, L., &#38; Hansell, F. (2020). <i>Unterrichtsmaterial Erzgebirge - World Heritage Education</i>."},"supervisor":[{"full_name":"Albert, Marie-Theres","last_name":"Albert","first_name":"Marie-Theres"}],"main_file_link":[{"url":"https://worldheritage-education.eu/resources/conference/Arbeitsblatt%20Erzgebirge%20-%20finale%20Version%20World%20Heritage%20Education.pdf"}],"language":[{"iso":"ger"}],"_id":"54663","user_id":"37813","title":"Unterrichtsmaterial Erzgebirge - World Heritage Education","year":"2020","status":"public","author":[{"id":"37813","full_name":"Eikermann, Larissa","last_name":"Eikermann","orcid":"https://orcid.org/0009-0009-5980-2458","first_name":"Larissa"},{"full_name":"Hansell, Friederike","first_name":"Friederike","last_name":"Hansell"}],"date_updated":"2024-06-07T12:37:54Z"},{"date_updated":"2024-06-07T12:38:08Z","author":[{"id":"37813","orcid":"https://orcid.org/0009-0009-5980-2458","first_name":"Larissa","last_name":"Eikermann","full_name":"Eikermann, Larissa"},{"last_name":"Hansell","first_name":"Friederike","full_name":"Hansell, Friederike"}],"year":"2020","title":"Unterrichtsmaterial Erzgebirge - Technology","status":"public","user_id":"37813","language":[{"iso":"ger"}],"_id":"54662","main_file_link":[{"url":"https://worldheritage-education.eu/resources/conference/Arbeitsblatt%20Erzgebirge%20-%20finale%20Version%20Technology.pdf"}],"citation":{"ieee":"L. Eikermann and F. Hansell, <i>Unterrichtsmaterial Erzgebirge - Technology</i>. 2020.","apa":"Eikermann, L., &#38; Hansell, F. (2020). <i>Unterrichtsmaterial Erzgebirge - Technology</i>.","short":"L. Eikermann, F. Hansell, Unterrichtsmaterial Erzgebirge - Technology, 2020.","chicago":"Eikermann, Larissa, and Friederike Hansell. <i>Unterrichtsmaterial Erzgebirge - Technology</i>, 2020.","mla":"Eikermann, Larissa, and Friederike Hansell. <i>Unterrichtsmaterial Erzgebirge - Technology</i>. 2020.","bibtex":"@book{Eikermann_Hansell_2020, title={Unterrichtsmaterial Erzgebirge - Technology}, author={Eikermann, Larissa and Hansell, Friederike}, year={2020} }","ama":"Eikermann L, Hansell F. <i>Unterrichtsmaterial Erzgebirge - Technology</i>.; 2020."},"supervisor":[{"first_name":"Marie-Theres","last_name":"Albert","full_name":"Albert, Marie-Theres"}],"type":"misc","date_created":"2024-06-07T12:35:27Z"},{"abstract":[{"text":"In this work we focus on the well-known Euclidean Traveling Salesperson Problem (TSP) and two highly competitive inexact heuristic TSP solvers, EAX and LKH, in the context of per-instance algorithm selection (AS). We evolve instances with 1000 nodes where the solvers show strongly different performance profiles. These instances serve as a basis for an exploratory study on the identification of well-discriminating problem characteristics (features). Our results in a nutshell: we show that even though (1) promising features exist, (2) these are in line with previous results from the literature, and (3) models trained with these features are more accurate than models adopting sophisticated feature selection methods, the advantage is not close to the virtual best solver in terms of penalized average runtime and so is the performance gain over the single best solver. However, we show that a feature-free deep neural network based approach solely based on visual representation of the instances already matches classical AS model results and thus shows huge potential for future studies.","lang":"eng"}],"publication":"Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI)","citation":{"short":"M. Seiler, J. Pohl, J. Bossek, P. Kerschke, H. Trautmann, in: T. Bäck, M. Preuss, A. Deutz, H. Wang, C. Doerr, M. Emmerich, H. Trautmann (Eds.), Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI), Leiden, The Netherlands, 2020, pp. 48–64.","chicago":"Seiler, Moritz, Janina Pohl, Jakob Bossek, Pascal Kerschke, and Heike Trautmann. “Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem.” In <i>Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI)</i>, edited by Thomas Bäck, Mike Preuss, André Deutz, Hao Wang, Carola Doerr, Michael Emmerich, and Heike Trautmann, 48–64. Leiden, The Netherlands, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">https://doi.org/10.1007/978-3-030-58112-1_4</a>.","apa":"Seiler, M., Pohl, J., Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. In T. Bäck, M. Preuss, A. Deutz, H. Wang, C. Doerr, M. Emmerich, &#38; H. Trautmann (Eds.), <i>Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI)</i> (pp. 48–64). <a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">https://doi.org/10.1007/978-3-030-58112-1_4</a>","ieee":"M. Seiler, J. Pohl, J. Bossek, P. Kerschke, and H. Trautmann, “Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem,” in <i>Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI)</i>, 2020, pp. 48–64, doi: <a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">10.1007/978-3-030-58112-1_4</a>.","ama":"Seiler M, Pohl J, Bossek J, Kerschke P, Trautmann H. Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. In: Bäck T, Preuss M, Deutz A, et al., eds. <i>Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI)</i>. ; 2020:48–64. doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">10.1007/978-3-030-58112-1_4</a>","bibtex":"@inproceedings{Seiler_Pohl_Bossek_Kerschke_Trautmann_2020, place={Leiden, The Netherlands}, title={Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">10.1007/978-3-030-58112-1_4</a>}, booktitle={Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI)}, author={Seiler, Moritz and Pohl, Janina and Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, editor={Bäck, Thomas and Preuss, Mike and Deutz, André and Wang, Hao and Doerr, Carola and Emmerich, Michael and Trautmann, Heike}, year={2020}, pages={48–64} }","mla":"Seiler, Moritz, et al. “Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem.” <i>Proceedings of the 16$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XVI)</i>, edited by Thomas Bäck et al., 2020, pp. 48–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">10.1007/978-3-030-58112-1_4</a>."},"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"place":"Leiden, The Netherlands","date_created":"2023-08-04T07:39:05Z","date_updated":"2024-06-10T11:57:13Z","title":"Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem","year":"2020","status":"public","author":[{"full_name":"Seiler, Moritz","first_name":"Moritz","last_name":"Seiler","id":"105520"},{"first_name":"Janina","last_name":"Pohl","full_name":"Pohl, Janina"},{"id":"102979","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282","id":"100740"}],"doi":"10.1007/978-3-030-58112-1_4","user_id":"15504","editor":[{"full_name":"Bäck, Thomas","last_name":"Bäck","first_name":"Thomas"},{"last_name":"Preuss","first_name":"Mike","full_name":"Preuss, Mike"},{"full_name":"Deutz, André","last_name":"Deutz","first_name":"André"},{"last_name":"Wang","first_name":"Hao","full_name":"Wang, Hao"},{"last_name":"Doerr","first_name":"Carola","full_name":"Doerr, Carola"},{"last_name":"Emmerich","first_name":"Michael","full_name":"Emmerich, Michael"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"page":"48–64","language":[{"iso":"eng"}],"_id":"46330"},{"volume":88,"user_id":"15504","doi":"https://doi.org/10.1016/j.asoc.2019.105901","_id":"46334","language":[{"iso":"eng"}],"page":"105901","intvolume":"        88","date_updated":"2024-06-10T12:00:46Z","author":[{"last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979"},{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"},{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"publication_identifier":{"issn":["1568-4946"]},"title":"A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms","status":"public","year":"2020","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","keyword":["Algorithm selection","Multi-objective optimization","Performance measurement","Combinatorial optimization","Traveling Salesperson Problem"],"date_created":"2023-08-04T07:42:26Z","abstract":[{"text":"We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs – both to be minimized – is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers.","lang":"eng"}],"citation":{"ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms,” <i>Applied Soft Computing</i>, vol. 88, p. 105901, 2020, doi: <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>.","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms. <i>Applied Soft Computing</i>, <i>88</i>, 105901. <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>","short":"J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020) 105901.","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i> 88 (2020): 105901. <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>.","mla":"Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i>, vol. 88, 2020, p. 105901, doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>.","bibtex":"@article{Bossek_Kerschke_Trautmann_2020, title={A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms}, volume={88}, DOI={<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={105901} }","ama":"Bossek J, Kerschke P, Trautmann H. A multi-objective perspective on performance assessment and automated selection of single-objective optimization algorithms. <i>Applied Soft Computing</i>. 2020;88:105901. doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>"},"publication":"Applied Soft Computing"},{"abstract":[{"lang":"eng","text":"We consider a dynamic bi-objective vehicle routing problem, where a subset of customers ask for service over time. Therein, the distance traveled by a single vehicle and the number of unserved dynamic requests is minimized by a dynamic evolutionary multi-objective algorithm (DEMOA), which operates on discrete time windows (eras). A decision is made at each era by a decision-maker, thus any decision depends on irreversible decisions made in foregoing eras. To understand effects of sequences of decision-making and interactions/dependencies between decisions made, we conduct a series of experiments. More precisely, we fix a set of decision-maker preferences D and the number of eras n t and analyze all |D| nt combinations of decision-maker options. We find that for random uniform instances (a) the final selected solutions mainly depend on the final decision and not on the decision history, (b) solutions are quite robust with respect to the number of unvisited dynamic customers, and (c) solutions of the dynamic approach can even dominate solutions obtained by a clairvoyant EMOA. In contrast, for instances with clustered customers, we observe a strong dependency on decision-making history as well as more variance in solution diversity."}],"publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","citation":{"mla":"Bossek, Jakob, et al. “Towards Decision Support in Dynamic Bi-Objective Vehicle Routing.” <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 2020, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">10.1109/CEC48606.2020.9185778</a>.","bibtex":"@inproceedings{Bossek_Grimme_Rudolph_Trautmann_2020, place={Glasgow, UK}, title={Towards Decision Support in Dynamic Bi-Objective Vehicle Routing}, DOI={<a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">10.1109/CEC48606.2020.9185778</a>}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}, author={Bossek, Jakob and Grimme, Christian and Rudolph, Günter and Trautmann, Heike}, year={2020}, pages={1–8} }","ama":"Bossek J, Grimme C, Rudolph G, Trautmann H. Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. In: <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. ; 2020:1–8. doi:<a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">10.1109/CEC48606.2020.9185778</a>","ieee":"J. Bossek, C. Grimme, G. Rudolph, and H. Trautmann, “Towards Decision Support in Dynamic Bi-Objective Vehicle Routing,” in <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 2020, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">10.1109/CEC48606.2020.9185778</a>.","apa":"Bossek, J., Grimme, C., Rudolph, G., &#38; Trautmann, H. (2020). Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">https://doi.org/10.1109/CEC48606.2020.9185778</a>","chicago":"Bossek, Jakob, Christian Grimme, Günter Rudolph, and Heike Trautmann. “Towards Decision Support in Dynamic Bi-Objective Vehicle Routing.” In <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. Glasgow, UK, 2020. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">https://doi.org/10.1109/CEC48606.2020.9185778</a>.","short":"J. Bossek, C. Grimme, G. Rudolph, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Glasgow, UK, 2020, pp. 1–8."},"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T07:32:36Z","place":"Glasgow, UK","date_updated":"2024-06-10T12:02:05Z","year":"2020","title":"Towards Decision Support in Dynamic Bi-Objective Vehicle Routing","status":"public","author":[{"full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","id":"102979"},{"last_name":"Grimme","first_name":"Christian","full_name":"Grimme, Christian"},{"full_name":"Rudolph, Günter","last_name":"Rudolph","first_name":"Günter"},{"id":"100740","full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"}],"user_id":"15504","doi":"10.1109/CEC48606.2020.9185778","page":"1–8","_id":"46322","language":[{"iso":"eng"}]},{"author":[{"full_name":"Bossek, Jakob","first_name":"Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979"},{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282","id":"100740"}],"year":"2020","title":"Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection","status":"public","date_updated":"2024-06-10T12:01:46Z","publisher":"IEEE","_id":"46324","language":[{"iso":"eng"}],"page":"1–8","user_id":"15504","citation":{"ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection,” in <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 2020, pp. 1–8.","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8.","mla":"Bossek, Jakob, et al. “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, IEEE, 2020, pp. 1–8.","bibtex":"@inproceedings{Bossek_Kerschke_Trautmann_2020, place={Glasgow, UK}, title={Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={1–8} }","short":"J. Bossek, P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), IEEE, Glasgow, UK, 2020, pp. 1–8.","ama":"Bossek J, Kerschke P, Trautmann H. Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. In: <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. IEEE; 2020:1–8.","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” In <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. Glasgow, UK: IEEE, 2020."},"publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","abstract":[{"text":"The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respective (restart) variants manage to calculate close-to optimal or even optimal solutions, also for large instances with several thousand nodes in reasonable time. In this work we extend existing benchmarking studies by addressing anytime behaviour of inexact TSP solvers based on empirical runtime distributions leading to an increased understanding of solver behaviour and the respective relation to problem hardness. It turns out that performance ranking of solvers is highly dependent on the focused approximation quality. Insights on intersection points of performances offer huge potential for the construction of hybridized solvers depending on instance features. Moreover, instance features tailored to anytime performance and corresponding performance indicators will highly improve automated algorithm selection models by including comprehensive information on solver quality.","lang":"eng"}],"date_created":"2023-08-04T07:34:40Z","place":"Glasgow, UK","department":[{"_id":"34"},{"_id":"819"}],"type":"conference"},{"author":[{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740"}],"title":"Dynamic Bi-Objective Routing of Multiple Vehicles","year":"2020","status":"public","date_updated":"2024-06-10T12:01:57Z","_id":"46323","publisher":"ACM","language":[{"iso":"eng"}],"page":"166–174","user_id":"15504","citation":{"apa":"Bossek, J., Grimme, C., &#38; Trautmann, H. (2020). Dynamic Bi-Objective Routing of Multiple Vehicles. <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)</i>, 166–174.","ieee":"J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of Multiple Vehicles,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)</i>, 2020, pp. 166–174.","chicago":"Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective Routing of Multiple Vehicles.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)</i>, 166–174. Cancun, Mexico: ACM, 2020.","short":"J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20), ACM, Cancun, Mexico, 2020, pp. 166–174.","mla":"Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.” <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)</i>, ACM, 2020, pp. 166–174.","ama":"Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple Vehicles. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)</i>. ACM; 2020:166–174.","bibtex":"@inproceedings{Bossek_Grimme_Trautmann_2020, place={Cancun, Mexico}, title={Dynamic Bi-Objective Routing of Multiple Vehicles}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)}, publisher={ACM}, author={Bossek, Jakob and Grimme, Christian and Trautmann, Heike}, year={2020}, pages={166–174} }"},"publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)","abstract":[{"text":"In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier.","lang":"eng"}],"place":"Cancun, Mexico","date_created":"2023-08-04T07:33:30Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference"},{"year":"2020","title":"Unterrichtsmaterial Erzgebirge - History","status":"public","author":[{"id":"37813","first_name":"Larissa","orcid":"https://orcid.org/0009-0009-5980-2458","last_name":"Eikermann","full_name":"Eikermann, Larissa"},{"full_name":"Hansell, Friederike","last_name":"Hansell","first_name":"Friederike"}],"date_updated":"2024-06-12T06:51:43Z","main_file_link":[{"url":"https://worldheritage-education.eu/resources/conference/Arbeitsblatt%20Erzgebirge%20-%20finale%20Version%20History%20deutsch.pdf"}],"language":[{"iso":"ger"}],"_id":"54658","user_id":"37813","citation":{"bibtex":"@book{Eikermann_Hansell_2020, title={Unterrichtsmaterial Erzgebirge - History}, author={Eikermann, Larissa and Hansell, Friederike}, year={2020} }","ama":"Eikermann L, Hansell F. <i>Unterrichtsmaterial Erzgebirge - History</i>.; 2020.","mla":"Eikermann, Larissa, and Friederike Hansell. <i>Unterrichtsmaterial Erzgebirge - History</i>. 2020.","chicago":"Eikermann, Larissa, and Friederike Hansell. <i>Unterrichtsmaterial Erzgebirge - History</i>, 2020.","short":"L. Eikermann, F. Hansell, Unterrichtsmaterial Erzgebirge - History, 2020.","ieee":"L. Eikermann and F. Hansell, <i>Unterrichtsmaterial Erzgebirge - History</i>. 2020.","apa":"Eikermann, L., &#38; Hansell, F. (2020). <i>Unterrichtsmaterial Erzgebirge - History</i>."},"supervisor":[{"last_name":"ALbert","first_name":"Marie-Theres","full_name":"ALbert, Marie-Theres"}],"date_created":"2024-06-07T12:29:20Z","keyword":["Welterbe"],"type":"misc"},{"date_created":"2020-05-29T09:27:23Z","department":[{"_id":"475"},{"_id":"19"},{"_id":"200"}],"type":"journal_article","citation":{"bibtex":"@article{Feng_Gries_Fritz_2020, title={Data-driven local polynomial for the trend and its derivatives in economic time series}, DOI={<a href=\"https://doi.org/10.1080/10485252.2020.1759598\">10.1080/10485252.2020.1759598</a>}, journal={Journal of Nonparametric Statistics}, author={Feng, Yuanhua and Gries, Thomas and Fritz, Marlon}, year={2020}, pages={510–533} }","ama":"Feng Y, Gries T, Fritz M. Data-driven local polynomial for the trend and its derivatives in economic time series. <i>Journal of Nonparametric Statistics</i>. Published online 2020:510-533. doi:<a href=\"https://doi.org/10.1080/10485252.2020.1759598\">10.1080/10485252.2020.1759598</a>","mla":"Feng, Yuanhua, et al. “Data-Driven Local Polynomial for the Trend and Its Derivatives in Economic Time Series.” <i>Journal of Nonparametric Statistics</i>, 2020, pp. 510–33, doi:<a href=\"https://doi.org/10.1080/10485252.2020.1759598\">10.1080/10485252.2020.1759598</a>.","short":"Y. Feng, T. Gries, M. Fritz, Journal of Nonparametric Statistics (2020) 510–533.","chicago":"Feng, Yuanhua, Thomas Gries, and Marlon Fritz. “Data-Driven Local Polynomial for the Trend and Its Derivatives in Economic Time Series.” <i>Journal of Nonparametric Statistics</i>, 2020, 510–33. <a href=\"https://doi.org/10.1080/10485252.2020.1759598\">https://doi.org/10.1080/10485252.2020.1759598</a>.","ieee":"Y. Feng, T. Gries, and M. Fritz, “Data-driven local polynomial for the trend and its derivatives in economic time series,” <i>Journal of Nonparametric Statistics</i>, pp. 510–533, 2020, doi: <a href=\"https://doi.org/10.1080/10485252.2020.1759598\">10.1080/10485252.2020.1759598</a>.","apa":"Feng, Y., Gries, T., &#38; Fritz, M. (2020). Data-driven local polynomial for the trend and its derivatives in economic time series. <i>Journal of Nonparametric Statistics</i>, 510–533. <a href=\"https://doi.org/10.1080/10485252.2020.1759598\">https://doi.org/10.1080/10485252.2020.1759598</a>"},"publication":"Journal of Nonparametric Statistics","language":[{"iso":"eng"}],"_id":"17064","page":"510-533","user_id":"186","doi":"10.1080/10485252.2020.1759598","author":[{"last_name":"Feng","first_name":"Yuanhua","full_name":"Feng, Yuanhua"},{"first_name":"Thomas","last_name":"Gries","full_name":"Gries, Thomas"},{"first_name":"Marlon","last_name":"Fritz","full_name":"Fritz, Marlon"}],"publication_identifier":{"issn":["1048-5252","1029-0311"]},"status":"public","title":"Data-driven local polynomial for the trend and its derivatives in economic time series","year":"2020","publication_status":"published","date_updated":"2024-06-12T12:56:19Z"},{"citation":{"short":"V. Peckhaus, zbMATH Open, Zbl 1445.01036 (2020).","chicago":"Peckhaus, Volker. “Wittgenstein, Ludwig, Wiener Ausgabe, Bd. 8.2: Synopse der Manuskriptbände V bis X, hg. v. Michael Nedo, Vittorio Klostermann: Frankfurt a.M. 2019.” <i>zbMATH Open, Zbl 1445.01036</i>, 2020.","apa":"Peckhaus, V. (2020). Wittgenstein, Ludwig, Wiener Ausgabe, Bd. 8.2: Synopse der Manuskriptbände V bis X, hg. v. Michael Nedo, Vittorio Klostermann: Frankfurt a.M. 2019. In <i>zbMATH Open, Zbl 1445.01036</i> (1445.01036).","ieee":"V. Peckhaus, “Wittgenstein, Ludwig, Wiener Ausgabe, Bd. 8.2: Synopse der Manuskriptbände V bis X, hg. v. Michael Nedo, Vittorio Klostermann: Frankfurt a.M. 2019,” <i>zbMATH Open, Zbl 1445.01036</i>. 2020.","ama":"Peckhaus V. Wittgenstein, Ludwig, Wiener Ausgabe, Bd. 8.2: Synopse der Manuskriptbände V bis X, hg. v. Michael Nedo, Vittorio Klostermann: Frankfurt a.M. 2019. <i>zbMATH Open, Zbl 144501036</i>. Published online 2020.","bibtex":"@article{Peckhaus_2020, title={Wittgenstein, Ludwig, Wiener Ausgabe, Bd. 8.2: Synopse der Manuskriptbände V bis X, hg. v. Michael Nedo, Vittorio Klostermann: Frankfurt a.M. 2019}, number={1445.01036}, journal={zbMATH Open, Zbl 1445.01036}, author={Peckhaus, Volker}, year={2020} }","mla":"Peckhaus, Volker. “Wittgenstein, Ludwig, Wiener Ausgabe, Bd. 8.2: Synopse der Manuskriptbände V bis X, hg. v. Michael Nedo, Vittorio Klostermann: Frankfurt a.M. 2019.” <i>zbMATH Open, Zbl 1445.01036</i>, 1445.01036, 2020."},"publication":"zbMATH Open, Zbl 1445.01036","date_created":"2021-12-13T10:41:49Z","department":[{"_id":"520"}],"oa":"1","type":"review","author":[{"id":"391","first_name":"Volker","last_name":"Peckhaus","full_name":"Peckhaus, Volker"}],"year":"2020","status":"public","title":"Wittgenstein, Ludwig, Wiener Ausgabe, Bd. 8.2: Synopse der Manuskriptbände V bis X, hg. v. Michael Nedo, Vittorio Klostermann: Frankfurt a.M. 2019","publication_status":"published","date_updated":"2024-06-12T16:31:33Z","language":[{"iso":"ger"}],"_id":"28698","article_number":"1445.01036","main_file_link":[{"open_access":"1","url":"https://zbmath.org/1445.01036"}],"user_id":"391"},{"user_id":"391","publication_date":"2020-02-05","language":[{"iso":"eng"}],"_id":"18995","article_number":"MR3917131","main_file_link":[{"url":"https://mathscinet.ams.org/mathscinet/article?mr=3917131"}],"publication_status":"published","date_updated":"2024-06-12T17:02:49Z","author":[{"first_name":"Volker","last_name":"Peckhaus","full_name":"Peckhaus, Volker","id":"391"}],"status":"public","year":"2020","title":"Breger, Herbert, Kontinuum, Analysis, Informales – Beiträge zur Mathematik und Philosophie von Leibniz, hg. v. W. Li, Springer Spektrum: Heidelberg/Berlin 2016","department":[{"_id":"520"}],"type":"review","date_created":"2020-09-04T08:50:02Z","citation":{"chicago":"Peckhaus, Volker. “Breger, Herbert, Kontinuum, Analysis, Informales – Beiträge Zur Mathematik Und Philosophie von Leibniz, Hg. v. W. Li, Springer Spektrum: Heidelberg/Berlin 2016.” <i>Mathematical Reviews, MR3917131</i>, 2020.","short":"V. Peckhaus, Mathematical Reviews, MR3917131 (2020).","ieee":"V. Peckhaus, “Breger, Herbert, Kontinuum, Analysis, Informales – Beiträge zur Mathematik und Philosophie von Leibniz, hg. v. W. Li, Springer Spektrum: Heidelberg/Berlin 2016,” <i>Mathematical Reviews, MR3917131</i>. 2020.","apa":"Peckhaus, V. (2020). Breger, Herbert, Kontinuum, Analysis, Informales – Beiträge zur Mathematik und Philosophie von Leibniz, hg. v. W. Li, Springer Spektrum: Heidelberg/Berlin 2016. In <i>Mathematical Reviews, MR3917131</i> (No. MR3917131).","bibtex":"@article{Peckhaus_2020, title={Breger, Herbert, Kontinuum, Analysis, Informales – Beiträge zur Mathematik und Philosophie von Leibniz, hg. v. W. Li, Springer Spektrum: Heidelberg/Berlin 2016}, number={MR3917131}, journal={Mathematical Reviews, MR3917131}, author={Peckhaus, Volker}, year={2020} }","ama":"Peckhaus V. Breger, Herbert, Kontinuum, Analysis, Informales – Beiträge zur Mathematik und Philosophie von Leibniz, hg. v. W. Li, Springer Spektrum: Heidelberg/Berlin 2016. <i>Mathematical Reviews, MR3917131</i>. Published online 2020.","mla":"Peckhaus, Volker. “Breger, Herbert, Kontinuum, Analysis, Informales – Beiträge Zur Mathematik Und Philosophie von Leibniz, Hg. v. W. Li, Springer Spektrum: Heidelberg/Berlin 2016.” <i>Mathematical Reviews, MR3917131</i>, MR3917131, 2020."},"publication":"Mathematical Reviews, MR3917131"},{"user_id":"100257","editor":[{"full_name":"Hennecke, Inga","first_name":"Inga","last_name":"Hennecke"},{"full_name":"Varga, Eva ","first_name":"Eva ","last_name":"Varga"}],"page":"153-183","publisher":"Peter Lang","_id":"54771","language":[{"iso":"ger"}],"date_updated":"2024-06-14T15:47:20Z","publication_status":"published","title":"Sprachliche Unsicherheit bei StandardsprecherInnen. Ein Vergleich zwischen französischen und deutschen SprecherInnen.","year":"2020","status":"public","author":[{"id":"100257","full_name":"Varga, Eva","first_name":"Eva","last_name":"Varga"},{"first_name":"Martin","last_name":"Sinn","full_name":"Sinn, Martin"}],"type":"book_chapter","place":"Berlin u.a.","date_created":"2024-06-14T15:13:29Z","publication":"Sprachliche Unsicherheit in der Romania.","citation":{"mla":"Varga, Eva, and Martin Sinn. “Sprachliche Unsicherheit bei StandardsprecherInnen. Ein Vergleich zwischen französischen und deutschen SprecherInnen.” <i>Sprachliche Unsicherheit in der Romania.</i>, edited by Inga Hennecke and Eva  Varga, Peter Lang, 2020, pp. 153–83.","bibtex":"@inbook{Varga_Sinn_2020, place={Berlin u.a.}, title={Sprachliche Unsicherheit bei StandardsprecherInnen. Ein Vergleich zwischen französischen und deutschen SprecherInnen.}, booktitle={Sprachliche Unsicherheit in der Romania.}, publisher={Peter Lang}, author={Varga, Eva and Sinn, Martin}, editor={Hennecke, Inga and Varga, Eva }, year={2020}, pages={153–183} }","ama":"Varga E, Sinn M. Sprachliche Unsicherheit bei StandardsprecherInnen. Ein Vergleich zwischen französischen und deutschen SprecherInnen. In: Hennecke I, Varga E, eds. <i>Sprachliche Unsicherheit in der Romania.</i> Peter Lang; 2020:153-183.","ieee":"E. Varga and M. Sinn, “Sprachliche Unsicherheit bei StandardsprecherInnen. Ein Vergleich zwischen französischen und deutschen SprecherInnen.,” in <i>Sprachliche Unsicherheit in der Romania.</i>, I. Hennecke and E. Varga, Eds. Berlin u.a.: Peter Lang, 2020, pp. 153–183.","apa":"Varga, E., &#38; Sinn, M. (2020). Sprachliche Unsicherheit bei StandardsprecherInnen. Ein Vergleich zwischen französischen und deutschen SprecherInnen. In I. Hennecke &#38; E. Varga (Eds.), <i>Sprachliche Unsicherheit in der Romania.</i> (pp. 153–183). Peter Lang.","chicago":"Varga, Eva, and Martin Sinn. “Sprachliche Unsicherheit bei StandardsprecherInnen. Ein Vergleich zwischen französischen und deutschen SprecherInnen.” In <i>Sprachliche Unsicherheit in der Romania.</i>, edited by Inga Hennecke and Eva  Varga, 153–83. Berlin u.a.: Peter Lang, 2020.","short":"E. Varga, M. Sinn, in: I. Hennecke, E. Varga (Eds.), Sprachliche Unsicherheit in der Romania., Peter Lang, Berlin u.a., 2020, pp. 153–183."}},{"date_updated":"2024-06-18T09:32:32Z","publication_status":"published","author":[{"first_name":"Benjamin","last_name":"Osswald","full_name":"Osswald, Benjamin"},{"id":"530","first_name":"Caren","last_name":"Sureth-Sloane","orcid":" 0000-0002-8183-5901","full_name":"Sureth-Sloane, Caren"}],"status":"public","title":"Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?","year":"2020","doi":"10.2139/ssrn.3297418","user_id":"74000","publisher":"TRR 266 Accounting for Transparency Working Paper Series No. 28","_id":"14901","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://papers.ssrn.com/sol3/Delivery.cfm/SSRN_ID3628503_code1908122.pdf?abstractid=3297418&mirid=1&type=2","open_access":"1"}],"abstract":[{"text":"This study investigates whether country risk factors, including political and fiscal budget risk, attenuate the effectiveness of tax policy tools that aim to encourage corporate risk-taking. Exploiting a cross-country panel, we predict and find that the effectiveness of loss offset rules and tax rate changes is fully attenuated for firms located in high-risk countries. We document the attenuating effect of country risk is more pronounced in high-tax countries or when countries increase their corporate tax rate. Additional tests around the U.S. federal budget crises from 2011 to 2013 indicate that temporarily heightened fiscal budget risk attenuates the effectiveness of loss offset rules even in countries with low political risk. We identify conditions (low political and low fiscal budget risk) under which targeted tax policy tools effectively stimulate risk-taking. This suggests that ensuring taxpayers receive tax refunds is important in times of economic crises with budgetary or political challenges. ","lang":"eng"}],"citation":{"chicago":"Osswald, Benjamin, and Caren Sureth-Sloane. <i>Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?</i> TRR 266 Accounting for Transparency Working Paper Series No. 28, 2020. <a href=\"https://doi.org/10.2139/ssrn.3297418\">https://doi.org/10.2139/ssrn.3297418</a>.","short":"B. Osswald, C. Sureth-Sloane, Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?, TRR 266 Accounting for Transparency Working Paper Series No. 28, 2020.","apa":"Osswald, B., &#38; Sureth-Sloane, C. (2020). <i>Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?</i> TRR 266 Accounting for Transparency Working Paper Series No. 28. <a href=\"https://doi.org/10.2139/ssrn.3297418\">https://doi.org/10.2139/ssrn.3297418</a>","ieee":"B. Osswald and C. Sureth-Sloane, <i>Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?</i> TRR 266 Accounting for Transparency Working Paper Series No. 28, 2020.","ama":"Osswald B, Sureth-Sloane C. <i>Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?</i> TRR 266 Accounting for Transparency Working Paper Series No. 28; 2020. doi:<a href=\"https://doi.org/10.2139/ssrn.3297418\">10.2139/ssrn.3297418</a>","bibtex":"@book{Osswald_Sureth-Sloane_2020, title={Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?}, DOI={<a href=\"https://doi.org/10.2139/ssrn.3297418\">10.2139/ssrn.3297418</a>}, publisher={TRR 266 Accounting for Transparency Working Paper Series No. 28}, author={Osswald, Benjamin and Sureth-Sloane, Caren}, year={2020} }","mla":"Osswald, Benjamin, and Caren Sureth-Sloane. <i>Do Country Risk Factors Attenuate the Effect of Tax Loss Incentives on Corporate Risk-Taking?</i> TRR 266 Accounting for Transparency Working Paper Series No. 28, 2020, doi:<a href=\"https://doi.org/10.2139/ssrn.3297418\">10.2139/ssrn.3297418</a>."},"oa":"1","department":[{"_id":"187"},{"_id":"635"}],"type":"working_paper","date_created":"2019-11-13T08:11:55Z"}]