Sebastian Ordyniak

According to our database, Sebastian Ordyniak authored at least 99 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Algorithms and Complexity of Difference Logic.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

CoRR, 2024

A General Theoretical Framework for Learning Smallest Interpretable Models.

Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Learning Small Decision Trees for Data of Low Rank-Width.

Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

CSP beyond tractable constraint languages.

Jan Dreier, Sebastian Ordyniak, Stefan Szeider

Constraints An Int. J., September, 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., June, 2023

Group Activity Selection with Few Agent Types.

Robert Ganian, Sebastian Ordyniak, C. S. Rahul

Algorithmica, May, 2023

Solving infinite-domain CSPs using the patchwork property.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Artif. Intell., April, 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ý

CoRR, 2023

Parameterized complexity of envy-free resource allocation in social networks.

Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Artif. Intell., 2023

Almost Consistent Systems of Linear Equations.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 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

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

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Complexity Classification for Interval Constraints.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 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ý

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The Parameterized Complexity of Finding Concise Local Explanations.

Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Learning Small Decision Trees with Large Domain.

Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

The Computational Complexity of Concise Hypersphere Classification.

Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider

Proceedings of the International Conference on Machine Learning, 2023

2022

Computational Short Cuts in Infinite Domain Constraint Satisfaction.

Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak

J. Artif. Intell. Res., 2022

An Algorithmic Framework for Locally Constrained Homomorphisms.

Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

The Complexity of Envy-Free Graph Cutting.

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Finding a Cluster in Incomplete Data.

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

SAT Backdoors: Depth Beats Size.

Jan Dreier, Sebastian Ordyniak, Stefan Szeider

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Parameterized Pre-Coloring Extension and List Coloring Problems.

Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström

SIAM J. Discret. Math., 2021

Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

J. Artif. Intell. Res., 2021

Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises.

Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak

CoRR, 2021

On Structural Parameterizations of the Edge Disjoint Paths Problem.

Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan

Algorithmica, 2021

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.

Robert Ganian, Sebastian Ordyniak

Algorithmica, 2021

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.

Robert Ganian, Fabian Klute, Sebastian Ordyniak

Algorithmica, 2021

Towards a Polynomial Kernel for Directed Feedback Vertex Set.

Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan

Algorithmica, 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

Backdoor DNFs.

Sebastian Ordyniak, André Schidler, Stefan Szeider

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

The Parameterized Complexity of Connected Fair Division.

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors.

Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Parameterized Complexity of Small Decision Tree Learning.

Sebastian Ordyniak, Stefan Szeider

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

The Complexity of Object Association in Multiple Object Tracking.

Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

The Parameterized Complexity of Clustering Incomplete Data.

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Disjunctive Temporal Problems under Structural Restrictions.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Parameterized Algorithms for MILPs with Small Treedepth.

Cornelius Brand, Martin Koutecký, Sebastian Ordyniak

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Using decomposition-parameters for QBF: Mind the prefix!

Eduard Eiben, Robert Ganian, Sebastian Ordyniak

J. Comput. Syst. Sci., 2020

Fine-Grained Complexity of Temporal Problems.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank.

Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

A SAT Approach to Branchwidth.

Neha Lodha, Sebastian Ordyniak, Stefan Szeider

ACM Trans. Comput. Log., 2019

On Clustering Incomplete Data.

Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider

CoRR, 2019

Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey.

Robert Ganian, Sebastian Ordyniak

Algorithms, 2019

Backdoors for Linear Temporal Logic.

Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler

Algorithmica, 2019

On the Complexity Landscape of Connected f-Factor Problems.

Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan

Algorithmica, 2019

Counting Linear Extensions: Parameterizations by Treewidth.

Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak

Algorithmica, 2019

Backdoors to planning.

Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler

Artif. Intell., 2019

Integer Programming and Incidence Treedepth.

Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

A Join-Based Hybrid Parameter for Constraint Satisfaction.

Robert Ganian, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Principles and Practice of Constraint Programming, 2019

SAT-Encodings for Treecut Width and Treedepth.

Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

