Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 14.

Article

Lodha, N., Ordyniak, S. orcid.org/0000-0003-1935-651X and Szeider, S. (2019) A SAT approach to branchwidth. ACM Transactions on Computational Logic, 20 (3). 15. ISSN 1529-3785

Kronegger, M., Ordyniak, S. orcid.org/0000-0003-1935-651X and Pfandler, A. (2019) Backdoors to planning. Artificial Intelligence, 269. pp. 49-75. ISSN 0004-3702

Eiben, E. orcid.org/0000-0003-2628-3435, Ganian, R., Kangas, K. et al. (1 more author) (2019) Counting linear extensions: Parameterizations by treewidth. Algorithmica, 81 (4). pp. 1657-1683. ISSN 0178-4617

Meier, A., Ordyniak, S. orcid.org/0000-0003-1935-651X, Ramanujan, M.S. et al. (1 more author) (2019) Backdoors for Linear Temporal Logic. Algorithmica, 81 (2). pp. 476-496. ISSN 0178-4617

Ganian, R., Narayanaswamy, N.S., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2019) On the complexity landscape of connected f-factor problems. Algorithmica. ISSN 0178-4617

Ganian, R. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2018) The complexity landscape of decompositional parameters for ILP. Artificial Intelligence, 257. pp. 61-71. ISSN 0004-3702

Gaspers, S., Misra, N., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2017) Backdoors into heterogeneous classes of SAT and CSP. Journal of Computer and System Sciences, 85. pp. 38-56. ISSN 0022-0000

Gajarsky, J., Hlineny, P., Obdrzalek, J. et al. (5 more authors) (2017) Kernelization using structural parameters on sparse graph classes. Journal of Computer and System Sciences, 84. pp. 219-242. ISSN 0022-0000

Ordyniak, S. orcid.org/0000-0003-1935-651X and Popa, A. (2016) A Parameterized Study of Maximum Generalized Pattern Matching Problems. Algorithmica, 75 (1). pp. 1-26. ISSN 0178-4617

Proceedings Paper

Ganian, R., Lodha, N., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (1 more author) (2019) SAT-encodings for treecut width and treedepth. In: Kobourov, S. and Meyerhenke, H., (eds.) 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX), 07-08 Jan 2019, San Diego, California, USA. Society for Industrial and Applied Mathematics , pp. 117-129. ISBN 978-1-61197-549-9

Ganian, R., Kanj, I.A., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (1 more author) (2018) Parameterized Algorithms for the Matrix Completion Problem. In: Dy, J.G. and Krause, A., (eds.) Proceedings of Machine Learning Research. International Conference on Machine Learning, 10-15 Jul 2018, Stockholmsmässan, Stockholm Sweden. Proceedings of Machine Learning Research , pp. 1642-1651.

Bäckström, C., Jonsson, P. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2018) Novel Structural Parameters for Acyclic Planning Using Tree Embeddings. In: Lang, J., (ed.) International Joint Conferences on Artificial Intelligence Organization. International Joint Conferences on Artificial Intelligence Organization 2018, 13-19 Jul 2018, Stockholm. IJCAI , pp. 4653-4659. ISBN 978-0-9992411-2-7

Eiben, E., Ganian, R. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2018) A Structural Approach to Activity Selection. In: Lang, J., (ed.) International Joint Conferences on Artificial Intelligence Organization. International Joint Conferences on Artificial Intelligence Organization 2018, 13-19 Jul 2018, Stockholm. IJCAI , pp. 203-209. ISBN 978-0-9992411-2-7

Eiben, E., Ganian, R., Knop, D. et al. (1 more author) (2018) Unary Integer Linear Programming with Structural Restrictions. In: Lang, J., (ed.) International Joint Conferences on Artificial Intelligence Organization (IJCAI). International Joint Conferences on Artificial Intelligence Organization , 13-19 Jul 2018, Stockholm. IJCAI , pp. 1284-1290. ISBN 978-0-9992411-2-7

This list was generated on Mon Jul 22 02:23:16 2019 BST.