Ordyniak, Sebastian

40 publications

AAAI 2024 A General Theoretical Framework for Learning Smallest Interpretable Models Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, 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

IJCAI 2024 Solving Quantified Boolean Formulas with Few Existential Variables Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki

IJCAI 2023 Learning Small Decision Trees with Large Domain Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

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

IJCAI 2023 The Parameterized Complexity of Finding Concise Local Explanations Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

JAIR 2022 Computational Short Cuts in Infinite Domain Constraint Satisfaction Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak

AAAI 2022 Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

IJCAI 2022 The Complexity of Envy-Free Graph Cutting Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

IJCAI 2021 Backdoor DNFs Sebastian Ordyniak, André Schidler, Stefan Szeider

JAIR 2021 Cost-Optimal Planning, Delete Relaxation, Approximability, and Heuristics Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

AAAI 2021 Disjunctive Temporal Problems Under Structural Restrictions Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

AAAI 2021 Parameterized Algorithms for MILPs with Small Treedepth Cornelius Brand, Martin Koutecký, Sebastian Ordyniak

AAAI 2021 Parameterized Complexity of Small Decision Tree Learning Sebastian Ordyniak, Stefan Szeider

AAAI 2021 Solving Infinite-Domain CSPs Using the Patchwork Property Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

AAAI 2021 The Complexity of Object Association in Multiple Object Tracking Robert Ganian, Thekla Hamm, Sebastian Ordyniak

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

IJCAI 2021 The Parameterized Complexity of Connected Fair Division Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

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

AAAI 2020 Parameterized Complexity of Envy-Free Resource Allocation in Social Networks Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

IJCAI 2019 A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

AAAI 2019 Solving Integer Quadratic Programming via Explicit and Structural Restrictions Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

IJCAI 2018 A Structural Approach to Activity Selection Eduard Eiben, Robert Ganian, Sebastian Ordyniak

IJCAI 2018 Novel Structural Parameters for Acyclic Planning Using Tree Embeddings Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

ICML 2018 Parameterized Algorithms for the Matrix Completion Problem Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

IJCAI 2018 Unary Integer Linear Programming with Structural Restrictions Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

IJCAI 2017 A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider

AAAI 2017 Going Beyond Primal Treewidth for (M)ILP Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan

IJCAI 2017 Solving Integer Linear Programs with a Small Number of Global Variables and Constraints Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

AAAI 2016 The Complexity Landscape of Decompositional Parameters for ILP Robert Ganian, Sebastian Ordyniak

AAAI 2016 Using Decomposition-Parameters for QBF: Mind the Prefix! Eduard Eiben, Robert Ganian, Sebastian Ordyniak

AAAI 2015 Variable-Deletion Backdoors to Planning Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler

AAAI 2014 Backdoors into Heterogeneous Classes of SAT and CSP Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný

AAAI 2014 Backdoors to Planning Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler

JAIR 2013 Parameterized Complexity Results for Exact Bayesian Network Structure Learning Sebastian Ordyniak, Stefan Szeider

AAAI 2012 Don't Be Strict in Local Search! Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider

AAAI 2012 On Finding Optimal Polytrees Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider

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

IJCAI 2011 Augmenting Tractable Fragments of Abstract Argumentation Sebastian Ordyniak, Stefan Szeider

UAI 2010 Algorithms and Complexity Results for Exact Bayesian Structure Learning Sebastian Ordyniak, Stefan Szeider