Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference - Herbert Fleischner; Stefan Szeider (Electron. Colloquium Comput. Complex., 2000)

NP-Completeness of Refutability by Literal-Once Resolution. - Stefan Szeider (IJCAR, 2001)

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. - Herbert Fleischner; Oliver Kullmann; Stefan Szeider (Theor. Comput. Sci., 2002)

On Fixed-Parameter Tractable Parameterizations of SAT. - Stefan Szeider (SAT, 2003)

Finding paths in graphs avoiding forbidden transitions. - Stefan Szeider (Discret. Appl. Math., 2003)

Homomorphisms of conjunctive normal forms. - Stefan Szeider (Discret. Appl. Math., 2003)

Detecting Backdoor Sets with Respect to Horn and Binary Clauses. - Naomi Nishimura; Prabhakar Ragde; Stefan Szeider (SAT, 2004)

On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors. - Stefan Szeider (Ars Comb., 2004)

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. - Stefan Szeider (J. Comput. Syst. Sci., 2004)

Generalizations of matched CNF formulas. - Stefan Szeider (Ann. Math. Artif. Intell., 2005)

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (Electron. Colloquium Comput. Complex., 2005)

Proving NP-hardness for clique-width II: non-approximability of clique-width - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (Electron. Colloquium Comput. Complex., 2005)

On Edge-Colored Graphs Covered by Properly Colored Cycles. - Herbert Fleischner; Stefan Szeider (Graphs Comb., 2005)

Backdoor Sets for DLL Subsolvers. - Stefan Szeider (J. Autom. Reason., 2005)

The Complexity of Resolution with Generalized Symmetry Rules. - Stefan Szeider (Theory Comput. Syst., 2005)

Computing unsatisfiable k-SAT instances with few occurrences per variable. - Shlomo Hoory; Stefan Szeider (Theor. Comput. Sci., 2005)

Clique-width minimization is NP-hard. - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (STOC, 2006)

Complexity and Applications of Edge-Induced Vertex-Cuts - Marko Samer; Stefan Szeider (CoRR, 2006)

A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth - Marko Samer; Stefan Szeider (CoRR, 2006)

A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. - Shlomo Hoory; Stefan Szeider (SIAM J. Discret. Math., 2006)

On finding short resolution refutations and small unsatisfiable subsets. - Michael R. Fellows; Stefan Szeider; Graham Wrightson (Theor. Comput. Sci., 2006)

Solving #SAT using vertex covers. - Naomi Nishimura; Prabhakar Ragde; Stefan Szeider (Acta Informatica, 2007)

Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. - Stefan S. Dantchev; Barnaby Martin; Stefan Szeider (Electron. Colloquium Comput. Complex., 2007)

The Linear Arrangement Problem Parameterized Above Guaranteed Value. - Gregory Z. Gutin; Arash Rafiey; Stefan Szeider; Anders Yeo (Theory Comput. Syst., 2007)

Backdoor Trees. - Marko Samer; Stefan Szeider (AAAI, 2008)

The Parameterized Complexity of Regular Subgraph Problems and Generalizations. - Luke Mathieson; Stefan Szeider (CATS, 2008)

Parameterized Graph Editing with Chosen Vertex Degrees. - Luke Mathieson; Stefan Szeider (COCOA, 2008)

Fixed-Parameter Complexity of Minimum Profile Problems. - Gregory Z. Gutin; Stefan Szeider; Anders Yeo (Algorithmica, 2008)

Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems. - Georg Gottlob; Stefan Szeider (Comput. J., 2008)

Preface. - Hajo Broersma; Stefan S. Dantchev; Matthew Johnson 002; Stefan Szeider (J. Discrete Algorithms, 2008)

Parameterized SAT. - Stefan Szeider (Encyclopedia of Algorithms, 2008)

A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound - Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (CoRR, 2009)

Solving MAX-2-SAT Above a Tight Lower Bound - Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (CoRR, 2009)

