Paintings, Polygons and Plant Propagation. - Misha Paauw; Daan van den Berg (EvoMUSART, 2019)

Fireworks Algorithm versus Plant Propagation Algorithm. - Wouter Vrielink; Daan van den Berg (IJCCI, 2019)

On the solvability of routing multiple point-to-point paths in manhattan meshes. - Reitze Jansen; Yannick Vinkesteijn; Daan van den Berg (GECCO Companion, 2020)

Monte carlo tree search on perfect rectangle packing problem instances. - Igor Pejic; Daan van den Berg (GECCO Companion, 2020)

Parameter Sensitivity Patterns in the Plant Propagation Algorithm. - Marleen de Jonge; Daan van den Berg (IJCCI, 2020)

Looking for the Hardest Hamiltonian Cycle Problem Instances. - Joeri Sleegers; Daan van den Berg (IJCCI, 2020)

Subset Sum and the Distribution of Information. - Daan van den Berg; Pieter Adriaans (IJCCI, 2021)

Backtracking (the) Algorithms on the Hamiltonian Cycle Problem. - Joeri Sleegers; Daan van den Berg (CoRR, 2021)

Painting with Evolutionary Algorithms. - Danny Dijkzeul; Nielis Brouwer; Iris Pijning; Levi Koppenhol; Daan van den Berg (EvoMUSART, 2022)

Survivor selection in a crossoverless evolutionary algorithm. - Nielis Brouwer; Danny Dijkzeul; Levi Koppenhol; Iris Pijning; Daan van den Berg (GECCO Companion, 2022)

Exactly characterizable parameter settings in a crossoverless evolutionary algorithm. - Levi Koppenhol; Nielis Brouwer; Danny Dijkzeul; Iris Pijning; Joeri Sleegers; Daan van den Berg (GECCO Companion, 2022)

Making Hard(Er) Bechmark Test Functions. - Dante Niewenhuis; Daan van den Berg (IJCCI, 2022)

Universally Hard Hamiltonian Cycle Problem Instances. - Joeri Sleegers; Sarah L. Thomson; Daan van den Berg (IJCCI, 2022)

Solving the Traveling Salesperson Problem using Frequency Fitness Assignment. - Tianyu Liang; Zhize Wu; Jörg Lässig; Daan van den Berg; Thomas Weise 001 (SSCI, 2022)

The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No. - Joeri Sleegers; Daan van den Berg (SN Comput. Sci., 2022)

Quantifying Instance Hardness of Protein Folding within the HP-model. - Okke van Eck; Daan van den Berg (CIBCB, 2023)

Frequency Fitness Assignment on JSSP: A Critical Review. - Ege de Bruin; Sarah L. Thomson; Daan van den Berg (EvoApplications@EvoStar, 2023)

From Fitness Landscapes to Explainable AI and Back. - Sarah L. Thomson; Jason Adair; Alexander E. I. Brownlee; Daan van den Berg (GECCO Companion, 2023)

Randomness in Local Optima Network Sampling. - Sarah L. Thomson; Nadarajen Veerapen; Gabriela Ochoa; Daan van den Berg (GECCO Companion, 2023)

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 (IJCCI, 2023)

The Partition Problem, and How The Distribution of Input Bits Affects the Solving Process. - Nikita Sazhinov; Ruben Horn; Pieter Adriaans; Daan van den Berg (IJCCI, 2023)

The Opaque Nature of Intelligence and the Pursuit of Explainable AI. - Sarah L. Thomson; Niki van Stein; Daan van den Berg; Cees van Leeuwen (IJCCI, 2023)

Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem. - Kristian Verduin; Sarah L. Thomson; Daan van den Berg (IJCCI, 2023)

The Easiest Hard Problem: Now Even Easier. - Ruben Horn; Sarah L. Thomson; Daan van den Berg; Pieter Adriaans (GECCO Companion, 2024)

Randomized Local Search on the 2D Rectangular Bin Packing Problem with Item Rotation. - Rui Zhao; Tianyu Liang; Zhize Wu; Daan van den Berg; Matthias Thürer; Thomas Weise 001 (GECCO Companion, 2024)

Making Hard(er) Benchmark Functions: Genetic Programming. - Dante Niewenhuis; Abdellah Salhi; Daan van den Berg (ICEIS (1), 2024)

The Traveling Tournament Problem: Rows-First versus Columns-First. - Kristian Verduin; Ruben Horn; Okke van Eck; Reitze Jansen; Thomas Weise 001; Daan van den Berg (ICEIS (1), 2024)

Fractal Analysis of the Subset-Sum Problem. - Ruben Horn; Daan van den Berg; Pieter Adriaans (IJCCI, 2024)

Separating the Yes- from the No-Instances in the Number Partitioning Problem. - Ruben Horn; Reitze Jansen; Okke van Eck; Daan van den Berg (IJCCI, 2024)

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 (IJCCI, 2024)

Genetic Programming for 5×5 Matrix Multiplication. - Rik Timmer; Jesse Kommandeur; Jonathan Koutstaal; Eric S. Fraga; Daan van den Berg (IJCCI, 2024)

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 001 (IJCCI, 2024)

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 Thürer; Tianyu Liang; Ming Tan; Thomas Weise 001 (IJCCI, 2024)

Entropy, Search Trajectories, and Explainability for Frequency Fitness Assignment. - Sarah L. Thomson; Gabriela Ochoa; Daan van den Berg; Tianyu Liang; Thomas Weise 001 (PPSN (1), 2024)

Addressing the traveling salesperson problem with frequency fitness assignment and hybrid algorithms. - Tianyu Liang; Zhize Wu; Jörg Lässig; Daan van den Berg; Sarah L. Thomson; Thomas Weise 001 (Soft Comput., 2024)