@article{45393,
  author       = {{Dröse, Jennifer and Prediger, Susanne}},
  journal      = {{Mathematik lehren 206}},
  pages        = {{8--12}},
  title        = {{{Strategien für Textaufgaben fördern – mit Info-Netzen und Formulierungsvariationen}}},
  year         = {{2018}},
}

@inproceedings{48839,
  abstract     = {{We analyze the effects of including local search techniques into a multi-objective evolutionary algorithm for solving a bi-objective orienteering problem with a single vehicle while the two conflicting objectives are minimization of travel time and maximization of the number of visited customer locations. Experiments are based on a large set of specifically designed problem instances with different characteristics and it is shown that local search techniques focusing on one of the objectives only improve the performance of the evolutionary algorithm in terms of both objectives. The analysis also shows that local search techniques are capable of sending locally optimal solutions to foremost fronts of the multi-objective optimization process, and that these solutions then become the leading factors of the evolutionary process.}},
  author       = {{Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-5618-3}},
  keywords     = {{combinatorial optimization, metaheuristics, multi-objective optimization, orienteering, transportation}},
  pages        = {{585–592}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Local Search Effects in Bi-Objective Orienteering}}},
  doi          = {{10.1145/3205455.3205548}},
  year         = {{2018}},
}

@inproceedings{48867,
  abstract     = {{Assessing the performance of stochastic optimization algorithms in the field of multi-objective optimization is of utmost importance. Besides the visual comparison of the obtained approximation sets, more sophisticated methods have been proposed in the last decade, e. g., a variety of quantitative performance indicators or statistical tests. In this paper, we present tools implemented in the R package ecr, which assist in performing comprehensive and sound comparison and evaluation of multi-objective evolutionary algorithms following recommendations from the literature.}},
  author       = {{Bossek, Jakob}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}},
  isbn         = {{978-1-4503-5764-7}},
  keywords     = {{evolutionary optimization, performance assessment, software-tools}},
  pages        = {{1350–1356}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr}}},
  doi          = {{10.1145/3205651.3208312}},
  year         = {{2018}},
}

@inproceedings{48885,
  abstract     = {{Performance comparisons of optimization algorithms are heavily influenced by the underlying indicator(s). In this paper we investigate commonly used performance indicators for single-objective stochastic solvers, such as the Penalized Average Runtime (e.g., PAR10) or the Expected Running Time (ERT), based on exemplary benchmark performances of state-of-the-art inexact TSP solvers. Thereby, we introduce a methodology for analyzing the effects of (usually heuristically set) indicator parametrizations - such as the penalty factor and the method used for aggregating across multiple runs - w.r.t. the robustness of the considered optimization algorithms.}},
  author       = {{Kerschke, Pascal and Bossek, Jakob and Trautmann, Heike}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}},
  isbn         = {{978-1-4503-5764-7}},
  keywords     = {{algorithm selection, optimization, performance measures, transportation, travelling salesperson problem}},
  pages        = {{1737–1744}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers}}},
  doi          = {{10.1145/3205651.3208233}},
  year         = {{2018}},
}

@book{48880,
  author       = {{Grimme, Christian and Bossek, Jakob}},
  isbn         = {{978-3-658-21150-9}},
  publisher    = {{Springer Vieweg}},
  title        = {{{Einführung in die Optimierung - Konzepte, Methoden und Anwendungen}}},
  doi          = {{10.1007/978-3-658-21151-6}},
  year         = {{2018}},
}

