| 2026 | AAAI | Model Counting for Dependency Quantified Boolean Formulas. | Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan |
| 2026 | FOSSACS | The Complexity of Games with Randomised Control. | Sarvin Bahmani, Rasmus Ibsen-Jensen, Soumyajit Paul, Sven Schewe, Friedrich Slivovsky, Qiyi Tang, Dominik Wojtczak, Shufang Zhu |
| 2026 | SAT | Long-Distance Q(D^std)-Consensus Is Sound. | Abhimanyu Choudhury, Meena Mahajan, Friedrich Slivovsky |
| 2025 | SAT | Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas. | Che Cheng, Long-Hin Fung, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan |
| 2024 | AAAI | Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. | Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider |
| 2024 | SAT | eSLIM: Circuit Minimization with SAT Based Local Improvement. | Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider |
| 2024 | SAT | Strategy Extraction by Interpolation. | Friedrich Slivovsky |
| 2023 | AAAI | Circuit Minimization with QBF-Based Exact Synthesis. | Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider |
| 2023 | LICS | Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. | Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak |
| 2022 | STACS | Towards Uniform Certification in QBF. | Leroy Chew, Friedrich Slivovsky |
| 2022 | SAT | Pedant: A Certifying DQBF Solver. | Franz-Xaver Reichl, Friedrich Slivovsky |
| 2022 | SAT | Quantified CDCL with Universal Resolution. | Friedrich Slivovsky |
| 2021 | ICCAD | Engineering an Efficient Boolean Functional Synthesis Engine. | Priyanka Golia, Friedrich Slivovsky, Subhajit Roy, Kuldeep S. Meel |
| 2021 | SAT | Davis and Putnam Meet Henkin: Solving DQBF with Resolution. | Joshua Blinkhorn, Toms Peitl, Friedrich Slivovsky |
| 2021 | SAT | Proof Complexity of Symbolic QBF Reasoning. | Stefan Mengel, Friedrich Slivovsky |
| 2021 | SAT | Certified DQBF Solving by Definition Extraction. | Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider |
| 2020 | CAV | Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing. | Friedrich Slivovsky |
| 2020 | KR | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. | Robert Ganian, Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2020 | SAT | Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. | Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger |
| 2020 | SAT | Short Q-Resolution Proofs with Homomorphisms. | Ankit Shukla, Friedrich Slivovsky, Stefan Szeider |
| 2020 | SAT | A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. | Friedrich Slivovsky, Stefan Szeider |
| 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 | ICTAI | Sum-of-Products with Default Values: Algorithms and Complexity Results. | Robert Ganian, Eun Jung Kim, 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 | IJCAI | Knowledge Compilation Meets Communication Complexity. | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
| 2016 | SAT | Long Distance Q-Resolution with Dependency Schemes. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2015 | CSR | On Compiling Structured CNFs to OBDDs. | Simone Bova, Friedrich Slivovsky |
| 2015 | SAT | On Compiling CNFs into Structured Deterministic DNNFs. | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
| 2014 | SAT | Variable Dependencies and Q-Resolution. | Friedrich Slivovsky, Stefan Szeider |
| 2013 | ISAAC | Model Counting for Formulas of Bounded Clique-Width. | Friedrich Slivovsky, Stefan Szeider |
| 2013 | MFCS | Meta-kernelization with Structural Parameters. | Robert Ganian, Friedrich Slivovsky, Stefan Szeider |
| 2013 | STACS | Model Counting for CNF Formulas of Bounded Modular Treewidth. | Danil Paulusma, Friedrich Slivovsky, Stefan Szeider |
| 2012 | SAT | Computing Resolution-Path Dependencies in Linear Time , . | Friedrich Slivovsky, Stefan Szeider |