Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk. Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016. pages 1132-1151, SIAM, 2016. [doi]
Abstract is missing.