default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Ordyniak
Person information
- affiliation: University of Leeds, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j40]Jan Dreier
, Sebastian Ordyniak, Stefan Szeider:
SAT backdoors: Depth beats size. J. Comput. Syst. Sci. 142: 103520 (2024)- [j39]Sebastian Ordyniak, André Schidler, Stefan Szeider:
Backdoor DNFs. J. Comput. Syst. Sci. 144: 103547 (2024) - [j38]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): 1315-1350 (2024) - [c87]Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider:
Learning Small Decision Trees for Data of Low Rank-Width. AAAI 2024: 10476-10483 - [c86]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider:
A General Theoretical Framework for Learning Smallest Interpretable Models. AAAI 2024: 10662-10669 - [c85]Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak:
Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. ESA 2024: 32:1-32:18 - [c84]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. ICALP 2024: 68:1-68:18 - [c83]Leif Eriksson, Victor Lagerkvist, Sebastian Ordyniak, George Osipov, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. IJCAI 2024: 1889-1897 - [c82]Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. MFCS 2024: 39:1-39:14 - [d1]Sebastian Ordyniak, André Schidler, Stefan Szeider:
Backdoor DNFs Results and Source Code. Zenodo, 2024
- [i54]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Algorithms and Complexity of Difference Logic. CoRR abs/2402.03273 (2024) - [i53]Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki:
A Tight Subexponential-time Algorithm for Two-Page Book Embedding. CoRR abs/2404.14087 (2024) - [i52]Leif Eriksson, Victor Lagerkvist, George Osipov, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki:
Solving Quantified Boolean Formulas with Few Existential Variables. CoRR abs/2405.06485 (2024) - [i51]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 abs/2407.10699 (2024) - [i50]Sebastian Ordyniak, Giacomo Paesani, Mateusz Rychlicki, Stefan Szeider:
Explaining Decisions in ML Models: a Parameterized Complexity Analysis. CoRR abs/2407.15780 (2024) - [i49]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR abs/2409.19410 (2024) - [i48]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings. CoRR abs/2410.09932 (2024) - 2023
- [j37]Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
Parameterized complexity of envy-free resource allocation in social networks. Artif. Intell. 315: 103826 (2023) - [j36]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Solving infinite-domain CSPs using the patchwork property. Artif. Intell. 317: 103880 (2023) - [j35]Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. Algorithmica 85(5): 1111-1155 (2023) - [j34]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
CSP beyond tractable constraint languages. Constraints An Int. J. 28(3): 450-471 (2023) - [j33]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: 1-19 (2023) - [c81]Eduard Eiben, Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. ICML 2023: 9060-9070 - [c80]Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider:
Learning Small Decision Trees with Large Domain. IJCAI 2023: 3184-3192 - [c79]Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider:
The Parameterized Complexity of Finding Concise Local Explanations. IJCAI 2023: 3312-3320 - [c78]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: 7:1-7:13 - [c77]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma:
Parameterized Complexity Classification for Interval Constraints. IPEC 2023: 11:1-11:19 - [c76]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: 16:1-16:14 - [c75]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: 1-14 - [c74]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. SODA 2023: 3179-3217 - [i47]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 abs/2301.10031 (2023) - [i46]Johannes Klaus Fichte, Robert Ganian, Markus Hecher, Friedrich Slivovsky, Sebastian Ordyniak:
Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. CoRR abs/2304.13896 (2023) - [i45]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma:
Parameterized Complexity Classification for Interval Constraints. CoRR abs/2305.13889 (2023) - [i44]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. CoRR abs/2312.07043 (2023) - [i43]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Computational Complexity of Concise Hypersphere Classification. CoRR abs/2312.07103 (2023) - [i42]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. CoRR abs/2312.07628 (2023) - 2022
- [j32]Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak:
Computational Short Cuts in Infinite Domain Constraint Satisfaction. J. Artif. Intell. Res. 75: 793-831 (2022) - [c73]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. AAAI 2022: 3724-3732 - [c72]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
CSP Beyond Tractable Constraint Languages. CP 2022: 20:1-20:17 - [c71]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT Backdoors: Depth Beats Size. ESA 2022: 46:1-46:18 - [c70]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. ESA 2022: 47:1-47:14 - [c69]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Envy-Free Graph Cutting. IJCAI 2022: 237-243 - [c68]Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. WG 2022: 114-128 - [i41]Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR abs/2201.11731 (2022) - [i40]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT Backdoors: Depth Beats Size. CoRR abs/2202.08326 (2022) - [i39]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström:
Almost Consistent Systems of Linear Equations. CoRR abs/2208.02732 (2022) - [i38]Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak:
Computational Short Cuts in Infinite Domain Constraint Satisfaction. CoRR abs/2211.10144 (2022) - 2021
- [j31]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: 103561 (2021) - [j30]Robert Ganian, Fabian Klute, Sebastian Ordyniak:
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Algorithmica 83(1): 297-336 (2021) - [j29]Robert Ganian, Sebastian Ordyniak:
The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. Algorithmica 83(2): 726-752 (2021) - [j28]Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 83(5): 1201-1221 (2021) - [j27]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica 83(6): 1605-1637 (2021) - [j26]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak:
Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. J. Artif. Intell. Res. 70: 169-204 (2021) - [j25]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM J. Discret. Math. 35(1): 575-596 (2021) - [c67]Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Complexity of Object Association in Multiple Object Tracking. AAAI 2021: 1388-1396 - [c66]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Solving Infinite-Domain CSPs Using the Patchwork Property. AAAI 2021: 3715-3723 - [c65]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Disjunctive Temporal Problems under Structural Restrictions. AAAI 2021: 3724-3732 - [c64]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity of Small Decision Tree Learning. AAAI 2021: 6454-6462 - [c63]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
The Parameterized Complexity of Clustering Incomplete Data. AAAI 2021: 7296-7304 - [c62]Cornelius Brand, Martin Koutecký, Sebastian Ordyniak:
Parameterized Algorithms for MILPs with Small Treedepth. AAAI 2021: 12249-12257 - [c61]Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak:
Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors. CP 2021: 32:1-32:20 - [c60]Argyrios Deligkas, Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
The Parameterized Complexity of Connected Fair Division. IJCAI 2021: 139-145 - [c59]Sebastian Ordyniak, André Schidler, Stefan Szeider:
Backdoor DNFs. IJCAI 2021: 1403-1409 - [i37]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Solving Infinite-Domain CSPs Using the Patchwork Property. CoRR abs/2107.01428 (2021) - [i36]Cornelius Brand, Martin Koutecký, Alexandra Lassota, Sebastian Ordyniak:
Sometimes, Convex Separable Optimization Is Much Harder than Linear Optimization, and Other Surprises. CoRR abs/2111.08048 (2021) - 2020
- [j24]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Using decomposition-parameters for QBF: Mind the prefix! J. Comput. Syst. Sci. 110: 1-21 (2020) - [c58]Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. AAAI 2020: 3906-3913 - [c57]Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak:
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. AAAI 2020: 7135-7142 - [c56]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Fine-Grained Complexity of Temporal Problems. KR 2020: 284-293 - [c55]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-Coloring Extension and List Coloring Problems. STACS 2020: 19:1-19:18 - [i35]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. CoRR abs/2012.00079 (2020)
2010 – 2019
- 2019
- [j23]Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler:
Backdoors to planning. Artif. Intell. 269: 49-75 (2019) - [j22]Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Backdoors for Linear Temporal Logic. Algorithmica 81(2): 476-496 (2019) - [j21]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. Algorithmica 81(4): 1657-1683 (2019) - [j20]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): 2606-2632 (2019) - [j19]Robert Ganian, Sebastian Ordyniak:
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey. Algorithms 12(12): 248 (2019) - [j18]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. ACM Trans. Comput. Log. 20(3): 15:1-15:24 (2019) - [c54]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI 2019: 1477-1484 - [c53]Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. ALENEX 2019: 117-129 - [c52]Robert Ganian, Sebastian Ordyniak, Stefan Szeider:
A Join-Based Hybrid Parameter for Constraint Satisfaction. CP 2019: 195-212 - [c51]Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. ESA 2019: 48:1-48:16 - [c50]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak:
A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. IJCAI 2019: 6126-6130 - [c49]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. IPCO 2019: 194-204 - [c48]Robert Ganian, Sebastian Ordyniak:
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. WG 2019: 190-204 - [i34]Gregory Z. Gutin, Diptapriyo Majumdar, Sebastian Ordyniak, Magnus Wahlström:
Parameterized Pre-coloring Extension and List Coloring Problems. CoRR abs/1907.12061 (2019) - [i33]Robert Ganian, Sebastian Ordyniak, Stefan Szeider:
A Join-Based Hybrid Parameter for Constraint Satisfaction. CoRR abs/1907.12335 (2019) - [i32]Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
On Clustering Incomplete Data. CoRR abs/1911.01465 (2019) - [i31]Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Treecut Width and Treedepth. CoRR abs/1911.12995 (2019) - [i30]Cornelius Brand, Martin Koutecký, Sebastian Ordyniak:
Parameterized Algorithms for MILPs with Small Treedepth. CoRR abs/1912.03501 (2019) - 2018
- [j17]Robert Ganian, Sebastian Ordyniak:
The complexity landscape of decompositional parameters for ILP. Artif. Intell. 257: 61-71 (2018) - [c47]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. ICML 2018: 1642-1651 - [c46]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
A Structural Approach to Activity Selection. IJCAI 2018: 203-209 - [c45]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Unary Integer Linear Programming with Structural Restrictions. IJCAI 2018: 1284-1290 - [c44]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak:
Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. IJCAI 2018: 4653-4659 - [c43]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak:
A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs. SOCS 2018: 19-27 - [c42]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Small Resolution Proofs for QBF using Dependency Treewidth. STACS 2018: 28:1-28:15 - [c41]Robert Ganian, Fabian Klute, Sebastian Ordyniak:
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. STACS 2018: 33:1-33:14 - [i29]Robert Ganian, Iyad A. Kanj, Sebastian Ordyniak, Stefan Szeider:
Parameterized Algorithms for the Matrix Completion Problem. CoRR abs/1804.03423 (2018) - [i28]Robert Ganian, Sebastian Ordyniak:
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. CoRR abs/1808.03496 (2018) - [i27]Robert Ganian, Sebastian Ordyniak, C. S. Rahul:
Group Activity Selection with Few Agent Types. CoRR abs/1808.06954 (2018) - [i26]Robert Ganian, Sebastian Ordyniak:
The Complexity Landscape of Decompositional Parameters for ILP. CoRR abs/1809.00585 (2018) - [i25]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f -Factor Problems. CoRR abs/1812.02037 (2018) - 2017
- [j16]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization using structural parameters on sparse graph classes. J. Comput. Syst. Sci. 84: 219-242 (2017) - [j15]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into heterogeneous classes of SAT and CSP. J. Comput. Syst. Sci. 85: 38-56 (2017) - [j14]Jakub Gajarský, Petr Hlinený, Tomás Kaiser, Daniel Král', Martin Kupec, Jan Obdrzálek, Sebastian Ordyniak, Vojtech Tuma:
First order limits of sparse graphs: Plane trees and path-width. Random Struct. Algorithms 50(4): 612-635 (2017) - [c40]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Going Beyond Primal Treewidth for (M)ILP. AAAI 2017: 815-821 - [c39]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. IJCAI 2017: 607-613 - [c38]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. IJCAI 2017: 4894-4898 - [c37]Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. ISAAC 2017: 36:1-36:13 - [c36]Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS 2017: 36:1-36:15 - [c35]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
SAT-Encodings for Special Treewidth and Pathwidth. SAT 2017: 429-445 - [p1]Serge Gaspers, Sebastian Ordyniak, Stefan Szeider:
Backdoor Sets for CSP. The Constraint Satisfaction Problem 2017: 137-157 - [i24]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. CoRR abs/1706.06084 (2017) - [i23]Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
On Structural Parameterizations of the Edge Disjoint Paths Problem. CoRR abs/1711.02076 (2017) - [i22]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Small Resolution Proofs for QBF using Dependency Treewidth. CoRR abs/1711.02120 (2017) - 2016
- [j13]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. Algorithmica 74(1): 540-557 (2016) - [j12]Sebastian Ordyniak, Alexandru Popa:
A Parameterized Study of Maximum Generalized Pattern Matching Problems. Algorithmica 75(1): 1-26 (2016) - [j11]Viktor Engelmann, Sebastian Ordyniak, Stephan Kreutzer:
Directed elimination games. Discret. Appl. Math. 199: 187-198 (2016) - [j10]Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak:
Tree-depth and vertex-minors. Eur. J. Comb. 56: 46-56 (2016) - [j9]Stephan Kreutzer, Sebastian Ordyniak:
Complexity and monotonicity results for domination games. Theor. Comput. Sci. 628: 1-29 (2016) - [c34]Robert Ganian, Sebastian Ordyniak:
The Complexity Landscape of Decompositional Parameters for ILP. AAAI 2016: 710-716 - [c33]Eduard Eiben, Robert Ganian, Sebastian Ordyniak:
Using Decomposition-Parameters for QBF: Mind the Prefix! AAAI 2016: 964-970 - [c32]Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran:
Clique-Width and Directed Width Measures for Answer-Set Programming. ECAI 2016: 1105-1113 - [c31]Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak:
Counting Linear Extensions: Parameterizations by Treewidth. ESA 2016: 39:1-39:18 - [c30]Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa:
SOBRA - Shielding Optimization for BRAchytherapy. IWOCA 2016: 309-320 - [c29]Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler:
Backdoors for Linear Temporal Logic. IPEC 2016: 23:1-23:17 - [c28]Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak:
Edge-Editing to a Dense and a Sparse Graph Class. LATIN 2016: 562-575 - [c27]Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan:
On the Complexity Landscape of Connected f-Factor Problems. MFCS 2016: 41:1-41:14 - [c26]Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. SAT 2016: 179-195 - [i21]Arne Meier, Sebastian Ordyniak, M. S. Ramanujan, Irena Schindler:
Strong Backdoors for Linear Temporal Logic. CoRR abs/1602.04934 (2016) - [i20]Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran:
Clique-Width and Directed Width Measures for Answer-Set Programming. CoRR abs/1606.09449 (2016) - 2015
- [j8]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. Log. Methods Comput. Sci. 11(4) (2015) - [j7]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
A complete parameterized complexity analysis of bounded planning. J. Comput. Syst. Sci. 81(7): 1311-1332 (2015) - [j6]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On finding optimal polytrees. Theor. Comput. Sci. 592: 49-58 (2015) - [c25]Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler:
Variable-Deletion Backdoors to Planning. AAAI 2015: 3305-3312 - [c24]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. FOCS 2015: 963-974 - [c23]Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak:
Parameterized Algorithms for Parity Games. MFCS (2) 2015: 336-347 - [i19]Jakub Gajarský, Petr Hlinený, Daniel Lokshtanov, Jan Obdrzálek, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh:
FO Model Checking on Posets of Bounded Width. CoRR abs/1504.04115 (2015) - [i18]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. CoRR abs/1509.05725 (2015) - 2014
- [c22]Martin Kronegger, Sebastian Ordyniak, Andreas Pfandler:
Backdoors to Planning. AAAI 2014: 2300-2307 - [c21]Serge Gaspers, Neeldhara Misra, Sebastian Ordyniak, Stefan Szeider, Stanislav Zivný:
Backdoors into Heterogeneous Classes of SAT and CSP. AAAI 2014: 2652-2658 - [c20]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak:
Faster Existential FO Model Checking on Posets. ISAAC 2014: 441-451 - [c19]Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Finite Integer Index of Pathwidth and Treewidth. IPEC 2014: 258-269 - [c18]Sebastian Ordyniak, Alexandru Popa:
A Parameterized Study of Maximum Generalized Pattern Matching Problems. IPEC 2014: 270-281 - [i17]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity Results for Exact Bayesian Network Structure Learning. CoRR abs/1402.0558 (2014) - [i16]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. CoRR abs/1402.6109 (2014) - [i15]Petr Hlinený, O-joung Kwon, Jan Obdrzálek, Sebastian Ordyniak:
Tree-depth and Vertex-minors. CoRR abs/1403.7024 (2014) - [i14]Sebastian Ordyniak, Alexandru Popa:
A Parameterized Study of Maximum Generalized Pattern Matching Problems. CoRR abs/1409.2398 (2014) - 2013
- [j5]Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity Results for Exact Bayesian Network Structure Learning. J. Artif. Intell. Res. 46: 263-302 (2013) - [j4]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci. 481: 85-99 (2013) - [c17]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CIAC 2013: 13-24 - [c16]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization Using Structural Parameters on Sparse Graph Classes. ESA 2013: 529-540 - [c15]Jakub Gajarský, Michael Lampis, Sebastian Ordyniak:
Parameterized Algorithms for Modular-Width. IPEC 2013: 163-176 - [c14]Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. SAT 2013: 394-402 - [c13]Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, Stefan Szeider:
Backdoors to q-Horn. STACS 2013: 67-79 - [c12]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. TAFA 2013: 158-175 - [i13]Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar:
Kernelization Using Structural Parameters on Sparse Graph Classes. CoRR abs/1302.6863 (2013) - [i12]Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman, Stefan Szeider:
Upper and Lower Bounds for Weak Backdoor Set Detection. CoRR abs/1304.5518 (2013) - [i11]Jakub Gajarský, Michael Lampis, Sebastian Ordyniak:
Parameterized Algorithms for Modular-Width. CoRR abs/1308.2858 (2013) - [i10]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
A Complete Parameterized Complexity Analysis of Bounded Planning. CoRR abs/1310.7828 (2013) - 2012
- [j3]Wolfgang Dvorák, Sebastian Ordyniak, Stefan Szeider:
Augmenting tractable fragments of abstract argumentation. Artif. Intell. 186: 157-173 (2012) - [c11]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! AAAI 2012: 486-492 - [c10]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On Finding Optimal Polytrees. AAAI 2012: 750-756 - [c9]Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Planning Revisited - A Parameterized Analysis. AAAI 2012: 1735-1741 - [c8]Eun Jung Kim, Sebastian Ordyniak:
Valued-Based Argumentation for Tree-like Value Graphs. COMMA 2012: 378-389 - [i9]Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Exact Bayesian Structure Learning. CoRR abs/1203.3501 (2012) - [i8]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! CoRR abs/1208.1688 (2012) - [i7]Serge Gaspers, Mikko Koivisto, Mathieu Liedloff, Sebastian Ordyniak, Stefan Szeider:
On Finding Optimal Polytrees. CoRR abs/1208.1692 (2012) - [i6]Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Planning Revisited - A Parameterized Analysis. CoRR abs/1208.2566 (2012) - [i5]Christer Bäckström, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider:
Parameterized Complexity and Kernel Bounds for Hard Planning Problems. CoRR abs/1211.0479 (2012) - 2011
- [j2]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and complexity results for persuasive argumentation. Artif. Intell. 175(9-10): 1722-1736 (2011) - [j1]Stephan Kreutzer, Sebastian Ordyniak:
Digraph decompositions and monotonicity in digraph searching. Theor. Comput. Sci. 412(35): 4688-4703 (2011) - [c7]Sebastian Ordyniak, Stefan Szeider:
Augmenting Tractable Fragments of Abstract Argumentation. IJCAI 2011: 1033-1038 - [c6]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). SAT 2011: 47-60 - [i4]Sebastian Ordyniak, Stefan Szeider:
Augmenting Tractable Fragments of Abstract Argumentation. CoRR abs/1104.2842 (2011) - [i3]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II). CoRR abs/1104.4279 (2011) - [i2]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Persuasive Argumentation. CoRR abs/1104.4290 (2011) - 2010
- [c5]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Persuasive Argumentation. COMMA 2010: 311-322 - [c4]Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. FSTTCS 2010: 84-95 - [c3]Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Exact Bayesian Structure Learning. UAI 2010: 401-408
2000 – 2009
- 2009
- [c2]Stephan Kreutzer, Sebastian Ordyniak:
Distance d-Domination Games. WG 2009: 308-319 - 2008
- [c1]Stephan Kreutzer, Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching. WG 2008: 336-347 - [i1]Stephan Kreutzer, Sebastian Ordyniak:
Digraph Decompositions and Monotonicity in Digraph Searching. CoRR abs/0802.2228 (2008)
Coauthor Index
[c84] [i53] [i51] [i49] [j37] [j35] [j33] [c81] [c76] [c75] [i46] [i44] [i43] [i42] [c70] [c69] [j31] [j30] [j29] [j28] [j27] [c67] [c63] [c60] [j24] [c58] [c57] [i35] [j21] [j20] [j19] [c54] [c53] [c52] [c51] [c49] [c48] [i33] [i32] [i31] [j17] [c47] [c46] [c45] [c42] [c41] [i29] [i28] [i27] [i26] [i25] [c40] [c39] [c37] [c36] [i24] [i23] [i22] [c34] [c33] [c31] [c27]
M. S. Ramanujan 0001
aka: Ramanujan Sridharan
aka: Ramanujan Sridharan
[j40] [j39] [c87] [c86] [d1] [i51] [i50] [j34] [j33] [c81] [c80] [c79] [c76] [i43] [i42] [c72] [c71] [c70] [i40] [c64] [c63] [c59] [c58] [j18] [c53] [c52] [i33] [i32] [i31] [c47] [i29] [j15] [c38] [c35] [p1] [j13] [c26] [j7] [j6] [i18] [c21] [i17] [i16] [j5] [j4] [c17] [c14] [c13] [c12] [i12] [i10] [j3] [c11] [c10] [c9] [i9] [i8] [i7] [i6] [i5] [j2] [c7] [c6] [i4] [i3] [i2] [c5] [c4] [c3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
