Xtract

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
ACM Transactions on Algorithms, volume 13, number AC-TR-17-016, pages 29:1-29:32, 2017.
PDF Cite DOI
Going Beyond Primal Treewidth for (M)ILP
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 815-821, 2017.
PDF Cite
Linear Representation of Transversal Matroids and Gammoids parameterized by rank
Computing and Combinatorics: 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings (Cao, Yixin and Chen, Jianer), pages 420-432, 2017, Springer Verlag.
PDF Cite DOI
Lossy kernelization
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 224-237, 2017.
PDF Cite DOI
New Width Parameters for Model Counting
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers and Toby Walsh), volume 10491 of Lecture Notes in Computer Science, pages 38-52, 2017, Springer Verlag.
PDF Cite DOI
On Structural Parameterizations of the Edge Disjoint Paths Problem
28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand (Yoshio Okamoto and Takeshi Tokuyama), volume 92 of LIPIcs, pages 36:1-36:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
PDF Cite
On the parameterized complexity of finding small unsatisfiable subsets of CNF formulas and CSP instances
ACM Transactions on Computational Logic, volume 18, number 3, pages Art. 21, 46, 2017.
Cite DOI
Path-Contractions, Edge Deletions and Connectivity Preservation
25th Annual European Symposium on Algorithms (ESA 2017) (Kirk Pruhs and Christian Sohler), volume 87 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1-47:13, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
PDF Cite DOI
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, pages 3929-3935, 2017.
PDF Cite
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers and Toby Walsh), volume 10491 of Lecture Notes in Computer Science, pages 401-411, 2017, Springer Verlag.
Cite DOI