@article{48884,
  abstract     = {{The Travelling Salesperson Problem (TSP) is one of the best-studied NP-hard problems. Over the years, many different solution approaches and solvers have been developed. For the first time, we directly compare five state-of-the-art inexact solvers\textemdash namely, LKH, EAX, restart variants of those, and MAOS\textemdash on a large set of well-known benchmark instances and demonstrate complementary performance, in that different instances may be solved most effectively by different algorithms. We leverage this complementarity to build an algorithm selector, which selects the best TSP solver on a per-instance basis and thus achieves significantly improved performance compared to the single best solver, representing an advance in the state of the art in solving the Euclidean TSP. Our in-depth analysis of the selectors provides insight into what drives this performance improvement.}},
  author       = {{Kerschke, Pascal and Kotthoff, Lars and Bossek, Jakob and Hoos, Holger H. and Trautmann, Heike}},
  issn         = {{1063-6560}},
  journal      = {{Evolutionary Computation}},
  keywords     = {{automated algorithm selection, machine learning., performance modeling, Travelling Salesperson Problem}},
  number       = {{4}},
  pages        = {{597–620}},
  title        = {{{Leveraging TSP Solver Complementarity through Machine Learning}}},
  doi          = {{10.1162/evco_a_00215}},
  volume       = {{26}},
  year         = {{2018}},
}

