[{"language":[{"iso":"eng"}],"_id":"46371","page":"589–618","volume":64,"doi":"10.1007/s10589-015-9815-8","user_id":"15504","author":[{"full_name":"Rudolph, G","first_name":"G","last_name":"Rudolph"},{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"full_name":"Grimme, C","last_name":"Grimme","first_name":"C"},{"full_name":"Domínguez-Medina, C","first_name":"C","last_name":"Domínguez-Medina"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"title":"Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results","year":"2016","status":"public","intvolume":"        64","date_updated":"2023-10-16T13:40:21Z","date_created":"2023-08-04T15:17:48Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","citation":{"ieee":"G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, and H. Trautmann, “Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results,” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, vol. 64, no. 2, pp. 589–618, 2016, doi: <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>.","mla":"Rudolph, G., et al. “Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and Numerical Results.” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, vol. 64, no. 2, 2016, pp. 589–618, doi:<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>.","apa":"Rudolph, G., Schütze, O., Grimme, C., Domínguez-Medina, C., &#38; Trautmann, H. (2016). Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results. <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i>, <i>64</i>(2), 589–618. <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">https://doi.org/10.1007/s10589-015-9815-8</a>","bibtex":"@article{Rudolph_Schütze_Grimme_Domínguez-Medina_Trautmann_2016, title={Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results}, volume={64}, DOI={<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>}, number={2}, journal={Computational Optimization and Applications (Comput. Optim. Appl.)}, author={Rudolph, G and Schütze, O and Grimme, C and Domínguez-Medina, C and Trautmann, Heike}, year={2016}, pages={589–618} }","ama":"Rudolph G, Schütze O, Grimme C, Domínguez-Medina C, Trautmann H. Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results. <i>Computational Optimization and Applications (Comput Optim Appl)</i>. 2016;64(2):589–618. doi:<a href=\"https://doi.org/10.1007/s10589-015-9815-8\">10.1007/s10589-015-9815-8</a>","short":"G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, H. Trautmann, Computational Optimization and Applications (Comput. Optim. Appl.) 64 (2016) 589–618.","chicago":"Rudolph, G, O Schütze, C Grimme, C Domínguez-Medina, and Heike Trautmann. “Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and Numerical Results.” <i>Computational Optimization and Applications (Comput. Optim. Appl.)</i> 64, no. 2 (2016): 589–618. <a href=\"https://doi.org/10.1007/s10589-015-9815-8\">https://doi.org/10.1007/s10589-015-9815-8</a>."},"publication":"Computational Optimization and Applications (Comput. Optim. Appl.)","issue":"2","abstract":[{"lang":"eng","text":"One main task in evolutionary multiobjective optimization (EMO) is to obtain a suitable finite size approximation of the Pareto front which is the image of the solution set, termed the Pareto set, of a given multiobjective optimization problem. In the technical literature, the characteristic of the desired approximation is commonly expressed by closeness to the Pareto front and a sufficient spread of the solutions obtained. In this paper, we first make an effort to show by theoretical and empirical findings that the recently proposed Averaged Hausdorff (or Δ𝑝-) indicator indeed aims at fulfilling both performance criteria for bi-objective optimization problems. In the second part of this paper, standard EMO algorithms combined with a specialized archiver and a postprocessing step based on the Δ𝑝 indicator are introduced which sufficiently approximate the Δ𝑝-optimal archives and generate solutions evenly spread along the Pareto front."}]},{"date_created":"2023-08-04T15:19:11Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","citation":{"ama":"Schütze O, Sosa HV, Trautmann H, Rudolph G. The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems. <i>Journal of Heuristics</i>. 2016;22(3):273–300. doi:<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>","bibtex":"@article{Schütze_Sosa_Trautmann_Rudolph_2016, title={The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems}, volume={22}, DOI={<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>}, number={3}, journal={Journal of Heuristics}, author={Schütze, O and Sosa, Hernandez VA and Trautmann, Heike and Rudolph, G}, year={2016}, pages={273–300} }","mla":"Schütze, O., et al. “The Hypervolume Based Directed Search Method for Multi-Objective Optimization Problems.” <i>Journal of Heuristics</i>, vol. 22, no. 3, 2016, pp. 273–300, doi:<a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>.","short":"O. Schütze, H.V. Sosa, H. Trautmann, G. Rudolph, Journal of Heuristics 22 (2016) 273–300.","chicago":"Schütze, O, Hernandez VA Sosa, Heike Trautmann, and G Rudolph. “The Hypervolume Based Directed Search Method for Multi-Objective Optimization Problems.” <i>Journal of Heuristics</i> 22, no. 3 (2016): 273–300. <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">https://doi.org/10.1007/s10732-016-9310-0</a>.","apa":"Schütze, O., Sosa, H. V., Trautmann, H., &#38; Rudolph, G. (2016). The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems. <i>Journal of Heuristics</i>, <i>22</i>(3), 273–300. <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">https://doi.org/10.1007/s10732-016-9310-0</a>","ieee":"O. Schütze, H. V. Sosa, H. Trautmann, and G. Rudolph, “The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems,” <i>Journal of Heuristics</i>, vol. 22, no. 3, pp. 273–300, 2016, doi: <a href=\"https://doi.org/10.1007/s10732-016-9310-0\">10.1007/s10732-016-9310-0</a>."},"publication":"Journal of Heuristics","issue":"3","abstract":[{"text":"We present a new hybrid evolutionary algorithm for the effective hypervolume approximation of the Pareto front of a given differentiable multi-objective optimization problem. Starting point for the local search (LS) mechanism is a new division of the decision space as we will argue that in each of these regions a different LS strategy seems to be most promising. For the LS in two out of the three regions we will utilize and adapt the Directed Search method which is capable of steering the search into any direction given in objective space and which is thus well suited for the problem at hand. We further on integrate the resulting LS mechanism into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations. Finally, we will present some numerical results on several benchmark problems with two and three objectives indicating the strength and competitiveness of the novel hybrid.","lang":"eng"}],"language":[{"iso":"eng"}],"_id":"46372","page":"273–300","volume":22,"doi":"10.1007/s10732-016-9310-0","user_id":"15504","author":[{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"full_name":"Sosa, Hernandez VA","last_name":"Sosa","first_name":"Hernandez VA"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Rudolph, G","first_name":"G","last_name":"Rudolph"}],"title":"The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems","status":"public","year":"2016","intvolume":"        22","date_updated":"2023-10-16T13:40:43Z"},{"language":[{"iso":"eng"}],"_id":"46368","doi":"10.1109/CEC.2016.7748359","user_id":"15504","title":"The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems","year":"2016","status":"public","author":[{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"date_updated":"2023-10-16T13:39:06Z","place":"Vancouver, BC, Kanada","date_created":"2023-08-04T15:14:52Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the IEEE Congress on Evolutionary Computation (CEC)","citation":{"ama":"Kerschke P, Trautmann H. The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. In: <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>","bibtex":"@inproceedings{Kerschke_Trautmann_2016, place={Vancouver, BC, Kanada}, title={The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems}, DOI={<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>}, booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}, author={Kerschke, Pascal and Trautmann, Heike}, year={2016} }","mla":"Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>.","chicago":"Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems.” In <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. Vancouver, BC, Kanada, 2016. <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">https://doi.org/10.1109/CEC.2016.7748359</a>.","short":"P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Kanada, 2016.","apa":"Kerschke, P., &#38; Trautmann, H. (2016). The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems. <i>Proceedings of the IEEE Congress on Evolutionary Computation (CEC)</i>. <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">https://doi.org/10.1109/CEC.2016.7748359</a>","ieee":"P. Kerschke and H. Trautmann, “The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems,” 2016, doi: <a href=\"https://doi.org/10.1109/CEC.2016.7748359\">10.1109/CEC.2016.7748359</a>."},"abstract":[{"text":"Exploratory Landscape Analysis (ELA) aims at understanding characteristics of single-objective continuous (black-box) optimization problems in an automated way. Moreover, the approach provides the basis for constructing algorithm selection models for unseen problem instances. Recently, it has gained increasing attention and numerical features have been designed by various research groups. This paper introduces the R-Package FLACCO which makes all relevant features available in a unified framework together with efficient helper functions. Moreover, a case study which gives perspectives to ELA for multi-objective optimization problems is presented.","lang":"eng"}]},{"date_updated":"2023-10-16T13:40:00Z","intvolume":"         5","title":"Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)","status":"public","year":"2016","author":[{"full_name":"Neumann, F","last_name":"Neumann","first_name":"F"},{"orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"}],"doi":"10.4230/DagRep.5.5.57","user_id":"15504","volume":5,"page":"78–79","_id":"46370","language":[{"iso":"eng"}],"abstract":[{"text":"This report documents the talks and discussions at the Dagstuhl Seminar 15211 \"Theory of Evolutionary Algorithms\". This seminar, now in its 8th edition, is the main meeting point of the highly active theory of randomized search heuristics subcommunities in Australia, Asia, North America, and Europe. Topics intensively discussed include rigorous runtime analysis and computational complexity theory for randomised search heuristics, information geometry of randomised search, and synergies between the theory of evolutionary algorithms and theories of natural evolution.","lang":"eng"}],"publication":"Dagstuhl Reports","issue":"5","citation":{"chicago":"Neumann, F, and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” <i>Dagstuhl Reports</i> 5, no. 5 (2016): 78–79. <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">https://doi.org/10.4230/DagRep.5.5.57</a>.","short":"F. Neumann, H. Trautmann, Dagstuhl Reports 5 (2016) 78–79.","apa":"Neumann, F., &#38; Trautmann, H. (2016). Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). <i>Dagstuhl Reports</i>, <i>5</i>(5), 78–79. <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">https://doi.org/10.4230/DagRep.5.5.57</a>","ieee":"F. Neumann and H. Trautmann, “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211),” <i>Dagstuhl Reports</i>, vol. 5, no. 5, pp. 78–79, 2016, doi: <a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>.","ama":"Neumann F, Trautmann H. Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211). <i>Dagstuhl Reports</i>. 2016;5(5):78–79. doi:<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>","bibtex":"@article{Neumann_Trautmann_2016, title={Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)}, volume={5}, DOI={<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>}, number={5}, journal={Dagstuhl Reports}, author={Neumann, F and Trautmann, Heike}, year={2016}, pages={78–79} }","mla":"Neumann, F., and Heike Trautmann. “Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211).” <i>Dagstuhl Reports</i>, vol. 5, no. 5, 2016, pp. 78–79, doi:<a href=\"https://doi.org/10.4230/DagRep.5.5.57\">10.4230/DagRep.5.5.57</a>."},"type":"journal_article","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:17:00Z"},{"date_created":"2023-10-19T08:31:58Z","type":"conference","department":[{"_id":"34"},{"_id":"820"}],"publication":"Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing","citation":{"apa":"Habernal, I., &#38; Gurevych, I. (2016). What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. <a href=\"https://doi.org/10.18653/v1/d16-1129\">https://doi.org/10.18653/v1/d16-1129</a>","ieee":"I. Habernal and I. Gurevych, “What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation,” 2016, doi: <a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>.","chicago":"Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” In <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. Association for Computational Linguistics, 2016. <a href=\"https://doi.org/10.18653/v1/d16-1129\">https://doi.org/10.18653/v1/d16-1129</a>.","short":"I. Habernal, I. Gurevych, in: Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing, Association for Computational Linguistics, 2016.","mla":"Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical Analysis and Detecting            Attributes of Convincingness in Web Argumentation.” <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>, Association for Computational Linguistics, 2016, doi:<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>.","ama":"Habernal I, Gurevych I. What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation. In: <i>Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing</i>. Association for Computational Linguistics; 2016. doi:<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>","bibtex":"@inproceedings{Habernal_Gurevych_2016, title={What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation}, DOI={<a href=\"https://doi.org/10.18653/v1/d16-1129\">10.18653/v1/d16-1129</a>}, booktitle={Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing}, publisher={Association for Computational Linguistics}, author={Habernal, Ivan and Gurevych, Iryna}, year={2016} }"},"_id":"48309","language":[{"iso":"eng"}],"publisher":"Association for Computational Linguistics","user_id":"15504","doi":"10.18653/v1/d16-1129","status":"public","year":"2016","title":"What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation","author":[{"full_name":"Habernal, Ivan","first_name":"Ivan","last_name":"Habernal","id":"101881"},{"full_name":"Gurevych, Iryna","first_name":"Iryna","last_name":"Gurevych"}],"publication_status":"published","date_updated":"2023-10-19T12:07:05Z"},{"user_id":"460","_id":"11890","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16.pdf"}],"date_updated":"2023-10-26T08:11:52Z","author":[{"full_name":"Schmalenstroeer, Joerg","first_name":"Joerg","last_name":"Schmalenstroeer","id":"460"},{"id":"242","last_name":"Haeb-Umbach","first_name":"Reinhold","full_name":"Haeb-Umbach, Reinhold"}],"year":"2016","status":"public","title":"Investigations into Bluetooth Low Energy Localization Precision Limits","oa":"1","department":[{"_id":"54"}],"type":"conference","date_created":"2019-07-12T05:30:14Z","related_material":{"link":[{"url":"https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16_Poster.pdf","relation":"supplementary_material","description":"Poster"}]},"abstract":[{"lang":"eng","text":"In this paper we study the influence of directional radio patterns of Bluetooth low energy (BLE) beacons on smartphone localization accuracy and beacon network planning. A two-dimensional model of the power emission characteristic is derived from measurements of the radiation pattern of BLE beacons carried out in an RF chamber. The Cramer-Rao lower bound (CRLB) for position estimation is then derived for this directional power emission model. With this lower bound on the RMS positioning error the coverage of different beacon network configurations can be evaluated. For near-optimal network planing an evolutionary optimization algorithm for finding the best beacon placement is presented."}],"quality_controlled":"1","citation":{"apa":"Schmalenstroeer, J., &#38; Haeb-Umbach, R. (2016). Investigations into Bluetooth Low Energy Localization Precision Limits. <i>24th European Signal Processing Conference (EUSIPCO 2016)</i>.","ieee":"J. Schmalenstroeer and R. Haeb-Umbach, “Investigations into Bluetooth Low Energy Localization Precision Limits,” 2016.","short":"J. Schmalenstroeer, R. Haeb-Umbach, in: 24th European Signal Processing Conference (EUSIPCO 2016), 2016.","chicago":"Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into Bluetooth Low Energy Localization Precision Limits.” In <i>24th European Signal Processing Conference (EUSIPCO 2016)</i>, 2016.","mla":"Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into Bluetooth Low Energy Localization Precision Limits.” <i>24th European Signal Processing Conference (EUSIPCO 2016)</i>, 2016.","ama":"Schmalenstroeer J, Haeb-Umbach R. Investigations into Bluetooth Low Energy Localization Precision Limits. In: <i>24th European Signal Processing Conference (EUSIPCO 2016)</i>. ; 2016.","bibtex":"@inproceedings{Schmalenstroeer_Haeb-Umbach_2016, title={Investigations into Bluetooth Low Energy Localization Precision Limits}, booktitle={24th European Signal Processing Conference (EUSIPCO 2016)}, author={Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}, year={2016} }"},"publication":"24th European Signal Processing Conference (EUSIPCO 2016)"},{"citation":{"bibtex":"@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes in Computer Science}, title={Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, Paola and Sellmann, Meinolf and Vanschoren, Joaquin}, year={2016}, pages={48–59}, collection={Lecture Notes in Computer Science} }","ama":"Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J, eds. <i>Learning and Intelligent Optimization</i>. Lecture Notes in Computer Science. Springer International Publishing; 2016:48–59. doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>","mla":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” <i>Learning and Intelligent Optimization</i>, edited by Paola Festa et al., Springer International Publishing, 2016, pp. 48–59, doi:<a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","short":"J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2016, pp. 48–59.","chicago":"Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers.” In <i>Learning and Intelligent Optimization</i>, edited by Paola Festa, Meinolf Sellmann, and Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>.","ieee":"J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers,” in <i>Learning and Intelligent Optimization</i>, 2016, pp. 48–59, doi: <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">10.1007/978-3-319-50349-3_4</a>.","apa":"Bossek, J., &#38; Trautmann, H. (2016). Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann, &#38; J. Vanschoren (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 48–59). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-50349-3_4\">https://doi.org/10.1007/978-3-319-50349-3_4</a>"},"place":"Cham","status":"public","editor":[{"first_name":"Paola","last_name":"Festa","full_name":"Festa, Paola"},{"full_name":"Sellmann, Meinolf","last_name":"Sellmann","first_name":"Meinolf"},{"first_name":"Joaquin","last_name":"Vanschoren","full_name":"Vanschoren, Joaquin"}],"user_id":"102979","_id":"48873","publisher":"Springer International Publishing","page":"48–59","abstract":[{"text":"Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms.","lang":"eng"}],"extern":"1","publication":"Learning and Intelligent Optimization","department":[{"_id":"819"}],"keyword":["Algorithm selection","Feature selection","Instance hardness","TSP"],"type":"conference","date_created":"2023-11-14T15:58:57Z","date_updated":"2023-12-13T10:47:05Z","publication_status":"published","publication_identifier":{"isbn":["978-3-319-50349-3"]},"author":[{"full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","id":"102979"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"year":"2016","title":"Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers","doi":"10.1007/978-3-319-50349-3_4","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"language":[{"iso":"ger"}],"_id":"51464","publisher":"Springer Spektrum","editor":[{"full_name":"Hoppenbrock, A.","first_name":"A.","last_name":"Hoppenbrock"}],"user_id":"49063","corporate_editor":["et al."],"author":[{"id":"220","full_name":"Hilgert, Joachim","last_name":"Hilgert","first_name":"Joachim"}],"title":"Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen","status":"public","year":"2016","publication_status":"published","date_updated":"2024-02-19T08:06:22Z","date_created":"2024-02-19T08:06:18Z","department":[{"_id":"91"}],"type":"book_chapter","citation":{"mla":"Hilgert, Joachim. “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen.” <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>, edited by A. Hoppenbrock and et al., Springer Spektrum, 2016.","bibtex":"@inbook{Hilgert_2016, title={Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen}, booktitle={Lehren und Lernen von Mathematik in der Studieneingangsphase}, publisher={Springer Spektrum}, author={Hilgert, Joachim}, editor={Hoppenbrock, A. and et al.}, year={2016} }","ama":"Hilgert J. Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen. In: Hoppenbrock A, et al., eds. <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>. Springer Spektrum; 2016.","ieee":"J. Hilgert, “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen,” in <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>, A. Hoppenbrock and et al., Eds. Springer Spektrum, 2016.","apa":"Hilgert, J. (2016). Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen. In A. Hoppenbrock &#38; et al. (Eds.), <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>. Springer Spektrum.","chicago":"Hilgert, Joachim. “Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen.” In <i>Lehren und Lernen von Mathematik in der Studieneingangsphase</i>, edited by A. Hoppenbrock and et al. Springer Spektrum, 2016.","short":"J. Hilgert, in: A. Hoppenbrock, et al. (Eds.), Lehren und Lernen von Mathematik in der Studieneingangsphase, Springer Spektrum, 2016."},"publication":"Lehren und Lernen von Mathematik in der Studieneingangsphase"},{"publication":"Geometric Methods in Physics","citation":{"ieee":"J. Hilgert, A. Pasquale, and T. Przebinda, “Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p&#62;2 odd),” in <i>Geometric Methods in Physics</i>, P. Kielanowski and et al., Eds. Birkhäuser, 2016.","apa":"Hilgert, J., Pasquale, A., &#38; Przebinda, T. (2016). Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p&#62;2 odd). In P. Kielanowski &#38; et al. (Eds.), <i>Geometric Methods in Physics</i>. Birkhäuser.","mla":"Hilgert, Joachim, et al. “Resonances for the Laplacian: The Cases BC2 and C2 (except SO(p,2) with P&#62;2 Odd).” <i>Geometric Methods in Physics</i>, edited by P. Kielanowski and et al., Birkhäuser, 2016.","bibtex":"@inbook{Hilgert_Pasquale_Przebinda_2016, title={Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p&#62;2 odd)}, booktitle={Geometric Methods in Physics}, publisher={Birkhäuser}, author={Hilgert, Joachim and Pasquale, A. and Przebinda, T.}, editor={Kielanowski, P. and et al.}, year={2016} }","ama":"Hilgert J, Pasquale A, Przebinda T. Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p&#62;2 odd). In: Kielanowski P, et al., eds. <i>Geometric Methods in Physics</i>. Birkhäuser; 2016.","short":"J. Hilgert, A. Pasquale, T. Przebinda, in: P. Kielanowski, et al. (Eds.), Geometric Methods in Physics, Birkhäuser, 2016.","chicago":"Hilgert, Joachim, A. Pasquale, and T. Przebinda. “Resonances for the Laplacian: The Cases BC2 and C2 (except SO(p,2) with P&#62;2 Odd).” In <i>Geometric Methods in Physics</i>, edited by P. Kielanowski and et al. Birkhäuser, 2016."},"date_created":"2024-02-19T08:05:20Z","type":"book_chapter","department":[{"_id":"91"}],"year":"2016","status":"public","title":"Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p>2 odd)","corporate_editor":["et al."],"author":[{"id":"220","full_name":"Hilgert, Joachim","first_name":"Joachim","last_name":"Hilgert"},{"last_name":"Pasquale","first_name":"A.","full_name":"Pasquale, A."},{"last_name":"Przebinda","first_name":"T.","full_name":"Przebinda, T."}],"date_updated":"2024-02-19T08:05:24Z","publication_status":"published","_id":"51463","publisher":"Birkhäuser","language":[{"iso":"eng"}],"user_id":"49063","editor":[{"full_name":"Kielanowski, P.","first_name":"P.","last_name":"Kielanowski"}]},{"_id":"52803","publisher":"Springer Science and Business Media LLC","page":"55-75","volume":5,"user_id":"9503","status":"public","citation":{"mla":"Borgwardt, Stefan, et al. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” <i>Journal on Data Semantics</i>, vol. 5, no. 2, Springer Science and Business Media LLC, 2016, pp. 55–75, doi:<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>.","ama":"Borgwardt S, Mailis T, Peñaloza R, Turhan A-Y. Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. <i>Journal on Data Semantics</i>. 2016;5(2):55-75. doi:<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>","bibtex":"@article{Borgwardt_Mailis_Peñaloza_Turhan_2016, title={Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies}, volume={5}, DOI={<a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>}, number={2}, journal={Journal on Data Semantics}, publisher={Springer Science and Business Media LLC}, author={Borgwardt, Stefan and Mailis, Theofilos and Peñaloza, Rafael and Turhan, Anni-Yasmin}, year={2016}, pages={55–75} }","apa":"Borgwardt, S., Mailis, T., Peñaloza, R., &#38; Turhan, A.-Y. (2016). Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. <i>Journal on Data Semantics</i>, <i>5</i>(2), 55–75. <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">https://doi.org/10.1007/s13740-015-0055-y</a>","ieee":"S. Borgwardt, T. Mailis, R. Peñaloza, and A.-Y. Turhan, “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies,” <i>Journal on Data Semantics</i>, vol. 5, no. 2, pp. 55–75, 2016, doi: <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">10.1007/s13740-015-0055-y</a>.","chicago":"Borgwardt, Stefan, Theofilos Mailis, Rafael Peñaloza, and Anni-Yasmin Turhan. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.” <i>Journal on Data Semantics</i> 5, no. 2 (2016): 55–75. <a href=\"https://doi.org/10.1007/s13740-015-0055-y\">https://doi.org/10.1007/s13740-015-0055-y</a>.","short":"S. Borgwardt, T. Mailis, R. Peñaloza, A.-Y. Turhan, Journal on Data Semantics 5 (2016) 55–75."},"language":[{"iso":"eng"}],"doi":"10.1007/s13740-015-0055-y","author":[{"last_name":"Borgwardt","first_name":"Stefan","full_name":"Borgwardt, Stefan"},{"last_name":"Mailis","first_name":"Theofilos","full_name":"Mailis, Theofilos"},{"first_name":"Rafael","last_name":"Peñaloza","full_name":"Peñaloza, Rafael"},{"full_name":"Turhan, Anni-Yasmin","first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470"}],"publication_identifier":{"issn":["1861-2032","1861-2040"]},"year":"2016","title":"Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies","intvolume":"         5","publication_status":"published","date_updated":"2024-03-25T13:50:33Z","date_created":"2024-03-25T09:23:39Z","department":[{"_id":"888"}],"keyword":["Artificial Intelligence","Computer Networks and Communications","Information Systems"],"type":"journal_article","publication":"Journal on Data Semantics","issue":"2"},{"citation":{"chicago":"Kovács, Balázs, and Christian Andreas Power Guerra. “Higher Order Time Discretizations with ALE Finite Elements for Parabolic Problems on Evolving Surfaces.” <i>IMA Journal of Numerical Analysis</i> 38, no. 1 (2016): 460–94. <a href=\"https://doi.org/10.1093/imanum/drw074\">https://doi.org/10.1093/imanum/drw074</a>.","short":"B. Kovács, C.A. Power Guerra, IMA Journal of Numerical Analysis 38 (2016) 460–494.","apa":"Kovács, B., &#38; Power Guerra, C. A. (2016). Higher order time discretizations with ALE finite elements for parabolic problems on evolving surfaces. <i>IMA Journal of Numerical Analysis</i>, <i>38</i>(1), 460–494. <a href=\"https://doi.org/10.1093/imanum/drw074\">https://doi.org/10.1093/imanum/drw074</a>","ieee":"B. Kovács and C. A. Power Guerra, “Higher order time discretizations with ALE finite elements for parabolic problems on evolving surfaces,” <i>IMA Journal of Numerical Analysis</i>, vol. 38, no. 1, pp. 460–494, 2016, doi: <a href=\"https://doi.org/10.1093/imanum/drw074\">10.1093/imanum/drw074</a>.","ama":"Kovács B, Power Guerra CA. Higher order time discretizations with ALE finite elements for parabolic problems on evolving surfaces. <i>IMA Journal of Numerical Analysis</i>. 2016;38(1):460-494. doi:<a href=\"https://doi.org/10.1093/imanum/drw074\">10.1093/imanum/drw074</a>","bibtex":"@article{Kovács_Power Guerra_2016, title={Higher order time discretizations with ALE finite elements for parabolic problems on evolving surfaces}, volume={38}, DOI={<a href=\"https://doi.org/10.1093/imanum/drw074\">10.1093/imanum/drw074</a>}, number={1}, journal={IMA Journal of Numerical Analysis}, publisher={Oxford University Press (OUP)}, author={Kovács, Balázs and Power Guerra, Christian Andreas}, year={2016}, pages={460–494} }","mla":"Kovács, Balázs, and Christian Andreas Power Guerra. “Higher Order Time Discretizations with ALE Finite Elements for Parabolic Problems on Evolving Surfaces.” <i>IMA Journal of Numerical Analysis</i>, vol. 38, no. 1, Oxford University Press (OUP), 2016, pp. 460–94, doi:<a href=\"https://doi.org/10.1093/imanum/drw074\">10.1093/imanum/drw074</a>."},"_id":"45944","publisher":"Oxford University Press (OUP)","page":"460-494","volume":38,"user_id":"100441","status":"public","date_created":"2023-07-10T11:39:39Z","department":[{"_id":"841"}],"type":"journal_article","keyword":["Applied Mathematics","Computational Mathematics","General Mathematics"],"publication":"IMA Journal of Numerical Analysis","issue":"1","language":[{"iso":"eng"}],"doi":"10.1093/imanum/drw074","publication_identifier":{"issn":["0272-4979","1464-3642"]},"author":[{"last_name":"Kovács","first_name":"Balázs","orcid":"0000-0001-9872-3474","full_name":"Kovács, Balázs","id":"100441"},{"first_name":"Christian Andreas","last_name":"Power Guerra","full_name":"Power Guerra, Christian Andreas"}],"year":"2016","title":"Higher order time discretizations with ALE finite elements for parabolic problems on evolving surfaces","intvolume":"        38","publication_status":"published","date_updated":"2024-04-03T09:22:19Z"},{"publication_identifier":{"issn":["0749-159X"]},"author":[{"full_name":"Kovács, Balázs","orcid":"0000-0001-9872-3474","last_name":"Kovács","first_name":"Balázs","id":"100441"},{"full_name":"Power Guerra, Christian Andreas","last_name":"Power Guerra","first_name":"Christian Andreas"}],"title":"Error analysis for full discretizations of quasilinear parabolic problems on evolving surfaces","year":"2016","intvolume":"        32","date_updated":"2024-04-03T09:23:28Z","publication_status":"published","language":[{"iso":"eng"}],"alternative_title":["Error Analysis for Quasilinear Problems on Evolving Surfaces"],"doi":"10.1002/num.22047","publication":"Numerical Methods for Partial Differential Equations","issue":"4","date_created":"2023-07-10T11:35:34Z","department":[{"_id":"841"}],"type":"journal_article","keyword":["Applied Mathematics","Computational Mathematics","Numerical Analysis","Analysis"],"status":"public","publisher":"Wiley","_id":"45936","page":"1200-1231","volume":32,"user_id":"100441","citation":{"ieee":"B. Kovács and C. A. Power Guerra, “Error analysis for full discretizations of quasilinear parabolic problems on evolving surfaces,” <i>Numerical Methods for Partial Differential Equations</i>, vol. 32, no. 4, pp. 1200–1231, 2016, doi: <a href=\"https://doi.org/10.1002/num.22047\">10.1002/num.22047</a>.","apa":"Kovács, B., &#38; Power Guerra, C. A. (2016). Error analysis for full discretizations of quasilinear parabolic problems on evolving surfaces. <i>Numerical Methods for Partial Differential Equations</i>, <i>32</i>(4), 1200–1231. <a href=\"https://doi.org/10.1002/num.22047\">https://doi.org/10.1002/num.22047</a>","short":"B. Kovács, C.A. Power Guerra, Numerical Methods for Partial Differential Equations 32 (2016) 1200–1231.","chicago":"Kovács, Balázs, and Christian Andreas Power Guerra. “Error Analysis for Full Discretizations of Quasilinear Parabolic Problems on Evolving Surfaces.” <i>Numerical Methods for Partial Differential Equations</i> 32, no. 4 (2016): 1200–1231. <a href=\"https://doi.org/10.1002/num.22047\">https://doi.org/10.1002/num.22047</a>.","mla":"Kovács, Balázs, and Christian Andreas Power Guerra. “Error Analysis for Full Discretizations of Quasilinear Parabolic Problems on Evolving Surfaces.” <i>Numerical Methods for Partial Differential Equations</i>, vol. 32, no. 4, Wiley, 2016, pp. 1200–31, doi:<a href=\"https://doi.org/10.1002/num.22047\">10.1002/num.22047</a>.","bibtex":"@article{Kovács_Power Guerra_2016, title={Error analysis for full discretizations of quasilinear parabolic problems on evolving surfaces}, volume={32}, DOI={<a href=\"https://doi.org/10.1002/num.22047\">10.1002/num.22047</a>}, number={4}, journal={Numerical Methods for Partial Differential Equations}, publisher={Wiley}, author={Kovács, Balázs and Power Guerra, Christian Andreas}, year={2016}, pages={1200–1231} }","ama":"Kovács B, Power Guerra CA. Error analysis for full discretizations of quasilinear parabolic problems on evolving surfaces. <i>Numerical Methods for Partial Differential Equations</i>. 2016;32(4):1200-1231. doi:<a href=\"https://doi.org/10.1002/num.22047\">10.1002/num.22047</a>"}},{"intvolume":"        54","publication_status":"published","date_updated":"2024-04-03T09:23:00Z","author":[{"id":"100441","orcid":"0000-0001-9872-3474","last_name":"Kovács","first_name":"Balázs","full_name":"Kovács, Balázs"},{"first_name":"Buyang","last_name":"Li","full_name":"Li, Buyang"},{"first_name":"Christian","last_name":"Lubich","full_name":"Lubich, Christian"}],"publication_identifier":{"issn":["0036-1429","1095-7170"]},"year":"2016","title":"A-Stable Time Discretizations Preserve Maximal Parabolic Regularity","doi":"10.1137/15m1040918","language":[{"iso":"eng"}],"issue":"6","publication":"SIAM Journal on Numerical Analysis","department":[{"_id":"841"}],"keyword":["Numerical Analysis","Applied Mathematics","Computational Mathematics"],"type":"journal_article","date_created":"2023-07-10T11:38:15Z","status":"public","volume":54,"user_id":"100441","_id":"45939","publisher":"Society for Industrial & Applied Mathematics (SIAM)","page":"3600-3624","citation":{"ama":"Kovács B, Li B, Lubich C. A-Stable Time Discretizations Preserve Maximal Parabolic Regularity. <i>SIAM Journal on Numerical Analysis</i>. 2016;54(6):3600-3624. doi:<a href=\"https://doi.org/10.1137/15m1040918\">10.1137/15m1040918</a>","bibtex":"@article{Kovács_Li_Lubich_2016, title={A-Stable Time Discretizations Preserve Maximal Parabolic Regularity}, volume={54}, DOI={<a href=\"https://doi.org/10.1137/15m1040918\">10.1137/15m1040918</a>}, number={6}, journal={SIAM Journal on Numerical Analysis}, publisher={Society for Industrial &#38; Applied Mathematics (SIAM)}, author={Kovács, Balázs and Li, Buyang and Lubich, Christian}, year={2016}, pages={3600–3624} }","mla":"Kovács, Balázs, et al. “A-Stable Time Discretizations Preserve Maximal Parabolic Regularity.” <i>SIAM Journal on Numerical Analysis</i>, vol. 54, no. 6, Society for Industrial &#38; Applied Mathematics (SIAM), 2016, pp. 3600–24, doi:<a href=\"https://doi.org/10.1137/15m1040918\">10.1137/15m1040918</a>.","short":"B. Kovács, B. Li, C. Lubich, SIAM Journal on Numerical Analysis 54 (2016) 3600–3624.","chicago":"Kovács, Balázs, Buyang Li, and Christian Lubich. “A-Stable Time Discretizations Preserve Maximal Parabolic Regularity.” <i>SIAM Journal on Numerical Analysis</i> 54, no. 6 (2016): 3600–3624. <a href=\"https://doi.org/10.1137/15m1040918\">https://doi.org/10.1137/15m1040918</a>.","apa":"Kovács, B., Li, B., &#38; Lubich, C. (2016). A-Stable Time Discretizations Preserve Maximal Parabolic Regularity. <i>SIAM Journal on Numerical Analysis</i>, <i>54</i>(6), 3600–3624. <a href=\"https://doi.org/10.1137/15m1040918\">https://doi.org/10.1137/15m1040918</a>","ieee":"B. Kovács, B. Li, and C. Lubich, “A-Stable Time Discretizations Preserve Maximal Parabolic Regularity,” <i>SIAM Journal on Numerical Analysis</i>, vol. 54, no. 6, pp. 3600–3624, 2016, doi: <a href=\"https://doi.org/10.1137/15m1040918\">10.1137/15m1040918</a>."}},{"publication_status":"published","date_updated":"2024-04-03T09:23:16Z","intvolume":"        37","year":"2016","title":"Numerical analysis of parabolic problems with dynamic boundary conditions","publication_identifier":{"issn":["0272-4979","1464-3642"]},"author":[{"id":"100441","full_name":"Kovács, Balázs","last_name":"Kovács","first_name":"Balázs","orcid":"0000-0001-9872-3474"},{"last_name":"Lubich","first_name":"Christian","full_name":"Lubich, Christian"}],"doi":"10.1093/imanum/drw015","language":[{"iso":"eng"}],"publication":"IMA Journal of Numerical Analysis","issue":"1","type":"journal_article","keyword":["Applied Mathematics","Computational Mathematics","General Mathematics"],"department":[{"_id":"841"}],"date_created":"2023-07-10T11:35:53Z","status":"public","user_id":"100441","volume":37,"page":"1-39","_id":"45937","publisher":"Oxford University Press (OUP)","citation":{"mla":"Kovács, Balázs, and Christian Lubich. “Numerical Analysis of Parabolic Problems with Dynamic Boundary Conditions.” <i>IMA Journal of Numerical Analysis</i>, vol. 37, no. 1, Oxford University Press (OUP), 2016, pp. 1–39, doi:<a href=\"https://doi.org/10.1093/imanum/drw015\">10.1093/imanum/drw015</a>.","bibtex":"@article{Kovács_Lubich_2016, title={Numerical analysis of parabolic problems with dynamic boundary conditions}, volume={37}, DOI={<a href=\"https://doi.org/10.1093/imanum/drw015\">10.1093/imanum/drw015</a>}, number={1}, journal={IMA Journal of Numerical Analysis}, publisher={Oxford University Press (OUP)}, author={Kovács, Balázs and Lubich, Christian}, year={2016}, pages={1–39} }","ama":"Kovács B, Lubich C. Numerical analysis of parabolic problems with dynamic boundary conditions. <i>IMA Journal of Numerical Analysis</i>. 2016;37(1):1-39. doi:<a href=\"https://doi.org/10.1093/imanum/drw015\">10.1093/imanum/drw015</a>","ieee":"B. Kovács and C. Lubich, “Numerical analysis of parabolic problems with dynamic boundary conditions,” <i>IMA Journal of Numerical Analysis</i>, vol. 37, no. 1, pp. 1–39, 2016, doi: <a href=\"https://doi.org/10.1093/imanum/drw015\">10.1093/imanum/drw015</a>.","apa":"Kovács, B., &#38; Lubich, C. (2016). Numerical analysis of parabolic problems with dynamic boundary conditions. <i>IMA Journal of Numerical Analysis</i>, <i>37</i>(1), 1–39. <a href=\"https://doi.org/10.1093/imanum/drw015\">https://doi.org/10.1093/imanum/drw015</a>","short":"B. Kovács, C. Lubich, IMA Journal of Numerical Analysis 37 (2016) 1–39.","chicago":"Kovács, Balázs, and Christian Lubich. “Numerical Analysis of Parabolic Problems with Dynamic Boundary Conditions.” <i>IMA Journal of Numerical Analysis</i> 37, no. 1 (2016): 1–39. <a href=\"https://doi.org/10.1093/imanum/drw015\">https://doi.org/10.1093/imanum/drw015</a>."}},{"type":"conference","department":[{"_id":"841"}],"date_created":"2023-07-10T11:37:53Z","publication":"Mathematical Problems in Meteorological Modelling","citation":{"chicago":"Karátson, J., and Balázs Kovács. “A Parallel Numerical Solution Approach for Nonlinear Parabolic Systems Arising in Air Pollution Transport Problems.” In <i>Mathematical Problems in Meteorological Modelling</i>, 57–70, 2016.","short":"J. Karátson, B. Kovács, in: Mathematical Problems in Meteorological Modelling, 2016, pp. 57–70.","apa":"Karátson, J., &#38; Kovács, B. (2016). A Parallel Numerical Solution Approach for Nonlinear Parabolic Systems Arising in Air Pollution Transport Problems. <i>Mathematical Problems in Meteorological Modelling</i>, 57–70.","ieee":"J. Karátson and B. Kovács, “A Parallel Numerical Solution Approach for Nonlinear Parabolic Systems Arising in Air Pollution Transport Problems,” in <i>Mathematical Problems in Meteorological Modelling</i>, 2016, pp. 57–70.","ama":"Karátson J, Kovács B. A Parallel Numerical Solution Approach for Nonlinear Parabolic Systems Arising in Air Pollution Transport Problems. In: <i>Mathematical Problems in Meteorological Modelling</i>. ; 2016:57–70.","bibtex":"@inproceedings{Karátson_Kovács_2016, title={A Parallel Numerical Solution Approach for Nonlinear Parabolic Systems Arising in Air Pollution Transport Problems}, booktitle={Mathematical Problems in Meteorological Modelling}, author={Karátson, J. and Kovács, Balázs}, year={2016}, pages={57–70} }","mla":"Karátson, J., and Balázs Kovács. “A Parallel Numerical Solution Approach for Nonlinear Parabolic Systems Arising in Air Pollution Transport Problems.” <i>Mathematical Problems in Meteorological Modelling</i>, 2016, pp. 57–70."},"user_id":"100441","page":"57–70","language":[{"iso":"eng"}],"_id":"45938","date_updated":"2024-04-03T09:23:08Z","year":"2016","status":"public","title":"A Parallel Numerical Solution Approach for Nonlinear Parabolic Systems Arising in Air Pollution Transport Problems","author":[{"last_name":"Karátson","first_name":"J.","full_name":"Karátson, J."},{"first_name":"Balázs","last_name":"Kovács","orcid":"0000-0001-9872-3474","full_name":"Kovács, Balázs","id":"100441"}]},{"publication":"2016 IEEE International Conference on Communications (ICC)","citation":{"apa":"Soleymani, M., Maham, B., &#38; Ashtiani, F. (2016). Analysis of the downlink saturation throughput of an asymmetric IEEE 802.11n-based WLAN. <i>2016 IEEE International Conference on Communications (ICC)</i>. <a href=\"https://doi.org/10.1109/icc.2016.7511453\">https://doi.org/10.1109/icc.2016.7511453</a>","ieee":"M. Soleymani, B. Maham, and F. Ashtiani, “Analysis of the downlink saturation throughput of an asymmetric IEEE 802.11n-based WLAN,” 2016, doi: <a href=\"https://doi.org/10.1109/icc.2016.7511453\">10.1109/icc.2016.7511453</a>.","short":"M. Soleymani, B. Maham, F. Ashtiani, in: 2016 IEEE International Conference on Communications (ICC), IEEE, 2016.","chicago":"Soleymani, Mohammad, Behrouz Maham, and Farid Ashtiani. “Analysis of the Downlink Saturation Throughput of an Asymmetric IEEE 802.11n-Based WLAN.” In <i>2016 IEEE International Conference on Communications (ICC)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/icc.2016.7511453\">https://doi.org/10.1109/icc.2016.7511453</a>.","mla":"Soleymani, Mohammad, et al. “Analysis of the Downlink Saturation Throughput of an Asymmetric IEEE 802.11n-Based WLAN.” <i>2016 IEEE International Conference on Communications (ICC)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/icc.2016.7511453\">10.1109/icc.2016.7511453</a>.","ama":"Soleymani M, Maham B, Ashtiani F. Analysis of the downlink saturation throughput of an asymmetric IEEE 802.11n-based WLAN. In: <i>2016 IEEE International Conference on Communications (ICC)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/icc.2016.7511453\">10.1109/icc.2016.7511453</a>","bibtex":"@inproceedings{Soleymani_Maham_Ashtiani_2016, title={Analysis of the downlink saturation throughput of an asymmetric IEEE 802.11n-based WLAN}, DOI={<a href=\"https://doi.org/10.1109/icc.2016.7511453\">10.1109/icc.2016.7511453</a>}, booktitle={2016 IEEE International Conference on Communications (ICC)}, publisher={IEEE}, author={Soleymani, Mohammad and Maham, Behrouz and Ashtiani, Farid}, year={2016} }"},"extern":"1","date_created":"2024-04-05T09:08:15Z","type":"conference","department":[{"_id":"263"}],"year":"2016","status":"public","title":"Analysis of the downlink saturation throughput of an asymmetric IEEE 802.11n-based WLAN","author":[{"first_name":"Mohammad","last_name":"Soleymani","full_name":"Soleymani, Mohammad"},{"full_name":"Maham, Behrouz","last_name":"Maham","first_name":"Behrouz"},{"first_name":"Farid","last_name":"Ashtiani","full_name":"Ashtiani, Farid"}],"publication_status":"published","date_updated":"2024-04-05T13:17:53Z","language":[{"iso":"eng"}],"_id":"53279","publisher":"IEEE","user_id":"67076","doi":"10.1109/icc.2016.7511453"},{"user_id":"578","language":[{"iso":"ger"}],"_id":"52575","publisher":"WTM","publication_status":"published","date_updated":"2024-04-09T11:11:18Z","corporate_editor":["Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg"],"author":[{"id":"578","first_name":"Gerda","last_name":"Werth","full_name":"Werth, Gerda"}],"conference":{"end_date":"2016-03-11","start_date":"2016-03-07","name":"50. Tagung für Didaktik der Mathematik","location":"Heidelberg"},"status":"public","title":"Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?","year":"2016","department":[{"_id":"34"},{"_id":"10"},{"_id":"98"}],"type":"conference","date_created":"2024-03-14T11:23:04Z","place":"Münster","citation":{"ieee":"G. Werth, “Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?,” in <i>Beiträge zum Mathematikunterricht</i>, Heidelberg, 2016.","apa":"Werth, G. (2016). Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen? In Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg (Ed.), <i>Beiträge zum Mathematikunterricht</i>. WTM.","short":"G. Werth, in: Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg (Ed.), Beiträge zum Mathematikunterricht, WTM, Münster, 2016.","chicago":"Werth, Gerda. “Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?” In <i>Beiträge zum Mathematikunterricht</i>, edited by Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg. Münster: WTM, 2016.","mla":"Werth, Gerda. “Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?” <i>Beiträge zum Mathematikunterricht</i>, edited by Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg, WTM, 2016.","bibtex":"@inproceedings{Werth_2016, place={Münster}, title={Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?}, booktitle={Beiträge zum Mathematikunterricht}, publisher={WTM}, author={Werth, Gerda}, editor={Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg}, year={2016} }","ama":"Werth G. Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen? In: Institut für Mathematik und Informatik der Pädagogischen Hochschule Heidelberg, ed. <i>Beiträge zum Mathematikunterricht</i>. WTM; 2016."},"publication":"Beiträge zum Mathematikunterricht"},{"department":[{"_id":"643"}],"type":"book_chapter","place":"Münster","date_created":"2023-10-24T06:39:13Z","citation":{"bibtex":"@inbook{Wessel_Wilhelm_2016, place={Münster}, title={Zusammenhänge zwischen Sprachkompetenz und verstehensorientierter Leistung beim Umgang mit Brüchen}, booktitle={Beiträge zum Mathematikunterricht 2016}, publisher={WTM-Verlag}, author={Wessel, Lena and Wilhelm, Nadine}, editor={Institut für Mathematik und Informatik Heidelberg}, year={2016}, pages={1059–1062} }","ama":"Wessel L, Wilhelm N. Zusammenhänge zwischen Sprachkompetenz und verstehensorientierter Leistung beim Umgang mit Brüchen. In: Institut für Mathematik und Informatik Heidelberg, ed. <i>Beiträge zum Mathematikunterricht 2016</i>. WTM-Verlag; 2016:1059-1062.","mla":"Wessel, Lena, and Nadine Wilhelm. “Zusammenhänge zwischen Sprachkompetenz und verstehensorientierter Leistung beim Umgang mit Brüchen.” <i>Beiträge zum Mathematikunterricht 2016</i>, edited by Institut für Mathematik und Informatik Heidelberg, WTM-Verlag, 2016, pp. 1059–62.","short":"L. Wessel, N. Wilhelm, in: Institut für Mathematik und Informatik Heidelberg (Ed.), Beiträge zum Mathematikunterricht 2016, WTM-Verlag, Münster, 2016, pp. 1059–1062.","chicago":"Wessel, Lena, and Nadine Wilhelm. “Zusammenhänge zwischen Sprachkompetenz und verstehensorientierter Leistung beim Umgang mit Brüchen.” In <i>Beiträge zum Mathematikunterricht 2016</i>, edited by Institut für Mathematik und Informatik Heidelberg, 1059–62. Münster: WTM-Verlag, 2016.","ieee":"L. Wessel and N. Wilhelm, “Zusammenhänge zwischen Sprachkompetenz und verstehensorientierter Leistung beim Umgang mit Brüchen,” in <i>Beiträge zum Mathematikunterricht 2016</i>, Institut für Mathematik und Informatik Heidelberg, Ed. Münster: WTM-Verlag, 2016, pp. 1059–1062.","apa":"Wessel, L., &#38; Wilhelm, N. (2016). Zusammenhänge zwischen Sprachkompetenz und verstehensorientierter Leistung beim Umgang mit Brüchen. In Institut für Mathematik und Informatik Heidelberg (Ed.), <i>Beiträge zum Mathematikunterricht 2016</i> (pp. 1059–1062). WTM-Verlag."},"publication":"Beiträge zum Mathematikunterricht 2016","user_id":"37888","publisher":"WTM-Verlag","_id":"48396","language":[{"iso":"ger"}],"page":"1059-1062","main_file_link":[{"url":"https://core.ac.uk/download/pdf/83041701.pdf#page=510"}],"date_updated":"2024-04-18T09:17:11Z","author":[{"full_name":"Wessel, Lena","first_name":"Lena","last_name":"Wessel","id":"85190"},{"first_name":"Nadine","last_name":"Wilhelm","full_name":"Wilhelm, Nadine"}],"corporate_editor":["Institut für Mathematik und Informatik Heidelberg"],"status":"public","year":"2016","title":"Zusammenhänge zwischen Sprachkompetenz und verstehensorientierter Leistung beim Umgang mit Brüchen"},{"date_updated":"2024-04-18T09:18:34Z","author":[{"last_name":"Wessel","first_name":"Lena","full_name":"Wessel, Lena","id":"85190"},{"first_name":"Susanne","last_name":"Prediger","full_name":"Prediger, Susanne"},{"first_name":"Alexander","last_name":"Schüler-Meyer","full_name":"Schüler-Meyer, Alexander"},{"full_name":"Kuzu, Taha","last_name":"Kuzu","first_name":"Taha"}],"status":"public","year":"2016","title":"Is grade 7 too late to start with bilingual mathematics courses? An intervention study","user_id":"37888","_id":"48417","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://www.mathematik.tu-dortmund.de/~prediger/veroeff/16-ICME-MuM-Multi-Intervention.pdf"}],"citation":{"mla":"Wessel, Lena, et al. “Is Grade 7 Too Late to Start with Bilingual Mathematics Courses? An Intervention Study.” <i>TSG 32 at 13th International Congress on Mathematical Education, Hamburg, July 2016</i>, 2016.","bibtex":"@inproceedings{Wessel_Prediger_Schüler-Meyer_Kuzu_2016, title={Is grade 7 too late to start with bilingual mathematics courses? An intervention study}, booktitle={TSG 32 at 13th International Congress on Mathematical Education, Hamburg, July 2016}, author={Wessel, Lena and Prediger, Susanne and Schüler-Meyer, Alexander and Kuzu, Taha}, year={2016} }","ama":"Wessel L, Prediger S, Schüler-Meyer A, Kuzu T. Is grade 7 too late to start with bilingual mathematics courses? An intervention study. In: <i>TSG 32 at 13th International Congress on Mathematical Education, Hamburg, July 2016</i>. ; 2016.","ieee":"L. Wessel, S. Prediger, A. Schüler-Meyer, and T. Kuzu, “Is grade 7 too late to start with bilingual mathematics courses? An intervention study,” 2016.","apa":"Wessel, L., Prediger, S., Schüler-Meyer, A., &#38; Kuzu, T. (2016). Is grade 7 too late to start with bilingual mathematics courses? An intervention study. <i>TSG 32 at 13th International Congress on Mathematical Education, Hamburg, July 2016</i>.","chicago":"Wessel, Lena, Susanne Prediger, Alexander Schüler-Meyer, and Taha Kuzu. “Is Grade 7 Too Late to Start with Bilingual Mathematics Courses? An Intervention Study.” In <i>TSG 32 at 13th International Congress on Mathematical Education, Hamburg, July 2016</i>, 2016.","short":"L. Wessel, S. Prediger, A. Schüler-Meyer, T. Kuzu, in: TSG 32 at 13th International Congress on Mathematical Education, Hamburg, July 2016, 2016."},"publication":"TSG 32 at 13th International Congress on Mathematical Education, Hamburg, July 2016","department":[{"_id":"643"}],"type":"conference","date_created":"2023-10-24T08:26:51Z"},{"date_updated":"2024-05-20T06:34:09Z","publication_status":"published","status":"public","title":"Neugestaltung der \"Höheren Mathematik A, B und C für Elektrotechniker\" -- Nutzung der Lehrmaterialien durch Studierende","year":"2016","author":[{"orcid":"0000-0003-4125-1941","first_name":"Kerstin","last_name":"Hesse","full_name":"Hesse, Kerstin","id":"42608"}],"user_id":"71124","editor":[{"full_name":"Paravicini, Walther","first_name":"Walther","last_name":"Paravicini"},{"full_name":"Schnieder, Jörn","first_name":"Jörn","last_name":"Schnieder"}],"page":"86-102","_id":"54340","language":[{"iso":"eng"}],"publisher":"WTM-Verlag","publication":"Hanse-Kolloquium zur Hochschuldidaktik der Mathematik 2015: Beiträge zum gleichnamigen Symposium am 13. & 14. November 2015 an der Universität zu Lübeck (Hochschulschriften zur Mathematik-Didaktik) ","citation":{"ieee":"K. Hesse, “Neugestaltung der ‘Höheren Mathematik A, B und C für Elektrotechniker’ -- Nutzung der Lehrmaterialien durch Studierende,” in <i>Hanse-Kolloquium zur Hochschuldidaktik der Mathematik 2015: Beiträge zum gleichnamigen Symposium am 13. &#38; 14. November 2015 an der Universität zu Lübeck (Hochschulschriften zur Mathematik-Didaktik) </i>, 2016, pp. 86–102.","apa":"Hesse, K. (2016). Neugestaltung der “Höheren Mathematik A, B und C für Elektrotechniker” -- Nutzung der Lehrmaterialien durch Studierende. In W. Paravicini &#38; J. Schnieder (Eds.), <i>Hanse-Kolloquium zur Hochschuldidaktik der Mathematik 2015: Beiträge zum gleichnamigen Symposium am 13. &#38; 14. November 2015 an der Universität zu Lübeck (Hochschulschriften zur Mathematik-Didaktik) </i> (pp. 86–102). WTM-Verlag.","chicago":"Hesse, Kerstin. “Neugestaltung Der ‘Höheren Mathematik A, B Und C Für Elektrotechniker’ -- Nutzung Der Lehrmaterialien Durch Studierende.” In <i>Hanse-Kolloquium Zur Hochschuldidaktik Der Mathematik 2015: Beiträge Zum Gleichnamigen Symposium Am 13. &#38; 14. November 2015 an Der Universität Zu Lübeck (Hochschulschriften Zur Mathematik-Didaktik) </i>, edited by Walther Paravicini and Jörn Schnieder, 86–102. WTM-Verlag, 2016.","short":"K. Hesse, in: W. Paravicini, J. Schnieder (Eds.), Hanse-Kolloquium Zur Hochschuldidaktik Der Mathematik 2015: Beiträge Zum Gleichnamigen Symposium Am 13. &#38; 14. November 2015 an Der Universität Zu Lübeck (Hochschulschriften Zur Mathematik-Didaktik) , WTM-Verlag, 2016, pp. 86–102.","mla":"Hesse, Kerstin. “Neugestaltung Der ‘Höheren Mathematik A, B Und C Für Elektrotechniker’ -- Nutzung Der Lehrmaterialien Durch Studierende.” <i>Hanse-Kolloquium Zur Hochschuldidaktik Der Mathematik 2015: Beiträge Zum Gleichnamigen Symposium Am 13. &#38; 14. November 2015 an Der Universität Zu Lübeck (Hochschulschriften Zur Mathematik-Didaktik) </i>, edited by Walther Paravicini and Jörn Schnieder, WTM-Verlag, 2016, pp. 86–102.","bibtex":"@inproceedings{Hesse_2016, title={Neugestaltung der “Höheren Mathematik A, B und C für Elektrotechniker” -- Nutzung der Lehrmaterialien durch Studierende}, booktitle={Hanse-Kolloquium zur Hochschuldidaktik der Mathematik 2015: Beiträge zum gleichnamigen Symposium am 13. &#38; 14. November 2015 an der Universität zu Lübeck (Hochschulschriften zur Mathematik-Didaktik) }, publisher={WTM-Verlag}, author={Hesse, Kerstin}, editor={Paravicini, Walther and Schnieder, Jörn}, year={2016}, pages={86–102} }","ama":"Hesse K. Neugestaltung der “Höheren Mathematik A, B und C für Elektrotechniker” -- Nutzung der Lehrmaterialien durch Studierende. In: Paravicini W, Schnieder J, eds. <i>Hanse-Kolloquium Zur Hochschuldidaktik Der Mathematik 2015: Beiträge Zum Gleichnamigen Symposium Am 13. &#38; 14. November 2015 an Der Universität Zu Lübeck (Hochschulschriften Zur Mathematik-Didaktik) </i>. WTM-Verlag; 2016:86-102."},"type":"conference","department":[{"_id":"10"}],"date_created":"2024-05-18T01:13:13Z"}]