@inproceedings{48893,
  abstract     = {{Computing diverse sets of high-quality solutions has gained increasing attention among the evolutionary computation community in recent years. It allows practitioners to choose from a set of high-quality alternatives. In this paper, we employ a population diversity measure, called the high-order entropy measure, in an evolutionary algorithm to compute a diverse set of high-quality solutions for the Traveling Salesperson Problem. In contrast to previous studies, our approach allows diversifying segments of tours containing several edges based on the entropy measure. We examine the resulting evolutionary diversity optimisation approach precisely in terms of the final set of solutions and theoretical properties. Experimental results show significant improvements compared to a recently proposed edge-based diversity optimisation approach when working with a large population of solutions or long segments.}},
  author       = {{Nikfarjam, Adel and Bossek, Jakob and Neumann, Aneta and Neumann, Frank}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-8350-9}},
  keywords     = {{evolutionary algorithms, evolutionary diversity optimisation, high-order entropy, traveling salesperson problem}},
  pages        = {{600–608}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem}}},
  doi          = {{10.1145/3449639.3459384}},
  year         = {{2021}},
}

@inproceedings{48891,
  abstract     = {{Submodular functions allow to model many real-world optimisation problems. This paper introduces approaches for computing diverse sets of high quality solutions for submodular optimisation problems with uniform and knapsack constraints. We first present diversifying greedy sampling approaches and analyse them with respect to the diversity measured by entropy and the approximation quality of the obtained solutions. Afterwards, we introduce an evolutionary diversity optimisation (EDO) approach to further improve diversity of the set of solutions. We carry out experimental investigations on popular submodular benchmark problems and analyse trade-offs in terms of solution quality and diversity of the resulting solution sets.}},
  author       = {{Neumann, Aneta and Bossek, Jakob and Neumann, Frank}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{978-1-4503-8350-9}},
  keywords     = {{evolutionary algorithms, evolutionary diversity optimisation, sub-modular functions}},
  pages        = {{261–269}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions}}},
  doi          = {{10.1145/3449639.3459385}},
  year         = {{2021}},
}

@inbook{48892,
  abstract     = {{Evolutionary algorithms based on edge assembly crossover (EAX) constitute some of the best performing incomplete solvers for the well-known traveling salesperson problem (TSP). Often, it is desirable to compute not just a single solution for a given problem, but a diverse set of high quality solutions from which a decision maker can choose one for implementation. Currently, there are only a few approaches for computing a diverse solution set for the TSP. Furthermore, almost all of them assume that the optimal solution is known. In this paper, we introduce evolutionary diversity optimisation (EDO) approaches for the TSP that find a diverse set of tours when the optimal tour is known or unknown. We show how to adopt EAX to not only find a high-quality solution but also to maximise the diversity of the population. The resulting EAX-based EDO approach, termed EAX-EDO is capable of obtaining diverse high-quality tours when the optimal solution for the TSP is known or unknown. A comparison to existing approaches shows that they are clearly outperformed by EAX-EDO.}},
  author       = {{Nikfarjam, Adel and Bossek, Jakob and Neumann, Aneta and Neumann, Frank}},
  booktitle    = {{Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms}},
  isbn         = {{978-1-4503-8352-3}},
  keywords     = {{edge assembly crossover (EAX), evolutionary algorithms, evolutionary diversity optimisation (EDO), traveling salesperson problem (TSP)}},
  pages        = {{1–11}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation}}},
  year         = {{2021}},
}

@article{48854,
  abstract     = {{We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs 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. The (1+1) Evolutionary Algorithm and RLS operate in a setting where the number of colors is bounded and we are minimizing the number of conflicts. Iterated local search algorithms use an unbounded color palette and aim to use the smallest colors and, consequently, 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. We further show that tailoring mutation operators to parts of the graph where changes have occurred can significantly reduce the expected reoptimization time. In most settings the expected reoptimization time for such tailored algorithms is linear in the number of added edges. However, tailored algorithms cannot prevent exponential times in settings where the original algorithm is inefficient.}},
  author       = {{Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}},
  issn         = {{0178-4617}},
  journal      = {{Algorithmica}},
  keywords     = {{Dynamic optimization, Evolutionary algorithms, Running time analysis}},
  number       = {{10}},
  pages        = {{3148–3179}},
  title        = {{{Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}}},
  doi          = {{10.1007/s00453-021-00838-3}},
  volume       = {{83}},
  year         = {{2021}},
}

