Stefan Szeider

377 papers A* 58A 72B 20C 9Misc 1Journal 191Unranked 19
YearRankTypeTitle / Venue / Authors
2026 J jnl
A General Theoretical Framework for Learning Smallest Interpretable Models.
Artif. Intell.
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2026 J jnl
ASP-Bench: From Natural Language to Logic Programs.
CoRR
Stefan Szeider
2026 J jnl
Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design.
CoRR
Hai Xia, Carla P. Gomes, Bart Selman, Stefan Szeider
2026 J jnl
Backdoors to satisfaction continued.
Comput. Sci. Rev.
Serge Gaspers, Stefan Szeider
2026 A* conf
Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms.
AAAI
Sebastian Ordyniak, Mateusz Rychlicki, Stefan Szeider
2026 J jnl
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
Algorithmica
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2026 A* conf
Generating Streamlining Constraints with Large Language Models (Abstract Reprint).
AAAI
Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2026 A* conf
Graph Choosability via SAT: Beyond the Nullstellensatz.
AAAI
Markus Kirchweger, Tomás Peitl, David Seka, Stefan Szeider
2026 J jnl
LLM Self-Explanations Fail Semantic Invariance.
CoRR
Stefan Szeider
2026 J jnl
OBDDs, SDDs, and circuits of bounded width: Completeness matters.
Artif. Intell.
Alexis de Colnet, Sebastian Ordyniak, Stefan Szeider
2026 J jnl
PBLean: Pseudo-Boolean Proof Certificates for Lean 4.
CoRR
Stefan Szeider
2026 J jnl
Unmediated AI-Assisted Scholarly Citations.
CoRR
Stefan Szeider
2025 A conf
Analyzing Reformulation Performance in Core-Guided MaxSAT Solving.
SAT
André Schidler, Stefan Szeider
2025 A conf
Balancing Latin Rectangles with LLM-Generated Streamliners.
CP
Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2025 A* conf
Breaking Symmetries in Quantified Graph Search: A Comparative Study.
AAAI
Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider
2025 J jnl
Breaking Symmetries in Quantified Graph Search: A Comparative Study.
CoRR
Mikolás Janota, Markus Kirchweger, Tomás Peitl, Stefan Szeider
2025 A conf
Bridging Language Models and Symbolic Solvers via the Model Context Protocol.
SAT
Stefan Szeider
2025 J jnl
CP-Agent: Agentic Constraint Programming.
CoRR
Stefan Szeider
2025 J jnl
Compilation and Fast Model Counting beyond CNF.
CoRR
Alexis de Colnet, Stefan Szeider, Tianwei Zhang
2025 J jnl
Explaining Decisions in ML Models: a Parameterized Complexity Analysis (Part I).
CoRR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2025 J jnl
Extracting Problem Structure with LLMs for Optimized SAT Local Search.
CoRR
André Schilder, Stefan Szeider
2025 J jnl
From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT.
CoRR
Markus Kirchweger, Tomás Peitl, Bernardo Subercaseaux, Stefan Szeider
2025 J jnl
Generating Streamlining Constraints with Large Language Models.
J. Artif. Intell. Res.
Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2025 J jnl
MCP-Solver: Integrating Language Models with Constraint Programming Systems.
CoRR
Stefan Szeider
2025 A* conf
Optimal Decision Tree Pruning Revisited: Algorithms and Complexity.
ICML
Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider
2025 J jnl
Optimal Decision Tree Pruning Revisited: Algorithms and Complexity.
CoRR
Juha Harviainen, Frank Sommer, Manuel Sorge, Stefan Szeider
2025 — conf
SAT Modulo Symmetries: A Survey.
SC-Square@CADE
Stefan Szeider
2025 J jnl
Smart Cubing for Graph Search: A Comparative Study.
CoRR
Markus Kirchweger, Hai Xia, Tomás Peitl, Stefan Szeider
2025 — conf
StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners.
NSE@ICSE
Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2025 A conf
The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagators.
CP
Tianwei Zhang, Stefan Szeider
2025 — conf
Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approach.
ICCS (2)
Carlos Ansótegui, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia
2025 J jnl
What Do LLM Agents Do When Left Alone? Evidence of Spontaneous Meta-Cognitive Patterns.
CoRR
Stefan Szeider
2024 A* conf
A General Theoretical Framework for Learning Smallest Interpretable Models.
AAAI
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 A* conf
ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP.
KR
Leroy Chew, Alexis de Colnet, Stefan Szeider
2024 J jnl
Backdoor DNFs.
J. Comput. Syst. Sci.
Sebastian Ordyniak, André Schidler, Stefan Szeider
2024 A* conf
Compilation and Fast Model Counting beyond CNF.
IJCAI
Alexis de Colnet, Stefan Szeider, Tianwei Zhang
2024 A conf
Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper).
CP
Markus Kirchweger, Stefan Szeider
2024 A* conf
Explaining Decisions in ML Models: A Parameterized Complexity Analysis.
KR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 J jnl
Explaining Decisions in ML Models: a Parameterized Complexity Analysis.
CoRR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 J jnl
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2024 A* conf
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.
AAAI
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
2024 J jnl
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL.
CoRR
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
2024 — conf
Large and Parallel Human Sorting Networks.
CMSC
Stefan Szeider
2024 A* conf
Learning Small Decision Trees for Data of Low Rank-Width.
AAAI
Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2024 J jnl
Realtime Generation of Streamliners with Large Language Models.
CoRR
Florentina Voboril, Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2024 A* conf
Revisiting Causal Discovery from a Complexity-Theoretic Perspective.
IJCAI
Robert Ganian, Viktoriia Korchemna, Stefan Szeider
2024 J jnl
SAT Modulo Symmetries for Graph Generation and Enumeration.
ACM Trans. Comput. Log.
Markus Kirchweger, Stefan Szeider
2024 J jnl
SAT backdoors: Depth beats size.
J. Comput. Syst. Sci.
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2024 A* conf
SAT-Based Tree Decomposition with Iterative Cascading Policy Selection.
AAAI
Hai Xia, Stefan Szeider
2024 J jnl
SAT-based Decision Tree Learning for Large Data Sets.
J. Artif. Intell. Res.
André Schidler, Stefan Szeider
2024 J jnl
Satisfiability Modulo User Propagators.
J. Artif. Intell. Res.
Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere
2024 A conf
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence.
SAT
Tianwei Zhang, Tomás Peitl, Stefan Szeider
2024 J jnl
Small unsatisfiable k-CNFs with bounded literal occurrence.
CoRR
Tianwei Zhang, Tomás Peitl, Stefan Szeider
2024 A conf
Structure-Guided Local Improvement for Maximum Satisfiability.
CP
André Schidler, Stefan Szeider
2024 B conf
The Power of Collaboration: Learning Large Bayesian Networks at Scale.
ICTAI
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider, Hai Xia
2024 A conf
eSLIM: Circuit Minimization with SAT Based Local Improvement.
SAT
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2023 A conf
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture.
SAT
Markus Kirchweger, Tomás Peitl, Stefan Szeider
2023 J jnl
Are hitting formulas hard for resolution?
Discret. Appl. Math.
Tomás Peitl, Stefan Szeider
2023 J jnl
CSP beyond tractable constraint languages.
Constraints An Int. J.
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2023 A* conf
Circuit Minimization with QBF-Based Exact Synthesis.
AAAI
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2023 A* conf
Co-Certificate Learning with SAT Modulo Symmetries.
IJCAI
Markus Kirchweger, Tomás Peitl, Stefan Szeider
2023 J jnl
Co-Certificate Learning with SAT Modulo Symmetries.
CoRR
Markus Kirchweger, Tomás Peitl, Stefan Szeider
2023 A* conf
Computing Twin-width with SAT and Branch & Bound.
IJCAI
André Schidler, Stefan Szeider
2023 J jnl
Computing optimal hypertree decompositions with SAT.
Artif. Intell.
André Schidler, Stefan Szeider
2023 J jnl
Finding a Cluster in Incomplete Data.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 B conf
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
IPEC
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 A conf
IPASIR-UP: User Propagators for CDCL.
SAT
Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere
2023 A* conf
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity.
AAAI
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2023 A* conf
Learning Small Decision Trees with Large Domain.
IJCAI
Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2023 J jnl
On the parameterized complexity of clustering problems for incomplete data.
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 A conf
Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper).
CP
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2023 J jnl
SAT Encodings and Beyond (Dagstuhl Seminar 23261).
Dagstuhl Reports
Marijn J. H. Heule, Inês Lynce, Stefan Szeider, André Schidler
2023 A conf
SAT-Based Generation of Planar Graphs.
SAT
Markus Kirchweger, Manfred Scheucher, Stefan Szeider
2023 J jnl
SAT-boosted Tabu Search for Coloring Massive Graphs.
ACM J. Exp. Algorithmics
André Schidler, Stefan Szeider
2023 A conf
Searching for Smallest Universal Graphs and Tournaments with SAT.
CP
Tianwei Zhang, Stefan Szeider
2023 A* conf
The Computational Complexity of Concise Hypersphere Classification.
ICML
Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
The Computational Complexity of Concise Hypersphere Classification.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 A* conf
The Parameterized Complexity of Finding Concise Local Explanations.
IJCAI
Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2023 J jnl
The Silent (R)evolution of SAT.
Commun. ACM
Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
2022 B ed.
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, Vienna, Austria, August 22-26, 2022
MFCS
Stefan Szeider, Robert Ganian, Alexandra Silva
2022 A conf
A SAT Approach to Twin-Width.
ALENEX
André Schidler, Stefan Szeider
2022 A conf
A SAT Attack on Rota's Basis Conjecture.
SAT
Markus Kirchweger, Manfred Scheucher, Stefan Szeider
2022 J jnl
Algorithmic Applications of Tree-Cut Width.
CoRR
Robert Ganian, Eun Jung Kim, Stefan Szeider
2022 J jnl
Algorithmic Applications of Tree-Cut Width.
SIAM J. Discret. Math.
Robert Ganian, Eun Jung Kim, Stefan Szeider
2022 J jnl
Are Hitting Formulas Hard for Resolution?
CoRR
Tomás Peitl, Stefan Szeider
2022 A conf
CSP Beyond Tractable Constraint Languages.
CP
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2022 A conf
Finding a Cluster in Incomplete Data.
ESA
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2022 A conf
Learning large Bayesian networks with expert constraints.
UAI
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2022 J jnl
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria.
Discret. Appl. Math.
Robert Ganian, Jan Kratochvíl, Stefan Szeider
2022 A conf
SAT Backdoors: Depth Beats Size.
ESA
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2022 J jnl
SAT Backdoors: Depth Beats Size.
CoRR
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2022 J jnl
Sum-of-Products with Default Values: Algorithms and Complexity Results.
J. Artif. Intell. Res.
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
2022 J jnl
Threshold Treewidth and Hypertree Width.
CoRR
André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider
2022 J jnl
Threshold Treewidth and Hypertree Width.
J. Artif. Intell. Res.
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
2022 A* conf
Tractable Abstract Argumentation via Backdoor-Treewidth.
AAAI
Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, Stefan Woltran
2022 A conf
Weighted Model Counting with Twin-Width.
SAT
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
2022 J jnl
Weighted Model Counting with Twin-Width.
CoRR
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
2021 J jnl
A SAT Approach to Twin-Width.
CoRR
André Schidler, Stefan Szeider
2021 A* conf
Backdoor DNFs.
IJCAI
Sebastian Ordyniak, André Schidler, Stefan Szeider
2021 A conf
Certified DQBF Solving by Definition Extraction.
SAT
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2021 J jnl
Certified DQBF Solving by Definition Extraction.
CoRR
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
2021 A* conf
Computing Optimal Hypertree Decompositions with SAT.
IJCAI
André Schidler, Stefan Szeider
2021 A* conf
Finding the Hardest Formulas for Resolution (Extended Abstract).
IJCAI
Tomás Peitl, Stefan Szeider
2021 J jnl
Finding the Hardest Formulas for Resolution.
J. Artif. Intell. Res.
Tomás Peitl, Stefan Szeider
2021 — ch.
Fixed-Parameter Tractability.
Handbook of Satisfiability
Marko Samer, Stefan Szeider
2021 J jnl
Formalizing Graph Trail Properties in Isabelle/HOL.
CoRR
Laura Kovács, Hanna Lachnitt, Stefan Szeider
2021 A* conf
Learning Fast-Inference Bayesian Networks.
NeurIPS
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2021 J jnl
New width parameters for SAT and #SAT.
Artif. Intell.
Robert Ganian, Stefan Szeider
2021 A* conf
Parameterized Complexity of Small Decision Tree Learning.
AAAI
Sebastian Ordyniak, Stefan Szeider
2021 A conf
SAT Modulo Symmetries for Graph Generation.
CP
Markus Kirchweger, Stefan Szeider
2021 A* conf
SAT-based Decision Tree Learning for Large Data Sets.
AAAI
André Schidler, Stefan Szeider
2021 A* conf
The Parameterized Complexity of Clustering Incomplete Data.
AAAI
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2021 A* conf
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning.
AAAI
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2020 A conf
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth.
SAT
Friedrich Slivovsky, Stefan Szeider
2020 J jnl
A Time Leap Challenge for SAT Solving.
CoRR
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 A conf
A Time Leap Challenge for SAT-Solving.
CP
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 A conf
Breaking Symmetries with RootClique and LexTopSort.
CP
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
2020 A conf
Computing Optimal Hypertree Decompositions.
ALENEX
André Schidler, Stefan Szeider
2020 A conf
Finding the Hardest Formulas for Resolution.
CP
Tomás Peitl, Stefan Szeider
2020 A* conf
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters.
KR
Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2020 C conf
Formalizing Graph Trail Properties in Isabelle/HOL.
CICM
Laura Kovács, Hanna Lachnitt, Stefan Szeider
2020 A conf
MaxSAT-Based Postprocessing for Treedepth.
CP
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
2020 J jnl
On Existential MSO and Its Relation to ETH.
ACM Trans. Comput. Theory
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
2020 A* conf
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank.
AAAI
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2020 A conf
Short Q-Resolution Proofs with Homomorphisms.
SAT
Ankit Shukla, Friedrich Slivovsky, Stefan Szeider
2020 A* conf
Threshold Treewidth and Hypertree Width.
IJCAI
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
2020 J jnl
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning.
CoRR
P. R. Vaidyanathan, Stefan Szeider
2019 J jnl
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy.
Algorithms
Ronald de Haan, Stefan Szeider
2019 A conf
A Join-Based Hybrid Parameter for Constraint Satisfaction.
CP
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
A Join-Based Hybrid Parameter for Constraint Satisfaction.
CoRR
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
A SAT Approach to Branchwidth.
ACM Trans. Comput. Log.
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2019 A conf
Combining Resolution-Path Dependencies with Dependency Learning.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 J jnl
Dependency Learning for QBF.
J. Artif. Intell. Res.
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 J jnl
Long-Distance Q-Resolution with Dependency Schemes.
J. Autom. Reason.
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 J jnl
On Clustering Incomplete Data.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
On the parameterized complexity of (
Inf. Process. Lett.
Daniël Paulusma, Stefan Szeider
2019 A conf
Proof Complexity of Fragments of Long-Distance Q-Resolution.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 J jnl
Qute in the QBF Evaluation 2018.
J. Satisf. Boolean Model. Comput.
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2019 A conf
SAT-Encodings for Treecut Width and Treedepth.
ALENEX
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
SAT-Encodings for Treecut Width and Treedepth.
CoRR
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2019 A* conf
The Parameterized Complexity of Cascading Portfolio Scheduling.
NeurIPS
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
2018 A conf
An SMT Approach to Fractional Hypertree Width.
CP
Johannes Klaus Fichte, Markus Hecher, Neha Lodha, Stefan Szeider
2018 J jnl
Meta-kernelization using well-structured modulators.
Discret. Appl. Math.
Eduard Eiben, Robert Ganian, Stefan Szeider
2018 A* conf
Parameterized Algorithms for the Matrix Completion Problem.
ICML
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 J jnl
Parameterized Algorithms for the Matrix Completion Problem.
CoRR
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 A conf
Polynomial-Time Validation of QCDCL Certificates.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2018 A conf
Portfolio-Based Algorithm Selection for Circuit QBFs.
CP
Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2018 J jnl
Solving Problems on Graphs of High Rank-Width.
Algorithmica
Eduard Eiben, Robert Ganian, Stefan Szeider
2018 B conf
Sum-of-Products with Default Values: Algorithms and Complexity Results.
ICTAI
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
2017 A* conf
A SAT Approach to Branchwidth.
IJCAI
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2017 — ch.
Backdoor Sets for CSP.
The Constraint Satisfaction Problem
Serge Gaspers, Sebastian Ordyniak, Stefan Szeider
2017 — conf
Backdoor Trees for Answer Set Programming.
ASPOCP@LPNMR
Johannes Klaus Fichte, Stefan Szeider
2017 A conf
Backdoor Treewidth for SAT.
SAT
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017 J jnl
Backdoors into heterogeneous classes of SAT and CSP.
J. Comput. Syst. Sci.
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2017 A* conf
Circuit Treewidth, Sentential Decision, and Query Compilation.
PODS
Simone Bova, Stefan Szeider
2017 J jnl
Circuit Treewidth, Sentential Decision, and Query Compilation.
CoRR
Simone Bova, Stefan Szeider
2017 A conf
Combining Treewidth and Backdoors for CSP.
STACS
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017 A conf
Dependency Learning for QBF.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2017 J jnl
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
ACM Trans. Algorithms
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2017 A conf
New Width Parameters for Model Counting.
SAT
Robert Ganian, Stefan Szeider
2017 J jnl
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances.
ACM Trans. Comput. Log.
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2017 J jnl
Parameterized complexity classes beyond para-NP.
J. Comput. Syst. Sci.
Ronald de Haan, Stefan Szeider
2017 J jnl
Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381).
Dagstuhl Reports
Adnan Darwiche, Pierre Marquis, Dan Suciu, Stefan Szeider
2017 A* conf
Rigging Nearly Acyclic Tournaments Is Fixed-Parameter Tractable.
AAAI
M. S. Ramanujan, Stefan Szeider
2017 A conf
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width.
SAT
Johannes Klaus Fichte, Neha Lodha, Stefan Szeider
2017 A conf
SAT-Encodings for Special Treewidth and Pathwidth.
SAT
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2017 J jnl
The treewidth of proofs.
Inf. Comput.
Moritz Müller, Stefan Szeider
2016 A conf
A SAT Approach to Branchwidth.
SAT
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2016 A conf
Backdoors to Tractable Valued CSP.
CP
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016 J jnl
Backdoors to Tractable Valued CSP.
CoRR
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016 J jnl
Backdoors to q-Horn.
Algorithmica
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2016 J jnl
Combining Treewidth and Backdoors for CSP.
CoRR
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016 A* conf
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
SODA
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2016 A conf
Long Distance Q-Resolution with Dependency Schemes.
SAT
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
2016 J jnl
Meta-kernelization with structural parameters.
J. Comput. Syst. Sci.
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2016 J jnl
Model Checking Existential Logic on Partially Ordered Sets.
ACM Trans. Comput. Log.
Simone Bova, Robert Ganian, Stefan Szeider
2016 J jnl
Model Counting for CNF Formulas of Bounded Modular Treewidth.
Algorithmica
Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider
2016 B conf
On Existential MSO and its Relation to ETH.
MFCS
Robert Ganian, Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2016 A* conf
Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics.
KR
Ronald de Haan, Stefan Szeider
2016 — ch.
Parameterized SAT.
Encyclopedia of Algorithms
Stefan Szeider
2016 A conf
Polynomial-Time Construction of Optimal MPI Derived Datatype Trees.
IPDPS
Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff
2016 J jnl
Quantified conjunctive queries on partially ordered sets.
Theor. Comput. Sci.
Simone Bova, Robert Ganian, Stefan Szeider
2016 J jnl
Quantifier Reordering for QBF.
J. Autom. Reason.
Friedrich Slivovsky, Stefan Szeider
2016 J jnl
Soundness of Q-resolution with dependency schemes.
Theor. Comput. Sci.
Friedrich Slivovsky, Stefan Szeider
2015 J jnl
A SAT Approach to Clique-Width.
ACM Trans. Comput. Log.
Marijn Heule, Stefan Szeider
2015 J jnl
A complete parameterized complexity analysis of bounded planning.
J. Comput. Syst. Sci.
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2015 — conf
Algorithmic Applications of Tree-Cut Width.
MFCS (2)
Robert Ganian, Eun Jung Kim, Stefan Szeider
2015 J jnl
Backdoors into Heterogeneous Classes of SAT and CSP.
CoRR
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2015 J jnl
Backdoors to Normality for Disjunctive Logic Programs.
ACM Trans. Comput. Log.
Johannes Klaus Fichte, Stefan Szeider
2015 J jnl
Backdoors to tractable answer set programming.
Artif. Intell.
Johannes Klaus Fichte, Stefan Szeider
2015 A conf
Community Structure Inspired Algorithms for SAT and #SAT.
SAT
Robert Ganian, Stefan Szeider
2015 J jnl
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
CoRR
Robert Ganian, M. S. Ramanujan, Stefan Szeider
2015 J jnl
Guest Editorial: Special Issue on Parameterized and Exact Computation.
Algorithmica
Gregory Z. Gutin, Stefan Szeider
2015 B conf
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP.
SOFSEM
Ronald de Haan, Stefan Szeider
2015 J jnl
Meta-Kernelization using Well-Structured Modulators.
CoRR
Eduard Eiben, Robert Ganian, Stefan Szeider
2015 B conf
Meta-kernelization using Well-structured Modulators.
IPEC
Eduard Eiben, Robert Ganian, Stefan Szeider
2015 J jnl
On finding optimal polytrees.
Theor. Comput. Sci.
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2015 J jnl
On the Subexponential-Time Complexity of CSP.
J. Artif. Intell. Res.
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2015 A conf
Parameterized Complexity Results for Agenda Safety in Judgment Aggregation.
AAMAS
Ulle Endriss, Ronald de Haan, Stefan Szeider
2015 J jnl
Parameterized and subexponential-time complexity of satisfiability problems and applications.
Theor. Comput. Sci.
Iyad A. Kanj, Stefan Szeider
2015 J jnl
Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions.
CoRR
Robert Ganian, Martin Kalany, Stefan Szeider, Jesper Larsson Träff
2015 B conf
Solving Problems on Graphs of High Rank-Width.
WADS
Eduard Eiben, Robert Ganian, Stefan Szeider
2015 J jnl
Solving Problems on Graphs of High Rank-Width.
CoRR
Eduard Eiben, Robert Ganian, Stefan Szeider
2014 A* conf
Backdoors into Heterogeneous Classes of SAT and CSP.
AAAI
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2014 J jnl
Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy.
Electron. Colloquium Comput. Complex.
Ronald de Haan, Stefan Szeider
2014 A conf
Fixed-Parameter Tractable Reductions to SAT.
SAT
Ronald de Haan, Stefan Szeider
2014 J jnl
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning.
CoRR
Serge Gaspers, Stefan Szeider
2014 J jnl
Guarantees and limits of preprocessing in constraint satisfaction and reasoning.
Artif. Intell.
Serge Gaspers, Stefan Szeider
2014 J jnl
Model Checking Existential Logic on Partially Ordered Sets.
CoRR
Simone Bova, Robert Ganian, Stefan Szeider
2014 J jnl
Model Counting for Formulas of Bounded Clique-Width.
CoRR
Friedrich Slivovsky, Stefan Szeider
2014 — conf
Model checking existential logic on partially ordered sets.
CSL-LICS
Simone Bova, Robert Ganian, Stefan Szeider
2014 J jnl
Parameterized Complexity Results for Exact Bayesian Network Structure Learning.
CoRR
Sebastian Ordyniak, Stefan Szeider
2014 C conf
Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications.
COCOA
Iyad A. Kanj, Stefan Szeider
2014 B conf
Quantified Conjunctive Queries on Partially Ordered Sets.
IPEC
Simone Bova, Robert Ganian, Stefan Szeider
2014 J jnl
Quantified Conjunctive Queries on Partially Ordered Sets.
CoRR
Simone Bova, Robert Ganian, Stefan Szeider
2014 B conf
Small Unsatisfiable Subsets in Constraint Satisfaction.
ICTAI
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2014 A conf
Subexponential Time Complexity of CSP with Global Constraints.
CP
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2014 J jnl
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.
CoRR
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2014 A* conf
The Parameterized Complexity of Reasoning Problems Beyond NP.
KR
Ronald de Haan, Stefan Szeider
2014 J jnl
Tractable answer-set programming with weight constraints: bounded treewidth is not enough.
Theory Pract. Log. Program.
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
2014 A conf
Variable Dependencies and Q-Resolution.
SAT
Friedrich Slivovsky, Stefan Szeider
2013 J jnl
A Complete Parameterized Complexity Analysis of Bounded Planning.
CoRR
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2013 J jnl
A SAT Approach to Clique-Width
CoRR
Marijn Heule, Stefan Szeider
2013 A conf
A SAT Approach to Clique-Width.
SAT
Marijn Heule, Stefan Szeider
2013 J jnl
Backdoors to Abduction
CoRR
Andreas Pfandler, Stefan Rümmele, Stefan Szeider
2013 A* conf
Backdoors to Abduction.
IJCAI
Andreas Pfandler, Stefan Rümmele, Stefan Szeider
2013 J jnl
Backdoors to Normality for Disjunctive Logic Programs
CoRR
Johannes Klaus Fichte, Stefan Szeider
2013 A* conf
Backdoors to Normality for Disjunctive Logic Programs.
AAAI
Johannes Klaus Fichte, Stefan Szeider
2013 A conf
Backdoors to q-Horn.
STACS
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2013 B conf
Capturing Structure in Hard Combinatorial Problems.
ICTAI
Stefan Szeider
2013 J jnl
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Theory Comput. Syst.
Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2013 J jnl
Local Backbones
CoRR
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2013 A conf
Local Backbones.
SAT
Ronald de Haan, Iyad A. Kanj, Stefan Szeider
2013 J jnl
Meta-Kernelization with Structural Parameters
CoRR
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2013 B conf
Meta-kernelization with Structural Parameters.
MFCS
Robert Ganian, Friedrich Slivovsky, Stefan Szeider
2013 A conf
Model Counting for CNF Formulas of Bounded Modular Treewidth.
STACS
Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider
2013 B conf
Model Counting for Formulas of Bounded Clique-Width.
ISAAC
Friedrich Slivovsky, Stefan Szeider
2013 J jnl
On the Subexponential Time Complexity of CSP
CoRR
Iyad A. Kanj, Stefan Szeider
2013 A* conf
On the Subexponential Time Complexity of CSP.
AAAI
Iyad A. Kanj, Stefan Szeider
2013 J jnl
Parameterized Complexity Results for Exact Bayesian Network Structure Learning.
J. Artif. Intell. Res.
Sebastian Ordyniak, Stefan Szeider
2013 A* conf
Parameterized Complexity Results for Plan Reuse.
AAAI
Ronald de Haan, Anna Roubícková, Stefan Szeider
2013 J jnl
Parameterized Complexity Results for Plan Reuse.
CoRR
Ronald de Haan, Anna Roubícková, Stefan Szeider
2013 C conf
Parameterized Complexity and Kernel Bounds for Hard Planning Problems.
CIAC
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2013 B ed.
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers
IPEC
Gregory Z. Gutin, Stefan Szeider
2013 J jnl
Preface.
Fundam. Informaticae
Agata Ciabattoni, Rusins Freivalds, Antonín Kucera, Igor Potapov, Stefan Szeider
2013 B conf
Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
MFCS
Moritz Müller, Stefan Szeider
2013 J jnl
Revisiting Space in Proof Complexity: Treewidth and Pathwidth.
Electron. Colloquium Comput. Complex.
Moritz Müller, Stefan Szeider
2013 J jnl
Satisfiability of acyclic and almost acyclic CNF formulas.
Theor. Comput. Sci.
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2013 A* conf
Strong Backdoors to Bounded Treewidth SAT.
FOCS
Serge Gaspers, Stefan Szeider
2013 — conf
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.
TAFA
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2013 J jnl
The Parameterized Complexity of Reasoning Problems Beyond NP.
CoRR
Ronald de Haan, Stefan Szeider
2013 J jnl
Upper and Lower Bounds for Weak Backdoor Set Detection
CoRR
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
2013 A conf
Upper and Lower Bounds for Weak Backdoor Set Detection.
SAT
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
2012 — conf
Abstract Argumentation via Monadic Second Order Logic.
SUM
Wolfgang Dvorák, Stefan Szeider, Stefan Woltran
2012 J jnl
Algorithms and Complexity Results for Exact Bayesian Structure Learning
CoRR
Sebastian Ordyniak, Stefan Szeider
2012 J jnl
Augmenting tractable fragments of abstract argumentation.
Artif. Intell.
Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider
2012 — conf
Backdoors to Acyclic SAT.
ICALP (1)
Serge Gaspers, Stefan Szeider
2012 — conf
Backdoors to Satisfaction.
The Multivariate Algorithmic Revolution and Beyond
Serge Gaspers, Stefan Szeider
2012 C ed.
Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012
COMMA
Bart Verheij, Stefan Szeider, Stefan Woltran
2012 J jnl
Computing Resolution-Path Dependencies in Linear Time
CoRR
Friedrich Slivovsky, Stefan Szeider
2012 A conf
Computing Resolution-Path Dependencies in Linear Time , .
SAT
Friedrich Slivovsky, Stefan Szeider
2012 A* conf
Don't Be Strict in Local Search!
AAAI
Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012 J jnl
Don't Be Strict in Local Search!
CoRR
Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012 J jnl
Editing graphs to satisfy degree constraints: A parameterized approach.
J. Comput. Syst. Sci.
Luke Mathieson, Stefan Szeider
2012 J jnl
On Finding Optimal Polytrees
CoRR
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2012 A* conf
On Finding Optimal Polytrees.
AAAI
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2012 J jnl
On graph contractions and induced minors.
Discret. Appl. Math.
Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2012 J jnl
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.
Algorithmica
Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2012 J jnl
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
CoRR
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2012 J jnl
Strong Backdoors to Bounded Treewidth SAT
CoRR
Serge Gaspers, Stefan Szeider
2012 J jnl
Strong Backdoors to Nested Satisfiability
CoRR
Serge Gaspers, Stefan Szeider
2012 A conf
Strong Backdoors to Nested Satisfiability.
SAT
Serge Gaspers, Stefan Szeider
2012 J jnl
The Complexity of Planning Revisited - A Parameterized Analysis
CoRR
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2012 A* conf
The Complexity of Planning Revisited - A Parameterized Analysis.
AAAI
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2012 J jnl
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
CoRR
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
2012 B conf
k-Gap Interval Graphs.
LATIN
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
2011 J jnl
A probabilistic approach to problems parameterized above or below tight bounds.
J. Comput. Syst. Sci.
Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2011 J jnl
Algorithms and Complexity Results for Persuasive Argumentation
CoRR
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2011 J jnl
Algorithms and complexity results for persuasive argumentation.
Artif. Intell.
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2011 J jnl
Augmenting Tractable Fragments of Abstract Argumentation
CoRR
Sebastian Ordyniak, Stefan Szeider
2011 A* conf
Augmenting Tractable Fragments of Abstract Argumentation.
IJCAI
Sebastian Ordyniak, Stefan Szeider
2011 J jnl
Backdoors to Acyclic SAT
CoRR
Serge Gaspers, Stefan Szeider
2011 J jnl
Backdoors to Satisfaction
CoRR
Serge Gaspers, Stefan Szeider
2011 J jnl
Backdoors to Tractable Answer-Set Programming
CoRR
Johannes Klaus Fichte, Stefan Szeider
2011 A* conf
Backdoors to Tractable Answer-Set Programming.
IJCAI
Johannes Klaus Fichte, Stefan Szeider
2011 J jnl
Kernels for Global Constraints
CoRR
Serge Gaspers, Stefan Szeider
2011 A* conf
Kernels for Global Constraints.
IJCAI
Serge Gaspers, Stefan Szeider
2011 J jnl
Limits of Preprocessing
CoRR
Stefan Szeider
2011 A* conf
Limits of Preprocessing.
AAAI
Stefan Szeider
2011 J jnl
Monadic second order logic on graphs with local cardinality constraints.
ACM Trans. Comput. Log.
Stefan Szeider
2011 J jnl
Not So Easy Problems for Tree Decomposable Graphs
CoRR
Stefan Szeider
2011 J jnl
On the complexity of some colorful problems parameterized by treewidth.
Inf. Comput.
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2011 J jnl
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming
CoRR
Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2011 J jnl
Parameterized Proof Complexity.
Comput. Complex.
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
2011 J jnl
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II)
CoRR
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2011 A conf
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).
SAT
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2011 J jnl
Solving MAX-
Algorithmica
Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2011 — conf
The Parameterized Complexity of Constraint Satisfaction and Reasoning.
INAP/WLP
Stefan Szeider
2011 A conf
The Parameterized Complexity of Local Consistency.
CP
Serge Gaspers, Stefan Szeider
2011 J jnl
The Parameterized Complexity of Local Consistency.
Electron. Colloquium Comput. Complex.
Serge Gaspers, Stefan Szeider
2011 J jnl
The parameterized complexity of k-flip local search for SAT and MAX SAT.
Discret. Optim.
Stefan Szeider
2011 J jnl
Tractable cases of the extended global cardinality constraint.
Constraints An Int. J.
Marko Samer, Stefan Szeider
2011 J jnl
k-Gap Interval Graphs
CoRR
Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger
2010 A conf
Algorithms and Complexity Results for Exact Bayesian Structure Learning.
UAI
Sebastian Ordyniak, Stefan Szeider
2010 C conf
Algorithms and Complexity Results for Persuasive Argumentation.
COMMA
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2010 J jnl
Algorithms for propositional model counting.
J. Discrete Algorithms
Marko Samer, Stefan Szeider
2010 J jnl
Constraint satisfaction with bounded treewidth revisited.
J. Comput. Syst. Sci.
Marko Samer, Stefan Szeider
2010 J jnl
Editorial.
J. Discrete Algorithms
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2010 B conf
On Contracting Graphs to Fixed Pattern Graphs.
SOFSEM
Pim van 't Hof, Marcin Kaminski, Daniël Paulusma, Stefan Szeider, Dimitrios M. Thilikos
2010 B conf
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.
IPEC
Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
2010 C conf
Reasoning in Argumentation Frameworks of Bounded Clique-Width.
COMMA
Wolfgang Dvorák, Stefan Szeider, Stefan Woltran
2010 — conf
Satisfiability of Acyclic and Almost Acyclic CNF Formulas.
FSTTCS
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2010 A* conf
Solving MAX-r-SAT Above a Tight Lower Bound.
SODA
Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2010 A ed.
Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings
SAT
Ofer Strichman, Stefan Szeider
2010 A* conf
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough.
KR
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
2009 J jnl
A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound
CoRR
Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009 — conf
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds.
IWPEC
Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009 J jnl
Backdoor Sets of Quantified Boolean Formulas.
J. Autom. Reason.
Marko Samer, Stefan Szeider
2009 J jnl
Clique-Width is NP-Complete.
SIAM J. Discret. Math.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2009 J jnl
Covering graphs with few complete bipartite subgraphs.
Theor. Comput. Sci.
Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
2009 J jnl
Editorial.
J. Discrete Algorithms
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2009 — ch.
Fixed-Parameter Tractability.
Handbook of Satisfiability
Marko Samer, Stefan Szeider
2009 J jnl
Matched Formulas and Backdoor Sets.
J. Satisf. Boolean Model. Comput.
Stefan Szeider
2009 J jnl
Solving MAX-2-SAT Above a Tight Lower Bound
CoRR
Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo
2009 A conf
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT.
SAT
Stefan Szeider
2008 A* conf
Backdoor Trees.
AAAI
Marko Samer, Stefan Szeider
2008 J jnl
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems.
Comput. J.
Georg Gottlob, Stefan Szeider
2008 J jnl
Fixed-Parameter Complexity of Minimum Profile Problems.
Algorithmica
Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2008 B conf
Monadic Second Order Logic on Graphs with Local Cardinality Constraints.
MFCS
Stefan Szeider
2008 C conf
Parameterized Graph Editing with Chosen Vertex Degrees.
COCOA
Luke Mathieson, Stefan Szeider
2008 — ch.
Parameterized SAT.
Encyclopedia of Algorithms
Stefan Szeider
2008 J jnl
Preface.
J. Discrete Algorithms
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2008 — conf
The Parameterized Complexity of Regular Subgraph Problems and Generalizations.
CATS
Luke Mathieson, Stefan Szeider
2008 — conf
Tractable Cases of the Extended Global Cardinality Constraint.
CATS
Marko Samer, Stefan Szeider
2007 B conf
Algorithms for Propositional Model Counting.
LPAR
Marko Samer, Stefan Szeider
2007 A conf
Backdoor Sets of Quantified Boolean Formulas.
SAT
Marko Samer, Stefan Szeider
2007 — conf
Covering Graphs with Few Complete Bipartite Subgraphs.
FSTTCS
Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
2007 A conf
Matched Formulas and Backdoor Sets.
SAT
Stefan Szeider
2007 C conf
On the Complexity of Some Colorful Problems Parameterized by Treewidth.
COCOA
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen
2007 A* conf
Parameterized Proof Complexity.
FOCS
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
2007 J jnl
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.
Electron. Colloquium Comput. Complex.
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
2007 J jnl
Solving #SAT using vertex covers.
Acta Informatica
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2007 J jnl
The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Theory Comput. Syst.
Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2006 J jnl
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
CoRR
Marko Samer, Stefan Szeider
2006 J jnl
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.
SIAM J. Discret. Math.
Shlomo Hoory, Stefan Szeider
2006 — ed.
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK
ACiD
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2006 A* conf
Clique-width minimization is NP-hard.
STOC
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2006 J jnl
Complexity and Applications of Edge-Induced Vertex-Cuts
CoRR
Marko Samer, Stefan Szeider
2006 A conf
Constraint Satisfaction with Bounded Treewidth Revisited.
CP
Marko Samer, Stefan Szeider
2006 J jnl
Fixed-Parameter Complexity of Minimum Profile Problems
CoRR
Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2006 — conf
Fixed-Parameter Complexity of Minimum Profile Problems.
IWPEC
Gregory Z. Gutin, Stefan Szeider, Anders Yeo
2006 J jnl
On finding short resolution refutations and small unsatisfiable subsets.
Theor. Comput. Sci.
Michael R. Fellows, Stefan Szeider, Graham Wrightson
2006 A conf
Solving #SAT Using Vertex Covers.
SAT
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2006 C conf
The Linear Arrangement Problem Parameterized Above Guaranteed Value.
CIAC
Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2005 — ed.
Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK
ACiD
Hajo Broersma, Matthew Johnson, Stefan Szeider
2005 J jnl
Backdoor Sets for DLL Subsolvers.
J. Autom. Reason.
Stefan Szeider
2005 J jnl
Computing unsatisfiable k-SAT instances with few occurrences per variable.
Theor. Comput. Sci.
Shlomo Hoory, Stefan Szeider
2005 J jnl
Generalizations of matched CNF formulas.
Ann. Math. Artif. Intell.
Stefan Szeider
2005 J jnl
On Edge-Colored Graphs Covered by Properly Colored Cycles.
Graphs Comb.
Herbert Fleischner, Stefan Szeider
2005 J jnl
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electron. Colloquium Comput. Complex.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2005 J jnl
Proving NP-hardness for clique-width II: non-approximability of clique-width
Electron. Colloquium Comput. Complex.
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
2005 J jnl
The Complexity of Resolution with Generalized Symmetry Rules.
Theory Comput. Syst.
Stefan Szeider
2005 J jnl
The Linear Arrangement Problem Parameterized Above Guaranteed Value
CoRR
Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2004 A conf
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable.
SAT
Shlomo Hoory, Stefan Szeider
2004 A conf
Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
SAT
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2004 J jnl
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable.
J. Comput. Syst. Sci.
Stefan Szeider
2004 — conf
On Finding Short Resolution Refutations and Small Unsatisfiable Subsets.
IWPEC
Michael R. Fellows, Stefan Szeider, Graham Wrightson
2004 J jnl
On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors.
Ars Comb.
Stefan Szeider
2003 J jnl
Finding paths in graphs avoiding forbidden transitions.
Discret. Appl. Math.
Stefan Szeider
2003 J jnl
Homomorphisms of conjunctive normal forms.
Discret. Appl. Math.
Stefan Szeider
2003 Misc conf
Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable.
COCOON
Stefan Szeider
2003 J jnl
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Electron. Colloquium Comput. Complex.
Stefan Szeider
2003 A conf
On Fixed-Parameter Tractable Parameterizations of SAT.
SAT
Stefan Szeider
2003 A conf
The Complexity of Resolution with Generalized Symmetry Rules.
STACS
Stefan Szeider
2002 J jnl
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Theor. Comput. Sci.
Herbert Fleischner, Oliver Kullmann, Stefan Szeider
2001 A conf
NP-Completeness of Refutability by Literal-Once Resolution.
IJCAR
Stefan Szeider
2000 J jnl
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
Electron. Colloquium Comput. Complex.
Herbert Fleischner, Stefan Szeider