Sebastian Ordyniak

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 125

Top Venues

Publications

Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees for Data of Low Rank-Width. AAAI (2024)
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
Explaining Decisions in ML Models: a Parameterized Complexity Analysis. CoRR (2024)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM J. Discret. Math. 38 (2) (2024)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
SAT backdoors: Depth beats size. J. Comput. Syst. Sci. 142 (2024)
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR (2024)
Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS (2024)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Algorithms and Complexity of Difference Logic. CoRR (2024)
Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider
A General Theoretical Framework for Learning Smallest Interpretable Models. AAAI (2024)
Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP (2024)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. CoRR (2024)
Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki
Solving Quantified Boolean Formulas with Few Existential Variables. CoRR (2024)
Sebastian Ordyniak, André Schidler, Stefan Szeider
Backdoor DNFs. J. Comput. Syst. Sci. 144 (2024)
Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
The Parameterized Complexity of Finding Concise Local Explanations. IJCAI (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. IPEC (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On the parameterized complexity of clustering problems for incomplete data. J. Comput. Syst. Sci. 134 (2023)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
Treewidth Is NP-Complete on Cubic Graphs. IPEC (2023)
Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
The Computational Complexity of Concise Hypersphere Classification. ICML (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. IPEC (2023)
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. LICS (2023)
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Parameterized complexity of envy-free resource allocation in social networks. Artif. Intell. 315 (2023)
Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. CoRR (2023)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Envy-Free Graph Cutting. CoRR (2023)
Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR (2023)
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
Group Activity Selection with Few Agent Types. Algorithmica 85 (5) (2023)
Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees with Large Domain. IJCAI (2023)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
CSP beyond tractable constraint languages. Constraints An Int. J. 28 (3) (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. CoRR (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
Almost Consistent Systems of Linear Equations. SODA (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Finding a Cluster in Incomplete Data. CoRR (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving infinite-domain CSPs using the patchwork property. Artif. Intell. 317 (2023)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
The Computational Complexity of Concise Hypersphere Classification. CoRR (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. AAAI (2022)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. WG (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
CSP Beyond Tractable Constraint Languages. CP (2022)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
Finding a Cluster in Incomplete Data. ESA (2022)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
SAT Backdoors: Depth Beats Size. ESA (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
SAT Backdoors: Depth Beats Size. CoRR (2022)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
Almost Consistent Systems of Linear Equations. CoRR (2022)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Computational Short Cuts in Infinite Domain Constraint Satisfaction. CoRR (2022)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Envy-Free Graph Cutting. IJCAI (2022)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Computational Short Cuts in Infinite Domain Constraint Satisfaction. J. Artif. Intell. Res. 75 (2022)
Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Complexity of Object Association in Multiple Object Tracking. AAAI (2021)
Robert Ganian, Sebastian Ordyniak
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. Algorithmica 83 (2) (2021)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. J. Artif. Intell. Res. 70 (2021)
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
Parameterized Algorithms for MILPs with Small Treedepth. AAAI (2021)
Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. CoRR (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Disjunctive Temporal Problems under Structural Restrictions. AAAI (2021)
Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. 300 (2021)
Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
The Parameterized Complexity of Connected Fair Division. IJCAI (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving Infinite-Domain CSPs Using the Patchwork Property. AAAI (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving Infinite-Domain CSPs Using the Patchwork Property. CoRR (2021)
Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica 83 (6) (2021)
Robert Ganian, Fabian Klute, Sebastian Ordyniak
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Algorithmica 83 (1) (2021)
Sebastian Ordyniak, André Schidler, Stefan Szeider
Backdoor DNFs. IJCAI (2021)
Sebastian Ordyniak, Stefan Szeider
Parameterized Complexity of Small Decision Tree Learning. AAAI (2021)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
The Parameterized Complexity of Clustering Incomplete Data. AAAI (2021)
Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan
Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 83 (5) (2021)
Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. CP (2021)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35 (1) (2021)
Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. AAAI (2020)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Incidence Treedepth. CoRR (2020)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Fine-Grained Complexity of Temporal Problems. KR (2020)
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci. 110 (2020)
Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. AAAI (2020)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-Coloring Extension and List Coloring Problems. STACS (2020)
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
SAT-Encodings for Treecut Width and Treedepth. ALENEX (2019)
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
A Join-Based Hybrid Parameter for Constraint Satisfaction. CoRR (2019)
Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström
Parameterized Pre-coloring Extension and List Coloring Problems. CoRR (2019)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna
Integer Programming and Incidence Treedepth. IPCO (2019)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI (2019)
Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider
SAT-Encodings for Treecut Width and Treedepth. CoRR (2019)
Neha Lodha, Sebastian Ordyniak, Stefan Szeider
A SAT Approach to Branchwidth. ACM Trans. Comput. Log. 20 (3) (2019)
Robert Ganian, Sebastian Ordyniak, Stefan Szeider
A Join-Based Hybrid Parameter for Constraint Satisfaction. CP (2019)
Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak
Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 81 (4) (2019)
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
Group Activity Selection with Few Agent Types. ESA (2019)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. IJCAI (2019)
Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider
On Clustering Incomplete Data. CoRR (2019)
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
Parameterized Algorithms for MILPs with Small Treedepth. CoRR (2019)
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
On the Complexity Landscape of Connected f-Factor Problems. Algorithmica 81 (6) (2019)
Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler
Backdoors for Linear Temporal Logic. Algorithmica 81 (2) (2019)
Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler
Backdoors to planning. Artif. Intell. 269 (2019)
Robert Ganian, Sebastian Ordyniak
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey. Algorithms 12 (12) (2019)
Robert Ganian, Sebastian Ordyniak
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. WG (2019)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. IJCAI (2018)
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
A Structural Approach to Activity Selection. IJCAI (2018)
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Small Resolution Proofs for QBF using Dependency Treewidth. STACS (2018)
Robert Ganian, Sebastian Ordyniak
The Complexity Landscape of Decompositional Parameters for ILP. CoRR (2018)
Christer Bäckström, Peter Jonsson, Sebastian Ordyniak
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. SOCS (2018)
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
Parameterized Algorithms for the Matrix Completion Problem. CoRR (2018)
Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider
Parameterized Algorithms for the Matrix Completion Problem. ICML (2018)
Robert Ganian, Fabian Klute, Sebastian Ordyniak
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. STACS (2018)
Robert Ganian, Sebastian Ordyniak
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. CoRR (2018)
Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Unary Integer Linear Programming with Structural Restrictions. IJCAI (2018)
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
Group Activity Selection with Few Agent Types. CoRR (2018)
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
On the Complexity Landscape of Connected f -Factor Problems. CoRR (2018)
Robert Ganian, Sebastian Ordyniak
The complexity landscape of decompositional parameters for ILP. Artif. Intell. 257 (2018)
Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Small Resolution Proofs for QBF using Dependency Treewidth. CoRR (2017)
Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný
Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85 (2017)
Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan
On Structural Parameterizations of the Edge Disjoint Paths Problem. ISAAC (2017)

Sebastian Ordyniak.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sebastian Ordyniak