Items where authors include "Ordyniak, S."

Article

Bulteau, L., Dabrowski, K.K., Köhler, N. orcid.org/0000-0002-1023-6530 et al. (2 more authors) (2024) An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM Journal on Discrete Mathematics, 38 (2). pp. 1315-1350. ISSN 0895-4801

Dreier, J., Ordyniak, S. orcid.org/0000-0003-1935-651X and Szeider, S. (2024) SAT Backdoors: Depth Beats Size. Journal of Computer and System Sciences, 142. 103520. ISSN 0022-0000

Bulteau, L., Dabrowski, K.K., Kohler, N. et al. (2 more authors) (2023) An Algorithmic Framework for Locally Contrainted Homomorphisms. SIAM Journal on Discrete Mathematics. ISSN 0895-4801 (In Press)

Dreier, J., Ordyniak, S. orcid.org/0000-0003-1935-651X and Szeider, S. (2023) CSP Beyond Tractable Constraint Languages. Constraints, 28 (3). pp. 450-471. ISSN 1383-7133

Dvořák, P., Eiben, E., Ganian, R. et al. (2 more authors) (2021) The complexity landscape of decompositional parameters for ILP : programs with few global variables and constraints. Artificial Intelligence, 300. 103561. ISSN 0004-3702

Ganian, R., Klute, F. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2021) On structural parameterizations of the bounded-degree vertex deletion problem. Algorithmica, 83 (1). pp. 297-336. ISSN 0178-4617

Eiben, E., Ganian, R. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2020) Using decomposition-parameters for QBF: Mind the prefix! Journal of Computer and System Sciences, 110. pp. 1-21. ISSN 0022-0000

Ganian, R. and Ordyniak, S. orcid.org/0000-0003-1935-651X (2019) Solving integer linear programs by exploiting variable-constraint interactions : a survey. Algorithms, 12 (12). 248. ISSN 1999-4893

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

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, 81 (6). pp. 2606-2632. ISSN 0178-4617

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. 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

Eiben, E., Ganian, R., Kanj, I. et al. (2 more authors) (2023) From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. In: Dagstuhl Reports. 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), 06-08 Sep 2023, Amsterdam, Netherlands. Leibniz International Proceedings in Informatics (LIPIcs), 285 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern, Merzig-Wadern, Saarland , 16:1-16:14. ISBN 978-3-95977-305-8

Ordyniak, S. orcid.org/0000-0003-1935-651X, Dabrowski, K., Jonsson, P. et al. (3 more authors) (2023) Parameterized Complexity Classification for Interval Constraints. In: Dagstuhl Reports. IPEC 2023: International Symposium on Parameterized and Exact Computation, 06-08 Sep 2023, Amsterdam, Netherlands. Leibniz International Proceedings in Informatics (LIPIcs), 285 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern, Merzig-Wadern, Saarland , 11:1-11:19. ISBN 978-3-95977-305-8

Ordyniak, S. orcid.org/0000-0003-1935-651X, Bodlaender, H., Bonnet, É et al. (6 more authors) (2023) Treewidth is NP-Complete on Cubic Graphs. In: Dagstuhl Reports. IPEC 2023: International Symposium on Parameterized and Exact Computation, 06-08 Sep 2023, Amsterdam, Netherlands. Leibniz International Proceedings in Informatics (LIPIcs), 285 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern, Merzig-Wadern, Saarland , 7:1-7:13. ISBN 978-3-95977-305-8

Ordyniak, S. orcid.org/0000-0003-1935-651X, Paesani, G., Rychlicki, M. et al. (1 more author) (2023) A General Theoretical Framework for Learning Smallest Interpretable Models. In: Proceedings of the AAAI Conference on Artificial Intelligence. Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI-24), 20-27 Feb 2024, Vancouver, Canada. AAAI Press . (In Press)

Dabrowski, K.K., Eiben, E., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2023) Learning Small Decision Trees for Data of Low Rank-Width. In: Proceedings of the AAAI Conference on Artificial Intelligence. Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI-24), 20-27 Feb 2024, Vancouver, Canada. AAAI Press . (In Press)

Gutin, G., Majumdar, D., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (1 more author) (2020) Parameterized pre-coloring extension and list coloring problems. In: Paul, C. and Bläser, M., (eds.) Leibniz International Proceedings in Informatics, LIPIcs. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 10-13 Mar 2020, Montpellier, France. Leibniz International Proceedings in Informatics (LIPIcs) (154). Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 9783959771405

Ganian, R., Ordyniak, S. orcid.org/0000-0003-1935-651X and Szeider, S. (2019) A join-based hybrid parameter for constraint satisfaction. In: Schiex, T. and de Givry, S., (eds.) Principles and Practice of Constraint Programming. 25th International Conference, CP 2019, 30 Sep - 04 Oct 2019, Stamford, CT, USA. Springer , pp. 195-212. ISBN 9783030300470

Eiben, E., Ganian, R., Knop, D. et al. (1 more author) (2019) Solving integer quadratic programming via explicit and structural restrictions. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence. Thirty-Third AAAI Conference on Artificial Intelligence, 27 Jan - 01 Feb 2019, Honolulu, Hawaii, USA. Association for the Advancement of Artificial Intelligence (AAAI) , pp. 1477-1484. ISBN 9781577358091

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