Computing Optimal Hypertree Decompositions. - André Schidler; Stefan Szeider (ALENEX, 2020)

Towards Faster Reasoners by Using Transparent Huge Pages. - Johannes Klaus Fichte; Norbert Manthey; Julian Stecklina; André Schidler (CP, 2020)

Solving the Steiner Tree Problem with few Terminals. - Johannes Klaus Fichte; Markus Hecher; André Schidler (ICTAI, 2020)

DT-SLIM Results. - André Schidler; Stefan Szeider (Zenodo, 2021)

DT-SLIM: SAT-based Decision Tree Learning for Large Data Sets. - André Schidler; Stefan Szeider (Zenodo, 2021)

HtdLEO Results. - André Schidler; Stefan Szeider (Zenodo, 2021)

HtdLEO source code. - André Schidler; Stefan Szeider (Zenodo, 2021)

A SAT Approach to Twin-Width. - André Schidler; Stefan Szeider (Zenodo, 2021)

Tractable Abstract Argumentation via Backdoor-Treewidth. - Wolfgang Dvorák; Markus Hecher; Matthias König 002; André Schidler; Stefan Szeider; Stefan Woltran (AAAI, 2022)

A SAT Approach to Twin-Width. - André Schidler; Stefan Szeider (ALENEX, 2022)

SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge). - André Schidler (SoCG, 2022)

PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT. - Rafael Kiesel; André Schidler (IPEC, 2022)

Weighted Model Counting with Twin-Width. - Robert Ganian; Filip Pokrývka; André Schidler; Kirill Simonov; Stefan Szeider (SAT, 2022)

Threshold Treewidth and Hypertree Width. - Robert Ganian; André Schidler; Manuel Sorge; Stefan Szeider (J. Artif. Intell. Res., 2022)

Weighted Model Counting with Twin-Width: Experimental Results. - Robert Ganian; Filip Pokrývka; André Schidler; Kirill Simonov; Stefan Szeider (Zenodo, 2022)

Computing Optimal Hypertree Decompositions with SAT - Results. - André Schidler; Stefan Szeider (Zenodo, 2022)

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. - Rafael Kiesel; André Schidler (ALENEX, 2023)

Computing Twin-width with SAT and Branch & Bound. - André Schidler; Stefan Szeider (IJCAI, 2023)

SAT Encodings and Beyond (Dagstuhl Seminar 23261). - Marijn J. H. Heule; Inês Lynce; Stefan Szeider; André Schidler (Dagstuhl Reports, 2023)

SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments. - André Schidler; Stefan Szeider (Zenodo, 2023)

Computing twin-width with SAT and branch & bound - Results. - André Schidler; Stefan Szeider (Zenodo, 2023)

Computing twin-width with SAT and branch & bound. - André Schidler; Stefan Szeider (Zenodo, 2023)

SAT-Boosted Tabu Search for Coloring Massive Graphs - Code. - André Schidler; Stefan Szeider (Zenodo, 2023)

Computing twin-width with branch & bound - PACE Submission. - André Schidler; Stefan Szeider (Zenodo, 2023)

MaxSLIM Anytime MaxSAT Solver. - André Schidler; Stefan Szeider (Zenodo, 2023)

Computing optimal hypertree decompositions with SAT. - André Schidler; Stefan Szeider (Artif. Intell., 2023)

SAT-boosted Tabu Search for Coloring Massive Graphs. - André Schidler; Stefan Szeider (ACM J. Exp. Algorithmics, 2023)

Structure-Guided Local Improvement for Maximum Satisfiability. - André Schidler; Stefan Szeider (CP, 2024)

SAT-based Decision Tree Learning for Large Data Sets. - André Schidler; Stefan Szeider (J. Artif. Intell. Res., 2024)

Backdoor DNFs. - Sebastian Ordyniak; André Schidler; Stefan Szeider (J. Comput. Syst. Sci., 2024)

Backdoor DNFs Results and Source Code. - Sebastian Ordyniak; André Schidler; Stefan Szeider (Zenodo, 2024)

SAT-based Decision Tree Learning for Large Data Sets - Results and Source code. - André Schidler; Stefan Szeider (Zenodo, 2024)

Structure-guided Local Improvement for Maximum Satisfiability Supplementary. - André Schidler; Stefan Szeider (Zenodo, 2024)

Learn to Unlearn. - Bernhard Gstrein; Florian Pollitt; André Schidler; Mathias Fleury; Armin Biere (SAT, 2025)

Analyzing Reformulation Performance in Core-Guided MaxSAT Solving. - André Schidler; Stefan Szeider (SAT, 2025)

Extracting Problem Structure with LLMs for Optimized SAT Local Search. - André Schidler; Stefan Szeider (Zenodo, 2025)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach. - Hannes Ihalainen; Dieter Vandesande; André Schidler; Jeremias Berg; Bart Bogaerts 001; Matti Järvisalo (CoRR, 2025)