Sebastian Ordyniak
Sebastian Ordyniak
Verified email at sheffield.ac.uk
Title
Cited by
Cited by
Year
Quantitative graph theory
M Dehmer, V Kraus, F Emmert-Streib, S Pickl
CRC press, 2014
702014
Algorithmic meta-theorems
S Kreutzer
International Workshop on Parameterized and Exact Computation, 10-12, 2008
632008
Parameterized algorithms for modular-width
J Gajarský, M Lampis, S Ordyniak
International Symposium on Parameterized and Exact Computation, 163-176, 2013
622013
Kernelization using structural parameters on sparse graph classes
J Gajarský, P Hliněný, J Obdržálek, S Ordyniak, F Reidl, P Rossmanith, ...
Journal of Computer and System Sciences 84, 219-242, 2017
612017
Augmenting tractable fragments of abstract argumentation
W Dvořák, S Ordyniak, S Szeider
Artificial Intelligence 186, 157-173, 2012
522012
Satisfiability of acyclic and almost acyclic CNF formulas
S Ordyniak, D Paulusma, S Szeider
Theoretical Computer Science 481, 85-99, 2013
502013
Digraph decompositions and monotonicity in digraph searching
S Kreutzer, S Ordyniak
International Workshop on Graph-Theoretic Concepts in Computer Science, 336-347, 2008
392008
The complexity landscape of decompositional parameters for ILP
R Ganian, S Ordyniak
Artificial Intelligence 257, 61-71, 2018
312018
FO model checking on posets of bounded width
J Gajarský, P Hlinený, D Lokshtanov, J Obdralek, S Ordyniak, ...
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 963-974, 2015
312015
The complexity of planning revisited—a parameterized analysis
C Bäckström, Y Chen, P Jonsson, S Ordyniak, S Szeider
Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 2012
252012
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, M Ramanujan
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
232017
Backdoors into heterogeneous classes of SAT and CSP
S Gaspers, N Misra, S Ordyniak, S Szeider, S Živný
Journal of Computer and System Sciences 85, 38-56, 2017
222017
Parameterized complexity results for exact Bayesian network structure learning
S Ordyniak, S Szeider
Journal of Artificial Intelligence Research 46, 263-302, 2013
222013
Don't be strict in local search!
S Gaspers, EJ Kim, S Ordyniak, S Saurabh, S Szeider
Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 2012
222012
Algorithms and complexity results for persuasive argumentation
EJ Kim, S Ordyniak, S Szeider
Artificial Intelligence 175 (9-10), 1722-1736, 2011
222011
Digraph decompositions and monotonicity in digraph searching
S Kreutzer, S Ordyniak
Theoretical Computer Science 412 (35), 4688-4703, 2011
212011
Algorithms and complexity results for exact Bayesian structure learning
S Ordyniak, S Szeider
arXiv preprint arXiv:1203.3501, 2012
192012
Extensive-form perfect equilibrium computation in two-player games
G Farina, N Gatti
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
182017
Backdoors to q-Horn
S Gaspers, S Ordyniak, MS Ramanujan, S Saurabh, S Szeider
Algorithmica 74 (1), 540-557, 2016
182016
SAT-encodings for treecut width and treedepth
R Ganian, N Lodha, S Ordyniak, S Szeider
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019
172019
The system can't perform the operation now. Try again later.
Articles 1–20