Stefan Szeider

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 139

Top Venues

CoRR

SAT

AAAI

Publications

Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees for Data of Low Rank-Width. AAAI (2024)
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. AAAI (2024)
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
Explaining Decisions in ML Models: a Parameterized Complexity Analysis. CoRR (2024)
Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. CoRR (2024)
Tianwei Zhang, Tomás Peitl, Stefan Szeider
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence. SAT (2024)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
SAT backdoors: Depth beats size. J. Comput. Syst. Sci. 142 (2024)
Tianwei Zhang, Tomás Peitl, Stefan Szeider
Small unsatisfiable k-CNFs with bounded literal occurrence. CoRR (2024)
André Schidler, Stefan Szeider
SAT-based Decision Tree Learning for Large Data Sets. J. Artif. Intell. Res. 80 (2024)
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
eSLIM: Circuit Minimization with SAT Based Local Improvement. SAT (2024)
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
A General Theoretical Framework for Learning Smallest Interpretable Models. AAAI (2024)
Markus Kirchweger, Stefan Szeider
Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries (Short Paper). CP (2024)
André Schidler, Stefan Szeider
Structure-Guided Local Improvement for Maximum Satisfiability. CP (2024)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. CoRR (2024)
Hai Xia, Stefan Szeider
SAT-Based Tree Decomposition with Iterative Cascading Policy Selection. AAAI (2024)
Sebastian Ordyniak, André Schidler, Stefan Szeider
Backdoor DNFs. J. Comput. Syst. Sci. 144 (2024)
Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
The Parameterized Complexity of Finding Concise Local Explanations. IJCAI (2023)
Markus Kirchweger, Tomás Peitl, Stefan Szeider
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture. SAT (2023)
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Proven Optimally-Balanced Latin Rectangles with SAT (Short Paper). CP (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On the parameterized complexity of clustering problems for incomplete data. J. Comput. Syst. Sci. 134 (2023)
Markus Kirchweger, Tomás Peitl, Stefan Szeider
Co-Certificate Learning with SAT Modulo Symmetries. IJCAI (2023)
Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
The Computational Complexity of Concise Hypersphere Classification. ICML (2023)
André Schidler, Stefan Szeider
Computing Twin-width with SAT and Branch & Bound. IJCAI (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC (2023)
Markus Kirchweger, Tomás Peitl, Stefan Szeider
Co-Certificate Learning with SAT Modulo Symmetries. CoRR (2023)
Tianwei Zhang, Stefan Szeider
Searching for Smallest Universal Graphs and Tournaments with SAT. CP (2023)
André Schidler, Stefan Szeider
SAT-boosted Tabu Search for Coloring Massive Graphs. ACM J. Exp. Algorithmics 28 (2023)
Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees with Large Domain. IJCAI (2023)
Johannes Klaus Fichte, Daniel Le Berre, Markus Hecher, Stefan Szeider
The Silent (R)evolution of SAT. Commun. ACM 66 (6) (2023)
Marijn J. H. Heule, Inês Lynce, Stefan Szeider, André Schidler
SAT Encodings and Beyond (Dagstuhl Seminar 23261). Dagstuhl Reports 13 (6) (2023)
André Schidler, Stefan Szeider
Computing optimal hypertree decompositions with SAT. Artif. Intell. 325 (2023)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
CSP beyond tractable constraint languages. Constraints An Int. J. 28 (3) (2023)
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Circuit Minimization with QBF-Based Exact Synthesis. AAAI (2023)
Markus Kirchweger, Manfred Scheucher, Stefan Szeider
SAT-Based Generation of Planar Graphs. SAT (2023)
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity. AAAI (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Finding a Cluster in Incomplete Data. CoRR (2023)
Katalin Fazekas, Aina Niemetz, Mathias Preiner, Markus Kirchweger, Stefan Szeider, Armin Biere
IPASIR-UP: User Propagators for CDCL. SAT (2023)
Tomás Peitl, Stefan Szeider
Are hitting formulas hard for resolution? Discret. Appl. Math. 337 (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
The Computational Complexity of Concise Hypersphere Classification. CoRR (2023)
Robert Ganian, Eun Jung Kim, Stefan Szeider
Algorithmic Applications of Tree-Cut Width. CoRR (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
CSP Beyond Tractable Constraint Languages. CP (2022)
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
Threshold Treewidth and Hypertree Width. J. Artif. Intell. Res. 74 (2022)
Robert Ganian, Jan Kratochvíl, Stefan Szeider
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. Discret. Appl. Math. 312 (2022)
Robert Ganian, Eun Jung Kim, Stefan Szeider
Algorithmic Applications of Tree-Cut Width. SIAM J. Discret. Math. 36 (4) (2022)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Finding a Cluster in Incomplete Data. ESA (2022)
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Learning large Bayesian networks with expert constraints. UAI (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
SAT Backdoors: Depth Beats Size. ESA (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
SAT Backdoors: Depth Beats Size. CoRR (2022)
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
Weighted Model Counting with Twin-Width. SAT (2022)
Markus Kirchweger, Manfred Scheucher, Stefan Szeider
A SAT Attack on Rota's Basis Conjecture. SAT (2022)
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. 73 (2022)
Tomás Peitl, Stefan Szeider
Are Hitting Formulas Hard for Resolution? CoRR (2022)
André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider
Threshold Treewidth and Hypertree Width. CoRR (2022)
Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider
Weighted Model Counting with Twin-Width. CoRR (2022)
Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, Stefan Woltran
Tractable Abstract Argumentation via Backdoor-Treewidth. AAAI (2022)
André Schidler, Stefan Szeider
A SAT Approach to Twin-Width. ALENEX (2022)
André Schidler, Stefan Szeider
SAT-based Decision Tree Learning for Large Data Sets. AAAI (2021)
André Schidler, Stefan Szeider
Computing Optimal Hypertree Decompositions with SAT. IJCAI (2021)
Laura Kovács, Hanna Lachnitt, Stefan Szeider
Formalizing Graph Trail Properties in Isabelle/HOL. CoRR (2021)
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Certified DQBF Solving by Definition Extraction. SAT (2021)
Markus Kirchweger, Stefan Szeider
SAT Modulo Symmetries for Graph Generation. CP (2021)
Tomás Peitl, Stefan Szeider
Finding the Hardest Formulas for Resolution (Extended Abstract). IJCAI (2021)
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Learning Fast-Inference Bayesian Networks. NeurIPS (2021)
André Schidler, Stefan Szeider
A SAT Approach to Twin-Width. CoRR (2021)
Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider
Certified DQBF Solving by Definition Extraction. CoRR (2021)
Sebastian Ordyniak, André Schidler, Stefan Szeider
Backdoor DNFs. IJCAI (2021)
Robert Ganian, Stefan Szeider
New width parameters for SAT and #SAT. Artif. Intell. 295 (2021)
Sebastian Ordyniak, Stefan Szeider
Parameterized Complexity of Small Decision Tree Learning. AAAI (2021)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
The Parameterized Complexity of Clustering Incomplete Data. AAAI (2021)
Tomás Peitl, Stefan Szeider
Finding the Hardest Formulas for Resolution. J. Artif. Intell. Res. 72 (2021)
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. AAAI (2021)
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
A Time Leap Challenge for SAT Solving. CoRR (2020)
Laura Kovács, Hanna Lachnitt, Stefan Szeider
Formalizing Graph Trail Properties in Isabelle/HOL. CICM (2020)
Friedrich Slivovsky, Stefan Szeider
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. SAT (2020)
Tomás Peitl, Stefan Szeider
Finding the Hardest Formulas for Resolution. CP (2020)
P. R. Vaidyanathan, Stefan Szeider
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. CoRR (2020)
Ankit Shukla, Friedrich Slivovsky, Stefan Szeider
Short Q-Resolution Proofs with Homomorphisms. SAT (2020)
Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider
Threshold Treewidth and Hypertree Width. IJCAI (2020)
Robert Ganian, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters. KR (2020)
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
Breaking Symmetries with RootClique and LexTopSort. CP (2020)
Robert Ganian, Ronald de Haan, Iyad Kanj, Stefan Szeider
On Existential MSO and Its Relation to ETH. ACM Trans. Comput. Theory 12 (4) (2020)
André Schidler, Stefan Szeider
Computing Optimal Hypertree Decompositions. ALENEX (2020)
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. AAAI (2020)
Vaidyanathan Peruvemba Ramaswamy, Stefan Szeider
MaxSAT-Based Postprocessing for Treedepth. CP (2020)
Johannes Klaus Fichte, Markus Hecher, Stefan Szeider
A Time Leap Challenge for SAT-Solving. CP (2020)
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
SAT-Encodings for Treecut Width and Treedepth. ALENEX (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Combining Resolution-Path Dependencies with Dependency Learning. SAT (2019)
Ronald de Haan, Stefan Szeider
A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy. Algorithms 12 (9) (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Long-Distance Q-Resolution with Dependency Schemes. J. Autom. Reason. 63 (1) (2019)
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
A Join-Based Hybrid Parameter for Constraint Satisfaction. CoRR (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Qute in the QBF Evaluation 2018. J. Satisf. Boolean Model. Comput. 11 (1) (2019)
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
SAT-Encodings for Treecut Width and Treedepth. CoRR (2019)
Eduard Eiben, Robert Ganian, Iyad Kanj, Stefan Szeider
The Parameterized Complexity of Cascading Portfolio Scheduling. NeurIPS (2019)
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
A SAT Approach to Branchwidth. ACM Trans. Comput. Log. 20 (3) (2019)
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
A Join-Based Hybrid Parameter for Constraint Satisfaction. CP (2019)
Daniël Paulusma, Stefan Szeider
)-SAT. Inf. Process. Lett. 143 (2019)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On Clustering Incomplete Data. CoRR (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Proof Complexity of Fragments of Long-Distance Q-Resolution. SAT (2019)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Dependency Learning for QBF. J. Artif. Intell. Res. 65 (2019)
Holger H. Hoos, Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Portfolio-Based Algorithm Selection for Circuit QBFs. CP (2018)
Tomás Peitl, Friedrich Slivovsky, Stefan Szeider
Polynomial-Time Validation of QCDCL Certificates. SAT (2018)

Stefan Szeider.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stefan Szeider