Backdoor Sets of Quantified Boolean Formulas. - Marko Samer; Stefan Szeider (J. Autom. Reason., 2009)

Matched Formulas and Backdoor Sets. - Stefan Szeider (J. Satisf. Boolean Model. Comput., 2009)

Clique-Width is NP-Complete. - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (SIAM J. Discret. Math., 2009)

Covering graphs with few complete bipartite subgraphs. - Herbert Fleischner; Egbert Mujuni; Daniël Paulusma; Stefan Szeider (Theor. Comput. Sci., 2009)

Fixed-Parameter Tractability. - Marko Samer; Stefan Szeider (Handbook of Satisfiability, 2009)

Reasoning in Argumentation Frameworks of Bounded Clique-Width. - Wolfgang Dvorák; Stefan Szeider; Stefan Woltran (COMMA, 2010)

Solving MAX-r-SAT Above a Tight Lower Bound. - Noga Alon; Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (SODA, 2010)

On Contracting Graphs to Fixed Pattern Graphs. - Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma; Stefan Szeider; Dimitrios M. Thilikos (SOFSEM, 2010)

Algorithms and Complexity Results for Exact Bayesian Structure Learning. - Sebastian Ordyniak; Stefan Szeider (UAI, 2010)

Constraint satisfaction with bounded treewidth revisited. - Marko Samer; Stefan Szeider (J. Comput. Syst. Sci., 2010)

Editorial. - Hajo Broersma; Stefan S. Dantchev; Matthew Johnson 002; Stefan Szeider (J. Discrete Algorithms, 2010)

Algorithms for propositional model counting. - Marko Samer; Stefan Szeider (J. Discrete Algorithms, 2010)

Limits of Preprocessing. - Stefan Szeider (AAAI, 2011)

Kernels for Global Constraints. - Serge Gaspers; Stefan Szeider (IJCAI, 2011)

Augmenting Tractable Fragments of Abstract Argumentation. - Sebastian Ordyniak; Stefan Szeider (IJCAI, 2011)

The Parameterized Complexity of Constraint Satisfaction and Reasoning. - Stefan Szeider (INAP/WLP, 2011)

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). - Sebastian Ordyniak; Daniël Paulusma; Stefan Szeider (SAT, 2011)

Algorithms and complexity results for persuasive argumentation. - Eun Jung Kim 002; Sebastian Ordyniak; Stefan Szeider (Artif. Intell., 2011)

Solving MAX-r-SAT Above a Tight Lower Bound. - Noga Alon; Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (Algorithmica, 2011)

Parameterized Proof Complexity. - Stefan S. Dantchev; Barnaby Martin; Stefan Szeider (Comput. Complex., 2011)

Tractable cases of the extended global cardinality constraint. - Marko Samer; Stefan Szeider (Constraints An Int. J., 2011)

Not So Easy Problems for Tree Decomposable Graphs - Stefan Szeider (CoRR, 2011)

The parameterized complexity of k-flip local search for SAT and MAX SAT. - Stefan Szeider (Discret. Optim., 2011)

The Parameterized Complexity of Local Consistency. - Serge Gaspers; Stefan Szeider (Electron. Colloquium Comput. Complex., 2011)

On the complexity of some colorful problems parameterized by treewidth. - Michael R. Fellows; Fedor V. Fomin; Daniel Lokshtanov; Frances A. Rosamond; Saket Saurabh 001; Stefan Szeider; Carsten Thomassen (Inf. Comput., 2011)

A probabilistic approach to problems parameterized above or below tight bounds. - Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (J. Comput. Syst. Sci., 2011)

Monadic second order logic on graphs with local cardinality constraints. - Stefan Szeider (ACM Trans. Comput. Log., 2011)

The Complexity of Planning Revisited - A Parameterized Analysis. - Christer Bäckström; Yue Chen; Peter Jonsson; Sebastian Ordyniak; Stefan Szeider (AAAI, 2012)

