Exploring Subexponential Parameterized Complexity of Completion Problems.

Pl Grns Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger

Browse the full STACS paper archive.