| 2026 | AAAI | Graph Choosability via SAT: Beyond the Nullstellensatz. | Markus Kirchweger, Toms Peitl, David Seka, Stefan Szeider |
| 2026 | AAAI | Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms. | Sebastian Ordyniak, Mateusz Rychlicki, Stefan Szeider |
| 2026 | AAAI | Generating Streamlining Constraints with Large Language Models (Abstract Reprint). | Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider |
| 2026 | CP | Smart Cubing for Graph Search: A Comparative Study. | Markus Kirchweger, Toms Peitl, Stefan Szeider, Hai Xia |
| 2026 | CP | VIPR Certificate Construction from Black-Box ILP Solvers. | Stefan Szeider |
| 2026 | IJCAR | Formally Verified Graph Generation with SAT Modulo Symmetries and Lean. | Markus Kirchweger, Pablo Manrique, Stefan Szeider |
| 2025 | AAAI | Breaking Symmetries in Quantified Graph Search: A Comparative Study. | Mikols Janota, Markus Kirchweger, Toms Peitl, Stefan Szeider |
| 2025 | CP | Balancing Latin Rectangles with LLM-Generated Streamliners. | Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider |
| 2025 | CP | The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators. | Tianwei Zhang, Stefan Szeider |
| 2025 | ICCS | Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach. | Carlos Anstegui, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia |
| 2025 | ICML | Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. | Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider |
| 2025 | ICSE | StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners. | Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider |
| 2025 | SAT | Analyzing Reformulation Performance in Core-Guided MaxSAT Solving. | Andr Schidler, Stefan Szeider |
| 2025 | SAT | Bridging Language Models and Symbolic Solvers via the Model Context Protocol. | Stefan Szeider |
| 2025 | SoCS | Extracting Problem Structure with LLMs for Optimized SAT Local Search. | Andr Schidler, Stefan Szeider |
| 2025 | SYNASC | Towards SAT-Based Learning of NNF Networks. | Paul Seip, Florian Beck, Johannes Frnkranz, Clemens Hofstadler, Peter Pfeiffer, Martina Seidl, Robert Peharz, Stefan Szeider |
| 2024 | AAAI | Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. | Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider |
| 2024 | AAAI | Learning Small Decision Trees for Data of Low Rank-Width. | Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2024 | AAAI | A General Theoretical Framework for Learning Smallest Interpretable Models. | Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider |
| 2024 | AAAI | SAT-Based Tree Decomposition with Iterative Cascading Policy Selection. | Hai Xia, Stefan Szeider |
| 2024 | CP | Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper). | Markus Kirchweger, Stefan Szeider |
| 2024 | CP | Structure-Guided Local Improvement for Maximum Satisfiability. | Andr Schidler, Stefan Szeider |
| 2024 | IJCAI | Compilation and Fast Model Counting beyond CNF. | Alexis de Colnet, Stefan Szeider, Tianwei Zhang |
| 2024 | IJCAI | Revisiting Causal Discovery from a Complexity-Theoretic Perspective. | Robert Ganian, Viktoriia Korchemna, Stefan Szeider |
| 2024 | ICTAI | The Power of Collaboration: Learning Large Bayesian Networks at Scale. | Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia |
| 2024 | KR | ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP. | Leroy Chew, Alexis de Colnet, Stefan Szeider |
| 2024 | KR | Explaining Decisions in ML Models: A Parameterized Complexity Analysis. | Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider |
| 2024 | SAT | eSLIM: Circuit Minimization with SAT Based Local Improvement. | Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider |
| 2024 | SAT | Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. | Tianwei Zhang, Toms Peitl, Stefan Szeider |
| 2023 | AAAI | Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2023 | AAAI | Circuit Minimization with QBF-Based Exact Synthesis. | Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider |
| 2023 | CP | Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper). | Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider |
| 2023 | CP | Searching for Smallest Universal Graphs and Tournaments with SAT. | Tianwei Zhang, Stefan Szeider |
| 2023 | ICML | The Computational Complexity of Concise Hypersphere Classification. | Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2023 | IJCAI | Learning Small Decision Trees with Large Domain. | Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2023 | IJCAI | Co-Certificate Learning with SAT Modulo Symmetries. | Markus Kirchweger, Toms Peitl, Stefan Szeider |
| 2023 | IJCAI | The Parameterized Complexity of Finding Concise Local Explanations. | Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2023 | IJCAI | Computing Twin-width with SAT and Branch & Bound. | Andr Schidler, Stefan Szeider |
| 2023 | SAT | IPASIR-UP: User Propagators for CDCL. | Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere |
| 2023 | SAT | A SAT Solver's Opinion on the Erdős-Faber-Lovsz Conjecture. | Markus Kirchweger, Toms Peitl, Stefan Szeider |
| 2023 | SAT | SAT-Based Generation of Planar Graphs. | Markus Kirchweger, Manfred Scheucher, Stefan Szeider |
| 2022 | AAAI | Tractable Abstract Argumentation via Backdoor-Treewidth. | Wolfgang Dvork, Markus Hecher, Matthias Knig, Andr Schidler, Stefan Szeider, Stefan Woltran |
| 2022 | ALENEX | A SAT Approach to Twin-Width. | Andr Schidler, Stefan Szeider |
| 2022 | CP | CSP Beyond Tractable Constraint Languages. | Jan Dreier, Sebastian Ordyniak, Stefan Szeider |
| 2022 | ESA | SAT Backdoors: Depth Beats Size. | Jan Dreier, Sebastian Ordyniak, Stefan Szeider |
| 2022 | ESA | Finding a Cluster in Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2022 | UAI | Learning large Bayesian networks with expert constraints. | Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider |
| 2022 | SAT | Weighted Model Counting with Twin-Width. | Robert Ganian, Filip Pokrvka, Andr Schidler, Kirill Simonov, Stefan Szeider |
| 2022 | SAT | A SAT Attack on Rota's Basis Conjecture. | Markus Kirchweger, Manfred Scheucher, Stefan Szeider |
| 2021 | AAAI | The Parameterized Complexity of Clustering Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2021 | AAAI | Parameterized Complexity of Small Decision Tree Learning. | Sebastian Ordyniak, Stefan Szeider |
| 2021 | AAAI | Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. | Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider |
| 2021 | AAAI | SAT-based Decision Tree Learning for Large Data Sets. | Andr Schidler, Stefan Szeider |
| 2021 | CP | SAT Modulo Symmetries for Graph Generation. | Markus Kirchweger, Stefan Szeider |
| 2021 | IJCAI | Backdoor DNFs. | Sebastian Ordyniak, Andr Schidler, Stefan Szeider |
| 2021 | IJCAI | Finding the Hardest Formulas for Resolution (Extended Abstract). | Toms Peitl, Stefan Szeider |
| 2021 | IJCAI | Computing Optimal Hypertree Decompositions with SAT. | Andr Schidler, Stefan Szeider |
| 2021 | SAT | Certified DQBF Solving by Definition Extraction. | Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider |
| 2020 | AAAI | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. | Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2020 | ALENEX | Computing Optimal Hypertree Decompositions. | Andr Schidler, Stefan Szeider |
| 2020 | CP | A Time Leap Challenge for SAT-Solving. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2020 | CP | Breaking Symmetries with RootClique and LexTopSort. | Johannes Klaus Fichte, Markus Hecher, Stefan Szeider |
| 2020 | CP | Finding the Hardest Formulas for Resolution. | Toms Peitl, Stefan Szeider |
| 2020 | CP | MaxSAT-Based Postprocessing for Treedepth. | Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider |
| 2020 | IJCAI | Threshold Treewidth and Hypertree Width. | Robert Ganian, Andr Schidler, Manuel Sorge, Stefan Szeider |
| 2020 | KR | Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. | Robert Ganian, Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 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 | ALENEX | SAT-Encodings for Treecut Width and Treedepth. | Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2019 | CP | A Join-Based Hybrid Parameter for Constraint Satisfaction. | Robert Ganian, Sebastian Ordyniak, 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 | An SMT Approach to Fractional Hypertree Width. | Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider |
| 2018 | CP | Portfolio-Based Algorithm Selection for Circuit QBFs. | Holger H. Hoos, Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2018 | ICML | Parameterized Algorithms for the Matrix Completion Problem. | Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, 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 | AAAI | Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. | M. S. Ramanujan, Stefan Szeider |
| 2017 | IJCAI | A SAT Approach to Branchwidth. | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2017 | LPNMR | Backdoor Trees for Answer Set Programming. | Johannes Klaus Fichte, Stefan Szeider |
| 2017 | PODS | Circuit Treewidth, Sentential Decision, and Query Compilation. | Simone Bova, Stefan Szeider |
| 2017 | STACS | Combining Treewidth and Backdoors for CSP. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2017 | SAT | SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. | Johannes Klaus Fichte, Neha Lodha, Stefan Szeider |
| 2017 | SAT | Backdoor Treewidth for SAT. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2017 | SAT | New Width Parameters for Model Counting. | Robert Ganian, Stefan Szeider |
| 2017 | SAT | SAT-Encodings for Special Treewidth and Pathwidth. | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2017 | SAT | Dependency Learning for QBF. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2016 | CP | Backdoors to Tractable Valued CSP. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2016 | KR | Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. | Ronald de Haan, Stefan Szeider |
| 2016 | MFCS | On Existential MSO and its Relation to ETH. | Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2016 | SODA | Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. | Robert Ganian, M. S. Ramanujan, Stefan Szeider |
| 2016 | SAT | A SAT Approach to Branchwidth. | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2016 | SAT | Long Distance Q-Resolution with Dependency Schemes. | Toms Peitl, Friedrich Slivovsky, Stefan Szeider |
| 2015 | MFCS | Algorithmic Applications of Tree-Cut Width. | Robert Ganian, Eun Jung Kim, Stefan Szeider |
| 2015 | SAT | Community Structure Inspired Algorithms for SAT and #SAT. | Robert Ganian, Stefan Szeider |
| 2015 | SOFSEM | Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. | Ronald de Haan, Stefan Szeider |
| 2015 | WADS | Solving Problems on Graphs of High Rank-Width. | Eduard Eiben, Robert Ganian, Stefan Szeider |
| 2014 | AAAI | Backdoors into Heterogeneous Classes of SAT and CSP. | Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivn |
| 2014 | COCOA | Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications. | Iyad A. Kanj, Stefan Szeider |
| 2014 | CP | Subexponential Time Complexity of CSP with Global Constraints. | Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2014 | CSL | Model checking existential logic on partially ordered sets. | Simone Bova, Robert Ganian, Stefan Szeider |
| 2014 | ICTAI | Small Unsatisfiable Subsets in Constraint Satisfaction. | Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2014 | KR | The Parameterized Complexity of Reasoning Problems Beyond NP. | Ronald de Haan, Stefan Szeider |
| 2014 | SAT | Fixed-Parameter Tractable Reductions to SAT. | Ronald de Haan, Stefan Szeider |
| 2014 | SAT | Variable Dependencies and Q-Resolution. | Friedrich Slivovsky, Stefan Szeider |
| 2013 | AAAI | Backdoors to Normality for Disjunctive Logic Programs. | Johannes Klaus Fichte, Stefan Szeider |
| 2013 | AAAI | Parameterized Complexity Results for Plan Reuse. | Ronald de Haan, Anna Roubckov, Stefan Szeider |
| 2013 | AAAI | On the Subexponential Time Complexity of CSP. | Iyad A. Kanj, Stefan Szeider |
| 2013 | CIAC | Parameterized Complexity and Kernel Bounds for Hard Planning Problems. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider |
| 2013 | FOCS | Strong Backdoors to Bounded Treewidth SAT. | Serge Gaspers, Stefan Szeider |
| 2013 | IJCAI | Backdoors to Abduction. | Andreas Pfandler, Stefan Rmmele, Stefan Szeider |
| 2013 | ISAAC | Model Counting for Formulas of Bounded Clique-Width. | Friedrich Slivovsky, Stefan Szeider |
| 2013 | ICTAI | Capturing Structure in Hard Combinatorial Problems. | Stefan Szeider |
| 2013 | MFCS | Meta-kernelization with Structural Parameters. | Robert Ganian, Friedrich Slivovsky, Stefan Szeider |
| 2013 | MFCS | Revisiting Space in Proof Complexity: Treewidth and Pathwidth. | Moritz Mller, Stefan Szeider |
| 2013 | STACS | Backdoors to q-Horn. | Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider |
| 2013 | STACS | Model Counting for CNF Formulas of Bounded Modular Treewidth. | Danil Paulusma, Friedrich Slivovsky, Stefan Szeider |
| 2013 | SAT | Local Backbones. | Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
| 2013 | SAT | A SAT Approach to Clique-Width. | Marijn Heule, Stefan Szeider |
| 2013 | SAT | Upper and Lower Bounds for Weak Backdoor Set Detection. | Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider |
| 2012 | AAAI | The Complexity of Planning Revisited - A Parameterized Analysis. | Christer Bckstrm, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider |
| 2012 | AAAI | On Finding Optimal Polytrees. | Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider |
| 2012 | AAAI | Don't Be Strict in Local Search! | Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider |
| 2012 | ICALP | Backdoors to Acyclic SAT. | Serge Gaspers, Stefan Szeider |
| 2012 | LATIN | k-Gap Interval Graphs. | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
| 2012 | SAT | Strong Backdoors to Nested Satisfiability. | Serge Gaspers, Stefan Szeider |
| 2012 | SAT | Computing Resolution-Path Dependencies in Linear Time , . | Friedrich Slivovsky, Stefan Szeider |
| 2011 | AAAI | Limits of Preprocessing. | Stefan Szeider |
| 2011 | CP | The Parameterized Complexity of Local Consistency. | Serge Gaspers, Stefan Szeider |
| 2011 | IJCAI | Backdoors to Tractable Answer-Set Programming. | Johannes Klaus Fichte, Stefan Szeider |
| 2011 | IJCAI | Kernels for Global Constraints. | Serge Gaspers, Stefan Szeider |
| 2011 | IJCAI | Augmenting Tractable Fragments of Abstract Argumentation. | Sebastian Ordyniak, Stefan Szeider |
| 2011 | SAT | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). | Sebastian Ordyniak, Danil Paulusma, Stefan Szeider |
| 2010 | COMMA | Reasoning in Argumentation Frameworks of Bounded Clique-Width. | Wolfgang Dvork, Stefan Szeider, Stefan Woltran |
| 2010 | COMMA | Algorithms and Complexity Results for Persuasive Argumentation. | Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider |
| 2010 | KR | Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. | Reinhard Pichler, Stefan Rmmele, Stefan Szeider, Stefan Woltran |
| 2010 | SODA | Solving MAX-r-SAT Above a Tight Lower Bound. | Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo |
| 2010 | UAI | Algorithms and Complexity Results for Exact Bayesian Structure Learning. | Sebastian Ordyniak, Stefan Szeider |
| 2010 | SOFSEM | On Contracting Graphs to Fixed Pattern Graphs. | Pim van 't Hof, Marcin Kaminski, Danil Paulusma, Stefan Szeider, Dimitrios M. Thilikos |
| 2009 | SAT | The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. | Stefan Szeider |
| 2008 | AAAI | Backdoor Trees. | Marko Samer, Stefan Szeider |
| 2008 | COCOA | Parameterized Graph Editing with Chosen Vertex Degrees. | Luke Mathieson, Stefan Szeider |
| 2008 | MFCS | Monadic Second Order Logic on Graphs with Local Cardinality Constraints. | Stefan Szeider |
| 2007 | COCOA | On the Complexity of Some Colorful Problems Parameterized by Treewidth. | Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen |
| 2007 | FOCS | Parameterized Proof Complexity. | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
| 2007 | LPAR | Algorithms for Propositional Model Counting. | Marko Samer, Stefan Szeider |
| 2007 | SAT | Backdoor Sets of Quantified Boolean Formulas. | Marko Samer, Stefan Szeider |
| 2007 | SAT | Matched Formulas and Backdoor Sets. | Stefan Szeider |
| 2006 | CIAC | The Linear Arrangement Problem Parameterized Above Guaranteed Value. | Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo |
| 2006 | CP | Constraint Satisfaction with Bounded Treewidth Revisited. | Marko Samer, Stefan Szeider |
| 2006 | STOC | Clique-width minimization is NP-hard. | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
| 2006 | SAT | Solving #SAT Using Vertex Covers. | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
| 2004 | SAT | Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. | Shlomo Hoory, Stefan Szeider |
| 2004 | SAT | Detecting Backdoor Sets with Respect to Horn and Binary Clauses. | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
| 2003 | COCOON | Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. | Stefan Szeider |
| 2003 | STACS | The Complexity of Resolution with Generalized Symmetry Rules. | Stefan Szeider |
| 2003 | SAT | On Fixed-Parameter Tractable Parameterizations of SAT. | Stefan Szeider |
| 2001 | CADE | NP-Completeness of Refutability by Literal-Once Resolution. | Stefan Szeider |