Slim

The Parameterized Complexity of Clustering Incomplete Data
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 7296-7304, 2021, AAAI Press.
PDF Cite Project Project Project Project
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3895-3903, 2021, AAAI Press.
PDF Cite Project Project
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina and Martina Seidl), volume 12178 of Lecture Notes in Computer Science, pages 267-276, 2020, Springer Verlag.
Cite Project Project Project
A Time Leap Challenge for SAT-Solving
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 267-285, 2020, Springer Verlag.
Cite Project Project
Breaking Symmetries with RootClique and LexTopsort
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 286-303, 2020, Springer Verlag.
Cite Project Project
Computing Optimal Hypertree Decompositions
Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch and Irene Finocchi), pages 1-11, 2020, SIAM.
Cite Project
Finding the Hardest Formulas for Resolution
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 514-530, 2020, Springer Verlag.
Note: Best Paper Award
Cite Project Project
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020 (Diego Calvanese and Esra Erdem and Michael Thielscher), pages 392-402, 2020.
PDF Cite Project Project Project Project
Formalizing Graph Trail Properties in Isabelle/HOL
Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings (Christoph Benzmüller and Bruce R. Miller), volume 12236 of Lecture Notes in Computer Science, pages 190-205, 2020, Springer Verlag.
Cite Project Project
MaxSAT-Based Postprocessing for Treedepth
Proceedings of CP 2020, the 26th International Conference on Principles and Practice of Constraint Programming (Helmut Simonis), volume 12333 of Lecture Notes in Computer Science, pages 478-495, 2020, Springer Verlag.
Cite Project Project DOI