In: 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016 Leibniz International Proceedings in Informatics, LIPIcs (60) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 5:1-5:12. ISSN 1868-8969
Approximation algorithms for parallel machine scheduling with speed-up resources
In: 32nd International Symposium on Computational Geometry (SoCG 2016) Leibniz International Proceedings in Informatics (LIPIcs) (51) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 52.1-52.16. ISSN 1868-8969
Peeling and nibbling the cactus: Subexponential-time algorithms for counting triangulations and related problems
In: 25th International Joint Conference on Artificial Intelligence, IJCAI 2016 IJCAI International Joint Conference on Artificial Intelligence (2016-J) IJCAI, New York, pp. 109-115. ISSN 1045-0823
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