| 2026 | AAAI | Graph Choosability via SAT: Beyond the Nullstellensatz. | Markus Kirchweger, Toms Peitl, David Seka, Stefan Szeider |
| 2026 | CP | Smart Cubing for Graph Search: A Comparative Study. | Markus Kirchweger, Toms Peitl, Stefan Szeider, Hai Xia |
| 2026 | SAT | Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking. | Leroy Chew, Toms Peitl |
| 2025 | AAAI | Breaking Symmetries in Quantified Graph Search: A Comparative Study. | Mikols Janota, Markus Kirchweger, Toms Peitl, Stefan Szeider |
| 2025 | SAT | Better Extension Variables in DQBF via Independence. | Leroy Chew, Toms Peitl |
| 2024 | SAT | Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. | Tianwei Zhang, Toms Peitl, Stefan Szeider |
| 2023 | IJCAI | Co-Certificate Learning with SAT Modulo Symmetries. | Markus Kirchweger, Toms Peitl, Stefan Szeider |
| 2023 | SAT | A SAT Solver's Opinion on the Erdős-Faber-Lovsz Conjecture. | Markus Kirchweger, Toms Peitl, Stefan Szeider |
| 2022 | IJCAI | QCDCL with Cube Learning or Pure Literal Elimination - What is Best? | Benjamin Bhm, Toms Peitl, Olaf Beyersdorff |
| 2022 | SAT | Should Decisions in QCDCL Follow Prefix Order? | Benjamin Bhm, Toms Peitl, Olaf Beyersdorff |
| 2021 | IJCAI | Finding the Hardest Formulas for Resolution (Extended Abstract). | Toms Peitl, Stefan Szeider |
| 2021 | SAT | Davis and Putnam Meet Henkin: Solving DQBF with Resolution. | Joshua Blinkhorn, Toms Peitl, Friedrich Slivovsky |
| 2020 | CP | Finding the Hardest Formulas for Resolution. | Toms Peitl, Stefan Szeider |
| 2020 | KR | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. | Robert Ganian, Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2020 | SAT | Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. | Olaf Beyersdorff, Joshua Blinkhorn, Toms Peitl |
| 2019 | SAT | Combining Resolution-Path Dependencies with Dependency Learning. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2019 | SAT | Proof Complexity of Fragments of Long-Distance Q-Resolution. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2018 | CP | Portfolio-Based Algorithm Selection for Circuit QBFs. | Holger H. Hoos, Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2018 | SAT | Polynomial-Time Validation of QCDCL Certificates. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2017 | SAT | Dependency Learning for QBF. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2016 | SAT | Long Distance Q-Resolution with Dependency Schemes. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |