Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems.

Ivan Bliznets, Marek Cygan, Pawel Komosa, Luks Mach, Michal Pilipczuk

Browse the full SODA paper archive.