Don't Be Strict in Local Search! - Serge Gaspers; Eun Jung Kim 002; Sebastian Ordyniak; Saket Saurabh 001; Stefan Szeider (AAAI, 2012)

Backdoors to Satisfaction. - Serge Gaspers; Stefan Szeider (The Multivariate Algorithmic Revolution and Beyond, 2012)

Backdoors to Acyclic SAT. - Serge Gaspers; Stefan Szeider (ICALP (1), 2012)

k-Gap Interval Graphs. - Fedor V. Fomin; Serge Gaspers; Petr A. Golovach; Karol Suchan; Stefan Szeider; Erik Jan van Leeuwen; Martin Vatshelle; Yngve Villanger (LATIN, 2012)

Strong Backdoors to Nested Satisfiability. - Serge Gaspers; Stefan Szeider (SAT, 2012)

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

Abstract Argumentation via Monadic Second Order Logic. - Wolfgang Dvorák; Stefan Szeider; Stefan Woltran (SUM, 2012)

Augmenting tractable fragments of abstract argumentation. - Wolfgang Dvorák; Sebastian Ordyniak; Stefan Szeider (Artif. Intell., 2012)

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. - Gregory Z. Gutin; Eun Jung Kim 002; Arezou Soleimanfallah; Stefan Szeider; Anders Yeo (Algorithmica, 2012)

On graph contractions and induced minors. - Pim van 't Hof; Marcin Kaminski 001; Daniël Paulusma; Stefan Szeider; Dimitrios M. Thilikos (Discret. Appl. Math., 2012)

Editing graphs to satisfy degree constraints: A parameterized approach. - Luke Mathieson; Stefan Szeider (J. Comput. Syst. Sci., 2012)

Parameterized Complexity Results for Plan Reuse. - Ronald de Haan; Anna Roubícková; Stefan Szeider (AAAI, 2013)

On the Subexponential Time Complexity of CSP. - Iyad A. Kanj; Stefan Szeider (AAAI, 2013)

Parameterized Complexity and Kernel Bounds for Hard Planning Problems. - Christer Bäckström; Peter Jonsson; Sebastian Ordyniak; Stefan Szeider (CIAC, 2013)

Strong Backdoors to Bounded Treewidth SAT. - Serge Gaspers; Stefan Szeider (FOCS, 2013)

Capturing Structure in Hard Combinatorial Problems. - Stefan Szeider (ICTAI, 2013)

Backdoors to Abduction. - Andreas Pfandler; Stefan Rümmele; Stefan Szeider (IJCAI, 2013)

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

Local Backbones. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (SAT, 2013)

Upper and Lower Bounds for Weak Backdoor Set Detection. - Neeldhara Misra; Sebastian Ordyniak; Venkatesh Raman 001; Stefan Szeider (SAT, 2013)

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. - Eun Jung Kim 002; Sebastian Ordyniak; Stefan Szeider (TAFA, 2013)

Revisiting Space in Proof Complexity: Treewidth and Pathwidth. - Moritz Müller; Stefan Szeider (Electron. Colloquium Comput. Complex., 2013)

Preface. - Agata Ciabattoni; Rusins Freivalds; Antonín Kucera 001; Igor Potapov; Stefan Szeider (Fundam. Informaticae, 2013)

Parameterized Complexity Results for Exact Bayesian Network Structure Learning. - Sebastian Ordyniak; Stefan Szeider (J. Artif. Intell. Res., 2013)

Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. - Gregory Z. Gutin; Arash Rafiey; Stefan Szeider; Anders Yeo (Theory Comput. Syst., 2013)

Satisfiability of acyclic and almost acyclic CNF formulas. - Sebastian Ordyniak; Daniël Paulusma; Stefan Szeider (Theor. Comput. Sci., 2013)

Subexponential Time Complexity of CSP with Global Constraints. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (CP, 2014)

