Sebastian Ordyniak
Sebastian Ordyniak
E-mailová adresa ověřena na: sheffield.ac.uk
Název
Citace
Citace
Rok
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
622017
Parameterized algorithms for modular-width
J Gajarský, M Lampis, S Ordyniak
International Symposium on Parameterized and Exact Computation, 163-176, 2013
622013
Satisfiability of acyclic and almost acyclic CNF formulas
S Ordyniak, D Paulusma, S Szeider
Theoretical Computer Science 481, 85-99, 2013
532013
Augmenting tractable fragments of abstract argumentation
W Dvořák, S Ordyniak, S Szeider
Artificial Intelligence 186, 157-173, 2012
532012
Digraph decompositions and monotonicity in digraph searching
S Kreutzer, S Ordyniak
International Workshop on Graph-Theoretic Concepts in Computer Science, 336-347, 2008
402008
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
352015
The complexity landscape of decompositional parameters for ILP
R Ganian, S Ordyniak
Artificial Intelligence 257, 61-71, 2018
342018
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
262017
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, M Ramanujan
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
252017
Parameterized complexity results for exact Bayesian network structure learning
S Ordyniak, S Szeider
Journal of Artificial Intelligence Research 46, 263-302, 2013
242013
The complexity of planning revisited—a parameterized analysis
C Bäckström, Y Chen, P Jonsson, S Ordyniak, S Szeider
Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012
242012
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
Digraph decompositions and monotonicity in digraph searching
S Kreutzer, S Ordyniak
Theoretical Computer Science 412 (35), 4688-4703, 2011
222011
Algorithms and complexity results for persuasive argumentation
EJ Kim, S Ordyniak, S Szeider
Artificial Intelligence 175 (9-10), 1722-1736, 2011
222011
Solving integer linear programs with a small number of global variables and constraints
P Dvořák, E Eiben, R Ganian, D Knop, S Ordyniak
arXiv preprint arXiv:1706.06084, 2017
202017
Backdoors to q-Horn
S Gaspers, S Ordyniak, MS Ramanujan, S Saurabh, S Szeider
Algorithmica 74 (1), 540-557, 2016
192016
Algorithms and complexity results for exact Bayesian structure learning
S Ordyniak, S Szeider
arXiv preprint arXiv:1203.3501, 2012
192012
On structural parameterizations of the bounded-degree vertex deletion problem
R Ganian, F Klute, S Ordyniak
Algorithmica 83 (1), 297-336, 2021
182021
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
162019
Backdoors to planning
M Kronegger, S Ordyniak, A Pfandler
Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
16*2014
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20