| [1] | Solving SAT via Treewidth Backdoors in Linear Time: Beyond Sparsity Proceedings of the 2027 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2027. Note: to appear |
| [1] | The Descriptive Complexity of Relation Modification Problems volume 386 of LIPIcs, pages 93:1–93:17, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [2] | Bilateral Treewidth for QBF: Where Strategies and Resolution Meet 29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev, Stefan Szeider, eds.), volume 377 of LIPIcs, pages 16:1–16:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. |
| [3] | Gateways to Tractability for Satisfiability in Pearl’s Causal Hierarchy Proceedings of the 43rd International Conference on Machine Learning, ICML 2026, 2026, PMLR. Note: to appear |