Portfolio-Based Algorithm Selection for Circuit QBFs. - Holger H. Hoos; Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (CP, 2018)

Polynomial-Time Validation of QCDCL Certificates. - Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (SAT, 2018)

Combining Resolution-Path Dependencies with Dependency Learning. - Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (SAT, 2019)

Proof Complexity of Fragments of Long-Distance Q-Resolution. - Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (SAT, 2019)

Dependency Learning for QBF. - Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (J. Artif. Intell. Res., 2019)

Long-Distance Q-Resolution with Dependency Schemes. - Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (J. Autom. Reason., 2019)

Qute in the QBF Evaluation 2018. - Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (J. Satisf. Boolean Model. Comput., 2019)

Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. - Robert Ganian; Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (KR, 2020)

Hard QBFs for Merge Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan; Tomás Peitl; Gaurav Sood 001 (Electron. Colloquium Comput. Complex., 2020)

Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths. - Olaf Beyersdorff; Joshua Blinkhorn; Tomás Peitl (Electron. Colloquium Comput. Complex., 2020)

Finding the Hardest Formulas for Resolution (Extended Abstract). - Tomás Peitl; Stefan Szeider (IJCAI, 2021)

Davis and Putnam Meet Henkin: Solving DQBF with Resolution. - Joshua Blinkhorn; Tomás Peitl; Friedrich Slivovsky (SAT, 2021)

Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. - Olaf Beyersdorff; Joshua Blinkhorn; Tomás Peitl (Electron. Colloquium Comput. Complex., 2021)

Finding the Hardest Formulas for Resolution. - Tomás Peitl; Stefan Szeider (J. Artif. Intell. Res., 2021)

Should decisions in QCDCL follow prefix order? - Benjamin Böhm 001; Tomás Peitl; Olaf Beyersdorff (Electron. Colloquium Comput. Complex., 2022)

Co-Certificate Learning with SAT Modulo Symmetries. - Markus Kirchweger; Tomás Peitl; Stefan Szeider (IJCAI, 2023)

A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. - Markus Kirchweger; Tomás Peitl; Stefan Szeider (SAT, 2023)

Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. - Olaf Beyersdorff; Joshua Blinkhorn; Meena Mahajan; Tomás Peitl (ACM Trans. Comput. Log., 2023)

Are hitting formulas hard for resolution? - Tomás Peitl; Stefan Szeider (Discret. Appl. Math., 2023)

Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. - Tianwei Zhang; Tomás Peitl; Stefan Szeider (SAT, 2024)

QCDCL with cube learning or pure literal elimination - What is best? - Benjamin Böhm 001; Tomás Peitl; Olaf Beyersdorff (Artif. Intell., 2024)

Supplementary Material for Breaking Symmetries in Quantified Graph Search: A Comparative Study. - Tomás Peitl; Markus Kirchweger; Mikolás Janota; Stefan Szeider (Zenodo, 2024)

Breaking Symmetries in Quantified Graph Search: A Comparative Study. - Mikolás Janota; Markus Kirchweger; Tomás Peitl; Stefan Szeider (AAAI, 2025)

Better Extension Variables in DQBF via Independence. - Leroy Chew; Tomás Peitl (SAT, 2025)

Supplementary material for Smart Cubing for Graph Search: A Comparative Study. - Tomás Peitl; Stefan Szeider; Markus Kirchweger; Hai Xia 001 (Zenodo, 2025)

Smart Cubing for Graph Search: A Comparative Study. - Markus Kirchweger; Hai Xia 001; Tomás Peitl; Stefan Szeider (CoRR, 2025)