Rieskamp, Jonas, et al. “Approaches to Improve Fairness When Deploying AI-Based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research.” Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS), 2023.
LibreCat: /record/33490

Bossek, Jakob, et al. “On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.”10.1145/3583131.3590384__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2023, pp. 248–256, doi:10.1145/3583131.3590384.
LibreCat: /record/48869
DOI: 10.1145/3583131.3590384

Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary Algorithms?”10.1016/j.tcs.2023.113757__Theoretical Computer Science, 2023, p. 113757, doi:10.1016/j.tcs.2023.113757.
LibreCat: /record/48871
DOI: 10.1016/j.tcs.2023.113757

Moura, Lucia, et al. Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp. 40–57, doi:10.4230/DagRep.13.4.40.
LibreCat: /record/52127
DOI: 10.4230/DagRep.13.4.40

Nikfarjam, Adel, et al. “Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem.”10.1007/978-3-031-14714-2_17__Parallel Problem Solving from Nature (PPSN XVII), edited by Günter Rudolph et al., Springer International Publishing, 2022, pp. 237–249, doi:10.1007/978-3-031-14714-2_17.
LibreCat: /record/48894
DOI: 10.1007/978-3-031-14714-2_17

Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.”10.1016/j.tcs.2020.10.037__Theoretical Computer Science, vol. 852, 2021, pp. 41–60, doi:10.1016/j.tcs.2020.10.037.
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.”10.1016/j.tcs.2020.11.009__Theoretical Computer Science, vol. 852, 2021, pp. 29–40, doi:10.1016/j.tcs.2020.11.009.
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

Grimme, Christian, et al. “Peeking beyond Peaks: Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.”https://doi.org/10.1016/j.cor.2021.105489__Computers &; Operations Research, vol. 136, 2021, p. 105489, doi:https://doi.org/10.1016/j.cor.2021.105489.
LibreCat: /record/46318
DOI: https://doi.org/10.1016/j.cor.2021.105489

Bossek, Jakob, et al. “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.”10.1145/3449639.3459364__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 556–564, doi:10.1145/3449639.3459364.
LibreCat: /record/48853
DOI: 10.1145/3449639.3459364

Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.”10.1145/3449639.3459363__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 198–206, doi:10.1145/3449639.3459363.
LibreCat: /record/48860
DOI: 10.1145/3449639.3459363