Sebastian Ordyniak

198 papers A* 43A 21B 21C 4Journal 105Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
A General Theoretical Framework for Learning Smallest Interpretable Models.
Artif. Intell.
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2026 J jnl
Algorithms and complexity of difference logic.
J. Comput. Syst. Sci.
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2026 A* conf
Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms.
AAAI
Sebastian Ordyniak, Mateusz Rychlicki, Stefan Szeider
2026 J jnl
Covering and partitioning of split, chain and cographs with isometric paths.
Theor. Comput. Sci.
Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2026 J jnl
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
Algorithmica
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2026 J jnl
OBDDs, SDDs, and circuits of bounded width: Completeness matters.
Artif. Intell.
Alexis de Colnet, Sebastian Ordyniak, Stefan Szeider
2026 J jnl
SOBRA - Shielding Optimization for BRAchytherapy.
Theor. Comput. Sci.
Guillaume Blin, Adrian Miclaus, Sebastian Ordyniak, Alexandru Popa
2025 J jnl
Almost Consistent Systems of Linear Equations.
ACM Trans. Algorithms
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025 B conf
Bounding Width on Graph Classes of Constant Diameter.
WG
Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2025 J jnl
Bounding Width on Graph Classes of Constant Diameter.
CoRR
Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2025 J jnl
Explaining Decisions in ML Models: a Parameterized Complexity Analysis (Part I).
CoRR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2025 A conf
Parameterized Approximability for Modular Linear Equations.
ESA
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025 J jnl
Parameterized Approximability for Modular Linear Equations.
CoRR
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2025 J jnl
Treewidth is NP-Complete on Cubic Graphs.
Electron. J. Comb.
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2024 A* conf
A General Theoretical Framework for Learning Smallest Interpretable Models.
AAAI
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 A* conf
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding.
ICALP
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
2024 J jnl
A Tight Subexponential-time Algorithm for Two-Page Book Embedding.
CoRR
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
2024 J jnl
Algorithms and Complexity of Difference Logic.
CoRR
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2024 J jnl
An Algorithmic Framework for Locally Constrained Homomorphisms.
SIAM J. Discret. Math.
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2024 J jnl
Backdoor DNFs.
J. Comput. Syst. Sci.
Sebastian Ordyniak, André Schidler, Stefan Szeider
2024 B conf
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths.
MFCS
Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2024 B conf
Exact Algorithms for Clustered Planarity with Linear Saturators.
ISAAC
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024 J jnl
Exact Algorithms for Clustered Planarity with Linear Saturators.
CoRR
Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024 A* conf
Explaining Decisions in ML Models: A Parameterized Complexity Analysis.
KR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 J jnl
Explaining Decisions in ML Models: a Parameterized Complexity Analysis.
CoRR
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
2024 J jnl
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2024 A* conf
Learning Small Decision Trees for Data of Low Rank-Width.
AAAI
Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2024 J jnl
SAT backdoors: Depth beats size.
J. Comput. Syst. Sci.
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2024 A conf
Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds.
ESA
Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
2024 A* conf
Solving Quantified Boolean Formulas with Few Existential Variables.
IJCAI
Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki
2024 J jnl
Solving Quantified Boolean Formulas with Few Existential Variables.
CoRR
Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
2024 J jnl
Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings.
CoRR
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2023 A* conf
Almost Consistent Systems of Linear Equations.
SODA
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2023 J jnl
CSP beyond tractable constraint languages.
Constraints An Int. J.
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
Finding a Cluster in Incomplete Data.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 B conf
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem.
IPEC
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
Group Activity Selection with Few Agent Types.
Algorithmica
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2023 A* conf
Learning Small Decision Trees with Large Domain.
IJCAI
Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2023 J jnl
On the parameterized complexity of clustering problems for incomplete data.
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 B conf
Parameterized Complexity Classification for Interval Constraints.
IPEC
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
2023 J jnl
Parameterized Complexity Classification for Interval Constraints.
CoRR
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
2023 J jnl
Parameterized complexity of envy-free resource allocation in social networks.
Artif. Intell.
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2023 J jnl
Solving infinite-domain CSPs using the patchwork property.
Artif. Intell.
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2023 A* conf
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
LICS
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023 J jnl
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF.
CoRR
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
2023 J jnl
The Complexity of Envy-Free Graph Cutting.
CoRR
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2023 A* conf
The Computational Complexity of Concise Hypersphere Classification.
ICML
Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2023 J jnl
The Computational Complexity of Concise Hypersphere Classification.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2023 A* conf
The Parameterized Complexity of Finding Concise Local Explanations.
IJCAI
Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
2023 B conf
Treewidth Is NP-Complete on Cubic Graphs.
IPEC
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023 J jnl
Treewidth is NP-Complete on Cubic Graphs (and related results).
CoRR
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2022 J jnl
Almost Consistent Systems of Linear Equations.
CoRR
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
2022 B conf
An Algorithmic Framework for Locally Constrained Homomorphisms.
WG
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2022 J jnl
An Algorithmic Framework for Locally Constrained Homomorphisms.
CoRR
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
2022 A conf
CSP Beyond Tractable Constraint Languages.
CP
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2022 J jnl
Computational Short Cuts in Infinite Domain Constraint Satisfaction.
CoRR
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2022 J jnl
Computational Short Cuts in Infinite Domain Constraint Satisfaction.
J. Artif. Intell. Res.
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2022 A conf
Finding a Cluster in Incomplete Data.
ESA
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2022 A* conf
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach.
AAAI
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2022 A conf
SAT Backdoors: Depth Beats Size.
ESA
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2022 J jnl
SAT Backdoors: Depth Beats Size.
CoRR
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
2022 A* conf
The Complexity of Envy-Free Graph Cutting.
IJCAI
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021 A* conf
Backdoor DNFs.
IJCAI
Sebastian Ordyniak, André Schidler, Stefan Szeider
2021 J jnl
Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics.
J. Artif. Intell. Res.
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
2021 A* conf
Disjunctive Temporal Problems under Structural Restrictions.
AAAI
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021 J jnl
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.
Algorithmica
Robert Ganian, Fabian Klute, Sebastian Ordyniak
2021 J jnl
On Structural Parameterizations of the Edge Disjoint Paths Problem.
Algorithmica
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2021 A* conf
Parameterized Algorithms for MILPs with Small Treedepth.
AAAI
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
2021 A* conf
Parameterized Complexity of Small Decision Tree Learning.
AAAI
Sebastian Ordyniak, Stefan Szeider
2021 J jnl
Parameterized Pre-Coloring Extension and List Coloring Problems.
SIAM J. Discret. Math.
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2021 A conf
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors.
CP
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
2021 A* conf
Solving Infinite-Domain CSPs Using the Patchwork Property.
AAAI
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021 J jnl
Solving Infinite-Domain CSPs Using the Patchwork Property.
CoRR
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2021 J jnl
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.
CoRR
Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
2021 A* conf
The Complexity of Object Association in Multiple Object Tracking.
AAAI
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021 A* conf
The Parameterized Complexity of Clustering Incomplete Data.
AAAI
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2021 A* conf
The Parameterized Complexity of Connected Fair Division.
IJCAI
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2021 J jnl
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
Algorithmica
Robert Ganian, Sebastian Ordyniak
2021 J jnl
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints.
Artif. Intell.
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2021 J jnl
Towards a Polynomial Kernel for Directed Feedback Vertex Set.
Algorithmica
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2020 A* conf
Fine-Grained Complexity of Temporal Problems.
KR
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
2020 J jnl
Integer Programming and Incidence Treedepth.
CoRR
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2020 A* conf
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank.
AAAI
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2020 A* conf
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks.
AAAI
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
2020 A conf
Parameterized Pre-Coloring Extension and List Coloring Problems.
STACS
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2020 J jnl
Using decomposition-parameters for QBF: Mind the prefix!
J. Comput. Syst. Sci.
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2019 A conf
A Join-Based Hybrid Parameter for Constraint Satisfaction.
CP
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
A Join-Based Hybrid Parameter for Constraint Satisfaction.
CoRR
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
2019 A* conf
A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs.
IJCAI
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
2019 J jnl
A SAT Approach to Branchwidth.
ACM Trans. Comput. Log.
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
Backdoors for Linear Temporal Logic.
Algorithmica
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
2019 J jnl
Backdoors to planning.
Artif. Intell.
Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler
2019 J jnl
Counting Linear Extensions: Parameterizations by Treewidth.
Algorithmica
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
2019 A conf
Group Activity Selection with Few Agent Types.
ESA
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2019 B conf
Integer Programming and Incidence Treedepth.
IPCO
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
2019 J jnl
On Clustering Incomplete Data.
CoRR
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
On the Complexity Landscape of Connected f-Factor Problems.
Algorithmica
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2019 J jnl
Parameterized Algorithms for MILPs with Small Treedepth.
CoRR
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
2019 J jnl
Parameterized Pre-coloring Extension and List Coloring Problems.
CoRR
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
2019 A conf
SAT-Encodings for Treecut Width and Treedepth.
ALENEX
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
SAT-Encodings for Treecut Width and Treedepth.
CoRR
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2019 J jnl
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey.
Algorithms
Robert Ganian, Sebastian Ordyniak
2019 A* conf
Solving Integer Quadratic Programming via Explicit and Structural Restrictions.
AAAI
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2019 B conf
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths.
WG
Robert Ganian, Sebastian Ordyniak
2018 B conf
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs.
SOCS
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
2018 A* conf
A Structural Approach to Activity Selection.
IJCAI
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2018 J jnl
Group Activity Selection with Few Agent Types.
CoRR
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2018 A* conf
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings.
IJCAI
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
2018 A conf
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.
STACS
Robert Ganian, Fabian Klute, Sebastian Ordyniak
2018 J jnl
On the Complexity Landscape of Connected f -Factor Problems.
CoRR
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2018 A* conf
Parameterized Algorithms for the Matrix Completion Problem.
ICML
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 J jnl
Parameterized Algorithms for the Matrix Completion Problem.
CoRR
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
2018 A conf
Small Resolution Proofs for QBF using Dependency Treewidth.
STACS
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2018 J jnl
The Complexity Landscape of Decompositional Parameters for ILP.
CoRR
Robert Ganian, Sebastian Ordyniak
2018 J jnl
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths.
CoRR
Robert Ganian, Sebastian Ordyniak
2018 J jnl
The complexity landscape of decompositional parameters for ILP.
Artif. Intell.
Robert Ganian, Sebastian Ordyniak
2018 A* conf
Unary Integer Linear Programming with Structural Restrictions.
IJCAI
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017 A* conf
A SAT Approach to Branchwidth.
IJCAI
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2017 — ch.
Backdoor Sets for CSP.
The Constraint Satisfaction Problem
Serge Gaspers, Sebastian Ordyniak, Stefan Szeider
2017 J jnl
Backdoors into heterogeneous classes of SAT and CSP.
J. Comput. Syst. Sci.
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2017 J jnl
First order limits of sparse graphs: Plane trees and path-width.
Random Struct. Algorithms
Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma
2017 A* conf
Going Beyond Primal Treewidth for (M)ILP.
AAAI
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2017 J jnl
Kernelization using structural parameters on sparse graph classes.
J. Comput. Syst. Sci.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2017 B conf
On Structural Parameterizations of the Edge Disjoint Paths Problem.
ISAAC
Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan
2017 J jnl
On Structural Parameterizations of the Edge Disjoint Paths Problem.
CoRR
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2017 A conf
SAT-Encodings for Special Treewidth and Pathwidth.
SAT
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2017 J jnl
Small Resolution Proofs for QBF using Dependency Treewidth.
CoRR
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2017 A* conf
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
IJCAI
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017 J jnl
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
CoRR
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
2017 B conf
Towards a Polynomial Kernel for Directed Feedback Vertex Set.
MFCS
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
2016 J jnl
A Parameterized Study of Maximum Generalized Pattern Matching Problems.
Algorithmica
Sebastian Ordyniak, Alexandru Popa
2016 A conf
A SAT Approach to Branchwidth.
SAT
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
2016 B conf
Backdoors for Linear Temporal Logic.
IPEC
Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler
2016 J jnl
Backdoors to q-Horn.
Algorithmica
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2016 A conf
Clique-Width and Directed Width Measures for Answer-Set Programming.
ECAI
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
2016 J jnl
Clique-Width and Directed Width Measures for Answer-Set Programming.
CoRR
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
2016 J jnl
Complexity and monotonicity results for domination games.
Theor. Comput. Sci.
Stephan Kreutzer, Sebastian Ordyniak
2016 A conf
Counting Linear Extensions: Parameterizations by Treewidth.
ESA
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
2016 J jnl
Directed elimination games.
Discret. Appl. Math.
Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer
2016 B conf
Edge-Editing to a Dense and a Sparse Graph Class.
LATIN
Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak
2016 B conf
On the Complexity Landscape of Connected f-Factor Problems.
MFCS
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2016 C conf
SOBRA - Shielding Optimization for BRAchytherapy.
IWOCA
Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa
2016 J jnl
Strong Backdoors for Linear Temporal Logic.
CoRR
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
2016 A* conf
The Complexity Landscape of Decompositional Parameters for ILP.
AAAI
Robert Ganian, Sebastian Ordyniak
2016 J jnl
Tree-depth and vertex-minors.
Eur. J. Comb.
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
2016 A* conf
Using Decomposition-Parameters for QBF: Mind the Prefix!
AAAI
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
2015 J jnl
A complete parameterized complexity analysis of bounded planning.
J. Comput. Syst. Sci.
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2015 J jnl
Backdoors into Heterogeneous Classes of SAT and CSP.
CoRR
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2015 A* conf
FO Model Checking on Posets of Bounded Width.
FOCS
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015 J jnl
FO Model Checking on Posets of Bounded Width.
CoRR
Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh
2015 J jnl
Faster Existential FO Model Checking on Posets.
Log. Methods Comput. Sci.
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
2015 J jnl
On finding optimal polytrees.
Theor. Comput. Sci.
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2015 — conf
Parameterized Algorithms for Parity Games.
MFCS (2)
Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak
2015 A* conf
Variable-Deletion Backdoors to Planning.
AAAI
Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler
2014 B conf
A Parameterized Study of Maximum Generalized Pattern Matching Problems.
IPEC
Sebastian Ordyniak, Alexandru Popa
2014 J jnl
A Parameterized Study of Maximum Generalized Pattern Matching Problems.
CoRR
Sebastian Ordyniak, Alexandru Popa
2014 A* conf
Backdoors into Heterogeneous Classes of SAT and CSP.
AAAI
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
2014 A* conf
Backdoors to Planning.
AAAI
Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler
2014 B conf
Faster Existential FO Model Checking on Posets.
ISAAC
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak
2014 B conf
Finite Integer Index of Pathwidth and Treewidth.
IPEC
Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2014 J jnl
Parameterized Complexity Results for Exact Bayesian Network Structure Learning.
CoRR
Sebastian Ordyniak, Stefan Szeider
2014 J jnl
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.
CoRR
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2014 J jnl
Tree-depth and Vertex-minors.
CoRR
Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak
2013 J jnl
A Complete Parameterized Complexity Analysis of Bounded Planning.
CoRR
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2013 A conf
Backdoors to q-Horn.
STACS
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider
2013 J jnl
Kernelization Using Structural Parameters on Sparse Graph Classes
CoRR
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013 A conf
Kernelization Using Structural Parameters on Sparse Graph Classes.
ESA
Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar
2013 B conf
Parameterized Algorithms for Modular-Width.
IPEC
Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
2013 J jnl
Parameterized Algorithms for Modular-Width.
CoRR
Jakub Gajarský, Michael Lampis, Sebastian Ordyniak
2013 J jnl
Parameterized Complexity Results for Exact Bayesian Network Structure Learning.
J. Artif. Intell. Res.
Sebastian Ordyniak, Stefan Szeider
2013 C conf
Parameterized Complexity and Kernel Bounds for Hard Planning Problems.
CIAC
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2013 J jnl
Satisfiability of acyclic and almost acyclic CNF formulas.
Theor. Comput. Sci.
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2013 — conf
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.
TAFA
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2013 J jnl
Upper and Lower Bounds for Weak Backdoor Set Detection
CoRR
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
2013 A conf
Upper and Lower Bounds for Weak Backdoor Set Detection.
SAT
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider
2012 J jnl
Algorithms and Complexity Results for Exact Bayesian Structure Learning
CoRR
Sebastian Ordyniak, Stefan Szeider
2012 J jnl
Augmenting tractable fragments of abstract argumentation.
Artif. Intell.
Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider
2012 A* conf
Don't Be Strict in Local Search!
AAAI
Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012 J jnl
Don't Be Strict in Local Search!
CoRR
Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
2012 J jnl
On Finding Optimal Polytrees
CoRR
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2012 A* conf
On Finding Optimal Polytrees.
AAAI
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider
2012 J jnl
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
CoRR
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2012 J jnl
The Complexity of Planning Revisited - A Parameterized Analysis
CoRR
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2012 A* conf
The Complexity of Planning Revisited - A Parameterized Analysis.
AAAI
Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
2012 C conf
Valued-Based Argumentation for Tree-like Value Graphs.
COMMA
Eun Jung Kim, Sebastian Ordyniak
2011 J jnl
Algorithms and Complexity Results for Persuasive Argumentation
CoRR
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2011 J jnl
Algorithms and complexity results for persuasive argumentation.
Artif. Intell.
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2011 J jnl
Augmenting Tractable Fragments of Abstract Argumentation
CoRR
Sebastian Ordyniak, Stefan Szeider
2011 A* conf
Augmenting Tractable Fragments of Abstract Argumentation.
IJCAI
Sebastian Ordyniak, Stefan Szeider
2011 J jnl
Digraph decompositions and monotonicity in digraph searching.
Theor. Comput. Sci.
Stephan Kreutzer, Sebastian Ordyniak
2011 J jnl
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II)
CoRR
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2011 A conf
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).
SAT
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2010 A conf
Algorithms and Complexity Results for Exact Bayesian Structure Learning.
UAI
Sebastian Ordyniak, Stefan Szeider
2010 C conf
Algorithms and Complexity Results for Persuasive Argumentation.
COMMA
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
2010 — conf
Satisfiability of Acyclic and Almost Acyclic CNF Formulas.
FSTTCS
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider
2009 B conf
Distance
WG
Stephan Kreutzer, Sebastian Ordyniak
2008 J jnl
Digraph Decompositions and Monotonicity in Digraph Searching
CoRR
Stephan Kreutzer, Sebastian Ordyniak
2008 B conf
Digraph Decompositions and Monotonicity in Digraph Searching.
WG
Stephan Kreutzer, Sebastian Ordyniak