In: 24th Annual European Symposium on Algorithms (ESA 2016) Leibniz International Proceedings in Informatics (LIPIcs) (57) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 33:1-33:17. ISSN 1868-8969
Counting Matchings with k Unmatched Vertices in Planar Graphs
In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) Leibniz International Proceedings in Informatics (LIPIcs) (55) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 47:1-47:14. ISSN 1868-8969
Parity Separation: A Scientifically Proven Method for Permanent Weight Loss
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