Distance d-Domination Games. - Stephan Kreutzer; Sebastian Ordyniak (WG, 2009)

Algorithms and Complexity Results for Exact Bayesian Structure Learning. - Sebastian Ordyniak; Stefan Szeider (UAI, 2010)

Augmenting Tractable Fragments of Abstract Argumentation. - Sebastian Ordyniak; Stefan Szeider (IJCAI, 2011)

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). - Sebastian Ordyniak; Daniël Paulusma; Stefan Szeider (SAT, 2011)

Algorithms and complexity results for persuasive argumentation. - Eun Jung Kim 002; Sebastian Ordyniak; Stefan Szeider (Artif. Intell., 2011)

Digraph decompositions and monotonicity in digraph searching. - Stephan Kreutzer; Sebastian Ordyniak (Theor. Comput. Sci., 2011)

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

Don't Be Strict in Local Search! - Serge Gaspers; Eun Jung Kim 002; Sebastian Ordyniak; Saket Saurabh 001; Stefan Szeider (AAAI, 2012)

Valued-Based Argumentation for Tree-like Value Graphs. - Eun Jung Kim 002; Sebastian Ordyniak (COMMA, 2012)

Augmenting tractable fragments of abstract argumentation. - Wolfgang Dvorák; Sebastian Ordyniak; Stefan Szeider (Artif. Intell., 2012)

Parameterized Complexity and Kernel Bounds for Hard Planning Problems. - Christer Bäckström; Peter Jonsson; Sebastian Ordyniak; Stefan Szeider (CIAC, 2013)

Parameterized Algorithms for Modular-Width. - Jakub Gajarský; Michael Lampis; Sebastian Ordyniak (IPEC, 2013)

Upper and Lower Bounds for Weak Backdoor Set Detection. - Neeldhara Misra; Sebastian Ordyniak; Venkatesh Raman 001; Stefan Szeider (SAT, 2013)

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. - Eun Jung Kim 002; Sebastian Ordyniak; Stefan Szeider (TAFA, 2013)

Parameterized Complexity Results for Exact Bayesian Network Structure Learning. - Sebastian Ordyniak; Stefan Szeider (J. Artif. Intell. Res., 2013)

Satisfiability of acyclic and almost acyclic CNF formulas. - Sebastian Ordyniak; Daniël Paulusma; Stefan Szeider (Theor. Comput. Sci., 2013)

Finite Integer Index of Pathwidth and Treewidth. - Jakub Gajarský; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (IPEC, 2014)

Variable-Deletion Backdoors to Planning. - Martin Kronegger; Sebastian Ordyniak; Andreas Pfandler (AAAI, 2015)

FO Model Checking on Posets of Bounded Width. - Jakub Gajarský; Petr Hlinený; Daniel Lokshtanov; Jan Obdrzálek; Sebastian Ordyniak; M. S. Ramanujan 001; Saket Saurabh 001 (FOCS, 2015)

Parameterized Algorithms for Parity Games. - Jakub Gajarský; Michael Lampis; Kazuhisa Makino; Valia Mitsou; Sebastian Ordyniak (MFCS (2), 2015)

Faster Existential FO Model Checking on Posets. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak (Log. Methods Comput. Sci., 2015)

A complete parameterized complexity analysis of bounded planning. - Christer Bäckström; Peter Jonsson; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2015)

On finding optimal polytrees. - Serge Gaspers; Mikko Koivisto; Mathieu Liedloff; Sebastian Ordyniak; Stefan Szeider (Theor. Comput. Sci., 2015)

Clique-Width and Directed Width Measures for Answer-Set Programming. - Bernhard Bliem; Sebastian Ordyniak; Stefan Woltran (ECAI, 2016)

SOBRA - Shielding Optimization for BRAchytherapy. - Guillaume Blin; Marie Gasparoux; Sebastian Ordyniak; Alexandru Popa 001 (IWOCA, 2016)

Edge-Editing to a Dense and a Sparse Graph Class. - Michal Kotrbcík; Rastislav Královic; Sebastian Ordyniak (LATIN, 2016)

Backdoors to q-Horn. - Serge Gaspers; Sebastian Ordyniak; M. S. Ramanujan 001; Saket Saurabh 001; Stefan Szeider (Algorithmica, 2016)

A Parameterized Study of Maximum Generalized Pattern Matching Problems. - Sebastian Ordyniak; Alexandru Popa 001 (Algorithmica, 2016)

Strong Backdoors for Linear Temporal Logic. - Arne Meier; Sebastian Ordyniak; M. S. Ramanujan 001; Irena Schindler (CoRR, 2016)

Directed elimination games. - Viktor Engelmann; Sebastian Ordyniak; Stephan Kreutzer (Discret. Appl. Math., 2016)

