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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary Algorithms?” Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–11.

Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance Differences for More than Just Two Algorithms.”10.1145/3449726.3463165__Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, 2021, pp. 1423–1432, doi:10.1145/3449726.3463165.

Nikfarjam, Adel, et al. “Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem.”10.1145/3449639.3459384__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 600–608, doi:10.1145/3449639.3459384.

Neumann, Aneta, et al. “Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions.”10.1145/3449639.3459385__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2021, pp. 261–269, doi:10.1145/3449639.3459385.

Nikfarjam, Adel, et al. “Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation.” Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–11.

Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.”10.1007/s00453-021-00838-3__Algorithmica, vol. 83, no. 10, 2021, pp. 3148–3179, doi:10.1007/s00453-021-00838-3.

Bossek, Jakob, et al. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.”10.1145/3377930.3390174__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 1277–1285, doi:10.1145/3377930.3390174.

Bossek, Jakob, et al. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.”10.1145/3377930.3390243__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 1286–1294, doi:10.1145/3377930.3390243.

Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.”10.1145/3377930.3390146__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 166–174, doi:10.1145/3377930.3390146.

Bossek, Jakob, et al. “Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.”10.1007/978-3-030-58112-1_24__Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, 2020, pp. 346–359, doi:10.1007/978-3-030-58112-1_24.