Sebastian Ordyniak
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
85
Venues
24
Active years
2008–2026
Best venue rank
A*
Where they publish
- A*AAAI22 papers
- A*IJCAI13 papers
- AESA7 papers
- BWG5 papers
- A*KR4 papers
- BMFCS4 papers
- ASTACS4 papers
- ASAT4 papers
- BISAAC3 papers
- ACP3 papers
- A*ICML2 papers
- CCOMMA2 papers
- A*ICALP1 paper
- A*LICS1 paper
- A*SODA1 paper
- AALENEX1 paper
- BIPCO1 paper
- BSoCS1 paper
- AECAI1 paper
- CIWOCA1 paper
- BLATIN1 paper
- A*FOCS1 paper
- CCIAC1 paper
- AUAI1 paper
Papers
85 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | AAAI | Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms. | Sebastian Ordyniak, Mateusz Rychlicki, Stefan Szeider |
| 2026 | KR | Resolving Inconsistencies in Disjunctive Temporal Constraints: a Parameterized Complexity Classification. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Jorke M. de Vlas |
| 2026 | KR | Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach. | Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki |
| 2025 | ESA | Parameterized Approximability for Modular Linear Equations. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrm |
| 2025 | WG | Bounding Width on Graph Classes of Constant Diameter. | Konrad K. Dabrowski, Tala Eagling-Vose, Noleen Khler, Sebastian Ordyniak, Danil Paulusma |
| 2024 | AAAI | Learning Small Decision Trees for Data of Low Rank-Width. | Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2024 | AAAI | A General Theoretical Framework for Learning Smallest Interpretable Models. | Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider |
| 2024 | ESA | Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. | Cornelius Brand, Martin Kouteck, Alexandra Lassota, Sebastian Ordyniak |
| 2024 | ICALP | A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. | Robert Ganian, Haiko Mller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki |
| 2024 | IJCAI | Solving Quantified Boolean Formulas with Few Existential Variables. | Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki |
| 2024 | ISAAC | Exact Algorithms for Clustered Planarity with Linear Saturators. | Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi |
| 2024 | KR | Explaining Decisions in ML Models: A Parameterized Complexity Analysis. | Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider |
| 2024 | MFCS | Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. | Dibyayan Chakraborty, Haiko Mller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki |
| 2023 | ICML | The Computational Complexity of Concise Hypersphere Classification. | Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2023 | IJCAI | Learning Small Decision Trees with Large Domain. | Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2023 | IJCAI | The Parameterized Complexity of Finding Concise Local Explanations. | Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider |
| 2023 | LICS | Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. | Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak |
| 2023 | SODA | Almost Consistent Systems of Linear Equations. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlstrm |
| 2022 | AAAI | Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov |
| 2022 | CP | CSP Beyond Tractable Constraint Languages. | Jan Dreier, Sebastian Ordyniak, Stefan Szeider |
| 2022 | ESA | SAT Backdoors: Depth Beats Size. | Jan Dreier, Sebastian Ordyniak, Stefan Szeider |
| 2022 | ESA | Finding a Cluster in Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2022 | IJCAI | The Complexity of Envy-Free Graph Cutting. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2022 | WG | An Algorithmic Framework for Locally Constrained Homomorphisms. | Laurent Bulteau, Konrad K. Dabrowski, Noleen Khler, Sebastian Ordyniak, Danil Paulusma |
| 2021 | AAAI | Parameterized Algorithms for MILPs with Small Treedepth. | Cornelius Brand, Martin Kouteck, Sebastian Ordyniak |
| 2021 | AAAI | Solving Infinite-Domain CSPs Using the Patchwork Property. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov |
| 2021 | AAAI | Disjunctive Temporal Problems under Structural Restrictions. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov |
| 2021 | AAAI | The Parameterized Complexity of Clustering Incomplete Data. | Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2021 | AAAI | The Complexity of Object Association in Multiple Object Tracking. | Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2021 | AAAI | Parameterized Complexity of Small Decision Tree Learning. | Sebastian Ordyniak, Stefan Szeider |
| 2021 | CP | Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. | Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak |
| 2021 | IJCAI | The Parameterized Complexity of Connected Fair Division. | Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2021 | IJCAI | Backdoor DNFs. | Sebastian Ordyniak, Andr Schidler, Stefan Szeider |
| 2020 | AAAI | Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. | Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak |
| 2020 | AAAI | On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. | Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2020 | KR | Fine-Grained Complexity of Temporal Problems. | Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov |
| 2020 | STACS | Parameterized Pre-Coloring Extension and List Coloring Problems. | Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlstrm |
| 2019 | AAAI | Solving Integer Quadratic Programming via Explicit and Structural Restrictions. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2019 | ALENEX | SAT-Encodings for Treecut Width and Treedepth. | Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2019 | CP | A Join-Based Hybrid Parameter for Constraint Satisfaction. | Robert Ganian, Sebastian Ordyniak, Stefan Szeider |
| 2019 | ESA | Group Activity Selection with Few Agent Types. | Robert Ganian, Sebastian Ordyniak, C. S. Rahul |
| 2019 | IJCAI | A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak |
| 2019 | IPCO | Integer Programming and Incidence Treedepth. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna |
| 2019 | WG | The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. | Robert Ganian, Sebastian Ordyniak |
| 2018 | ICML | Parameterized Algorithms for the Matrix Completion Problem. | Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2018 | IJCAI | Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak |
| 2018 | IJCAI | Unary Integer Linear Programming with Structural Restrictions. | Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2018 | IJCAI | A Structural Approach to Activity Selection. | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2018 | STACS | Small Resolution Proofs for QBF using Dependency Treewidth. | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2018 | STACS | On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. | Robert Ganian, Fabian Klute, Sebastian Ordyniak |
| 2018 | SoCS | A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak |
| 2017 | AAAI | Going Beyond Primal Treewidth for (M)ILP. | Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | IJCAI | Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. | Pavel Dvork, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak |
| 2017 | IJCAI | A SAT Approach to Branchwidth. | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2017 | ISAAC | On Structural Parameterizations of the Edge Disjoint Paths Problem. | Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan |
| 2017 | MFCS | Towards a Polynomial Kernel for Directed Feedback Vertex Set. | Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan |
| 2017 | SAT | SAT-Encodings for Special Treewidth and Pathwidth. | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2016 | AAAI | Using Decomposition-Parameters for QBF: Mind the Prefix! | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
| 2016 | AAAI | The Complexity Landscape of Decompositional Parameters for ILP. | Robert Ganian, Sebastian Ordyniak |
| 2016 | ECAI | Clique-Width and Directed Width Measures for Answer-Set Programming. | Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran |
| 2016 | ESA | Counting Linear Extensions: Parameterizations by Treewidth. | Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak |
| 2016 | IWOCA | SOBRA - Shielding Optimization for BRAchytherapy. | Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa |
| 2016 | LATIN | Edge-Editing to a Dense and a Sparse Graph Class. | Michal Kotrbck, Rastislav Krlovic, Sebastian Ordyniak |
| 2016 | MFCS | On the Complexity Landscape of Connected f-Factor Problems. | Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan |
| 2016 | SAT | A SAT Approach to Branchwidth. | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
| 2015 | AAAI | Variable-Deletion Backdoors to Planning. | Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler |
| 2015 | FOCS | FO Model Checking on Posets of Bounded Width. | Jakub Gajarsk, Petr Hlinen, Daniel Lokshtanov, Jan Obdrzlek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh |
| 2015 | MFCS | Parameterized Algorithms for Parity Games. | Jakub Gajarsk, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak |
| 2014 | AAAI | Backdoors into Heterogeneous Classes of SAT and CSP. | Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivn |
| 2014 | AAAI | Backdoors to Planning. | Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler |
| 2014 | ISAAC | Faster Existential FO Model Checking on Posets. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak |
| 2013 | CIAC | Parameterized Complexity and Kernel Bounds for Hard Planning Problems. | Christer Bckstrm, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider |
| 2013 | ESA | Kernelization Using Structural Parameters on Sparse Graph Classes. | Jakub Gajarsk, Petr Hlinen, Jan Obdrzlek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar |
| 2013 | STACS | Backdoors to q-Horn. | Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider |
| 2013 | SAT | Upper and Lower Bounds for Weak Backdoor Set Detection. | Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider |
| 2012 | AAAI | The Complexity of Planning Revisited - A Parameterized Analysis. | Christer Bckstrm, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider |
| 2012 | AAAI | On Finding Optimal Polytrees. | Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider |
| 2012 | AAAI | Don't Be Strict in Local Search! | Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider |
| 2012 | COMMA | Valued-Based Argumentation for Tree-like Value Graphs. | Eun Jung Kim, Sebastian Ordyniak |
| 2011 | IJCAI | Augmenting Tractable Fragments of Abstract Argumentation. | Sebastian Ordyniak, Stefan Szeider |
| 2011 | SAT | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). | Sebastian Ordyniak, Danil Paulusma, Stefan Szeider |
| 2010 | COMMA | Algorithms and Complexity Results for Persuasive Argumentation. | Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider |
| 2010 | UAI | Algorithms and Complexity Results for Exact Bayesian Structure Learning. | Sebastian Ordyniak, Stefan Szeider |
| 2009 | WG | Distance | Stephan Kreutzer, Sebastian Ordyniak |
| 2008 | WG | Digraph Decompositions and Monotonicity in Digraph Searching. | Stephan Kreutzer, Sebastian Ordyniak |