Small Unsatisfiable Subsets in Constraint Satisfaction. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (ICTAI, 2014)

The Parameterized Complexity of Reasoning Problems Beyond NP. - Ronald de Haan; Stefan Szeider (KR, 2014)

Fixed-Parameter Tractable Reductions to SAT. - Ronald de Haan; Stefan Szeider (SAT, 2014)

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

Guarantees and limits of preprocessing in constraint satisfaction and reasoning. - Serge Gaspers; Stefan Szeider (Artif. Intell., 2014)

Tractable answer-set programming with weight constraints: bounded treewidth is not enough. - Reinhard Pichler; Stefan Rümmele; Stefan Szeider; Stefan Woltran (Theory Pract. Log. Program., 2014)

Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. - Ulle Endriss; Ronald de Haan; Stefan Szeider (AAMAS, 2015)

Community Structure Inspired Algorithms for SAT and #SAT. - Robert Ganian; Stefan Szeider (SAT, 2015)

Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP. - Ronald de Haan; Stefan Szeider (SOFSEM, 2015)

Backdoors to tractable answer set programming. - Johannes Klaus Fichte; Stefan Szeider (Artif. Intell., 2015)

Guest Editorial: Special Issue on Parameterized and Exact Computation. - Gregory Z. Gutin; Stefan Szeider (Algorithmica, 2015)

Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. - Robert Ganian; Martin Kalany; Stefan Szeider; Jesper Larsson Träff (CoRR, 2015)

On the Subexponential-Time Complexity of CSP. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (J. Artif. Intell. Res., 2015)

A complete parameterized complexity analysis of bounded planning. - Christer Bäckström; Peter Jonsson; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2015)

On finding optimal polytrees. - Serge Gaspers; Mikko Koivisto; Mathieu Liedloff; Sebastian Ordyniak; Stefan Szeider (Theor. Comput. Sci., 2015)

Parameterized and subexponential-time complexity of satisfiability problems and applications. - Iyad A. Kanj; Stefan Szeider (Theor. Comput. Sci., 2015)

Backdoors to Normality for Disjunctive Logic Programs. - Johannes Klaus Fichte; Stefan Szeider (ACM Trans. Comput. Log., 2015)

A SAT Approach to Clique-Width. - Marijn Heule; Stefan Szeider (ACM Trans. Comput. Log., 2015)

Backdoors to Tractable Valued CSP. - Robert Ganian; M. S. Ramanujan 001; Stefan Szeider (CP, 2016)

Polynomial-Time Construction of Optimal MPI Derived Datatype Trees. - Robert Ganian; Martin Kalany; Stefan Szeider; Jesper Larsson Träff (IPDPS, 2016)

Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. - Ronald de Haan; Stefan Szeider (KR, 2016)

Backdoors to q-Horn. - Serge Gaspers; Sebastian Ordyniak; M. S. Ramanujan 001; Saket Saurabh 001; Stefan Szeider (Algorithmica, 2016)

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

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

Meta-kernelization with structural parameters. - Robert Ganian; Friedrich Slivovsky; Stefan Szeider (J. Comput. Syst. Sci., 2016)

Quantified conjunctive queries on partially ordered sets. - Simone Bova; Robert Ganian; Stefan Szeider (Theor. Comput. Sci., 2016)

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

Model Checking Existential Logic on Partially Ordered Sets. - Simone Bova; Robert Ganian; Stefan Szeider (ACM Trans. Comput. Log., 2016)

Parameterized SAT. - Stefan Szeider (Encyclopedia of Algorithms, 2016)

Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable. - M. S. Ramanujan 001; Stefan Szeider (AAAI, 2017)

Backdoor Sets for CSP. - Serge Gaspers; Sebastian Ordyniak; Stefan Szeider (The Constraint Satisfaction Problem, 2017)

Backdoor Trees for Answer Set Programming. - Johannes Klaus Fichte; Stefan Szeider (ASPOCP@LPNMR, 2017)

