Rieskamp, J., Hofeditz, L., Mirbabaie, M., &; Stieglitz, S. (2023). 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). Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS).
LibreCat: /record/33490

Bossek, J., Neumann, A., &; Neumann, F. (2023). On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 248–256.https://doi.org/10.1145/3583131.3590384 
LibreCat: /record/48869
DOI: 10.1145/3583131.3590384

Bossek, J., &; Sudholt, D. (2023). Do Additional Target Points Speed Up Evolutionary Algorithms? Theoretical Computer Science, 113757.https://doi.org/10.1016/j.tcs.2023.113757 
LibreCat: /record/48871
DOI: 10.1016/j.tcs.2023.113757

Moura, L., Nakic, A., Östergård, P., Wassermann, A., &; Weiß, C. (2023). Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161) (Vols. 13, Issue 4, pp. 40–57). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/DagRep.13.4.40 
LibreCat: /record/52127
DOI: 10.4230/DagRep.13.4.40

Nikfarjam, A., Neumann, A., Bossek, J., &; Neumann, F. (2022). Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. In G. Rudolph, A. V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, &; T. Tu\'76 sar (Eds.), Parallel Problem Solving from Nature (PPSN XVII) (pp. 237–249). Springer International Publishing.https://doi.org/10.1007/978-3-031-14714-2_17 
LibreCat: /record/48894
DOI: 10.1007/978-3-031-14714-2_17

Li, S., Markarian, C., Meyer auf der Heide, F., &; Podlipyan, P. (2021). A continuous strategy for collisionless gathering. Theoretical Computer Science, 852, 41–60.https://doi.org/10.1016/j.tcs.2020.10.037 
LibreCat: /record/22510
DOI: 10.1016/j.tcs.2020.10.037

Li, S., Meyer auf der Heide, F., &; Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. Theoretical Computer Science, 852, 29–40.https://doi.org/10.1016/j.tcs.2020.11.009 
LibreCat: /record/22511
DOI: 10.1016/j.tcs.2020.11.009

Grimme, C., Kerschke, P., Aspar, P., Trautmann, H., Preuss, M., Deutz, A. H., Wang, H., &; Emmerich, M. (2021). Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. Computers &; Operations Research, 136, 105489.https://doi.org/10.1016/j.cor.2021.105489 
LibreCat: /record/46318
DOI: https://doi.org/10.1016/j.cor.2021.105489

Bossek, J., Neumann, A., &; Neumann, F. (2021). Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference, 556–564.https://doi.org/10.1145/3449639.3459364 
LibreCat: /record/48853
DOI: 10.1145/3449639.3459364

Bossek, J., &; Neumann, F. (2021). Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 198–206.https://doi.org/10.1145/3449639.3459363 
LibreCat: /record/48860
DOI: 10.1145/3449639.3459363

Bossek, J., &; Sudholt, D. (2021). Do Additional Optima Speed up Evolutionary Algorithms? In Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (pp. 1–11). Association for Computing Machinery.
LibreCat: /record/48862

Bossek, J., &; Wagner, M. (2021). Generating Instances with Performance Differences for More than Just Two Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference Companion, 1423–1432.https://doi.org/10.1145/3449726.3463165 
LibreCat: /record/48876
DOI: 10.1145/3449726.3463165

Nikfarjam, A., Bossek, J., Neumann, A., &; Neumann, F. (2021). Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 600–608.https://doi.org/10.1145/3449639.3459384 
LibreCat: /record/48893
DOI: 10.1145/3449639.3459384

Neumann, A., Bossek, J., &; Neumann, F. (2021). Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions. Proceedings of the Genetic and Evolutionary Computation Conference, 261–269.https://doi.org/10.1145/3449639.3459385 
LibreCat: /record/48891
DOI: 10.1145/3449639.3459385

Nikfarjam, A., Bossek, J., Neumann, A., &; Neumann, F. (2021). Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation. In Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (pp. 1–11). Association for Computing Machinery.
LibreCat: /record/48892

Bossek, J., Neumann, F., Peng, P., &; Sudholt, D. (2021). Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica, 83(10), 3148–3179.https://doi.org/10.1007/s00453-021-00838-3 
LibreCat: /record/48854
DOI: 10.1007/s00453-021-00838-3

Bossek, J., Neumann, F., Peng, P., &; Sudholt, D. (2020). More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285.https://doi.org/10.1145/3377930.3390174 
LibreCat: /record/48847
DOI: 10.1145/3377930.3390174

Bossek, J., Casel, K., Kerschke, P., &; Neumann, F. (2020). The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. Proceedings of the Genetic and Evolutionary Computation Conference, 1286–1294.https://doi.org/10.1145/3377930.3390243 
LibreCat: /record/48851
DOI: 10.1145/3377930.3390243

Bossek, J., Grimme, C., &; Trautmann, H. (2020). Dynamic Bi-Objective Routing of Multiple Vehicles. Proceedings of the Genetic and Evolutionary Computation Conference, 166–174.https://doi.org/10.1145/3377930.3390146 
LibreCat: /record/48845
DOI: 10.1145/3377930.3390146

Bossek, J., Neumann, A., &; Neumann, F. (2020). Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. Parallel Problem Solving from Nature (PPSN XVI), 346–359.https://doi.org/10.1007/978-3-030-58112-1_24 
LibreCat: /record/48852
DOI: 10.1007/978-3-030-58112-1_24