Conference presentations sit beside workshops and standalone talks. Some entries have interactive slides or video; others preserve the delivery and its context.
A constraint model for wedding-table assignments that balances practical seating requests with the chance that every guest can find a well-supported conversation topic.
Direct propagation algorithms for selecting well-spaced points, including pairwise, global, advisor-backed, and matching-based variants.
What changes when Sudoku grows from 6×6 to 36×36, based on propagation experiments and a public corpus of 434,201 generated instances.
A practical retrospective on building a problem-specific CBLS-style solver, the business constraints behind that choice, and whether it paid off.
What changes when a propagator may deliberately remove solutions, while every solution it reports must still be genuine?
Using constraint programming to represent Patchwork boards, guide polyomino placement, and evaluate game-playing choices.