Circuit Treewidth, Sentential Decision, and Query Compilation. - Simone Bova; Stefan Szeider (PODS, 2017)

SAT-Based Local Improvement for Finding Tree Decompositions of Small Width. - Johannes Klaus Fichte; Neha Lodha; Stefan Szeider (SAT, 2017)

Backdoor Treewidth for SAT. - Robert Ganian; M. S. Ramanujan 001; Stefan Szeider (SAT, 2017)

New Width Parameters for Model Counting. - Robert Ganian; Stefan Szeider (SAT, 2017)

SAT-Encodings for Special Treewidth and Pathwidth. - Neha Lodha; Sebastian Ordyniak; Stefan Szeider (SAT, 2017)

Combining Treewidth and Backdoors for CSP. - Robert Ganian; M. S. Ramanujan 001; Stefan Szeider (STACS, 2017)

Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381). - Adnan Darwiche; Pierre Marquis; Dan Suciu; Stefan Szeider (Dagstuhl Reports, 2017)

The treewidth of proofs. - Moritz Müller; Stefan Szeider (Inf. Comput., 2017)

Backdoors into heterogeneous classes of SAT and CSP. - Serge Gaspers; Neeldhara Misra; Sebastian Ordyniak; Stefan Szeider; Stanislav Zivný (J. Comput. Syst. Sci., 2017)

Parameterized complexity classes beyond para-NP. - Ronald de Haan; Stefan Szeider (J. Comput. Syst. Sci., 2017)

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. - Robert Ganian; M. S. Ramanujan 001; Stefan Szeider (ACM Trans. Algorithms, 2017)

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. - Ronald de Haan; Iyad A. Kanj; Stefan Szeider (ACM Trans. Comput. Log., 2017)

An SMT Approach to Fractional Hypertree Width. - Johannes Klaus Fichte; Markus Hecher; Neha Lodha; Stefan Szeider (CP, 2018)

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

Parameterized Algorithms for the Matrix Completion Problem. - Robert Ganian; Iyad A. Kanj; Sebastian Ordyniak; Stefan Szeider (ICML, 2018)

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

Solving Problems on Graphs of High Rank-Width. - Eduard Eiben; Robert Ganian; Stefan Szeider (Algorithmica, 2018)

Meta-kernelization using well-structured modulators. - Eduard Eiben; Robert Ganian; Stefan Szeider (Discret. Appl. Math., 2018)

SAT-Encodings for Treecut Width and Treedepth. - Robert Ganian; Neha Lodha; Sebastian Ordyniak; Stefan Szeider (ALENEX, 2019)

A Join-Based Hybrid Parameter for Constraint Satisfaction. - Robert Ganian; Sebastian Ordyniak; Stefan Szeider (CP, 2019)

The Parameterized Complexity of Cascading Portfolio Scheduling. - Eduard Eiben; Robert Ganian; Iyad Kanj; Stefan Szeider (NeurIPS, 2019)

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)

A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. - Ronald de Haan; Stefan Szeider (Algorithms, 2019)

On Clustering Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (CoRR, 2019)

On the parameterized complexity of (k, s)-SAT. - Daniël Paulusma; Stefan Szeider (Inf. Process. Lett., 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)

A SAT Approach to Branchwidth. - Neha Lodha; Sebastian Ordyniak; Stefan Szeider (ACM Trans. Comput. Log., 2019)

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. - Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (AAAI, 2020)

Computing Optimal Hypertree Decompositions. - André Schidler; Stefan Szeider (ALENEX, 2020)

A Time Leap Challenge for SAT-Solving. - Johannes Klaus Fichte; Markus Hecher; Stefan Szeider (CP, 2020)

Breaking Symmetries with RootClique and LexTopSort. - Johannes Klaus Fichte; Markus Hecher; Stefan Szeider (CP, 2020)

MaxSAT-Based Postprocessing for Treedepth. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (CP, 2020)

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

