The signup sheet has 36 places, with 0 participants

Betweenness problem

Betweenness problem - Wikipedia

1 places available in total (0 used, 1 free)

Bipartite dimension

https://en.wikipedia.org/wiki/Bipartite_dimension

1 places available in total (0 used, 1 free)

Cubic Subgraph (problém č. 26)

https://cgi.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.html

1 places available in total (0 used, 1 free)

Degree-constrained Spanning Tree

https://en.wikipedia.org/wiki/Degree-constrained_spanning_tree

1 places available in total (0 used, 1 free)

Domatic Number

https://en.wikipedia.org/wiki/Domatic_number

1 places available in total (0 used, 1 free)

Feedback arc set

Feedback arc set - Wikipedia

1 places available in total (0 used, 1 free)

Futoshiki

Futoshiki - Wikipedia

1 places available in total (0 used, 1 free)

Garden of Eden

Garden of Eden - LifeWiki

1 places available in total (0 used, 1 free)

Graph Isomorphism

https://en.wikipedia.org/wiki/Graph_isomorphism_problem

1 places available in total (0 used, 1 free)

Graph Partitioning (problém č. 25)

https://cgi.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.html

1 places available in total (0 used, 1 free)

Hamiltonian Path

https://en.wikipedia.org/wiki/Hamiltonian_path_problem

1 places available in total (0 used, 1 free)

Hidato

Hidato - Wikipedia

1 places available in total (0 used, 1 free)

Hitori

Hitori - Wikipedia

1 places available in total (0 used, 1 free)

Induced Subgraph Isomorphism

https://en.wikipedia.org/wiki/Induced_subgraph_isomorphism_problem

1 places available in total (0 used, 1 free)

Intersection Number

https://en.wikipedia.org/wiki/Intersection_number_(graph_theory)

1 places available in total (0 used, 1 free)

Killer Sudoku, zobecnění pro mřížku n x n (kde n je čtverec)

057: Killer Sudoku , zobecnění pro mřížku n x n (kde n je čtverec)

1 places available in total (0 used, 1 free)

Largest Common Subgraph (problém č. 84)

Annotated List of Selected NP-complete Problems

1 places available in total (0 used, 1 free)

Longest Circuit (problém č. 17)

https://cgi.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.html

1 places available in total (0 used, 1 free)

Maximum Density Still Life

https://www.csplib.org/Problems/prob032/

1 places available in total (0 used, 1 free)

Multi-agent pathfinding, stačí pro mřížový graf, makespan objective

Multi-agent pathfinding - Wikipedia

1 places available in total (0 used, 1 free)

Nonogram

https://www.csplib.org/Problems/prob012/

1 places available in total (0 used, 1 free)

Numberlink

https://en.wikipedia.org/wiki/Numberlink

1 places available in total (0 used, 1 free)

Nurikabe, stačí omezení na čísla 1 a 2

https://en.wikipedia.org/wiki/Nurikabe_(puzzle)

1 places available in total (0 used, 1 free)

Peaceably Co-existing Armies of Queens, zobecnění pro šachovnici $n\times n$

https://www.csplib.org/Problems/prob110/

1 places available in total (0 used, 1 free)

Rural Postman (problém č. 34)

https://cgi.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.html

1 places available in total (0 used, 1 free)

Shortest Common Superstring (problém č. 16)

https://cgi.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.html

1 places available in total (0 used, 1 free)

Slitherink

https://en.wikipedia.org/wiki/Slitherlink

1 places available in total (0 used, 1 free)

Social Golfers Problem

https://www.csplib.org/Problems/prob010/

1 places available in total (0 used, 1 free)

Sports Tournament Scheduling

https://www.csplib.org/Problems/prob026/

1 places available in total (0 used, 1 free)

Square-Tiling (problém č. 54)

https://cgi.csc.liv.ac.uk/~ped/teachadmin/COMP202/annotated_np.html

1 places available in total (0 used, 1 free)

Stable roommates problem

Stable roommates problem - Wikipedia

1 places available in total (0 used, 1 free)

Steiner Triple Systems

https://www.csplib.org/Problems/prob044/

1 places available in total (0 used, 1 free)

Steiner tree problem

Steiner tree problem - Wikipedia

1 places available in total (0 used, 1 free)

Subgraph Isomorphism

https://en.wikipedia.org/wiki/Subgraph_isomorphism_problem

1 places available in total (0 used, 1 free)

Tetris

tetr.pdf

1 places available in total (0 used, 1 free)

Word Design for DNA Computing on Surfaces

033: Word Design for DNA Computing on Surfaces

1 places available in total (0 used, 1 free)