@inproceedings{22218,
  author       = {{Krauter, Stefan and Böcker, Joachim and Freitag, Christine and Hehenkamp, Burkhard and Hilleringmann, Ulrich and Temmen, Katrin and Klaus, Tobias and Rohrer, Nicolaus and Lehmann, Sven}},
  booktitle    = {{Tagungsband des 36. PV-Symposiums, 18.-26 Mai 2021}},
  isbn         = {{978-3-948176-14-3}},
  keywords     = {{Art-D, Afrika, Resilienz, Resilience, Grid stability, robustness, microgrids}},
  location     = {{Staffelstein / online}},
  pages        = {{305--309}},
  publisher    = {{Conexio}},
  title        = {{{Projekt Art-D Grids: Nachhaltige und stabile Microgrids in Afrika - eine Plattform für Forschung und Lehre für die Entwicklung}}},
  year         = {{2021}},
}

@inproceedings{29937,
  author       = {{Karp, Martin and Podobas, Artur and Jansson, Niclas and Kenter, Tobias and Plessl, Christian and Schlatter, Philipp and Markidis, Stefano}},
  booktitle    = {{2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}},
  publisher    = {{IEEE}},
  title        = {{{High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection}}},
  doi          = {{10.1109/ipdps49936.2021.00116}},
  year         = {{2021}},
}

@article{31263,
  author       = {{Guillarmou, Colin and Hilgert, Joachim and Weich, Tobias}},
  issn         = {{2644-9463}},
  journal      = {{Annales Henri Lebesgue}},
  pages        = {{81--119}},
  publisher    = {{Cellule MathDoc/CEDRAM}},
  title        = {{{High frequency limits for invariant Ruelle densities}}},
  doi          = {{10.5802/ahl.67}},
  volume       = {{4}},
  year         = {{2021}},
}

@article{36271,
  author       = {{Brennecken, Dominik and Hilgert, Joachim and Ciardo, Lorenzo}},
  journal      = {{Journal of Lie Theory}},
  number       = {{2}},
  pages        = {{459----468}},
  publisher    = {{Heldermann Verlag}},
  title        = {{{Algebraically Independent Generators for the Algebra of Invariant Differential Operators on SLn(R)/SOn(R)}}},
  doi          = {{10.48550/arXiv.2008.07479}},
  volume       = {{31}},
  year         = {{2021}},
}

@misc{51556,
  author       = {{Hilgert, Joachim}},
  booktitle    = {{Mathematische Semesterberichte}},
  pages        = {{171–173}},
  title        = {{{Philip Ording: 99 Variations on a Proof. Princeton University Press 2019}}},
  doi          = {{10.1007/s00591-021-00295-7}},
  volume       = {{68}},
  year         = {{2021}},
}

@misc{51555,
  author       = {{Hilgert, Joachim}},
  booktitle    = {{Mathematische Semesterberichte}},
  pages        = {{175–177}},
  title        = {{{Georg Glaeser (Hrsg.): 77-mal Mathematik für zwischendurch – Unterhaltsame Kuriositäten und unorthodoxe Anwendungen. Springer Spektrum 2020}}},
  doi          = {{10.1007/s00591-021-00296-6}},
  volume       = {{68}},
  year         = {{2021}},
}

@inproceedings{52927,
  author       = {{Gil, Oliver Fernández and Turhan, Anni-Yasmin}},
  booktitle    = {{Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021}},
  pages        = {{6340–6348}},
  publisher    = {{AAAI Press}},
  title        = {{{Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics}}},
  doi          = {{10.1609/AAAI.V35I7.16787}},
  year         = {{2021}},
}

@article{52926,
  author       = {{Dubslaff, Clemens and Koopmann, Patrick and Turhan, Anni-Yasmin}},
  journal      = {{Formal Aspects Comput.}},
  number       = {{6}},
  pages        = {{885–921}},
  title        = {{{Enhancing Probabilistic Model Checking with Ontologies}}},
  doi          = {{10.1007/S00165-021-00549-0}},
  volume       = {{33}},
  year         = {{2021}},
}

@inproceedings{52849,
  author       = {{Podworny, Susanne and Fleischer, Yannik and Hüsing, Sven and Biehler, Rolf and Frischemeier, Daniel and Höper, Lukas and Schulte, Carsten}},
  booktitle    = {{Proceedings of the 21st Koli Calling International Conference on Computing Education Research}},
  publisher    = {{ACM}},
  title        = {{{Using data cards for teaching data based decision trees in middle school}}},
  doi          = {{10.1145/3488042.3489966}},
  year         = {{2021}},
}

@inproceedings{22285,
  author       = {{Biermeier, Kai and Yigitbas, Enes and Weidmann, Nils and Engels, Gregor}},
  booktitle    = {{Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use }},
  title        = {{{Ensuring User Interface Adaptation Consistency through Triple Graph Grammers}}},
  year         = {{2021}},
}

