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.

Do, Anh Viet, et al. “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem.”10.1145/3377930.3389844__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 681–689, doi:10.1145/3377930.3389844.

Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.”10.1145/3377930.3390168__Proceedings of the 2020 Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2020, pp. 551–559, doi:10.1145/3377930.3390168.

Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi Network Environments.”10.1109/CSCloud/EdgeCom.2019.000-9__2019 6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.

Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.”10.4230/LIPICS.ICALP.2019.150__Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150.

Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.”10.1145/3321707.3321792__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792.

Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.”10.1109/icdm.2016.0094__2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–10, doi:10.1109/icdm.2016.0094.

Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.”10.1109/TCC.2015.2487964__Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1, doi:10.1109/TCC.2015.2487964.

Rauchecker, Gerhard, and Guido Schryen. “High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic.” Australasian Conference on Information Systems, 2015, pp. 1–13.

Bossek, Jakob, et al. “Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement.”10.1145/2739480.2754673__Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2015, pp. 1319–1326, doi:10.1145/2739480.2754673.

Meisel, Stephan, et al. “Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle.”10.1145/2739480.2754705__Proceedings of the Genetic and Evolutionary Computation Conference , Association for Computing Machinery, 2015, pp. 425–432, doi:10.1145/2739480.2754705.