Daan van den Berg

36 papers C 19Journal 3Unranked 14

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	The Traveling Tournament Problem: Valid Solutions Are Different Across Instance Sizes. IJCCI (2) Bas Loyen, Duncan Bart, Florian Richoux, Daan van den Berg
2024	J	`jnl`	Addressing the traveling salesperson problem with frequency fitness assignment and hybrid algorithms. Soft Comput. Tianyu Liang, Zhize Wu, Jörg Lässig, Daan van den Berg, Sarah L. Thomson, Thomas Weise
2024	—	`conf`	Entropy, Search Trajectories, and Explainability for Frequency Fitness Assignment. PPSN (1) Sarah L. Thomson, Gabriela Ochoa, Daan van den Berg, Tianyu Liang, Thomas Weise
2024	C	`conf`	Fractal Analysis of the Subset-Sum Problem. IJCCI Ruben Horn, Daan van den Berg, Pieter Adriaans
2024	C	`conf`	Genetic Programming for 5×5 Matrix Multiplication. IJCCI Rik Timmer, Jesse Kommandeur, Jonathan Koutstaal, Eric S. Fraga, Daan van den Berg
2024	—	`conf`	Making Hard(er) Benchmark Functions: Genetic Programming. ICEIS (1) Dante Niewenhuis, Abdellah Salhi, Daan van den Berg
2024	C	`conf`	Randomized Local Search for Two-Dimensional Bin Packing and a Negative Result for Frequency Fitness Assignment. IJCCI Rui Zhao, Zhize Wu, Daan van den Berg, Matthias Thürer, Tianyu Liang, Ming Tan, Thomas Weise
2024	—	`conf`	Randomized Local Search on the 2D Rectangular Bin Packing Problem with Item Rotation. GECCO Companion Rui Zhao, Tianyu Liang, Zhize Wu, Daan van den Berg, Matthias Thürer, Thomas Weise
2024	C	`conf`	Randomized Local Search vs. NSGA-II vs. Frequency Fitness Assignment on The Traveling Tournament Problem. IJCCI Cao Xiang, Zhize Wu, Daan van den Berg, Thomas Weise
2024	C	`conf`	Separating the Yes- from the No-Instances in the Number Partitioning Problem. IJCCI Ruben Horn, Reitze Jansen, Okke van Eck, Daan van den Berg
2024	—	`conf`	The Easiest Hard Problem: Now Even Easier. GECCO Companion Ruben Horn, Sarah L. Thomson, Daan van den Berg, Pieter Adriaans
2024	C	`conf`	The Performance of Frequency Fitness Assignment on JSSP for Different Problem Instance Sizes. IJCCI Iris Pijning, Levi Koppenhol, Danny Dijkzeul, Nielis Brouwer, Sarah L. Thomson, Daan van den Berg
2024	—	`conf`	The Traveling Tournament Problem: Rows-First versus Columns-First. ICEIS (1) Kristian Verduin, Ruben Horn, Okke van Eck, Reitze Jansen, Thomas Weise, Daan van den Berg
2023	C	`conf`	Can HP-protein Folding Be Solved with Genetic Algorithms? Maybe not. IJCCI Reitze Jansen, Ruben Horn, Okke van Eck, Kristian Verduin, Sarah L. Thomson, Daan van den Berg
2023	—	`conf`	Frequency Fitness Assignment on JSSP: A Critical Review. EvoApplications@EvoStar Ege de Bruin, Sarah L. Thomson, Daan van den Berg
2023	—	`conf`	From Fitness Landscapes to Explainable AI and Back. GECCO Companion Sarah L. Thomson, Jason Adair, Alexander E. I. Brownlee, Daan van den Berg
2023	C	`conf`	Quantifying Instance Hardness of Protein Folding within the HP-model. CIBCB Okke van Eck, Daan van den Berg
2023	—	`conf`	Randomness in Local Optima Network Sampling. GECCO Companion Sarah L. Thomson, Nadarajen Veerapen, Gabriela Ochoa, Daan van den Berg
2023	C	`conf`	The Opaque Nature of Intelligence and the Pursuit of Explainable AI. IJCCI Sarah L. Thomson, Niki van Stein, Daan van den Berg, Cees van Leeuwen
2023	C	`conf`	The Partition Problem, and How The Distribution of Input Bits Affects the Solving Process. IJCCI Nikita Sazhinov, Ruben Horn, Pieter Adriaans, Daan van den Berg
2023	C	`conf`	Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem. IJCCI Kristian Verduin, Sarah L. Thomson, Daan van den Berg
2022	—	`conf`	Exactly characterizable parameter settings in a crossoverless evolutionary algorithm. GECCO Companion Levi Koppenhol, Nielis Brouwer, Danny Dijkzeul, Iris Pijning, Joeri Sleegers, Daan van den Berg
2022	C	`conf`	Making Hard(Er) Bechmark Test Functions. IJCCI Dante Niewenhuis, Daan van den Berg
2022	C	`conf`	Painting with Evolutionary Algorithms. EvoMUSART Danny Dijkzeul, Nielis Brouwer, Iris Pijning, Levi Koppenhol, Daan van den Berg
2022	—	`conf`	Solving the Traveling Salesperson Problem using Frequency Fitness Assignment. SSCI Tianyu Liang, Zhize Wu, Jörg Lässig, Daan van den Berg, Thomas Weise
2022	—	`conf`	Survivor selection in a crossoverless evolutionary algorithm. GECCO Companion Nielis Brouwer, Danny Dijkzeul, Levi Koppenhol, Iris Pijning, Daan van den Berg
2022	J	`jnl`	The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No. SN Comput. Sci. Joeri Sleegers, Daan van den Berg
2022	C	`conf`	Universally Hard Hamiltonian Cycle Problem Instances. IJCCI Joeri Sleegers, Sarah L. Thomson, Daan van den Berg
2021	J	`jnl`	Backtracking (the) Algorithms on the Hamiltonian Cycle Problem. CoRR Joeri Sleegers, Daan van den Berg
2021	C	`conf`	Subset Sum and the Distribution of Information. IJCCI Daan van den Berg, Pieter Adriaans
2020	C	`conf`	Looking for the Hardest Hamiltonian Cycle Problem Instances. IJCCI Joeri Sleegers, Daan van den Berg
2020	—	`conf`	Monte carlo tree search on perfect rectangle packing problem instances. GECCO Companion Igor Pejic, Daan van den Berg
2020	—	`conf`	On the solvability of routing multiple point-to-point paths in manhattan meshes. GECCO Companion Reitze Jansen, Yannick Vinkesteijn, Daan van den Berg
2020	C	`conf`	Parameter Sensitivity Patterns in the Plant Propagation Algorithm. IJCCI Marleen de Jonge, Daan van den Berg
2019	C	`conf`	Fireworks Algorithm versus Plant Propagation Algorithm. IJCCI Wouter Vrielink, Daan van den Berg
2019	C	`conf`	Paintings, Polygons and Plant Propagation. EvoMUSART Misha Paauw, Daan van den Berg