[{"title":"Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung","date_created":"2023-12-04T08:53:58Z","author":[{"first_name":"Katharina","last_name":"Kammeyer","id":"60607","full_name":"Kammeyer, Katharina"},{"full_name":"Kamcili-Yildiz, Naciye","last_name":"Kamcili-Yildiz","first_name":"Naciye"},{"first_name":"Marion","full_name":"Keuchen, Marion","last_name":"Keuchen"}],"publisher":"Erev-Rav","date_updated":"2023-12-04T08:54:02Z","citation":{"apa":"Kammeyer, K., Kamcili-Yildiz, N., &#38; Keuchen, M. (2019). Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung. <i>Junge Kirche</i>, <i>80</i>.","short":"K. Kammeyer, N. Kamcili-Yildiz, M. Keuchen, Junge Kirche (2019).","bibtex":"@article{Kammeyer_Kamcili-Yildiz_Keuchen_2019, title={Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung}, number={80}, journal={Junge Kirche}, publisher={Erev-Rav}, author={Kammeyer, Katharina and Kamcili-Yildiz, Naciye and Keuchen, Marion}, year={2019} }","mla":"Kammeyer, Katharina, et al. “Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung.” <i>Junge Kirche</i>, no. 80, Erev-Rav, 2019.","ieee":"K. Kammeyer, N. Kamcili-Yildiz, and M. Keuchen, “Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung,” <i>Junge Kirche</i>, no. 80, 2019.","chicago":"Kammeyer, Katharina, Naciye Kamcili-Yildiz, and Marion Keuchen. “Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung.” <i>Junge Kirche</i>, no. 80 (2019).","ama":"Kammeyer K, Kamcili-Yildiz N, Keuchen M. Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung. <i>Junge Kirche</i>. 2019;(80)."},"year":"2019","issue":"80","publication_status":"published","language":[{"iso":"ger"}],"user_id":"60607","_id":"49405","status":"public","publication":"Junge Kirche","type":"journal_article"},{"issue":"02","publication_identifier":{"issn":["1793-0421","1793-7310"]},"publication_status":"published","page":"309-325","intvolume":"        15","citation":{"bibtex":"@article{Kirschmer_Nebe_2019, title={Quaternary quadratic lattices over number fields}, volume={15}, DOI={<a href=\"https://doi.org/10.1142/s1793042119500131\">10.1142/s1793042119500131</a>}, number={02}, journal={International Journal of Number Theory}, publisher={World Scientific Pub Co Pte Lt}, author={Kirschmer, Markus and Nebe, Gabriele}, year={2019}, pages={309–325} }","mla":"Kirschmer, Markus, and Gabriele Nebe. “Quaternary Quadratic Lattices over Number Fields.” <i>International Journal of Number Theory</i>, vol. 15, no. 02, World Scientific Pub Co Pte Lt, 2019, pp. 309–25, doi:<a href=\"https://doi.org/10.1142/s1793042119500131\">10.1142/s1793042119500131</a>.","short":"M. Kirschmer, G. Nebe, International Journal of Number Theory 15 (2019) 309–325.","apa":"Kirschmer, M., &#38; Nebe, G. (2019). Quaternary quadratic lattices over number fields. <i>International Journal of Number Theory</i>, <i>15</i>(02), 309–325. <a href=\"https://doi.org/10.1142/s1793042119500131\">https://doi.org/10.1142/s1793042119500131</a>","chicago":"Kirschmer, Markus, and Gabriele Nebe. “Quaternary Quadratic Lattices over Number Fields.” <i>International Journal of Number Theory</i> 15, no. 02 (2019): 309–25. <a href=\"https://doi.org/10.1142/s1793042119500131\">https://doi.org/10.1142/s1793042119500131</a>.","ieee":"M. Kirschmer and G. Nebe, “Quaternary quadratic lattices over number fields,” <i>International Journal of Number Theory</i>, vol. 15, no. 02, pp. 309–325, 2019, doi: <a href=\"https://doi.org/10.1142/s1793042119500131\">10.1142/s1793042119500131</a>.","ama":"Kirschmer M, Nebe G. Quaternary quadratic lattices over number fields. <i>International Journal of Number Theory</i>. 2019;15(02):309-325. doi:<a href=\"https://doi.org/10.1142/s1793042119500131\">10.1142/s1793042119500131</a>"},"year":"2019","volume":15,"author":[{"full_name":"Kirschmer, Markus","id":"82258","last_name":"Kirschmer","first_name":"Markus"},{"full_name":"Nebe, Gabriele","last_name":"Nebe","first_name":"Gabriele"}],"date_created":"2022-12-23T11:05:09Z","publisher":"World Scientific Pub Co Pte Lt","date_updated":"2023-12-06T10:05:59Z","doi":"10.1142/s1793042119500131","title":"Quaternary quadratic lattices over number fields","publication":"International Journal of Number Theory","type":"journal_article","status":"public","abstract":[{"text":"We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of (V,q). This yields a good algorithm to enumerate a system of representatives of proper isometry classes of lattices in genera of maximal lattices in (V,q).","lang":"eng"}],"department":[{"_id":"102"}],"user_id":"82258","_id":"34917","language":[{"iso":"eng"}],"keyword":["Algebra and Number Theory"]},{"language":[{"iso":"eng"}],"keyword":["Algebra and Number Theory"],"department":[{"_id":"102"}],"user_id":"82258","_id":"34916","status":"public","abstract":[{"lang":"eng","text":"We describe the powers of irreducible polynomials occurring as characteristic polynomials of automorphisms of even unimodular lattices over number fields. This generalizes results of Gross & McMullen and Bayer-Fluckiger & Taelman."}],"publication":"Journal of Number Theory","type":"journal_article","doi":"10.1016/j.jnt.2018.08.004","title":"Automorphisms of even unimodular lattices over number fields","volume":197,"date_created":"2022-12-23T11:04:34Z","author":[{"first_name":"Markus","id":"82258","full_name":"Kirschmer, Markus","last_name":"Kirschmer"}],"date_updated":"2023-12-06T10:07:17Z","publisher":"Elsevier BV","intvolume":"       197","page":"121-134","citation":{"bibtex":"@article{Kirschmer_2019, title={Automorphisms of even unimodular lattices over number fields}, volume={197}, DOI={<a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">10.1016/j.jnt.2018.08.004</a>}, journal={Journal of Number Theory}, publisher={Elsevier BV}, author={Kirschmer, Markus}, year={2019}, pages={121–134} }","mla":"Kirschmer, Markus. “Automorphisms of Even Unimodular Lattices over Number Fields.” <i>Journal of Number Theory</i>, vol. 197, Elsevier BV, 2019, pp. 121–34, doi:<a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">10.1016/j.jnt.2018.08.004</a>.","short":"M. Kirschmer, Journal of Number Theory 197 (2019) 121–134.","apa":"Kirschmer, M. (2019). Automorphisms of even unimodular lattices over number fields. <i>Journal of Number Theory</i>, <i>197</i>, 121–134. <a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">https://doi.org/10.1016/j.jnt.2018.08.004</a>","chicago":"Kirschmer, Markus. “Automorphisms of Even Unimodular Lattices over Number Fields.” <i>Journal of Number Theory</i> 197 (2019): 121–34. <a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">https://doi.org/10.1016/j.jnt.2018.08.004</a>.","ieee":"M. Kirschmer, “Automorphisms of even unimodular lattices over number fields,” <i>Journal of Number Theory</i>, vol. 197, pp. 121–134, 2019, doi: <a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">10.1016/j.jnt.2018.08.004</a>.","ama":"Kirschmer M. Automorphisms of even unimodular lattices over number fields. <i>Journal of Number Theory</i>. 2019;197:121-134. doi:<a href=\"https://doi.org/10.1016/j.jnt.2018.08.004\">10.1016/j.jnt.2018.08.004</a>"},"year":"2019","publication_identifier":{"issn":["0022-314X"]},"publication_status":"published"},{"publication_status":"published","publication_identifier":{"issn":["0043-6275","1613-978X"]},"citation":{"ama":"Habla W, Huwe V, Kesternich M. <i>Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte</i>. Vol 99(5). Wirtschaftsdienst 99(5), 330-334; 2019:330-334. doi:<a href=\"https://doi.org/10.1007/s10273-019-2452-6\">10.1007/s10273-019-2452-6</a>","ieee":"W. Habla, V. Huwe, and M. Kesternich, <i>Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte</i>, vol. 99(5). Wirtschaftsdienst 99(5), 330-334, 2019, pp. 330–334.","chicago":"Habla, Wolfgang, Vera Huwe, and Martin Kesternich. <i>Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte</i>. Vol. 99(5). Wirtschaftsdienst. Wirtschaftsdienst 99(5), 330-334, 2019. <a href=\"https://doi.org/10.1007/s10273-019-2452-6\">https://doi.org/10.1007/s10273-019-2452-6</a>.","mla":"Habla, Wolfgang, et al. <i>Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte</i>. Wirtschaftsdienst 99(5), 330-334, 2019, pp. 330–34, doi:<a href=\"https://doi.org/10.1007/s10273-019-2452-6\">10.1007/s10273-019-2452-6</a>.","bibtex":"@book{Habla_Huwe_Kesternich_2019, series={Wirtschaftsdienst}, title={Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte}, volume={99(5)}, DOI={<a href=\"https://doi.org/10.1007/s10273-019-2452-6\">10.1007/s10273-019-2452-6</a>}, publisher={Wirtschaftsdienst 99(5), 330-334}, author={Habla, Wolfgang and Huwe, Vera and Kesternich, Martin}, year={2019}, pages={330–334}, collection={Wirtschaftsdienst} }","short":"W. Habla, V. Huwe, M. Kesternich, Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte, Wirtschaftsdienst 99(5), 330-334, 2019.","apa":"Habla, W., Huwe, V., &#38; Kesternich, M. (2019). <i>Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte: Vol. 99(5)</i> (pp. 330–334). Wirtschaftsdienst 99(5), 330-334. <a href=\"https://doi.org/10.1007/s10273-019-2452-6\">https://doi.org/10.1007/s10273-019-2452-6</a>"},"page":"330-334","year":"2019","author":[{"full_name":"Habla, Wolfgang","last_name":"Habla","first_name":"Wolfgang"},{"first_name":"Vera","last_name":"Huwe","full_name":"Huwe, Vera"},{"first_name":"Martin","id":"98922","full_name":"Kesternich, Martin","last_name":"Kesternich"}],"date_created":"2023-09-15T11:51:12Z","volume":"99(5)","date_updated":"2023-12-06T18:28:16Z","publisher":"Wirtschaftsdienst 99(5), 330-334","doi":"10.1007/s10273-019-2452-6","title":"Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte","type":"working_paper","status":"public","user_id":"98922","series_title":"Wirtschaftsdienst","_id":"47083","language":[{"iso":"ger"}],"keyword":["Business","Management and Accounting (miscellaneous)"]},{"_id":"47081","user_id":"98922","language":[{"iso":"eng"}],"type":"working_paper","status":"public","date_updated":"2023-12-06T18:29:55Z","publisher":"MRN: E-Mobilität in der Metropolregion Rhein-Neckar","author":[{"first_name":"Martin","id":"98922","full_name":"Kesternich, Martin","last_name":"Kesternich"}],"date_created":"2023-09-15T11:49:55Z","title":"Eine City-Maut ist Diesel-Fahrverboten in Städten klar überlegen","year":"2019","citation":{"ama":"Kesternich M. <i>Eine City-Maut Ist Diesel-Fahrverboten in Städten Klar Überlegen</i>. MRN: E-Mobilität in der Metropolregion Rhein-Neckar; 2019.","chicago":"Kesternich, Martin. <i>Eine City-Maut Ist Diesel-Fahrverboten in Städten Klar Überlegen</i>. MRN: E-Mobilität in der Metropolregion Rhein-Neckar, 2019.","ieee":"M. Kesternich, <i>Eine City-Maut ist Diesel-Fahrverboten in Städten klar überlegen</i>. MRN: E-Mobilität in der Metropolregion Rhein-Neckar, 2019.","short":"M. Kesternich, Eine City-Maut Ist Diesel-Fahrverboten in Städten Klar Überlegen, MRN: E-Mobilität in der Metropolregion Rhein-Neckar, 2019.","mla":"Kesternich, Martin. <i>Eine City-Maut Ist Diesel-Fahrverboten in Städten Klar Überlegen</i>. MRN: E-Mobilität in der Metropolregion Rhein-Neckar, 2019.","bibtex":"@book{Kesternich_2019, title={Eine City-Maut ist Diesel-Fahrverboten in Städten klar überlegen}, publisher={MRN: E-Mobilität in der Metropolregion Rhein-Neckar}, author={Kesternich, Martin}, year={2019} }","apa":"Kesternich, M. (2019). <i>Eine City-Maut ist Diesel-Fahrverboten in Städten klar überlegen</i>. MRN: E-Mobilität in der Metropolregion Rhein-Neckar."}},{"_id":"49536","user_id":"102100","language":[{"iso":"eng"}],"type":"journal_article","publication":"Evangelische Theologie 79","status":"public","date_updated":"2023-12-13T07:30:12Z","author":[{"full_name":"Meyer zu Hörste-Bührer, Raphaela","id":"102100","last_name":"Meyer zu Hörste-Bührer","first_name":"Raphaela"}],"date_created":"2023-12-07T11:15:58Z","title":"Ethik zwischen Universalisierbarkeit und Lebensnähe. Zeitimplikate in den Referenzbegriffen der Ethikdefinition","year":"2019","citation":{"apa":"Meyer zu Hörste-Bührer, R. (2019). Ethik zwischen Universalisierbarkeit und Lebensnähe. Zeitimplikate in den Referenzbegriffen der Ethikdefinition. <i>Evangelische Theologie 79</i>, 210–222.","short":"R. Meyer zu Hörste-Bührer, Evangelische Theologie 79 (2019) 210–222.","bibtex":"@article{Meyer zu Hörste-Bührer_2019, title={Ethik zwischen Universalisierbarkeit und Lebensnähe. Zeitimplikate in den Referenzbegriffen der Ethikdefinition}, journal={Evangelische Theologie 79}, author={Meyer zu Hörste-Bührer, Raphaela}, year={2019}, pages={210–222} }","mla":"Meyer zu Hörste-Bührer, Raphaela. “Ethik Zwischen Universalisierbarkeit Und Lebensnähe. Zeitimplikate in Den Referenzbegriffen Der Ethikdefinition.” <i>Evangelische Theologie 79</i>, 2019, pp. 210–222.","ama":"Meyer zu Hörste-Bührer R. Ethik zwischen Universalisierbarkeit und Lebensnähe. Zeitimplikate in den Referenzbegriffen der Ethikdefinition. <i>Evangelische Theologie 79</i>. Published online 2019:210–222.","ieee":"R. Meyer zu Hörste-Bührer, “Ethik zwischen Universalisierbarkeit und Lebensnähe. Zeitimplikate in den Referenzbegriffen der Ethikdefinition,” <i>Evangelische Theologie 79</i>, pp. 210–222, 2019.","chicago":"Meyer zu Hörste-Bührer, Raphaela. “Ethik Zwischen Universalisierbarkeit Und Lebensnähe. Zeitimplikate in Den Referenzbegriffen Der Ethikdefinition.” <i>Evangelische Theologie 79</i>, 2019, 210–222."},"page":"210–222"},{"publication":"Journal of Ethics in Antiquity and Christianity 1 ","type":"journal_article","status":"public","_id":"49537","user_id":"102100","language":[{"iso":"eng"}],"year":"2019","page":"3-8","citation":{"apa":"Meyer zu Hörste-Bührer, R. (2019). Editorial: Ethik in Antike und Christentum / Editorial: Ethics in Antiquity and Christianity. <i>Journal of Ethics in Antiquity and Christianity 1 </i>, 3–8.","short":"R. Meyer zu Hörste-Bührer, Journal of Ethics in Antiquity and Christianity 1  (2019) 3–8.","mla":"Meyer zu Hörste-Bührer, Raphaela. “Editorial: Ethik in Antike Und Christentum / Editorial: Ethics in Antiquity and Christianity.” <i>Journal of Ethics in Antiquity and Christianity 1 </i>, 2019, pp. 3–8.","bibtex":"@article{Meyer zu Hörste-Bührer_2019, title={Editorial: Ethik in Antike und Christentum / Editorial: Ethics in Antiquity and Christianity}, journal={Journal of Ethics in Antiquity and Christianity 1 }, author={Meyer zu Hörste-Bührer, Raphaela}, year={2019}, pages={3–8} }","ieee":"R. Meyer zu Hörste-Bührer, “Editorial: Ethik in Antike und Christentum / Editorial: Ethics in Antiquity and Christianity,” <i>Journal of Ethics in Antiquity and Christianity 1 </i>, pp. 3–8, 2019.","chicago":"Meyer zu Hörste-Bührer, Raphaela. “Editorial: Ethik in Antike Und Christentum / Editorial: Ethics in Antiquity and Christianity.” <i>Journal of Ethics in Antiquity and Christianity 1 </i>, 2019, 3–8.","ama":"Meyer zu Hörste-Bührer R. Editorial: Ethik in Antike und Christentum / Editorial: Ethics in Antiquity and Christianity. <i>Journal of Ethics in Antiquity and Christianity 1 </i>. Published online 2019:3-8."},"date_updated":"2023-12-13T07:29:38Z","author":[{"first_name":"Raphaela","full_name":"Meyer zu Hörste-Bührer, Raphaela","id":"102100","last_name":"Meyer zu Hörste-Bührer"}],"date_created":"2023-12-07T11:18:01Z","title":"Editorial: Ethik in Antike und Christentum / Editorial: Ethics in Antiquity and Christianity"},{"year":"2019","publisher":"Springer International Publishing","date_created":"2023-11-14T15:58:52Z","title":"Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm","publication":"Evolutionary Multi-Criterion Optimization (EMO)","abstract":[{"lang":"eng","text":"We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. The goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies."}],"keyword":["Combinatorial optimization","Dynamic optimization","Metaheuristics","Multi-objective optimization","Vehicle routing"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-030-12598-1"]},"place":"Cham","citation":{"apa":"Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2019). Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, &#38; P. Reed (Eds.), <i>Evolutionary Multi-Criterion Optimization (EMO)</i> (pp. 516–528). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">https://doi.org/10.1007/978-3-030-12598-1_41</a>","short":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E. Goodman, C.A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International Publishing, Cham, 2019, pp. 516–528.","bibtex":"@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>}, booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture Notes in Computer Science} }","mla":"Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528, doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>.","chicago":"Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” In <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, edited by Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, and Patrick Reed, 516–528. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">https://doi.org/10.1007/978-3-030-12598-1_41</a>.","ieee":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in <i>Evolutionary Multi-Criterion Optimization (EMO)</i>, 2019, pp. 516–528, doi: <a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>.","ama":"Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In: Deb K, Goodman E, Coello Coello CA, et al., eds. <i>Evolutionary Multi-Criterion Optimization (EMO)</i>. Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528. doi:<a href=\"https://doi.org/10.1007/978-3-030-12598-1_41\">10.1007/978-3-030-12598-1_41</a>"},"page":"516–528","date_updated":"2023-12-13T10:43:07Z","author":[{"full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"last_name":"Grimme","full_name":"Grimme, Christian","first_name":"Christian"},{"first_name":"Stephan","last_name":"Meisel","full_name":"Meisel, Stephan"},{"first_name":"Günter","last_name":"Rudolph","full_name":"Rudolph, Günter"},{"first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"doi":"10.1007/978-3-030-12598-1_41","type":"conference","editor":[{"first_name":"Kalyanmoy","last_name":"Deb","full_name":"Deb, Kalyanmoy"},{"full_name":"Goodman, Erik","last_name":"Goodman","first_name":"Erik"},{"first_name":"Carlos A.","last_name":"Coello Coello","full_name":"Coello Coello, Carlos A."},{"full_name":"Klamroth, Kathrin","last_name":"Klamroth","first_name":"Kathrin"},{"full_name":"Miettinen, Kaisa","last_name":"Miettinen","first_name":"Kaisa"},{"full_name":"Mostaghim, Sanaz","last_name":"Mostaghim","first_name":"Sanaz"},{"first_name":"Patrick","last_name":"Reed","full_name":"Reed, Patrick"}],"status":"public","_id":"48841","user_id":"102979","series_title":"Lecture Notes in Computer Science","department":[{"_id":"819"}],"extern":"1"},{"keyword":["benchmarking","instance features","optimization","problem generation","traveling salesperson problem"],"language":[{"iso":"eng"}],"abstract":[{"text":"Evolutionary algorithms have successfully been applied to evolve problem instances that exhibit a significant difference in performance for a given algorithm or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP). Creating a large variety of instances is crucial for successful applications in the blooming field of algorithm selection. In this paper, we introduce new and creative mutation operators for evolving instances of the TSP. We show that adopting those operators in an evolutionary algorithm allows for the generation of benchmark sets with highly desirable properties: (1) novelty by clear visual distinction to established benchmark sets in the field, (2) visual and quantitative diversity in the space of TSP problem characteristics, and (3) significant performance differences with respect to the restart versions of heuristic state-of-the-art TSP solvers EAX and LKH. The important aspect of diversity is addressed and achieved solely by the proposed mutation operators and not enforced by explicit diversity preservation.","lang":"eng"}],"publication":"Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","title":"Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators","publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:52Z","year":"2019","extern":"1","_id":"48842","department":[{"_id":"819"}],"series_title":"FOGA ’19","user_id":"102979","status":"public","type":"conference","doi":"10.1145/3299904.3340307","date_updated":"2023-12-13T10:42:57Z","author":[{"first_name":"Jakob","id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"full_name":"Neumann, Aneta","last_name":"Neumann","first_name":"Aneta"},{"full_name":"Wagner, Markus","last_name":"Wagner","first_name":"Markus"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"place":"New York, NY, USA","page":"58–71","citation":{"apa":"Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., &#38; Trautmann, H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 58–71. <a href=\"https://doi.org/10.1145/3299904.3340307\">https://doi.org/10.1145/3299904.3340307</a>","mla":"Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2019, pp. 58–71, doi:<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>.","bibtex":"@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators}, DOI={<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>}, booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19} }","short":"J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann, in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.","chicago":"Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” In <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 58–71. FOGA ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3299904.3340307\">https://doi.org/10.1145/3299904.3340307</a>.","ieee":"J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann, “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,” in <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 2019, pp. 58–71, doi: <a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>.","ama":"Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. FOGA ’19. Association for Computing Machinery; 2019:58–71. doi:<a href=\"https://doi.org/10.1145/3299904.3340307\">10.1145/3299904.3340307</a>"},"publication_identifier":{"isbn":["978-1-4503-6254-2"]},"publication_status":"published"},{"abstract":[{"lang":"eng","text":"We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. This includes the (1+1) EA and RLS in a setting where the number of colors is bounded and we are minimizing the number of conflicts as well as iterated local search algorithms that use an unbounded color palette and aim to use the smallest colors and - as a consequence - the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i. e. starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. Furthermore, we show how to speed up computations by using problem specific operators concentrating on parts of the graph where changes have occurred."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","language":[{"iso":"eng"}],"keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"year":"2019","title":"Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring","date_created":"2023-11-14T15:58:52Z","publisher":"Association for Computing Machinery","status":"public","type":"conference","extern":"1","department":[{"_id":"819"}],"series_title":"GECCO ’19","user_id":"102979","_id":"48843","page":"1443–1451","citation":{"ama":"Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’19. Association for Computing Machinery; 2019:1443–1451. doi:<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>","chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1443–1451. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3321707.3321792\">https://doi.org/10.1145/3321707.3321792</a>.","ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2019, pp. 1443–1451, doi: <a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>.","apa":"Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1443–1451. <a href=\"https://doi.org/10.1145/3321707.3321792\">https://doi.org/10.1145/3321707.3321792</a>","mla":"Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2019, pp. 1443–1451, doi:<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>.","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 1443–1451.","bibtex":"@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA}, series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring}, DOI={<a href=\"https://doi.org/10.1145/3321707.3321792\">10.1145/3321707.3321792</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2019}, pages={1443–1451}, collection={GECCO ’19} }"},"place":"New York, NY, USA","publication_identifier":{"isbn":["978-1-4503-6111-8"]},"publication_status":"published","doi":"10.1145/3321707.3321792","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"},{"first_name":"Pan","full_name":"Peng, Pan","last_name":"Peng"},{"first_name":"Dirk","full_name":"Sudholt, Dirk","last_name":"Sudholt"}],"date_updated":"2023-12-13T10:42:37Z"},{"date_created":"2023-11-14T15:58:52Z","publisher":"Association for Computing Machinery","title":"On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem","year":"2019","language":[{"iso":"eng"}],"keyword":["biased mutation","combinatorial optimization","minimum spanning tree","multi-objective optimization"],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","abstract":[{"text":"Research has shown that for many single-objective graph problems where optimum solutions are composed of low weight sub-graphs, such as the minimum spanning tree problem (MST), mutation operators favoring low weight edges show superior performance. Intuitively, similar observations should hold for multi-criteria variants of such problems. In this work, we focus on the multi-criteria MST problem. A thorough experimental study is conducted where we estimate the probability of edges being part of non-dominated spanning trees as a function of the edges’ non-domination level or domination count, respectively. Building on gained insights, we propose several biased one-edge-exchange mutation operators that differ in the used edge-selection probability distribution (biased towards edges of low rank). Our empirical analysis shows that among different graph types (dense and sparse) and edge weight types (both uniformly random and combinations of Euclidean and uniformly random) biased edge-selection strategies perform superior in contrast to the baseline uniform edge-selection. Our findings are in particular strong for dense graphs.","lang":"eng"}],"author":[{"first_name":"Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"date_updated":"2023-12-13T10:42:24Z","doi":"10.1145/3321707.3321818","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-6111-8"]},"citation":{"apa":"Bossek, J., Grimme, C., &#38; Neumann, F. (2019). On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 516–523. <a href=\"https://doi.org/10.1145/3321707.3321818\">https://doi.org/10.1145/3321707.3321818</a>","short":"J. Bossek, C. Grimme, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 516–523.","mla":"Bossek, Jakob, et al. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2019, pp. 516–523, doi:<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>.","bibtex":"@inproceedings{Bossek_Grimme_Neumann_2019, place={New York, NY, USA}, series={GECCO ’19}, title={On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Neumann, Frank}, year={2019}, pages={516–523}, collection={GECCO ’19} }","ama":"Bossek J, Grimme C, Neumann F. On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’19. Association for Computing Machinery; 2019:516–523. doi:<a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>","ieee":"J. Bossek, C. Grimme, and F. Neumann, “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2019, pp. 516–523, doi: <a href=\"https://doi.org/10.1145/3321707.3321818\">10.1145/3321707.3321818</a>.","chicago":"Bossek, Jakob, Christian Grimme, and Frank Neumann. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 516–523. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3321707.3321818\">https://doi.org/10.1145/3321707.3321818</a>."},"page":"516–523","place":"New York, NY, USA","series_title":"GECCO ’19","user_id":"102979","department":[{"_id":"819"}],"_id":"48840","extern":"1","type":"conference","status":"public"},{"title":"Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems","publisher":"Springer International Publishing","date_created":"2023-11-14T15:58:54Z","year":"2019","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The $$\\textbackslash mathcal NP$$-hard multi-criteria shortest path problem (mcSPP) is of utmost practical relevance, e.~g., in navigation system design and logistics. We address the problem of approximating the Pareto-front of the mcSPP with sum objectives. We do so by proposing a new mutation operator for multi-objective evolutionary algorithms that solves single-objective versions of the shortest path problem on subgraphs. A rigorous empirical benchmark on a diverse set of problem instances shows the effectiveness of the approach in comparison to a well-known mutation operator in terms of convergence speed and approximation quality. In addition, we glance at the neighbourhood structure and similarity of obtained Pareto-optimal solutions and derive promising directions for future work."}],"publication":"Learning and Intelligent Optimization","doi":"10.1007/978-3-030-05348-2_17","date_updated":"2023-12-13T10:44:44Z","author":[{"first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979","full_name":"Bossek, Jakob"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"}],"place":"Cham","page":"184–198","citation":{"bibtex":"@inproceedings{Bossek_Grimme_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">10.1007/978-3-030-05348-2_17</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Grimme, Christian}, editor={Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019}, pages={184–198}, collection={Lecture Notes in Computer Science} }","mla":"Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” <i>Learning and Intelligent Optimization</i>, edited by Roberto Battiti et al., Springer International Publishing, 2019, pp. 184–198, doi:<a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">10.1007/978-3-030-05348-2_17</a>.","short":"J. Bossek, C. Grimme, in: R. Battiti, M. Brunato, I. Kotsireas, P.M. Pardalos (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2019, pp. 184–198.","apa":"Bossek, J., &#38; Grimme, C. (2019). Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems. In R. Battiti, M. Brunato, I. Kotsireas, &#38; P. M. Pardalos (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 184–198). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">https://doi.org/10.1007/978-3-030-05348-2_17</a>","ama":"Bossek J, Grimme C. Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems. In: Battiti R, Brunato M, Kotsireas I, Pardalos PM, eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science. Springer International Publishing; 2019:184–198. doi:<a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">10.1007/978-3-030-05348-2_17</a>","ieee":"J. Bossek and C. Grimme, “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems,” in <i>Learning and Intelligent Optimization</i>, 2019, pp. 184–198, doi: <a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">10.1007/978-3-030-05348-2_17</a>.","chicago":"Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” In <i>Learning and Intelligent Optimization</i>, edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, and Panos M. Pardalos, 184–198. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-05348-2_17\">https://doi.org/10.1007/978-3-030-05348-2_17</a>."},"publication_identifier":{"isbn":["978-3-030-05348-2"]},"publication_status":"published","extern":"1","_id":"48858","department":[{"_id":"819"}],"series_title":"Lecture Notes in Computer Science","user_id":"102979","editor":[{"first_name":"Roberto","full_name":"Battiti, Roberto","last_name":"Battiti"},{"first_name":"Mauro","full_name":"Brunato, Mauro","last_name":"Brunato"},{"last_name":"Kotsireas","full_name":"Kotsireas, Ilias","first_name":"Ilias"},{"first_name":"Panos M.","full_name":"Pardalos, Panos M.","last_name":"Pardalos"}],"status":"public","type":"conference"},{"title":"Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem","date_created":"2023-11-14T15:58:56Z","publisher":"Association for Computing Machinery","year":"2019","language":[{"iso":"eng"}],"keyword":["edge coloring problem","runtime analysis"],"abstract":[{"lang":"eng","text":"The edge coloring problem asks for an assignment of colors to edges of a graph such that no two incident edges share the same color and the number of colors is minimized. It is known that all graphs with maximum degree {$\\Delta$} can be colored with {$\\Delta$} or {$\\Delta$} + 1 colors, but it is NP-hard to determine whether {$\\Delta$} colors are sufficient. We present the first runtime analysis of evolutionary algorithms (EAs) for the edge coloring problem. Simple EAs such as RLS and (1+1) EA efficiently find (2{$\\Delta$} - 1)-colorings on arbitrary graphs and optimal colorings for even and odd cycles, paths, star graphs and arbitrary trees. A partial analysis for toroids also suggests efficient runtimes in bipartite graphs with many cycles. Experiments support these findings and investigate additional graph classes such as hypercubes, complete graphs and complete bipartite graphs. Theoretical and experimental results suggest that simple EAs find optimal colorings for all these graph classes in expected time O({$\\Delta\\mathscrl$}2m log m), where m is the number of edges and {$\\mathscrl$} is the length of the longest simple path in the graph."}],"publication":"Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","doi":"10.1145/3299904.3340311","author":[{"first_name":"Jakob","id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"last_name":"Sudholt","full_name":"Sudholt, Dirk","first_name":"Dirk"}],"date_updated":"2023-12-13T10:46:12Z","citation":{"ama":"Bossek J, Sudholt D. Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem. In: <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. FOGA ’19. Association for Computing Machinery; 2019:102–115. doi:<a href=\"https://doi.org/10.1145/3299904.3340311\">10.1145/3299904.3340311</a>","chicago":"Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem.” In <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 102–115. FOGA ’19. New York, NY, USA: Association for Computing Machinery, 2019. <a href=\"https://doi.org/10.1145/3299904.3340311\">https://doi.org/10.1145/3299904.3340311</a>.","ieee":"J. Bossek and D. Sudholt, “Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem,” in <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 2019, pp. 102–115, doi: <a href=\"https://doi.org/10.1145/3299904.3340311\">10.1145/3299904.3340311</a>.","apa":"Bossek, J., &#38; Sudholt, D. (2019). Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem. <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 102–115. <a href=\"https://doi.org/10.1145/3299904.3340311\">https://doi.org/10.1145/3299904.3340311</a>","short":"J. Bossek, D. Sudholt, in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2019, pp. 102–115.","mla":"Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem.” <i>Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2019, pp. 102–115, doi:<a href=\"https://doi.org/10.1145/3299904.3340311\">10.1145/3299904.3340311</a>.","bibtex":"@inproceedings{Bossek_Sudholt_2019, place={New York, NY, USA}, series={FOGA ’19}, title={Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem}, DOI={<a href=\"https://doi.org/10.1145/3299904.3340311\">10.1145/3299904.3340311</a>}, booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2019}, pages={102–115}, collection={FOGA ’19} }"},"page":"102–115","place":"New York, NY, USA","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-6254-2"]},"extern":"1","series_title":"FOGA ’19","user_id":"102979","department":[{"_id":"819"}],"_id":"48870","status":"public","type":"conference"},{"publisher":"Springer International Publishing","date_created":"2023-11-14T15:58:57Z","title":"Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time","year":"2019","keyword":["Algorithm selection","Performance measurement"],"language":[{"iso":"eng"}],"publication":"Learning and Intelligent Optimization","abstract":[{"lang":"eng","text":"A multiobjective perspective onto common performance measures such as the PAR10 score or the expected runtime of single-objective stochastic solvers is presented by directly investigating the tradeoff between the fraction of failed runs and the average runtime. Multi-objective indicators operating in the bi-objective space allow for an overall performance comparison on a set of instances paving the way for instance-based automated algorithm selection techniques."}],"date_updated":"2023-12-13T10:47:32Z","author":[{"last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann"}],"doi":"10.1007/978-3-030-05348-2_19","publication_identifier":{"isbn":["978-3-030-05348-2"]},"place":"Cham","page":"215–219","citation":{"apa":"Bossek, J., &#38; Trautmann, H. (2019). Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. In R. Battiti, M. Brunato, I. Kotsireas, &#38; P. M. Pardalos (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 215–219). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">https://doi.org/10.1007/978-3-030-05348-2_19</a>","mla":"Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time.” <i>Learning and Intelligent Optimization</i>, edited by Roberto Battiti et al., Springer International Publishing, 2019, pp. 215–219, doi:<a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">10.1007/978-3-030-05348-2_19</a>.","bibtex":"@inproceedings{Bossek_Trautmann_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">10.1007/978-3-030-05348-2_19</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019}, pages={215–219}, collection={Lecture Notes in Computer Science} }","short":"J. Bossek, H. Trautmann, in: R. Battiti, M. Brunato, I. Kotsireas, P.M. Pardalos (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2019, pp. 215–219.","ieee":"J. Bossek and H. Trautmann, “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time,” in <i>Learning and Intelligent Optimization</i>, 2019, pp. 215–219, doi: <a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">10.1007/978-3-030-05348-2_19</a>.","chicago":"Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time.” In <i>Learning and Intelligent Optimization</i>, edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, and Panos M. Pardalos, 215–219. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">https://doi.org/10.1007/978-3-030-05348-2_19</a>.","ama":"Bossek J, Trautmann H. Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. In: Battiti R, Brunato M, Kotsireas I, Pardalos PM, eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science. Springer International Publishing; 2019:215–219. doi:<a href=\"https://doi.org/10.1007/978-3-030-05348-2_19\">10.1007/978-3-030-05348-2_19</a>"},"_id":"48875","department":[{"_id":"819"}],"user_id":"102979","series_title":"Lecture Notes in Computer Science","extern":"1","type":"conference","editor":[{"first_name":"Roberto","last_name":"Battiti","full_name":"Battiti, Roberto"},{"full_name":"Brunato, Mauro","last_name":"Brunato","first_name":"Mauro"},{"first_name":"Ilias","last_name":"Kotsireas","full_name":"Kotsireas, Ilias"},{"first_name":"Panos M.","full_name":"Pardalos, Panos M.","last_name":"Pardalos"}],"status":"public"},{"status":"public","abstract":[{"text":"OpenML is an online machine learning platform where researchers can easily share data, machine learning tasks and experiments as well as organize them online to work and collaborate more efficiently. In this paper, we present an R package to interface with the OpenML platform and illustrate its usage in combination with the machine learning R package mlr (Bischl et al. J Mach Learn Res 17(170):1—5, 2016). We show how the OpenML package allows R users to easily search, download and upload data sets and machine learning tasks. Furthermore, we also show how to upload results of experiments, share them with others and download results from other users. Beyond ensuring reproducibility of results, the OpenML platform automates much of the drudge work, speeds up research, facilitates collaboration and increases the users’ visibility online.","lang":"eng"}],"publication":"Computational Statistics","type":"journal_article","language":[{"iso":"eng"}],"keyword":["Databases","Machine learning","R","Reproducible research"],"department":[{"_id":"819"}],"user_id":"102979","_id":"48877","intvolume":"        34","page":"977–991","citation":{"chicago":"Casalicchio, Giuseppe, Jakob Bossek, Michel Lang, Dominik Kirchhoff, Pascal Kerschke, Benjamin Hofner, Heidi Seibold, Joaquin Vanschoren, and Bernd Bischl. “OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” <i>Computational Statistics</i> 34, no. 3 (2019): 977–991. <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">https://doi.org/10.1007/s00180-017-0742-2</a>.","ieee":"G. Casalicchio <i>et al.</i>, “OpenML: An R Package to Connect to the Machine Learning Platform OpenML,” <i>Computational Statistics</i>, vol. 34, no. 3, pp. 977–991, 2019, doi: <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>.","ama":"Casalicchio G, Bossek J, Lang M, et al. OpenML: An R Package to Connect to the Machine Learning Platform OpenML. <i>Computational Statistics</i>. 2019;34(3):977–991. doi:<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>","apa":"Casalicchio, G., Bossek, J., Lang, M., Kirchhoff, D., Kerschke, P., Hofner, B., Seibold, H., Vanschoren, J., &#38; Bischl, B. (2019). OpenML: An R Package to Connect to the Machine Learning Platform OpenML. <i>Computational Statistics</i>, <i>34</i>(3), 977–991. <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">https://doi.org/10.1007/s00180-017-0742-2</a>","mla":"Casalicchio, Giuseppe, et al. “OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” <i>Computational Statistics</i>, vol. 34, no. 3, 2019, pp. 977–991, doi:<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>.","bibtex":"@article{Casalicchio_Bossek_Lang_Kirchhoff_Kerschke_Hofner_Seibold_Vanschoren_Bischl_2019, title={OpenML: An R Package to Connect to the Machine Learning Platform OpenML}, volume={34}, DOI={<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>}, number={3}, journal={Computational Statistics}, author={Casalicchio, Giuseppe and Bossek, Jakob and Lang, Michel and Kirchhoff, Dominik and Kerschke, Pascal and Hofner, Benjamin and Seibold, Heidi and Vanschoren, Joaquin and Bischl, Bernd}, year={2019}, pages={977–991} }","short":"G. Casalicchio, J. Bossek, M. Lang, D. Kirchhoff, P. Kerschke, B. Hofner, H. Seibold, J. Vanschoren, B. Bischl, Computational Statistics 34 (2019) 977–991."},"year":"2019","issue":"3","publication_identifier":{"issn":["0943-4062"]},"doi":"10.1007/s00180-017-0742-2","title":"OpenML: An R Package to Connect to the Machine Learning Platform OpenML","volume":34,"date_created":"2023-11-14T15:58:57Z","author":[{"full_name":"Casalicchio, Giuseppe","last_name":"Casalicchio","first_name":"Giuseppe"},{"full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"first_name":"Michel","full_name":"Lang, Michel","last_name":"Lang"},{"last_name":"Kirchhoff","full_name":"Kirchhoff, Dominik","first_name":"Dominik"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"full_name":"Hofner, Benjamin","last_name":"Hofner","first_name":"Benjamin"},{"full_name":"Seibold, Heidi","last_name":"Seibold","first_name":"Heidi"},{"full_name":"Vanschoren, Joaquin","last_name":"Vanschoren","first_name":"Joaquin"},{"first_name":"Bernd","last_name":"Bischl","full_name":"Bischl, Bernd"}],"date_updated":"2023-12-13T10:51:17Z"},{"keyword":["General Energy","General Materials Science","General Chemical Engineering","Environmental Chemistry"],"language":[{"iso":"eng"}],"_id":"41032","user_id":"44418","department":[{"_id":"35"},{"_id":"306"}],"status":"public","type":"journal_article","publication":"ChemSusChem","title":"Stereoselective Alkyne Hydrogenation by using a Simple Iron Catalyst","doi":"10.1002/cssc.201900926","date_updated":"2023-12-13T15:12:41Z","publisher":"Wiley","author":[{"last_name":"Gregori","full_name":"Gregori, Bernhard J.","first_name":"Bernhard J."},{"first_name":"Felix","last_name":"Schwarzhuber","full_name":"Schwarzhuber, Felix"},{"last_name":"Pöllath","full_name":"Pöllath, Simon","first_name":"Simon"},{"first_name":"Josef","full_name":"Zweck, Josef","last_name":"Zweck"},{"first_name":"Lorena","last_name":"Fritsch","full_name":"Fritsch, Lorena","id":"44418"},{"first_name":"Roland","orcid":"0000-0003-2061-7289","last_name":"Schoch","id":"48467","full_name":"Schoch, Roland"},{"id":"47241","full_name":"Bauer, Matthias","orcid":"0000-0002-9294-6076","last_name":"Bauer","first_name":"Matthias"},{"last_name":"Jacobi von Wangelin","full_name":"Jacobi von Wangelin, Axel","first_name":"Axel"}],"date_created":"2023-01-30T17:56:44Z","volume":12,"year":"2019","citation":{"ieee":"B. J. Gregori <i>et al.</i>, “Stereoselective Alkyne Hydrogenation by using a Simple Iron Catalyst,” <i>ChemSusChem</i>, vol. 12, no. 16, pp. 3864–3870, 2019, doi: <a href=\"https://doi.org/10.1002/cssc.201900926\">10.1002/cssc.201900926</a>.","chicago":"Gregori, Bernhard J., Felix Schwarzhuber, Simon Pöllath, Josef Zweck, Lorena Fritsch, Roland Schoch, Matthias Bauer, and Axel Jacobi von Wangelin. “Stereoselective Alkyne Hydrogenation by Using a Simple Iron Catalyst.” <i>ChemSusChem</i> 12, no. 16 (2019): 3864–70. <a href=\"https://doi.org/10.1002/cssc.201900926\">https://doi.org/10.1002/cssc.201900926</a>.","ama":"Gregori BJ, Schwarzhuber F, Pöllath S, et al. Stereoselective Alkyne Hydrogenation by using a Simple Iron Catalyst. <i>ChemSusChem</i>. 2019;12(16):3864-3870. doi:<a href=\"https://doi.org/10.1002/cssc.201900926\">10.1002/cssc.201900926</a>","mla":"Gregori, Bernhard J., et al. “Stereoselective Alkyne Hydrogenation by Using a Simple Iron Catalyst.” <i>ChemSusChem</i>, vol. 12, no. 16, Wiley, 2019, pp. 3864–70, doi:<a href=\"https://doi.org/10.1002/cssc.201900926\">10.1002/cssc.201900926</a>.","bibtex":"@article{Gregori_Schwarzhuber_Pöllath_Zweck_Fritsch_Schoch_Bauer_Jacobi von Wangelin_2019, title={Stereoselective Alkyne Hydrogenation by using a Simple Iron Catalyst}, volume={12}, DOI={<a href=\"https://doi.org/10.1002/cssc.201900926\">10.1002/cssc.201900926</a>}, number={16}, journal={ChemSusChem}, publisher={Wiley}, author={Gregori, Bernhard J. and Schwarzhuber, Felix and Pöllath, Simon and Zweck, Josef and Fritsch, Lorena and Schoch, Roland and Bauer, Matthias and Jacobi von Wangelin, Axel}, year={2019}, pages={3864–3870} }","short":"B.J. Gregori, F. Schwarzhuber, S. Pöllath, J. Zweck, L. Fritsch, R. Schoch, M. Bauer, A. Jacobi von Wangelin, ChemSusChem 12 (2019) 3864–3870.","apa":"Gregori, B. J., Schwarzhuber, F., Pöllath, S., Zweck, J., Fritsch, L., Schoch, R., Bauer, M., &#38; Jacobi von Wangelin, A. (2019). Stereoselective Alkyne Hydrogenation by using a Simple Iron Catalyst. <i>ChemSusChem</i>, <i>12</i>(16), 3864–3870. <a href=\"https://doi.org/10.1002/cssc.201900926\">https://doi.org/10.1002/cssc.201900926</a>"},"intvolume":"        12","page":"3864-3870","publication_status":"published","publication_identifier":{"issn":["1864-5631","1864-564X"]},"issue":"16"},{"date_updated":"2023-12-14T09:49:15Z","date_created":"2023-12-14T09:41:02Z","author":[{"last_name":"Schulte Eickholt","full_name":"Schulte Eickholt, Swen","id":"7117","first_name":"Swen"},{"first_name":"Michael","last_name":"Hofmann","full_name":"Hofmann, Michael"},{"last_name":"von Stosch","full_name":"von Stosch, Klaus","first_name":"Klaus"}],"title":"Navid Kermani","place":"Würzburg","year":"2019","citation":{"ama":"Schulte Eickholt S, Hofmann M, von Stosch K. <i>Navid Kermani</i>.; 2019.","chicago":"Schulte Eickholt, Swen, Michael Hofmann, and Klaus von Stosch. <i>Navid Kermani</i>. Würzburg, 2019.","ieee":"S. Schulte Eickholt, M. Hofmann, and K. von Stosch, <i>Navid Kermani</i>. Würzburg, 2019.","apa":"Schulte Eickholt, S., Hofmann, M., &#38; von Stosch, K. (2019). <i>Navid Kermani</i>.","mla":"Schulte Eickholt, Swen, et al. <i>Navid Kermani</i>. 2019.","short":"S. Schulte Eickholt, M. Hofmann, K. von Stosch, Navid Kermani, Würzburg, 2019.","bibtex":"@book{Schulte Eickholt_Hofmann_von Stosch_2019, place={Würzburg}, title={Navid Kermani}, author={Schulte Eickholt, Swen and Hofmann, Michael and von Stosch, Klaus}, year={2019} }"},"_id":"49614","user_id":"7117","language":[{"iso":"eng"}],"type":"book","status":"public"},{"status":"public","editor":[{"last_name":"Elit","full_name":"Elit, Stefan","first_name":"Stefan"},{"full_name":"Eke, Norbert Otto","last_name":"Eke","first_name":"Norbert Otto"}],"publication":"Literarische Institutionen","type":"book_chapter","language":[{"iso":"ger"}],"department":[{"_id":"465"},{"_id":"5"}],"user_id":"105","series_title":"Grundthemen der Literaturwissenschaft","_id":"49712","page":"1-17","citation":{"ama":"Elit S, Eke NO. Einleitung. In: Elit S, Eke NO, eds. <i>Literarische Institutionen</i>. Grundthemen der Literaturwissenschaft. de Gruyter; 2019:1-17.","chicago":"Elit, Stefan, and Norbert Otto Eke. “Einleitung.” In <i>Literarische Institutionen</i>, edited by Stefan Elit and Norbert Otto Eke, 1–17. Grundthemen der Literaturwissenschaft. Berlin/Boston: de Gruyter, 2019.","ieee":"S. Elit and N. O. Eke, “Einleitung,” in <i>Literarische Institutionen</i>, S. Elit and N. O. Eke, Eds. Berlin/Boston: de Gruyter, 2019, pp. 1–17.","bibtex":"@inbook{Elit_Eke_2019, place={Berlin/Boston}, series={Grundthemen der Literaturwissenschaft}, title={Einleitung}, booktitle={Literarische Institutionen}, publisher={de Gruyter}, author={Elit, Stefan and Eke, Norbert Otto}, editor={Elit, Stefan and Eke, Norbert Otto}, year={2019}, pages={1–17}, collection={Grundthemen der Literaturwissenschaft} }","mla":"Elit, Stefan, and Norbert Otto Eke. “Einleitung.” <i>Literarische Institutionen</i>, edited by Stefan Elit and Norbert Otto Eke, de Gruyter, 2019, pp. 1–17.","short":"S. Elit, N.O. Eke, in: S. Elit, N.O. Eke (Eds.), Literarische Institutionen, de Gruyter, Berlin/Boston, 2019, pp. 1–17.","apa":"Elit, S., &#38; Eke, N. O. (2019). Einleitung. In S. Elit &#38; N. O. Eke (Eds.), <i>Literarische Institutionen</i> (pp. 1–17). de Gruyter."},"year":"2019","place":"Berlin/Boston","publication_identifier":{"isbn":["978-3-11-036469-9"]},"publication_status":"published","title":"Einleitung","author":[{"id":"105","full_name":"Elit, Stefan","last_name":"Elit","orcid":"0000-0002-4719-1073","first_name":"Stefan"},{"first_name":"Norbert Otto","full_name":"Eke, Norbert Otto","id":"104","last_name":"Eke"}],"date_created":"2023-12-15T14:02:51Z","publisher":"de Gruyter","date_updated":"2023-12-15T14:02:56Z"},{"title":"Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO)","main_file_link":[{"url":"https://belgien.net/antwerpener-boerse/","open_access":"1"}],"date_updated":"2023-12-18T10:09:20Z","oa":"1","publisher":"BelgienNet","author":[{"first_name":"Yves","last_name":"Huybrechts","orcid":"0009-0009-2166-9794","full_name":"Huybrechts, Yves","id":"78579"}],"date_created":"2023-12-18T09:38:41Z","year":"2019","citation":{"ama":"Huybrechts Y. <i>Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO)</i>. BelgienNet; 2019.","ieee":"Y. Huybrechts, <i>Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO)</i>. BelgienNet, 2019.","chicago":"Huybrechts, Yves. <i>Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO)</i>. BelgienNet, 2019.","apa":"Huybrechts, Y. (2019). <i>Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO)</i>. BelgienNet.","bibtex":"@book{Huybrechts_2019, title={Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO)}, publisher={BelgienNet}, author={Huybrechts, Yves}, year={2019} }","mla":"Huybrechts, Yves. <i>Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO)</i>. BelgienNet, 2019.","short":"Y. Huybrechts, Die Antwerpener Börse - Aufstieg, Niedergang und Wandel (VIDEO), BelgienNet, 2019."},"publication_status":"published","language":[{"iso":"ger"}],"_id":"49747","department":[{"_id":"448"}],"user_id":"78579","status":"public","type":"misc"},{"_id":"49834","user_id":"49513","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur und Film","editor":[{"first_name":"Andrea","full_name":"Bartl, Andrea","last_name":"Bartl"},{"last_name":"Erk","full_name":"Erk, Corina ","first_name":"Corina "},{"full_name":"Klinge, Annika ","last_name":"Klinge","first_name":"Annika "},{"last_name":"Kraus","full_name":"Kraus, Martin","first_name":"Martin"}],"status":"public","date_updated":"2023-12-19T09:05:40Z","date_created":"2023-12-19T09:00:06Z","author":[{"id":"49513","full_name":"Diedrich, Alena","last_name":"Diedrich","first_name":"Alena"}],"title":"Ironische Wendigkeit und poetische Notwendigkeit. Zum Begriff des ,Scheiterns‘ bei Hans Magnus Enzensberger","year":"2019","citation":{"chicago":"Diedrich, Alena. “Ironische Wendigkeit Und Poetische Notwendigkeit. Zum Begriff Des ,Scheiterns‘ Bei Hans Magnus Enzensberger.” In <i>Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur Und Film</i>, edited by Andrea Bartl, Corina  Erk, Annika  Klinge, and Martin Kraus, 2019.","ieee":"A. Diedrich, “Ironische Wendigkeit und poetische Notwendigkeit. Zum Begriff des ,Scheiterns‘ bei Hans Magnus Enzensberger,” in <i>Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur und Film</i>, A. Bartl, C. Erk, A. Klinge, and M. Kraus, Eds. 2019.","ama":"Diedrich A. Ironische Wendigkeit und poetische Notwendigkeit. Zum Begriff des ,Scheiterns‘ bei Hans Magnus Enzensberger. In: Bartl A, Erk C, Klinge A, Kraus M, eds. <i>Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur Und Film</i>. ; 2019.","apa":"Diedrich, A. (2019). Ironische Wendigkeit und poetische Notwendigkeit. Zum Begriff des ,Scheiterns‘ bei Hans Magnus Enzensberger. In A. Bartl, C. Erk, A. Klinge, &#38; M. Kraus (Eds.), <i>Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur und Film</i>.","mla":"Diedrich, Alena. “Ironische Wendigkeit Und Poetische Notwendigkeit. Zum Begriff Des ,Scheiterns‘ Bei Hans Magnus Enzensberger.” <i>Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur Und Film</i>, edited by Andrea Bartl et al., 2019.","bibtex":"@inbook{Diedrich_2019, title={Ironische Wendigkeit und poetische Notwendigkeit. Zum Begriff des ,Scheiterns‘ bei Hans Magnus Enzensberger}, booktitle={Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur und Film}, author={Diedrich, Alena}, editor={Bartl, Andrea and Erk, Corina  and Klinge, Annika  and Kraus, Martin}, year={2019} }","short":"A. Diedrich, in: A. Bartl, C. Erk, A. Klinge, M. Kraus (Eds.), Verhinderte Meisterwerke. Gescheiterte Projekte in Literatur Und Film, 2019."}}]