J. Bossek and F. Neumann, “Exploring the Feature Space of TSP Instances Using Quality Diversity,”10.1145/3512290.3528851__in Proceedings of the Genetic and Evolutionary Computation Conference, 2022, pp. 186–194, doi:10.1145/3512290.3528851 .

J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “On the Potential of Normalized TSP Features for Automated Algorithm Selection,” in Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–15.

A. Nikfarjam, J. Bossek, A. Neumann, and F. Neumann, “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, New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–11.

J. Bossek, A. Neumann, and F. Neumann, “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__in Parallel Problem Solving from Nature (PPSN XVI), 2020, pp. 346–359, doi:10.1007/978-3-030-58112-1_24 .

J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers,”10.1007/978-3-319-50349-3_4__in Learning and Intelligent Optimization, 2016, pp. 48–59, doi:10.1007/978-3-319-50349-3_4 .

J. Bossek and H. Trautmann, “Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference,”10.1007/978-3-319-49130-1_1__in Proceedings of the XV International Conference of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037, 2016, pp. 3–12, doi:10.1007/978-3-319-49130-1_1 .

O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem,”10.1007/s10472-013-9341-2__Annals of Mathematics and Artificial Intelligence, vol. 69, no. 2, pp. 151–182, 2013, doi:10.1007/s10472-013-9341-2 .

O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219, 2012, pp. 115–129.