Tree-depth and vertex-minors. - Petr Hlinený; O-joung Kwon; Jan Obdrzálek; Sebastian Ordyniak (Eur. J. Comb., 2016)

Complexity and monotonicity results for domination games. - Stephan Kreutzer; Sebastian Ordyniak (Theor. Comput. Sci., 2016)

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

Backdoor Sets for CSP. - Serge Gaspers; Sebastian Ordyniak; Stefan Szeider (The Constraint Satisfaction Problem, 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 (IJCAI, 2017)

SAT-Encodings for Special Treewidth and Pathwidth. - Neha Lodha; Sebastian Ordyniak; Stefan Szeider (SAT, 2017)

Kernelization using structural parameters on sparse graph classes. - Jakub Gajarský; Petr Hlinený; Jan Obdrzálek; Sebastian Ordyniak; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil; Somnath Sikdar (J. Comput. Syst. Sci., 2017)

Backdoors into heterogeneous classes of SAT and CSP. - Serge Gaspers; Neeldhara Misra; Sebastian Ordyniak; Stefan Szeider; Stanislav Zivný (J. Comput. Syst. Sci., 2017)

First order limits of sparse graphs: Plane trees and path-width. - Jakub Gajarský; Petr Hlinený; Tomás Kaiser; Daniel Král'; Martin Kupec; Jan Obdrzálek; Sebastian Ordyniak; Vojtech Tuma (Random Struct. Algorithms, 2017)

Parameterized Algorithms for the Matrix Completion Problem. - Robert Ganian; Iyad A. Kanj; Sebastian Ordyniak; Stefan Szeider (ICML, 2018)

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

Unary Integer Linear Programming with 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)

Small Resolution Proofs for QBF using Dependency Treewidth. - Eduard Eiben; Robert Ganian; Sebastian Ordyniak (STACS, 2018)

The complexity landscape of decompositional parameters for ILP. - Robert Ganian; Sebastian Ordyniak (Artif. Intell., 2018)

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

SAT-Encodings for Treecut Width and Treedepth. - Robert Ganian; Neha Lodha; Sebastian Ordyniak; Stefan Szeider (ALENEX, 2019)

A Join-Based Hybrid Parameter for Constraint Satisfaction. - Robert Ganian; Sebastian Ordyniak; Stefan Szeider (CP, 2019)

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

Integer Programming and Incidence Treedepth. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak; Michal Pilipczuk; Marcin Wrochna (IPCO, 2019)

Backdoors to planning. - Martin Kronegger; Sebastian Ordyniak; Andreas Pfandler (Artif. Intell., 2019)

Counting Linear Extensions: Parameterizations by Treewidth. - Eduard Eiben; Robert Ganian; Kustaa Kangas; Sebastian Ordyniak (Algorithmica, 2019)

On the Complexity Landscape of Connected f-Factor Problems. - Robert Ganian; N. S. Narayanaswamy; Sebastian Ordyniak; C. S. Rahul 001; M. S. Ramanujan 001 (Algorithmica, 2019)

Backdoors for Linear Temporal Logic. - Arne Meier; Sebastian Ordyniak; M. S. Ramanujan 001; Irena Schindler (Algorithmica, 2019)

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey. - Robert Ganian; Sebastian Ordyniak (Algorithms, 2019)

On Clustering Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (CoRR, 2019)

A SAT Approach to Branchwidth. - Neha Lodha; Sebastian Ordyniak; Stefan Szeider (ACM Trans. Comput. Log., 2019)

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

Fine-Grained Complexity of Temporal Problems. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (KR, 2020)

Using decomposition-parameters for QBF: Mind the prefix! - Eduard Eiben; Robert Ganian; Sebastian Ordyniak (J. Comput. Syst. Sci., 2020)

Parameterized Algorithms for MILPs with Small Treedepth. - Cornelius Brand; Martin Koutecký; Sebastian Ordyniak (AAAI, 2021)

Disjunctive Temporal Problems under Structural Restrictions. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (AAAI, 2021)

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

The Complexity of Object Association in Multiple Object Tracking. - Robert Ganian; Thekla Hamm; Sebastian Ordyniak (AAAI, 2021)

Parameterized Complexity of Small Decision Tree Learning. - Sebastian Ordyniak; Stefan Szeider (AAAI, 2021)

Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. - Peter Jonsson; Victor Lagerkvist; Sebastian Ordyniak (CP, 2021)

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

The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. - Pavel Dvorák; Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak (Artif. Intell., 2021)

Towards a Polynomial Kernel for Directed Feedback Vertex Set. - Benjamin Bergougnoux; Eduard Eiben; Robert Ganian; Sebastian Ordyniak; M. S. Ramanujan 001 (Algorithmica, 2021)

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. - Robert Ganian; Fabian Klute; Sebastian Ordyniak (Algorithmica, 2021)

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. - Robert Ganian; Sebastian Ordyniak (Algorithmica, 2021)

