Stefan Szeider

34 papers · 2013–2026 · 5 conferences · across top CS/AI conferences

Achievements

🐝 Cross-Pollinator (8) 🐣 Hot Topic Early Bird 🗺️ Taxonomy Completionist (35) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🌈 Renaissance Researcher (7) 🌍 Conference Polyglot (5) 🏃 Academic Marathon (12) 🤝 Dynamic Duo (11) 🔬 Deep Specialist (13) 🧬 Topic Evolution 🏆 Keyword Champion (9) 🗃️ Keyword Collector (112) 🚀 Conference Pioneer 🔥 Unstoppable (9) 💎 Century Club (31) ⚡ Prolific Year (6)

Conferences

AAAI (16) IJCAI (12) ICML (3) NIPS (2) UAI (1)

Top co-authors

Sebastian Ordyniak (12) Robert Ganian (7) Andre Schidler (6) Eduard Eiben (5) Vaidyanathan Peruvemba Ramaswamy (4) Tomáš Peitl (4) Giacomo Paesani (4) Iyad Kanj (4) Markus Kirchweger (3) Mateusz Rychlicki (2)

Keywords

fixed-parameter tractability (9) parameterized complexity (8) combinatorial optimization (5) fixed-parameter tractable (5) decision tree (5) sat encoding (5) constraint satisfaction (4) sat solver (4) structure learning (3) symmetry breaking (3) bayesian network (3) quantified boolean formula (2) sat solving (2) hypertree width (2) cnf formula (2) model interpretability (2) matrix completion (2) decision tree learning (2) algorithm design (2) rank minimization (2)

Papers

Graph Choosability via SAT: Beyond the Nullstellensatz AAAI 2026

Generating Streamlining Constraints with Large Language Models (Abstract Reprint) AAAI 2026

Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms AAAI 2026

Optimal Decision Tree Pruning Revisited: Algorithms and Complexity ICML 2025

Breaking Symmetries in Quantified Graph Search: A Comparative Study AAAI 2025

SAT-Based Tree Decomposition with Iterative Cascading Policy Selection AAAI 2024

Learning Small Decision Trees for Data of Low Rank-Width AAAI 2024

A General Theoretical Framework for Learning Smallest Interpretable Models AAAI 2024

Compilation and Fast Model Counting beyond CNF IJCAI 2024

Revisiting Causal Discovery from a Complexity-Theoretic Perspective IJCAI 2024

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL AAAI 2024

The Parameterized Complexity of Finding Concise Local Explanations IJCAI 2023

Circuit Minimization with QBF-Based Exact Synthesis AAAI 2023

Inconsistent Cores for ASP: The Perks and Perils of Non-monotonicity AAAI 2023

Co-Certificate Learning with SAT Modulo Symmetries IJCAI 2023

Computing Twin-width with SAT and Branch & Bound IJCAI 2023

The Computational Complexity of Concise Hypersphere Classification ICML 2023

Learning Small Decision Trees with Large Domain IJCAI 2023

Tractable Abstract Argumentation via Backdoor-Treewidth AAAI 2022

Learning large Bayesian networks with expert constraints UAI 2022

Parameterized Complexity of Small Decision Tree Learning AAAI 2021

The Parameterized Complexity of Clustering Incomplete Data AAAI 2021

Learning Fast-Inference Bayesian Networks NIPS 2021

Backdoor DNFs IJCAI 2021

Computing Optimal Hypertree Decompositions with SAT IJCAI 2021

Finding the Hardest Formulas for Resolution (Extended Abstract) IJCAI 2021

Turbocharging Treewidth-Bounded Bayesian Network Structure Learning AAAI 2021

SAT-based Decision Tree Learning for Large Data Sets AAAI 2021

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank AAAI 2020

Threshold Treewidth and Hypertree Width IJCAI 2020

The Parameterized Complexity of Cascading Portfolio Scheduling NIPS 2019

Parameterized Algorithms for the Matrix Completion Problem ICML 2018

A SAT Approach to Branchwidth IJCAI 2017

Backdoors to Abduction IJCAI 2013