@article{45967,
  author       = {{Binz, Tim and Kovács, Balázs}},
  journal      = {{arXiv}},
  title        = {{{A convergent finite element algorithm for mean curvature flow in higher codimension}}},
  year         = {{2021}},
}

@article{45962,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>An algorithm is proposed for generalized mean curvature flow of closed two-dimensional surfaces, which include inverse mean curvature flow and powers of mean and inverse mean curvature flow. Error estimates are proved for semidiscretizations and full discretizations for the generalized flow. The algorithm proposed and studied here combines evolving surface finite elements, whose nodes determine the discrete surface, and linearly implicit backward difference formulae for time integration. The numerical method is based on a system coupling the surface evolution to nonlinear second-order parabolic evolution equations for the normal velocity and normal vector. A convergence proof is presented in the case of finite elements of polynomial degree at least 2 and backward difference formulae of orders 2 to 5. The error analysis combines stability estimates and consistency estimates to yield optimal-order $H^1$-norm error bounds for the computed surface position, velocity, normal vector, normal velocity and therefore for the mean curvature. The stability analysis is performed in the matrix–vector formulation and is independent of geometric arguments, which only enter the consistency analysis. Numerical experiments are presented to illustrate the convergence results and also to report on monotone quantities, e.g. Hawking mass for inverse mean curvature flow, and complemented by experiments for nonconvex surfaces.</jats:p>}},
  author       = {{Binz, Tim and Kovács, Balázs}},
  issn         = {{0272-4979}},
  journal      = {{IMA Journal of Numerical Analysis}},
  keywords     = {{Applied Mathematics, Computational Mathematics, General Mathematics}},
  number       = {{3}},
  pages        = {{2545--2588}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{A convergent finite element algorithm for generalized mean curvature flows of closed surfaces}}},
  doi          = {{10.1093/imanum/drab043}},
  volume       = {{42}},
  year         = {{2021}},
}

@article{45957,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>A proof of convergence is given for a bulk–surface finite element semidiscretisation of the Cahn–Hilliard equation with Cahn–Hilliard-type dynamic boundary conditions in a smooth domain. The semidiscretisation is studied in an abstract weak formulation as a second-order system. Optimal-order uniform-in-time error estimates are shown in the $L^2$- and $H^1$-norms. The error estimates are based on a consistency and stability analysis. The proof of stability is performed in an abstract framework, based on energy estimates exploiting the anti-symmetric structure of the second-order system. Numerical experiments illustrate the theoretical results.</jats:p>}},
  author       = {{Harder, Paula and Kovács, Balázs}},
  issn         = {{0272-4979}},
  journal      = {{IMA Journal of Numerical Analysis}},
  keywords     = {{Applied Mathematics, Computational Mathematics, General Mathematics}},
  number       = {{3}},
  pages        = {{2589--2620}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Error estimates for the Cahn–Hilliard equation with dynamic boundary conditions}}},
  doi          = {{10.1093/imanum/drab045}},
  volume       = {{42}},
  year         = {{2021}},
}

@article{45961,
  author       = {{Nick, Jörg and Kovács, Balázs and Lubich, Christian}},
  issn         = {{0029-599X}},
  journal      = {{Numerische Mathematik}},
  keywords     = {{Applied Mathematics, Computational Mathematics}},
  number       = {{4}},
  pages        = {{997--1000}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Correction to: Stable and convergent fully discrete interior–exterior coupling of Maxwell’s equations}}},
  doi          = {{10.1007/s00211-021-01196-6}},
  volume       = {{147}},
  year         = {{2021}},
}

@article{45959,
  author       = {{Kovács, Balázs and Li, Buyang and Lubich, Christian}},
  issn         = {{0029-599X}},
  journal      = {{Numerische Mathematik}},
  keywords     = {{Applied Mathematics, Computational Mathematics}},
  number       = {{3}},
  pages        = {{595--643}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{A convergent evolving finite element algorithm for Willmore flow of closed surfaces}}},
  doi          = {{10.1007/s00211-021-01238-z}},
  volume       = {{149}},
  year         = {{2021}},
}

@article{34629,
  author       = {{Hesse, Kerstin and Sloan, Ian H. and Womersley, Robert S.}},
  issn         = {{0377-0427}},
  journal      = {{Journal of Computational and Applied Mathematics}},
  keywords     = {{Applied Mathematics, Computational Mathematics}},
  publisher    = {{Elsevier BV}},
  title        = {{{Local RBF-based penalized least-squares approximation on the sphere with noisy scattered data}}},
  doi          = {{10.1016/j.cam.2020.113061}},
  volume       = {{382}},
  year         = {{2021}},
}