Publications (31)
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak +1
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
A Parameterized Study of Maximum Generalized Pattern Matching Problems
Sebastian Ordyniak, Alexandru Popa
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
Sebastian Ordyniak, Daniel Paulusma, Stefan Szeider
Parameterized Algorithms for Modular-Width
Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
Parameterized Pre-coloring Extension and List Coloring Problems
Gregory Gutin, Diptapriyo Majumdar, Sebastian Ordyniak +1
The paper studies the parameterized complexity of list coloring and pre‑coloring extension problems on graphs when a small clique modulator is given, providing an O*(2^k) randomize…
Group Activity Selection with Few Agent Types
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
First order limits of sparse graphs: Plane trees and path-width
Jakub Gajarsky, Petr Hlineny, Tomas Kaiser +5
Parameterized Algorithms for the Matrix Completion Problem
Robert Ganian, Iyad Kanj, Sebastian Ordyniak +1
Clique-Width and Directed Width Measures for Answer-Set Programming
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
Algorithms and Complexity Results for Exact Bayesian Structure Learning
Sebastian Ordyniak, Stefan Szeider
The Complexity Landscape of Decompositional Parameters for ILP
Robert Ganian, Sebastian Ordyniak
Strong Backdoors for Linear Temporal Logic
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan +1
Faster Existential FO Model Checking on Posets
Jakub Gajarský, Petr HlinÄný, Jan Obdržálek +1
Tree-depth and Vertex-minors
Petr HlinÄný, O-joung Kwon, Jan Obdržálek +1
Don't Be Strict in Local Search!
Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak +2
The Complexity of Planning Revisited - A Parameterized Analysis
Christer Baeckstroem, Yue Chen, Peter Jonsson +2
Upper and Lower Bounds for Weak Backdoor Set Detection
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman +1
FO Model Checking on Posets of Bounded Width
Jakub Gajarský, Petr HlinÄný, Daniel Lokshtanov +4
Algorithms and Complexity Results for Persuasive Argumentation
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
Augmenting Tractable Fragments of Abstract Argumentation
Sebastian Ordyniak, Stefan Szeider
Digraph Decompositions and Monotonicity in Digraph Searching
Stephan Kreutzer, Sebastian Ordyniak
Small Resolution Proofs for QBF using Dependency Treewidth
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
On Structural Parameterizations of the Edge Disjoint Paths Problem
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Backdoors into Heterogeneous Classes of SAT and CSP
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak +2
A Join-Based Hybrid Parameter for Constraint Satisfaction
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
The paper introduces joinwidth, a new hybrid complexity measure for the Constraint Satisfaction Problem that combines structural and relational information, and shows how it yields…
A Complete Parameterized Complexity Analysis of Bounded Planning
Christer Baeckstroem, Peter Jonsson, Sebastian Ordyniak +1
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Robert Ganian, Sebastian Ordyniak
Parameterized Complexity Results for Exact Bayesian Network Structure Learning
Sebastian Ordyniak, Stefan Szeider
On Finding Optimal Polytrees
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff +2
Kernelization Using Structural Parameters on Sparse Graph Classes
Jakub Gajarský, Petr HlinÄný, Jan Obdržálek +5