On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem
J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2023, pp. 248–256.
LibreCat: /record/48869
DOI: 10.1145/3583131.3590384

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

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

Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms
J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 556–564.
LibreCat: /record/48853
DOI: 10.1145/3449639.3459364

Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 198–206.
LibreCat: /record/48860
DOI: 10.1145/3449639.3459363

Do Additional Optima Speed up Evolutionary Algorithms?
J. Bossek, D. Sudholt, in: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–11.
LibreCat: /record/48862

Generating Instances with Performance Differences for More than Just Two Algorithms
J. Bossek, M. Wagner, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2021, pp. 1423–1432.
LibreCat: /record/48876
DOI: 10.1145/3449726.3463165

Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem
A. Nikfarjam, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 600–608.
LibreCat: /record/48893
DOI: 10.1145/3449639.3459384

Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions
A. Neumann, J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 261–269.
LibreCat: /record/48891
DOI: 10.1145/3449639.3459385

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

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

More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization
J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1277–1285.
LibreCat: /record/48847
DOI: 10.1145/3377930.3390174

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics
J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1286–1294.
LibreCat: /record/48851
DOI: 10.1145/3377930.3390243

Dynamic Bi-Objective Routing of Multiple Vehicles
J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 166–174.
LibreCat: /record/48845
DOI: 10.1145/3377930.3390146

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

Evolving Diverse Sets of Tours for the Travelling Salesperson Problem
A.V. Do, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 681–689.
LibreCat: /record/48879
DOI: 10.1145/3377930.3389844

Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem
V. Roostapour, J. Bossek, F. Neumann, in: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 551–559.
LibreCat: /record/48895
DOI: 10.1145/3377930.3390168

Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring
J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 1443–1451.
LibreCat: /record/48843
DOI: 10.1145/3321707.3321792

Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement
J. Bossek, B. Bischl, T. Wagner, G. Rudolph, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2015, pp. 1319–1326.
LibreCat: /record/48838
DOI: 10.1145/2739480.2754673