People
Research
Courses
Updates
Jobs
Contact
Internal
Light
Dark
Automatic
Sebastian Ordyniak
Recent Publications
Backdoor DNFs
2024
Learning Small Decision Trees for Data of Low Rank-Width
2024
SAT backdoors: Depth beats size
2024
Learning Small Decision Trees with Large Domain
2023
The Parameterized Complexity of Finding Concise Local Explanations
2023
Finding a Cluster in Incomplete Data
2022
Parameterized Complexity of Small Decision Tree Learning
2021
A Join-Based Hybrid Parameter for Constraint Satisfaction
2019
Group Activity Selection with Few Agent Types
2019
SAT-Encodings for Special Treewidth and Pathwidth
2017
Backdoors for Linear Temporal Logic
2016
Counting Linear Extensions: Parameterizations by Treewidth
2016
On the Complexity Landscape of Connected f-factor Problems
2016
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
2013
Satisfiability of acyclic and almost acyclic CNF formulas
2013
Upper and Lower Bounds for Weak Backdoor Set Detection
2013
Don't Be Strict in Local Search!
2012
The Complexity of Planning Revisited - A Parameterized Analysis
2012
Algorithms and Complexity Results for Persuasive Argumentation
2011
Augmenting Tractable Fragments of Abstract Argumentation
2011
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
2011
Algorithms and Complexity Results for Exact Bayesian Structure Learning
2010
Cite
×