On Structural Parameterizations of the Edge Disjoint Paths Problem. - Robert Ganian; Sebastian Ordyniak; M. S. Ramanujan 001 (Algorithmica, 2021)

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. - Cornelius Brand; Martin Koutecký; Alexandra Lassota; Sebastian Ordyniak (CoRR, 2021)

Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. - Christer Bäckström; Peter Jonsson; Sebastian Ordyniak (J. Artif. Intell. Res., 2021)

Parameterized Pre-Coloring Extension and List Coloring Problems. - Gregory Z. Gutin; Diptapriyo Majumdar; Sebastian Ordyniak; Magnus Wahlström (SIAM J. Discret. Math., 2021)

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

Finding a Cluster in Incomplete Data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (ESA, 2022)

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

Computational Short Cuts in Infinite Domain Constraint Satisfaction. - Peter Jonsson; Victor Lagerkvist; Sebastian Ordyniak (J. Artif. Intell. Res., 2022)

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

Learning Small Decision Trees with Large Domain. - Eduard Eiben; Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (IJCAI, 2023)

The Parameterized Complexity of Finding Concise Local Explanations. - Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (IJCAI, 2023)

Treewidth Is NP-Complete on Cubic Graphs. - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (IPEC, 2023)

Parameterized Complexity Classification for Interval Constraints. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov; Marcin Pilipczuk; Roohani Sharma (IPEC, 2023)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (IPEC, 2023)

Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. - Johannes Klaus Fichte; Robert Ganian; Markus Hecher; Friedrich Slivovsky; Sebastian Ordyniak (LICS, 2023)

Almost Consistent Systems of Linear Equations. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov; Magnus Wahlström (SODA, 2023)

Parameterized complexity of envy-free resource allocation in social networks. - Eduard Eiben; Robert Ganian; Thekla Hamm; Sebastian Ordyniak (Artif. Intell., 2023)

Treewidth is NP-Complete on Cubic Graphs (and related results). - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (CoRR, 2023)

Solving infinite-domain CSPs using the patchwork property. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (Artif. Intell., 2023)

Group Activity Selection with Few Agent Types. - Robert Ganian; Sebastian Ordyniak; C. S. Rahul 001 (Algorithmica, 2023)

On the parameterized complexity of clustering problems for incomplete data. - Eduard Eiben; Robert Ganian; Iyad Kanj; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2023)

CSP beyond tractable constraint languages. - Jan Dreier; Sebastian Ordyniak; Stefan Szeider (Constraints An Int. J., 2023)

Learning Small Decision Trees for Data of Low Rank-Width. - Konrad K. Dabrowski; Eduard Eiben; Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (AAAI, 2024)

A General Theoretical Framework for Learning Smallest Interpretable Models. - Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki; Stefan Szeider (AAAI, 2024)

Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. - Cornelius Brand; Martin Koutecký; Alexandra Lassota; Sebastian Ordyniak (ESA, 2024)

A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. - Robert Ganian; Haiko Müller; Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki (ICALP, 2024)

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

Exact Algorithms for Clustered Planarity with Linear Saturators. - Giordano Da Lozzo; Robert Ganian; Siddharth Gupta 002; Bojan Mohar; Sebastian Ordyniak; Meirav Zehavi (ISAAC, 2024)

Explaining Decisions in ML Models: A Parameterized Complexity Analysis. - Sebastian Ordyniak; Giacomo Paesani; Mateusz Rychlicki; Stefan Szeider (KR, 2024)

Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. - Dibyayan Chakraborty; Haiko Müller; Sebastian Ordyniak; Fahad Panolan; Mateusz Rychlicki (MFCS, 2024)

Algorithms and Complexity of Difference Logic. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (CoRR, 2024)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov; Magnus Wahlström (CoRR, 2024)

SAT backdoors: Depth beats size. - Jan Dreier; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2024)

Backdoor DNFs. - Sebastian Ordyniak; André Schidler; Stefan Szeider (J. Comput. Syst. Sci., 2024)

An Algorithmic Framework for Locally Constrained Homomorphisms. - Laurent Bulteau; Konrad K. Dabrowski; Noleen Köhler; Sebastian Ordyniak; Daniël Paulusma (SIAM J. Discret. Math., 2024)

Backdoor DNFs Results and Source Code. - Sebastian Ordyniak; André Schidler; Stefan Szeider (Zenodo, 2024)

Bounding Width on Graph Classes of Constant Diameter. - Konrad K. Dabrowski; Tala Eagling-Vose; Noleen Köhler; Sebastian Ordyniak; Daniël Paulusma (CoRR, 2025)