| 2025 | IJCCI | The Traveling Tournament Problem: Valid Solutions Are Different Across Instance Sizes. | Bas Loyen, Duncan Bart, Florian Richoux, Daan van den Berg |
| 2024 | GECCO | The Easiest Hard Problem: Now Even Easier. | Ruben Horn, Sarah L. Thomson, Daan van den Berg, Pieter Adriaans |
| 2024 | GECCO | Randomized Local Search on the 2D Rectangular Bin Packing Problem with Item Rotation. | Rui Zhao, Tianyu Liang, Zhize Wu, Daan van den Berg, Matthias Threr, Thomas Weise |
| 2024 | IJCCI | Fractal Analysis of the Subset-Sum Problem. | Ruben Horn, Daan van den Berg, Pieter Adriaans |
| 2024 | IJCCI | Separating the Yes- from the No-Instances in the Number Partitioning Problem. | Ruben Horn, Reitze Jansen, Okke van Eck, Daan van den Berg |
| 2024 | IJCCI | The Performance of Frequency Fitness Assignment on JSSP for Different Problem Instance Sizes. | Iris Pijning, Levi Koppenhol, Danny Dijkzeul, Nielis Brouwer, Sarah L. Thomson, Daan van den Berg |
| 2024 | IJCCI | Genetic Programming for 55 Matrix Multiplication. | Rik Timmer, Jesse Kommandeur, Jonathan Koutstaal, Eric S. Fraga, Daan van den Berg |
| 2024 | IJCCI | Randomized Local Search vs. NSGA-II vs. Frequency Fitness Assignment on The Traveling Tournament Problem. | Cao Xiang, Zhize Wu, Daan van den Berg, Thomas Weise |
| 2024 | IJCCI | Randomized Local Search for Two-Dimensional Bin Packing and a Negative Result for Frequency Fitness Assignment. | Rui Zhao, Zhize Wu, Daan van den Berg, Matthias Threr, Tianyu Liang, Ming Tan, Thomas Weise |
| 2024 | PPSN | Entropy, Search Trajectories, and Explainability for Frequency Fitness Assignment. | Sarah L. Thomson, Gabriela Ochoa, Daan van den Berg, Tianyu Liang, Thomas Weise |
| 2023 | CIBCB | Quantifying Instance Hardness of Protein Folding within the HP-model. | Okke van Eck, Daan van den Berg |
| 2023 | GECCO | From Fitness Landscapes to Explainable AI and Back. | Sarah L. Thomson, Jason Adair, Alexander E. I. Brownlee, Daan van den Berg |
| 2023 | GECCO | Randomness in Local Optima Network Sampling. | Sarah L. Thomson, Nadarajen Veerapen, Gabriela Ochoa, Daan van den Berg |
| 2023 | IJCCI | Can HP-protein Folding Be Solved with Genetic Algorithms? Maybe not. | Reitze Jansen, Ruben Horn, Okke van Eck, Kristian Verduin, Sarah L. Thomson, Daan van den Berg |
| 2023 | IJCCI | The Partition Problem, and How The Distribution of Input Bits Affects the Solving Process. | Nikita Sazhinov, Ruben Horn, Pieter Adriaans, Daan van den Berg |
| 2023 | IJCCI | The Opaque Nature of Intelligence and the Pursuit of Explainable AI. | Sarah L. Thomson, Niki van Stein, Daan van den Berg, Cees van Leeuwen |
| 2023 | IJCCI | Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem. | Kristian Verduin, Sarah L. Thomson, Daan van den Berg |
| 2022 | GECCO | Survivor selection in a crossoverless evolutionary algorithm. | Nielis Brouwer, Danny Dijkzeul, Levi Koppenhol, Iris Pijning, Daan van den Berg |
| 2022 | GECCO | Exactly characterizable parameter settings in a crossoverless evolutionary algorithm. | Levi Koppenhol, Nielis Brouwer, Danny Dijkzeul, Iris Pijning, Joeri Sleegers, Daan van den Berg |
| 2022 | IJCCI | Making Hard(Er) Bechmark Test Functions. | Dante Niewenhuis, Daan van den Berg |
| 2022 | IJCCI | Universally Hard Hamiltonian Cycle Problem Instances. | Joeri Sleegers, Sarah L. Thomson, Daan van den Berg |
| 2021 | IJCCI | Subset Sum and the Distribution of Information. | Daan van den Berg, Pieter Adriaans |
| 2020 | GECCO | On the solvability of routing multiple point-to-point paths in manhattan meshes. | Reitze Jansen, Yannick Vinkesteijn, Daan van den Berg |
| 2020 | GECCO | Monte carlo tree search on perfect rectangle packing problem instances. | Igor Pejic, Daan van den Berg |
| 2020 | IJCCI | Parameter Sensitivity Patterns in the Plant Propagation Algorithm. | Marleen de Jonge, Daan van den Berg |
| 2020 | IJCCI | Looking for the Hardest Hamiltonian Cycle Problem Instances. | Joeri Sleegers, Daan van den Berg |
| 2019 | IJCCI | Fireworks Algorithm versus Plant Propagation Algorithm. | Wouter Vrielink, Daan van den Berg |