An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion.

Mikko Koivisto

Browse the full FOCS paper archive.