Formalizing Graph Trail Properties in Isabelle/HOL. - Laura Kovács; Hanna Lachnitt; Stefan Szeider (CICM, 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)

On Existential MSO and Its Relation to ETH. - Robert Ganian; Ronald de Haan; Iyad Kanj; Stefan Szeider (ACM Trans. Comput. Theory, 2020)

The Parameterized Complexity of Clustering Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (AAAI, 2021)

Parameterized Complexity of Small Decision Tree Learning. - Sebastian Ordyniak; Stefan Szeider (AAAI, 2021)

Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (AAAI, 2021)

SAT Modulo Symmetries for Graph Generation. - Markus Kirchweger; Stefan Szeider (CP, 2021)

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

Learning Fast-Inference Bayesian Networks. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (NeurIPS, 2021)

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

New width parameters for SAT and #SAT. - Robert Ganian; Stefan Szeider (Artif. Intell., 2021)

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

Fixed-Parameter Tractability. - Marko Samer; Stefan Szeider (Handbook of Satisfiability, 2021)

DT-SLIM Results. - André Schidler; Stefan Szeider (Zenodo, 2021)

DT-SLIM: SAT-based Decision Tree Learning for Large Data Sets. - André Schidler; Stefan Szeider (Zenodo, 2021)

HtdLEO Results. - André Schidler; Stefan Szeider (Zenodo, 2021)

HtdLEO source code. - André Schidler; Stefan Szeider (Zenodo, 2021)

aditya95sriram/bn-slim: NeurIPS 2021. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (Zenodo, 2021)

A SAT Approach to Twin-Width. - André Schidler; Stefan Szeider (Zenodo, 2021)

Tractable Abstract Argumentation via Backdoor-Treewidth. - Wolfgang Dvorák; Markus Hecher; Matthias König 002; André Schidler; Stefan Szeider; Stefan Woltran (AAAI, 2022)

A SAT Approach to Twin-Width. - André Schidler; Stefan Szeider (ALENEX, 2022)

Finding a Cluster in Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (ESA, 2022)

Weighted Model Counting with Twin-Width. - Robert Ganian; Filip Pokrývka; André Schidler; Kirill Simonov; Stefan Szeider (SAT, 2022)

A SAT Attack on Rota's Basis Conjecture. - Markus Kirchweger; Manfred Scheucher; Stefan Szeider (SAT, 2022)

Learning large Bayesian networks with expert constraints. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (UAI, 2022)

Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. - Robert Ganian; Jan Kratochvíl; Stefan Szeider (Discret. Appl. Math., 2022)

Sum-of-Products with Default Values: Algorithms and Complexity Results. - Robert Ganian; Eun Jung Kim 002; Friedrich Slivovsky; Stefan Szeider (J. Artif. Intell. Res., 2022)

Threshold Treewidth and Hypertree Width. - Robert Ganian; André Schidler; Manuel Sorge; Stefan Szeider (J. Artif. Intell. Res., 2022)

Weighted Model Counting with Twin-Width: Experimental Results. - Robert Ganian; Filip Pokrývka; André Schidler; Kirill Simonov; Stefan Szeider (Zenodo, 2022)

Computing Optimal Hypertree Decompositions with SAT - Results. - André Schidler; Stefan Szeider (Zenodo, 2022)

Algorithmic Applications of Tree-Cut Width. - Robert Ganian; Eun Jung Kim 002; Stefan Szeider (SIAM J. Discret. Math., 2022)

Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. - Johannes Klaus Fichte; Markus Hecher; Stefan Szeider (AAAI, 2023)

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

Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper). - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (CP, 2023)

Searching for Smallest Universal Graphs and Tournaments with SAT. - Tianwei Zhang; Stefan Szeider (CP, 2023)

The Computational Complexity of Concise Hypersphere Classification. - Eduard Eiben; Robert Ganian; Iyad A. Kanj; Sebastian Ordyniak; Stefan Szeider (ICML, 2023)

