In: 27th Annual ACM-SIAM Symposium on Discrete Algorithms Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (3) Association for Computing Machinery, Red Hook NY, pp. 1650-1669.
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
In: 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016 Leibniz International Proceedings in Informatics (LIPIcs) (58) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 34:1-34:14. ISSN 1868-8969
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion