From Daan
- AI-course
- ASQAS-34
- A Predictive Data Analytic for the Hardness of Hamiltonian Cycle Problem Instances
- Addendum smartgrid
- Advanced Heuristics - Maak je eigen case
- Afternoon
- Almost Almost Almost Squares
- Almost Almost Squares
- Almost Squares
- Amstelhaege
- Building Brains
- CheesemanTSPReplication
- Chips & Circuits
- Citibase
- Couveuse
- De Glasmeesters
- De StaalMeesters
- Forensics
- Freecell
- Fruitvliegen
- Global Traffic
- Heuristieken
- Kaartkleuren
- Kaartkleuren++
- Kanjis, Clusters, and Gelb's Hypothesis
- Lectures & Lesroosters
- Leeuwen & Lammetjes
- Lego
- Lesroosters & Lectures
- Main Page
- Minor Programmeren: research in combinatorial optimization
- MyHEAP
- Nieuwe Cases
- Number Crunching
- PPA & Hard Hamiltonian Graphs
- PPA parameterization
- Paintings from Polygons
- Protein Pow(d)er
- Radio Russia
- RailNL
- Rentaroom
- Rush Hour
- Sliding Triangles
- SmartGrid
- Solution patterns
- Space Freight
- Ta6s
- Tegelzetten
- Where the Really Hard Problems Aren't