Learning Small Decision Trees with Large Domain. - Eduard Eiben; Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (IJCAI, 2023)

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

The Parameterized Complexity of Finding Concise Local Explanations. - Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (IJCAI, 2023)

Computing Twin-width with SAT and Branch & Bound. - André Schidler; Stefan Szeider (IJCAI, 2023)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (IPEC, 2023)

IPASIR-UP: User Propagators for CDCL. - Katalin Fazekas; Aina Niemetz; Mathias Preiner; Markus Kirchweger; Stefan Szeider; Armin Biere (SAT, 2023)

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

SAT-Based Generation of Planar Graphs. - Markus Kirchweger; Manfred Scheucher; Stefan Szeider (SAT, 2023)

SAT Encodings and Beyond (Dagstuhl Seminar 23261). - Marijn J. H. Heule; Inês Lynce; Stefan Szeider; André Schidler (Dagstuhl Reports, 2023)

SAT-Boosted Tabu Search for Coloring Massive Graphs - Experiments. - André Schidler; Stefan Szeider (Zenodo, 2023)

Computing twin-width with SAT and branch & bound - Results. - André Schidler; Stefan Szeider (Zenodo, 2023)

Computing twin-width with SAT and branch & bound. - André Schidler; Stefan Szeider (Zenodo, 2023)

SAT-Boosted Tabu Search for Coloring Massive Graphs - Code. - André Schidler; Stefan Szeider (Zenodo, 2023)

Supplementary material of submission "IPASIR-UP: User Propagators for CDCL". - Katalin Fazekas; Aina Niemetz; Mathias Preiner; Markus Kirchweger; Stefan Szeider; Armin Biere (Zenodo, 2023)

Computing twin-width with branch & bound - PACE Submission. - André Schidler; Stefan Szeider (Zenodo, 2023)

The Silent (R)evolution of SAT. - Johannes Klaus Fichte; Daniel Le Berre; Markus Hecher; Stefan Szeider (Commun. ACM, 2023)

On the parameterized complexity of clustering problems for incomplete data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2023)

Supplementary Material for Proven optimally-balanced Latin rectangles with SAT. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (Zenodo, 2023)

Supplementary Material for Proven optimally-balanced Latin rectangles with SAT. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (Zenodo, 2023)

CSP beyond tractable constraint languages. - Jan Dreier; Sebastian Ordyniak; Stefan Szeider (Constraints An Int. J., 2023)

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

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

MaxSLIM Anytime MaxSAT Solver. - André Schidler; Stefan Szeider (Zenodo, 2023)

Computing optimal hypertree decompositions with SAT. - André Schidler; Stefan Szeider (Artif. Intell., 2023)

SAT-boosted Tabu Search for Coloring Massive Graphs. - André Schidler; Stefan Szeider (ACM J. Exp. Algorithmics, 2023)

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

Learning Small Decision Trees for Data of Low Rank-Width. - Konrad K. Dabrowski; Eduard Eiben; Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (AAAI, 2024)

A General Theoretical Framework for Learning Smallest Interpretable Models. - Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki; Stefan Szeider (AAAI, 2024)

SAT-Based Tree Decomposition with Iterative Cascading Policy Selection. - Hai Xia 001; Stefan Szeider (AAAI, 2024)

Large and Parallel Human Sorting Networks. - Stefan Szeider (CMSC, 2024)

Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper). - Markus Kirchweger; Stefan Szeider (CP, 2024)

Structure-Guided Local Improvement for Maximum Satisfiability. - André Schidler; Stefan Szeider (CP, 2024)

The Power of Collaboration: Learning Large Bayesian Networks at Scale. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider; Hai Xia 001 (ICTAI, 2024)

Compilation and Fast Model Counting beyond CNF. - Alexis de Colnet; Stefan Szeider; Tianwei Zhang (IJCAI, 2024)

