The following pages link to On completing latin squares (Q5951961):
Displaying 4 items.
- The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152) (← links)
- Handling fairness issues in time-relaxed tournaments with availability constraints (Q2289924) (← links)
- On the complexity of pattern feasibility problems in time-relaxed sports timetabling (Q2661499) (← links)
- Extending partial edge colorings of iterated Cartesian products of cycles and paths (Q6606987) (← links)
