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: 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. 28:1-28:13. ISSN 1868-8969
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