Solving Integer Quadratic Programming via Explicit and Structural Restrictions.

Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

The complexity landscape of decompositional parameters for ILP.

Robert Ganian, Sebastian Ordyniak

Artif. Intell., 2018

Small Resolution Proofs for QBF using Dependency Treewidth.

Eduard Eiben, Robert Ganian, Sebastian Ordyniak

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

A Structural Approach to Activity Selection.

Eduard Eiben, Robert Ganian, Sebastian Ordyniak

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Unary Integer Linear Programming with Structural Restrictions.

Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Novel Structural Parameters for Acyclic Planning Using Tree Embeddings.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Parameterized Algorithms for the Matrix Completion Problem.

Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider

Proceedings of the 35th International Conference on Machine Learning, 2018

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

Backdoors into heterogeneous classes of SAT and CSP.

Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný

J. Comput. Syst. Sci., 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

SAT-Encodings for Special Treewidth and Pathwidth.

Neha Lodha, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 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

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Backdoor Sets for CSP.

Serge Gaspers, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Constraint Satisfaction Problem: Complexity and Approximability, 2017

Going Beyond Primal Treewidth for (M)ILP.

Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Complexity and monotonicity results for domination games.

Stephan Kreutzer, Sebastian Ordyniak

Theor. Comput. Sci., 2016

Tree-depth and vertex-minors.

Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak

Eur. J. Comb., 2016

Directed elimination games.

Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer

Discret. Appl. Math., 2016

Strong Backdoors for Linear Temporal Logic.

Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler

CoRR, 2016

A Parameterized Study of Maximum Generalized Pattern Matching Problems.

Sebastian Ordyniak, Alexandru Popa

Algorithmica, 2016

Backdoors to q-Horn.

Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider

Algorithmica, 2016

Edge-Editing to a Dense and a Sparse Graph Class.

Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

SOBRA - Shielding Optimization for BRAchytherapy.

Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Clique-Width and Directed Width Measures for Answer-Set Programming.

Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

On finding optimal polytrees.

Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider

Theor. 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

Faster Existential FO Model Checking on Posets.

Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak

Log. Methods Comput. Sci., 2015

Parameterized Algorithms for Parity Games.

Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

FO Model Checking on Posets of Bounded Width.

Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Variable-Deletion Backdoors to Planning.

Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Finite Integer Index of Pathwidth and Treewidth.

Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Satisfiability of acyclic and almost acyclic CNF formulas.

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider

Theor. Comput. Sci., 2013

Parameterized Complexity Results for Exact Bayesian Network Structure Learning.

Sebastian Ordyniak, Stefan Szeider

J. Artif. Intell. Res., 2013

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.

Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Theory and Applications of Formal Argumentation, 2013

Upper and Lower Bounds for Weak Backdoor Set Detection.

Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Parameterized Algorithms for Modular-Width.

Jakub Gajarský, Michael Lampis, Sebastian Ordyniak

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

Parameterized Complexity and Kernel Bounds for Hard Planning Problems.

Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Augmenting tractable fragments of abstract argumentation.

Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider

Artif. Intell., 2012

Valued-Based Argumentation for Tree-like Value Graphs.

Eun Jung Kim, Sebastian Ordyniak

Proceedings of the Computational Models of Argument, 2012

Don't Be Strict in Local Search!

Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

The Complexity of Planning Revisited - A Parameterized Analysis.

Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Digraph decompositions and monotonicity in digraph searching.

Stephan Kreutzer, Sebastian Ordyniak

Theor. Comput. Sci., 2011

Algorithms and complexity results for persuasive argumentation.

Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider

Artif. Intell., 2011

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Augmenting Tractable Fragments of Abstract Argumentation.

Sebastian Ordyniak, Stefan Szeider

Proceedings of the IJCAI 2011, 2011

2010

Algorithms and Complexity Results for Exact Bayesian Structure Learning.

Sebastian Ordyniak, Stefan Szeider

Proceedings of the UAI 2010, 2010

2009

Distance <i>d</i>-Domination Games.

Stephan Kreutzer, Sebastian Ordyniak

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009