Revisiting Causal Discovery from a Complexity-Theoretic Perspective. - Robert Ganian; Viktoriia Korchemna; Stefan Szeider (IJCAI, 2024)

ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP. - Leroy Chew; Alexis de Colnet; Stefan Szeider (KR, 2024)

Explaining Decisions in ML Models: A Parameterized Complexity Analysis. - Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki; Stefan Szeider (KR, 2024)

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

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

collab-bn-slim. - Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider; Hai Xia 001 (Zenodo, 2024)

Realtime Generation of Streamliners with Large Language Models. - Florentina Voboril; Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (CoRR, 2024)

Satisfiability Modulo User Propagators. - Katalin Fazekas; Aina Niemetz; Mathias Preiner; Markus Kirchweger; Stefan Szeider; Armin Biere (J. Artif. Intell. Res., 2024)

SAT-based Decision Tree Learning for Large Data Sets. - André Schidler; Stefan Szeider (J. Artif. Intell. Res., 2024)

SAT backdoors: Depth beats size. - Jan Dreier; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2024)

Backdoor DNFs. - Sebastian Ordyniak; André Schidler; Stefan Szeider (J. Comput. Syst. Sci., 2024)

SAT Modulo Symmetries for Graph Generation and Enumeration. - Markus Kirchweger; Stefan Szeider (ACM Trans. Comput. Log., 2024)

Backdoor DNFs Results and Source Code. - Sebastian Ordyniak; André Schidler; Stefan Szeider (Zenodo, 2024)

SAT-based Decision Tree Learning for Large Data Sets - Results and Source code. - André Schidler; Stefan Szeider (Zenodo, 2024)

Structure-guided Local Improvement for Maximum Satisfiability Supplementary. - André Schidler; Stefan Szeider (Zenodo, 2024)

Code and Instances for the Paper Realtime Generation of Streamliners with Large Language Models. - Florentina Voboril; P. R. Vaidyanathan; Stefan Szeider (Zenodo, 2024)

Supplementary material of "Satisfiability modulo User Propagators". - Katalin Fazekas; Aina Niemetz; Mathias Preiner; Markus Kirchweger; Stefan Szeider; Armin Biere (Zenodo, 2024)

eSLIM. - Franz-Xaver Reichl; Friedrich Slivovsky; Stefan Szeider (DROPS Artifacts, 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)

Balancing Latin Rectangles with LLM-Generated Streamliners. - Florentina Voboril; Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (CP, 2025)

The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators. - Tianwei Zhang; Stefan Szeider (CP, 2025)

Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach. - Carlos Ansótegui; Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider; Hai Xia 001 (ICCS (2), 2025)

StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners. - Florentina Voboril; Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (NSE@ICSE, 2025)

Analyzing Reformulation Performance in Core-Guided MaxSAT Solving. - André Schidler; Stefan Szeider (SAT, 2025)

Bridging Language Models and Symbolic Solvers via the Model Context Protocol. - Stefan Szeider (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)

Extracting Problem Structure with LLMs for Optimized SAT Local Search. - André Schidler; Stefan Szeider (Zenodo, 2025)

Code and Instances for the Paper: Generating Streamlining Constraints with Large Language Models. - Florentina Voboril; P. R. Vaidyanathan; Stefan Szeider (Zenodo, 2025)

MCP-Solver: Integrating Language Models with Constraint Programming Systems. - Stefan Szeider (CoRR, 2025)

Extracting Problem Structure with LLMs for Optimized SAT Local Search. - André Schilder; Stefan Szeider (CoRR, 2025)

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

Code and Instances for the Paper - StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners. - Florentina Voboril; Vaidyanathan Peruvemba Ramaswamy; Stefan Szeider (Zenodo, 2025)

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity. - Juha Harviainen; Frank Sommer; Manuel Sorge; Stefan Szeider (CoRR, 2025)

CP-Agent: Agentic Constraint Programming. - Stefan Szeider (CoRR, 2025)