Computing Resolution-Path Dependencies in Linear Time , . - Friedrich Slivovsky; Stefan Szeider (SAT, 2012)

Model Counting for Formulas of Bounded Clique-Width. - Friedrich Slivovsky; Stefan Szeider (ISAAC, 2013)

Meta-kernelization with Structural Parameters. - Robert Ganian; Friedrich Slivovsky; Stefan Szeider (MFCS, 2013)

Model Counting for CNF Formulas of Bounded Modular Treewidth. - Daniël Paulusma; Friedrich Slivovsky; Stefan Szeider (STACS, 2013)

Variable Dependencies and Q-Resolution. - Friedrich Slivovsky; Stefan Szeider (SAT, 2014)

Expander CNFs have Exponential DNNF Size. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (CoRR, 2014)

On Compiling Structured CNFs to OBDDs. - Simone Bova; Friedrich Slivovsky (CSR, 2015)

On Compiling CNFs into Structured Deterministic DNNFs. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (SAT, 2015)

Knowledge Compilation Meets Communication Complexity. - Simone Bova; Florent Capelli; Stefan Mengel; Friedrich Slivovsky (IJCAI, 2016)

Long Distance Q-Resolution with Dependency Schemes. - Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (SAT, 2016)

Quantifier Reordering for QBF. - Friedrich Slivovsky; Stefan Szeider (J. Autom. Reason., 2016)

Soundness of Q-resolution with dependency schemes. - Friedrich Slivovsky; Stefan Szeider (Theor. Comput. Sci., 2016)

Dependency Learning for QBF. - Tomás Peitl; Friedrich Slivovsky; Stefan Szeider (SAT, 2017)

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

Sum-of-Products with Default Values: Algorithms and Complexity Results. - Robert Ganian; Eun Jung Kim 002; Friedrich Slivovsky; Stefan Szeider (ICTAI, 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)

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

Interpolation-Based Semantic Gate Extraction and Its Applications to QBF Preprocessing. - Friedrich Slivovsky (CAV (1), 2020)

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

Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness. - Matthias Schlaipfer; Friedrich Slivovsky; Georg Weissenbacher; Florian Zuleger (SAT, 2020)

Short Q-Resolution Proofs with Homomorphisms. - Ankit Shukla 003; Friedrich Slivovsky; Stefan Szeider (SAT, 2020)

A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. - Friedrich Slivovsky; Stefan Szeider (SAT, 2020)

Engineering an Efficient Boolean Functional Synthesis Engine. - Priyanka Golia; Friedrich Slivovsky; Subhajit Roy 001; Kuldeep S. Meel (ICCAD, 2021)

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

Proof Complexity of Symbolic QBF Reasoning. - Stefan Mengel; Friedrich Slivovsky (SAT, 2021)

Certified DQBF Solving by Definition Extraction. - Franz-Xaver Reichl; Friedrich Slivovsky; Stefan Szeider (SAT, 2021)

Pedant: A Certifying DQBF Solver. - Franz-Xaver Reichl; Friedrich Slivovsky (SAT, 2022)

Quantified CDCL with Universal Resolution. - Friedrich Slivovsky (SAT, 2022)

Towards Uniform Certification in QBF. - Leroy Chew; Friedrich Slivovsky (STACS, 2022)

Circuit Minimization with QBF-Based Exact Synthesis. - Franz-Xaver Reichl; Friedrich Slivovsky; Stefan Szeider (AAAI, 2023)

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. - Johannes Klaus Fichte; Robert Ganian; Markus Hecher; Friedrich Slivovsky; Sebastian Ordyniak (LICS, 2023)

Dataset of Random Reordered Encodings of Parity Problems. - Leroy Chew; Alexis de Colnet; Friedrich Slivovsky; Stefan Szeider (Zenodo, 2023)

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. - Leroy Chew; Alexis de Colnet; Friedrich Slivovsky; Stefan Szeider (AAAI, 2024)

eSLIM: Circuit Minimization with SAT Based Local Improvement. - Franz-Xaver Reichl; Friedrich Slivovsky; Stefan Szeider (SAT, 2024)

Strategy Extraction by Interpolation. - Friedrich Slivovsky (SAT, 2024)

eSLIM. - Franz-Xaver Reichl; Friedrich Slivovsky; Stefan Szeider (DROPS Artifacts, 2024)

Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas. - Che Cheng; Long-Hin Fung; Jie-Hong Roland Jiang; Friedrich Slivovsky; Tony Tan (SAT, 2025)