André Schidler

Recent Publications

Extracting Problem Structure with LLMs for Optimized SAT Local Search
SOCS 2025, The 18th International Symposium on Combinatorial Search. August 12-15, 2025. University of Glasgow, Scotland, United Kingdom, 2025.
SAT-based Decision Tree Learning for Large Data Sets
Journal of Artificial Intelligence Research, volume 80, pages 875-918, 2024.
Structure-guided Local Improvement for Maximum Satisfiability
The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
A SAT Approach to Twin-Width
Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips and Bettina Speckmann), pages 67-77, 2022, SIAM.
SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)
38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc and Michael Kerber), volume 224 of LIPIcs, pages 74:1-74:8, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Backdoor DNFs
2021, Technical report AC-TR-21-001, Algorithms and Complexity Group, TU Wien.
Parameterized Complexity of Small Decision Tree Learning
2021, Technical report AC-TR-21-002, Algorithms and Complexity Group, TU Wien.
SAT-based Decision Tree Learning for Large Data Sets
2021, Technical report AC-TR-21-003, Algorithms and Complexity Group, TU Wien.
SAT-based Decision Tree Learning for Large Data Sets
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904-3912, 2021, AAAI Press.
Computing Optimal Hypertree Decompositions
2020, Technical report AC-TR-20-001, Algorithms and Complexity Group, TU Wien.
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.