@article{48866,
  abstract     = {{Bossek, (2018). grapherator: A Modular Multi-Step Graph Generator. Journal of Open Source Software, 3(22), 528, https://doi.org/10.21105/joss.00528}},
  author       = {{Bossek, Jakob}},
  issn         = {{2475-9066}},
  journal      = {{Journal of Open Source Software}},
  number       = {{22}},
  pages        = {{528}},
  title        = {{{Grapherator: A Modular Multi-Step Graph Generator}}},
  doi          = {{10.21105/joss.00528}},
  volume       = {{3}},
  year         = {{2018}},
}

@misc{31374,
  author       = {{Hoffmann, Max}},
  title        = {{{Konzeption von fachmathematischen Schnittstellenmodulen für Lehramtsstudierende am Beispiel ausgewählter Themen der höheren Analysis.}}},
  volume       = {{ 18 - 06}},
  year         = {{2018}},
}

@article{51388,
  author       = {{Hilgert, Joachim and Wurzbacher, T. and Alldridge, A.}},
  journal      = {{Journal of the Institute of Mathematics of Jussieu}},
  pages        = {{1065--1120}},
  title        = {{{Superorbits}}},
  doi          = {{10.1017/S147474801600030X}},
  volume       = {{17}},
  year         = {{2018}},
}

@inbook{51462,
  author       = {{Hilgert, Joachim}},
  booktitle    = {{Erscheinung und Vernunft - Wirklichkeitszugänge der Aufklärung}},
  editor       = {{Nieland, T.}},
  publisher    = {{Frank&Timme}},
  title        = {{{Von Fermat und Descartes zu Gauß und Cauchy - Der Wandel der Mathematik in der Zeit der Aufklärung}}},
  year         = {{2018}},
}

@unpublished{51523,
  author       = {{Hilgert, Joachim and Hansen, S. and Parthasarathy, A.}},
  title        = {{{Boundary Values of Eigenfunctions on Riemannian Symmetric Spaces}}},
  year         = {{2018}},
}

@misc{51571,
  author       = {{Hilgert, Joachim}},
  booktitle    = {{Mathematische Semesterberichte}},
  pages        = {{307--309}},
  title        = {{{Winfried Scharlau: Das Glück, Mathematiker zu sein – Friedrich Hirzebruch und seine Zeit (Springer Spektrum 2017)}}},
  volume       = {{65}},
  year         = {{2018}},
}

@misc{51572,
  author       = {{Hilgert, Joachim}},
  booktitle    = {{Mathematische Semesterberichte}},
  pages        = {{129--131}},
  title        = {{{Lemmermeyer, F: Quadratische Zahlkörper – Eine Einführung mit vielen Beispielen (Springer Spektrum 2017)}}},
  volume       = {{65}},
  year         = {{2018}},
}

@misc{51570,
  author       = {{Hilgert, Joachim}},
  booktitle    = {{Mathematische Semesterberichte}},
  pages        = {{311--313}},
  title        = {{{Barry Mazur und William Stein: Prime Numbers and the Riemann Hypothesis}}},
  volume       = {{65}},
  year         = {{2018}},
}

@misc{51574,
  author       = {{Hilgert, Joachim}},
  booktitle    = {{Mathematische Semesterberichte}},
  pages        = {{121--123}},
  title        = {{{Joseph, G.G. Indian Mathematics. Engaging with the World from Ancient to Modern Times (World Scientific 2016)}}},
  volume       = {{65}},
  year         = {{2018}},
}

@misc{51573,
  author       = {{Hilgert, Joachim}},
  booktitle    = {{Mathematische Semesterberichte}},
  pages        = {{125--127}},
  title        = {{{Diaconis, P.,  B. Skyrms: Ten great ideas about chance (Princeton University Press 2018)}}},
  volume       = {{65}},
  year         = {{2018}},
}

@inproceedings{6523,
  author       = {{Weber, Daniel and Rafsan Jani, Mohammad Iffat and Grabo, Matti and Wallscheid, Oliver and Klaus, Tobias and Krauter, Stefan and Böcker, Joachim}},
  booktitle    = {{World Conference on Photovoltaic Energy Conversion (WCPEC-7), 45th IEEE PVSC, 28th PVSEC, 34th EU PVSEC.}},
  location     = {{Waikoloa Village, Big Island, Hawaii (USA)}},
  title        = {{{Lifetime Extension of Photovoltaic Modules by Influencing the Module Temperature Using Phase Change Material}}},
  doi          = {{ 10.1109/PVSC.2018.8548115}},
  year         = {{2018}},
}

@misc{45974,
  author       = {{Kovács, Balázs}},
  title        = {{{Numerical analysis of partial differential equations on and of evolving surfaces}}},
  year         = {{2018}},
}

@article{45950,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The maximum principle forms an important qualitative property of second-order elliptic equations; therefore, its discrete analogues, the so-called discrete maximum principles (DMPs), have drawn much attention owing to their role in reinforcing the qualitative reliability of the given numerical scheme. In this paper DMPs are established for nonlinear finite element problems on surfaces with boundary, corresponding to the classical pointwise maximum principles on Riemannian manifolds in the spirit of Pucci &amp; Serrin (2007, The Maximum Principle. Springer). Various real-life examples illustrate the scope of the results.</jats:p>}},
  author       = {{Karátson, János and Kovács, Balázs and Korotov, Sergey}},
  issn         = {{0272-4979}},
  journal      = {{IMA Journal of Numerical Analysis}},
  keywords     = {{Applied Mathematics, Computational Mathematics, General Mathematics}},
  number       = {{2}},
  pages        = {{1241--1265}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Discrete maximum principles for nonlinear elliptic finite element problems on surfaces with boundary}}},
  doi          = {{10.1093/imanum/dry086}},
  volume       = {{40}},
  year         = {{2018}},
}

@article{45949,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>The maximum principle forms an important qualitative property of second-order elliptic equations; therefore, its discrete analogues, the so-called discrete maximum principles (DMPs), have drawn much attention owing to their role in reinforcing the qualitative reliability of the given numerical scheme. In this paper DMPs are established for nonlinear finite element problems on surfaces with boundary, corresponding to the classical pointwise maximum principles on Riemannian manifolds in the spirit of Pucci &amp; Serrin (2007, The Maximum Principle. Springer). Various real-life examples illustrate the scope of the results.</jats:p>}},
  author       = {{Karátson, János and Kovács, Balázs and Korotov, Sergey}},
  issn         = {{0272-4979}},
  journal      = {{IMA Journal of Numerical Analysis}},
  keywords     = {{Applied Mathematics, Computational Mathematics, General Mathematics}},
  number       = {{2}},
  pages        = {{1241--1265}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Discrete maximum principles for nonlinear elliptic finite element problems on surfaces with boundary}}},
  doi          = {{10.1093/imanum/dry086}},
  volume       = {{40}},
  year         = {{2018}},
}