@article{13246, author = {{Schneider, Martin and Iseke, Anja and Pull, Kerstin}}, issn = {{0958-5192}}, journal = {{The International Journal of Human Resource Management}}, pages = {{1--23}}, title = {{{The gender pay gap in European executive boards: the role of executives’ pathway into the board}}}, doi = {{10.1080/09585192.2019.1620307}}, year = {{2019}}, } @article{13244, author = {{Schneider, Martin R. and Iseke, Anja and Pull, Kerstin}}, issn = {{0958-5192}}, journal = {{The International Journal of Human Resource Management}}, pages = {{1--23}}, title = {{{The gender pay gap in European executive boards: the role of executives’ pathway into the board}}}, doi = {{10.1080/09585192.2019.1620307}}, year = {{2019}}, } @inbook{49186, author = {{Gretz, Daniela}}, booktitle = {{Verfahren und diskursive Verortungen einer Kurzprosaform vom Poetischen Realismus bis zur Frühen Moderne}}, editor = {{Assmann, David-Christopher and Tetzlaff, Stefan}}, pages = {{87−101}}, publisher = {{Universitätsverlag Winter}}, title = {{{»Freilich, nur bruchstückartig ist, was er erzählt; aber er erzählt gut.« Wilhelm Raabes immanente ›Poetik der Skizze‹}}}, volume = {{58}}, year = {{2019}}, } @misc{49248, author = {{Gretz, Daniela}}, booktitle = {{Limbus. Australisches Jahrbuch für germanistische Literatur- und Kulturwissenschaft}}, pages = {{205−208}}, title = {{{Rolf Parr: Die Fremde als Heimat. Heimatkunst, Kolonialismus, Expeditionen}}}, volume = {{10}}, year = {{2019}}, } @misc{49247, author = {{Gretz, Daniela}}, booktitle = {{Jahrbuch der Raabe-Gesellschaft}}, pages = {{211−216}}, title = {{{Florian Krobb: Vorkoloniale Afrika-Penetrationen. Diskursive Vorstöße ins »Herz des großen Continents« in der deutschen Reiseliteratur (ca. 1850-1890)}}}, year = {{2019}}, } @article{49405, author = {{Kammeyer, Katharina and Kamcili-Yildiz, Naciye and Keuchen, Marion}}, journal = {{Junge Kirche}}, number = {{80}}, publisher = {{Erev-Rav}}, title = {{{Vertrauenskrise. Ein christlich-muslimisches Gespräch über Ibrahim und Abraham Prüfung}}}, year = {{2019}}, } @article{34917, abstract = {{We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of (V,q). This yields a good algorithm to enumerate a system of representatives of proper isometry classes of lattices in genera of maximal lattices in (V,q).}}, author = {{Kirschmer, Markus and Nebe, Gabriele}}, issn = {{1793-0421}}, journal = {{International Journal of Number Theory}}, keywords = {{Algebra and Number Theory}}, number = {{02}}, pages = {{309--325}}, publisher = {{World Scientific Pub Co Pte Lt}}, title = {{{Quaternary quadratic lattices over number fields}}}, doi = {{10.1142/s1793042119500131}}, volume = {{15}}, year = {{2019}}, } @article{34916, abstract = {{We describe the powers of irreducible polynomials occurring as characteristic polynomials of automorphisms of even unimodular lattices over number fields. This generalizes results of Gross & McMullen and Bayer-Fluckiger & Taelman.}}, author = {{Kirschmer, Markus}}, issn = {{0022-314X}}, journal = {{Journal of Number Theory}}, keywords = {{Algebra and Number Theory}}, pages = {{121--134}}, publisher = {{Elsevier BV}}, title = {{{Automorphisms of even unimodular lattices over number fields}}}, doi = {{10.1016/j.jnt.2018.08.004}}, volume = {{197}}, year = {{2019}}, } @techreport{47083, author = {{Habla, Wolfgang and Huwe, Vera and Kesternich, Martin}}, issn = {{0043-6275}}, keywords = {{Business, Management and Accounting (miscellaneous)}}, pages = {{330--334}}, publisher = {{Wirtschaftsdienst 99(5), 330-334}}, title = {{{Tempolimits und Grenzwerte: für eine evidenzbasierte verkehrspolitische Debatte}}}, doi = {{10.1007/s10273-019-2452-6}}, volume = {{99(5)}}, year = {{2019}}, } @techreport{47081, author = {{Kesternich, Martin}}, publisher = {{MRN: E-Mobilität in der Metropolregion Rhein-Neckar}}, title = {{{Eine City-Maut ist Diesel-Fahrverboten in Städten klar überlegen}}}, year = {{2019}}, } @article{49536, author = {{Meyer zu Hörste-Bührer, Raphaela}}, journal = {{Evangelische Theologie 79}}, pages = {{210–222}}, title = {{{Ethik zwischen Universalisierbarkeit und Lebensnähe. Zeitimplikate in den Referenzbegriffen der Ethikdefinition}}}, year = {{2019}}, } @article{49537, author = {{Meyer zu Hörste-Bührer, Raphaela}}, journal = {{Journal of Ethics in Antiquity and Christianity 1 }}, pages = {{3--8}}, title = {{{Editorial: Ethik in Antike und Christentum / Editorial: Ethics in Antiquity and Christianity}}}, year = {{2019}}, } @inproceedings{48841, abstract = {{We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. The goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies.}}, author = {{Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}}, booktitle = {{Evolutionary Multi-Criterion Optimization (EMO)}}, editor = {{Deb, Kalyanmoy and Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}}, isbn = {{978-3-030-12598-1}}, keywords = {{Combinatorial optimization, Dynamic optimization, Metaheuristics, Multi-objective optimization, Vehicle routing}}, pages = {{516–528}}, publisher = {{Springer International Publishing}}, title = {{{Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm}}}, doi = {{10.1007/978-3-030-12598-1_41}}, year = {{2019}}, } @inproceedings{48842, abstract = {{Evolutionary algorithms have successfully been applied to evolve problem instances that exhibit a significant difference in performance for a given algorithm or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP). Creating a large variety of instances is crucial for successful applications in the blooming field of algorithm selection. In this paper, we introduce new and creative mutation operators for evolving instances of the TSP. We show that adopting those operators in an evolutionary algorithm allows for the generation of benchmark sets with highly desirable properties: (1) novelty by clear visual distinction to established benchmark sets in the field, (2) visual and quantitative diversity in the space of TSP problem characteristics, and (3) significant performance differences with respect to the restart versions of heuristic state-of-the-art TSP solvers EAX and LKH. The important aspect of diversity is addressed and achieved solely by the proposed mutation operators and not enforced by explicit diversity preservation.}}, author = {{Bossek, Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}}, booktitle = {{Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}}, isbn = {{978-1-4503-6254-2}}, keywords = {{benchmarking, instance features, optimization, problem generation, traveling salesperson problem}}, pages = {{58–71}}, publisher = {{Association for Computing Machinery}}, title = {{{Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators}}}, doi = {{10.1145/3299904.3340307}}, year = {{2019}}, } @inproceedings{48843, abstract = {{We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. This includes the (1+1) EA and RLS in a setting where the number of colors is bounded and we are minimizing the number of conflicts as well as iterated local search algorithms that use an unbounded color palette and aim to use the smallest colors and - as a consequence - the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i. e. starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. Furthermore, we show how to speed up computations by using problem specific operators concentrating on parts of the graph where changes have occurred.}}, author = {{Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-6111-8}}, keywords = {{dynamic optimization, evolutionary algorithms, running time analysis, theory}}, pages = {{1443–1451}}, publisher = {{Association for Computing Machinery}}, title = {{{Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring}}}, doi = {{10.1145/3321707.3321792}}, year = {{2019}}, } @inproceedings{48840, abstract = {{Research has shown that for many single-objective graph problems where optimum solutions are composed of low weight sub-graphs, such as the minimum spanning tree problem (MST), mutation operators favoring low weight edges show superior performance. Intuitively, similar observations should hold for multi-criteria variants of such problems. In this work, we focus on the multi-criteria MST problem. A thorough experimental study is conducted where we estimate the probability of edges being part of non-dominated spanning trees as a function of the edges’ non-domination level or domination count, respectively. Building on gained insights, we propose several biased one-edge-exchange mutation operators that differ in the used edge-selection probability distribution (biased towards edges of low rank). Our empirical analysis shows that among different graph types (dense and sparse) and edge weight types (both uniformly random and combinations of Euclidean and uniformly random) biased edge-selection strategies perform superior in contrast to the baseline uniform edge-selection. Our findings are in particular strong for dense graphs.}}, author = {{Bossek, Jakob and Grimme, Christian and Neumann, Frank}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-6111-8}}, keywords = {{biased mutation, combinatorial optimization, minimum spanning tree, multi-objective optimization}}, pages = {{516–523}}, publisher = {{Association for Computing Machinery}}, title = {{{On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem}}}, doi = {{10.1145/3321707.3321818}}, year = {{2019}}, } @inproceedings{48858, abstract = {{The $$\textbackslash mathcal NP$$-hard multi-criteria shortest path problem (mcSPP) is of utmost practical relevance, e.~g., in navigation system design and logistics. We address the problem of approximating the Pareto-front of the mcSPP with sum objectives. We do so by proposing a new mutation operator for multi-objective evolutionary algorithms that solves single-objective versions of the shortest path problem on subgraphs. A rigorous empirical benchmark on a diverse set of problem instances shows the effectiveness of the approach in comparison to a well-known mutation operator in terms of convergence speed and approximation quality. In addition, we glance at the neighbourhood structure and similarity of obtained Pareto-optimal solutions and derive promising directions for future work.}}, author = {{Bossek, Jakob and Grimme, Christian}}, booktitle = {{Learning and Intelligent Optimization}}, editor = {{Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}}, isbn = {{978-3-030-05348-2}}, pages = {{184–198}}, publisher = {{Springer International Publishing}}, title = {{{Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems}}}, doi = {{10.1007/978-3-030-05348-2_17}}, year = {{2019}}, } @inproceedings{48870, abstract = {{The edge coloring problem asks for an assignment of colors to edges of a graph such that no two incident edges share the same color and the number of colors is minimized. It is known that all graphs with maximum degree {$\Delta$} can be colored with {$\Delta$} or {$\Delta$} + 1 colors, but it is NP-hard to determine whether {$\Delta$} colors are sufficient. We present the first runtime analysis of evolutionary algorithms (EAs) for the edge coloring problem. Simple EAs such as RLS and (1+1) EA efficiently find (2{$\Delta$} - 1)-colorings on arbitrary graphs and optimal colorings for even and odd cycles, paths, star graphs and arbitrary trees. A partial analysis for toroids also suggests efficient runtimes in bipartite graphs with many cycles. Experiments support these findings and investigate additional graph classes such as hypercubes, complete graphs and complete bipartite graphs. Theoretical and experimental results suggest that simple EAs find optimal colorings for all these graph classes in expected time O({$\Delta\mathscrl$}2m log m), where m is the number of edges and {$\mathscrl$} is the length of the longest simple path in the graph.}}, author = {{Bossek, Jakob and Sudholt, Dirk}}, booktitle = {{Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}}, isbn = {{978-1-4503-6254-2}}, keywords = {{edge coloring problem, runtime analysis}}, pages = {{102–115}}, publisher = {{Association for Computing Machinery}}, title = {{{Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem}}}, doi = {{10.1145/3299904.3340311}}, year = {{2019}}, } @inproceedings{48875, abstract = {{A multiobjective perspective onto common performance measures such as the PAR10 score or the expected runtime of single-objective stochastic solvers is presented by directly investigating the tradeoff between the fraction of failed runs and the average runtime. Multi-objective indicators operating in the bi-objective space allow for an overall performance comparison on a set of instances paving the way for instance-based automated algorithm selection techniques.}}, author = {{Bossek, Jakob and Trautmann, Heike}}, booktitle = {{Learning and Intelligent Optimization}}, editor = {{Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}}, isbn = {{978-3-030-05348-2}}, keywords = {{Algorithm selection, Performance measurement}}, pages = {{215–219}}, publisher = {{Springer International Publishing}}, title = {{{Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time}}}, doi = {{10.1007/978-3-030-05348-2_19}}, year = {{2019}}, } @article{48877, abstract = {{OpenML is an online machine learning platform where researchers can easily share data, machine learning tasks and experiments as well as organize them online to work and collaborate more efficiently. In this paper, we present an R package to interface with the OpenML platform and illustrate its usage in combination with the machine learning R package mlr (Bischl et al. J Mach Learn Res 17(170):1—5, 2016). We show how the OpenML package allows R users to easily search, download and upload data sets and machine learning tasks. Furthermore, we also show how to upload results of experiments, share them with others and download results from other users. Beyond ensuring reproducibility of results, the OpenML platform automates much of the drudge work, speeds up research, facilitates collaboration and increases the users’ visibility online.}}, author = {{Casalicchio, Giuseppe and Bossek, Jakob and Lang, Michel and Kirchhoff, Dominik and Kerschke, Pascal and Hofner, Benjamin and Seibold, Heidi and Vanschoren, Joaquin and Bischl, Bernd}}, issn = {{0943-4062}}, journal = {{Computational Statistics}}, keywords = {{Databases, Machine learning, R, Reproducible research}}, number = {{3}}, pages = {{977–991}}, title = {{{OpenML: An R Package to Connect to the Machine Learning Platform OpenML}}}, doi = {{10.1007/s00180-017-0742-2}}, volume = {{34}}, year = {{2019}}, }