Graph minimal uncolorability is DP-complete

Exact complexity of exact-four-colorability

Information Processing Letters

Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem

Fundamenta Informaticae - Machines, Computations and Universality, Part I

Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem

Fundamenta Informaticae - Machines, Computations and Universality, Part I

Computational complexity and approximability of social welfare optimization in multiagent resource allocation

Autonomous Agents and Multi-Agent Systems