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

Bossek, Jakob, Aneta Neumann, and Frank Neumann. “On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.”https://doi.org/10.1145/3583131.3590384__In Proceedings of the Genetic and Evolutionary Computation Conference, 248–256. GECCO’23. New York, NY, USA: Association for Computing Machinery, 2023.https://doi.org/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?”https://doi.org/10.1016/j.tcs.2023.113757__Theoretical Computer Science, 2023, 113757.https://doi.org/10.1016/j.tcs.2023.113757 .
LibreCat: /record/48871
DOI: 10.1016/j.tcs.2023.113757

Moura, Lucia, Anamari Nakic, Patric Östergård, Alfred Wassermann, and Charlene Weiß. Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Vol. 13, Issue 4. Dagstuhl Reports. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/DagRep.13.4.40 .
LibreCat: /record/52127
DOI: 10.4230/DagRep.13.4.40

Nikfarjam, Adel, Aneta Neumann, Jakob Bossek, and Frank Neumann. “Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem.”https://doi.org/10.1007/978-3-031-14714-2_17__In Parallel Problem Solving from Nature (PPSN XVII), edited by Günter Rudolph, Anna V. Kononova, Hernán Aguirre, Pascal Kerschke, Gabriela Ochoa, and Tea Tu\'76 sar, 237–249. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2022.https://doi.org/10.1007/978-3-031-14714-2_17 .
LibreCat: /record/48894
DOI: 10.1007/978-3-031-14714-2_17

Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.”https://doi.org/10.1016/j.tcs.2020.10.037__Theoretical Computer Science 852 (2021): 41–60.https://doi.org/10.1016/j.tcs.2020.10.037 .
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.”https://doi.org/10.1016/j.tcs.2020.11.009__Theoretical Computer Science 852 (2021): 29–40.https://doi.org/10.1016/j.tcs.2020.11.009 .
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

Grimme, Christian, Pascal Kerschke, Pelin Aspar, Heike Trautmann, Mike Preuss, André H. Deutz, Hao Wang, and Michael Emmerich. “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 136 (2021): 105489.https://doi.org/10.1016/j.cor.2021.105489 .
LibreCat: /record/46318
DOI: https://doi.org/10.1016/j.cor.2021.105489

Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.”https://doi.org/10.1145/3449639.3459364__In Proceedings of the Genetic and Evolutionary Computation Conference, 556–564. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021.https://doi.org/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.”https://doi.org/10.1145/3449639.3459363__In Proceedings of the Genetic and Evolutionary Computation Conference, 198–206. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021.https://doi.org/10.1145/3449639.3459363 .
LibreCat: /record/48860
DOI: 10.1145/3449639.3459363