In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 Leibniz International Proceedings in Informatics, LIPIcs (47) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 22:1-22:14. ISSN 1868-8969
Time-approximation trade-offs for inapproximable problems
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: 10th ACM Conference on Recommender Systems, RecSys 2016 RecSys 2016 - Proceedings of the 10th ACM Conference on Recommender Systems ACM Press, New York, pp. 425-426.