| Parameterized algorithms for modular-width J Gajarský, M Lampis, S Ordyniak Parameterized and Exact Computation: 8th International Symposium, IPEC 2013 …, 2013 | 116 | 2013 |
| 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 | 77 | 2017 |
| Augmenting tractable fragments of abstract argumentation W Dvořák, S Ordyniak, S Szeider Artificial Intelligence 186, 157-173, 2012 | 63 | 2012 |
| Digraph decompositions and monotonicity in digraph searching S Kreutzer, S Ordyniak Theoretical Computer Science 412 (35), 4688-4703, 2011 | 62 | 2011 |
| The complexity landscape of decompositional parameters for ILP R Ganian, S Ordyniak Artificial Intelligence 257, 61-71, 2018 | 61 | 2018 |
| Satisfiability of acyclic and almost acyclic CNF formulas S Ordyniak, D Paulusma, S Szeider Theoretical Computer Science 481, 85-99, 2013 | 60 | 2013 |
| On structural parameterizations of the bounded-degree vertex deletion problem R Ganian, F Klute, S Ordyniak Algorithmica 83, 297-336, 2021 | 54 | 2021 |
| 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 | 53 | 2015 |
| Parameterized complexity results for exact Bayesian network structure learning S Ordyniak, S Szeider Journal of Artificial Intelligence Research 46, 263-302, 2013 | 47 | 2013 |
| 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 | 41 | 2017 |
| Going beyond primal treewidth for (M) ILP R Ganian, S Ordyniak, M Ramanujan Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 36 | 2017 |
| Parameterized algorithms for the matrix completion problem R Ganian, I Kanj, S Ordyniak, S Szeider International Conference on Machine Learning, 1656-1665, 2018 | 32 | 2018 |
| 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 | 32 | 2017 |
| 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 | 30 | 2019 |
| 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), 486-492, 2012 | 29 | 2012 |
| 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), 1735-1741, 2012 | 28 | 2012 |
| Towards a polynomial kernel for directed feedback vertex set B Bergougnoux, E Eiben, R Ganian, S Ordyniak, MS Ramanujan Algorithmica 83, 1201-1221, 2021 | 26 | 2021 |
| The power of cut-based parameters for computing edge-disjoint paths R Ganian, S Ordyniak Algorithmica 83 (2), 726-752, 2021 | 24 | 2021 |
| SAT-encodings for special treewidth and pathwidth N Lodha, S Ordyniak, S Szeider Theory and Applications of Satisfiability Testing–SAT 2017: 20th …, 2017 | 24 | 2017 |
| A SAT approach to branchwidth N Lodha, S Ordyniak, S Szeider Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016 | 24 | 2016 |
