Items where authors include "Ordyniak, S"
Up a levelArticle
Ganian, R, Ordyniak, S orcid.org/0000-0003-1935-651X and Rahul, CS (2023) Group Activity Selection with Few Agent Types. Algorithmica, 85. pp. 1111-1155. ISSN 0178-4617
Dabrowski, KK orcid.org/0000-0001-9515-6945, Jonsson, P, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2023) Solving infinite-domain CSPs using the patchwork property. Artificial Intelligence, 317. 103880. ISSN 0004-3702
Eiben, E, Ganian, R, Hamm, T et al. (1 more author) (2023) Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. Artificial Intelligence, 315. 103826. ISSN 0004-3702
Jonsson, P, Lagerkvist, V and Ordyniak, S orcid.org/0000-0003-1935-651X (2022) Computational Short Cuts in Infinite Domain Constraint Satisfaction. Journal of Artificial Intelligence Research, 75. pp. 793-831. ISSN 1076-9757
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, Ordyniak, S orcid.org/0000-0003-1935-651X and Ramanujan, MS (2021) On Structural Parameterizations of the Edge Disjoint Paths Problem. Algorithmica, 83 (6). pp. 1605-1637. ISSN 0178-4617
Bergougnoux, B, Eiben, E, Ganian, R et al. (2 more authors) (2021) Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica, 83. pp. 1201-1221. ISSN 0178-4617
Gutin, G, Majumdar, D, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2021) Parameterized Pre-Coloring Extension and List Coloring Problems. SIAM Journal on Discrete Mathematics, 35 (1). pp. 575-596. ISSN 0895-4801
Ganian, R and Ordyniak, S orcid.org/0000-0003-1935-651X (2021) The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths. Algorithmica, 83. pp. 726-752. ISSN 0178-4617
Backstrom, C, Jonsson, P and Ordyniak, S orcid.org/0000-0003-1935-651X (2021) Cost-Optimal Planning, Delete Relaxation, Approximability, and Heuristics. Journal of Artificial Intelligence Research, 70. pp. 169-204. ISSN 1076-9757
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
Ganian, R, Narayanaswamy, NS, 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
Eiben, E, 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
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
Proceedings Paper
Eiben, E orcid.org/0000-0003-1935-651X, Ganian, R, Kanj, I et al. (2 more authors) (2023) The Computational Complexity of Concise Hypersphere Classification. In: Proceedings of Machine Learning Research. ICML 2023 Fortieth International Conference on Machine Learning, 23-29 Jul 2023, Honolulu, Hawai. Proceedings of the 40th International Conference on Machine Learning, 202 . PMLR , pp. 9060-9070.
Eiben, E, Ordyniak, S orcid.org/0000-0003-1935-651X, Paesani, G et al. (1 more author) (2023) Learning Small Decision Trees with Large Domain. In: Elkind, E, (ed.) Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. IJCAI 2023, The 32nd International Joint Conference On Artificial Intelligence, 19-25 Aug 2023, Macau, S.A.R.. International Joint Conferences on Artificial Intelligence , pp. 3184-3192. ISBN 978-1-956792-03-4
Fichte, JK, Ganian, R, Hecher, M et al. (2 more authors) (2023) Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. In: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 26-29 Jun 2023, Boston, USA. IEEE . ISBN 979-8-3503-3587-3
Ordyniak, S orcid.org/0000-0003-1935-651X, Paesani, G and Szeider, S (2023) The Parameterized Complexity of Finding Concise Local Explanations. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. IJCAI 2023, The 32nd International Joint Conference On Artificial Intelligence, 19-25 Aug 2023, Macau, China. International Joint Conferences on Artificial Intelligence , pp. 3312-3320. ISBN 978-1-956792-03-4
Dabrowski, KK, Jonsson, P, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (2 more authors) (2023) Almost Consistent Systems of Linear Equations. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Symposium of Discrete Algorithms (SODA), 22-25 Jan 2023, Florence, Italy. SIAM . ISBN 978-1-61197-755-4
Bulteau, L, Dabrowski, KK orcid.org/0000-0001-9515-6945, Köhler, N et al. (2 more authors) (2022) An Algorithmic Framework for Locally Constrained Homomorphisms. In: Lecture Notes in Computer Science. 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022), 22-24 Jun 2022, Tuebingen, Germany. Springer Nature , pp. 114-128.
Eiben, E, Ganian, R, Kanj, I et al. (2 more authors) (2022) Finding a Cluster in Incomplete Data. In: Chechik, S, Navarro, G, Rotenberg, E and Herman, G, (eds.) Proceedings of 30th Annual European Symposium on Algorithms (ESA 2022). 30th Annual European Symposium on Algorithms (ESA 2022), 05-07 Sep 2022, Postdam, Germany. Leibniz International Proceedings in Informatics (LIPIcs), 244 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 47:1-47:14. ISBN 978-3-95977-247-1
Dreier, J, Ordyniak, S orcid.org/0000-0003-1935-651X and Szeider, S (2022) SAT Backdoors: Depth Beats Size. In: LIPIcs : Leibniz International Proceedings in Informatics. 30th Annual European Symposium on Algorithms (ESA 2022), 05-07 Sep 2022, Postdam, Germany. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 46:1-46:18.
Dreier, J, Ordyniak, S orcid.org/0000-0003-1935-651X and Szeider, S (2022) CSP Beyond Tractable Constraint Languages. In: Solnon, C, (ed.) Proceedings of 28th International Conference on Principles and Practice of Constraint Programming (CP 2022). 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), 31 Jul - 05 Aug 2022, Haifa, Israel. Leibniz International Proceedings in Informatics (LIPIcs), 235 . Schloss Dagstuhl , 20:1-20:17. ISBN 978-3-95977-240-2
Dabrowski, KK, Jonsson, P, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2022) Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. In: Proceedings of the 36th AAAI Conference on Artificial Intelligence: AAAI-22 Technical Tracks 4. Thirty-Sixth AAAI Conference on Artificial Intelligence, 22 Feb - 01 Mar 2022, Virtual. AAAI Press , Palo Alto, California USA , pp. 3724-3732. ISBN 978-1-57735-876-3
Deligkas, A, Eiben, E, Ganian, R et al. (2 more authors) (2022) The Complexity of Envy-Free Graph Cutting. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence. The 31st International Joint Conference on Artificial Intelligence, 23-29 Jul 2022, Vienna, Austria. International Joint Conferences on Artificial Intelligence , pp. 237-243. ISBN 978-0-9992411-9-6
Jonsson, P, Lagerkvist, V and Ordyniak, S orcid.org/0000-0003-1935-651X (2021) Reasoning short cuts in infinite domain constraint satisfaction: Algorithms and lower bounds for backdoors. In: Leibniz International Proceedings in Informatics, LIPIcs. The Twenty-Seventh Conference on Principles and Practice of Constraint Programming (CP 2021, 25-29 Oct 2021, Montpellier, France. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 9783959772112
Ganian, R, Hamm, T and Ordyniak, S orcid.org/0000-0003-1935-651X (2021) The Complexity of Object Association in Multiple Object Tracking. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence. Thirty-Fifth {AAAI} Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual. . ISBN 978-1-57735-866-4
Dabrowski, K, Jonsson, P, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2021) Disjunctive Temporal Problems under Structural Restrictions. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence. Thirty-Fifth AAAI Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual. , pp. 3724-3732. ISBN 978-1-57735-866-4
Brand, C, Koutecky, M and Ordyniak, S orcid.org/0000-0003-1935-651X (2021) Parameterized Algorithms for MILPs with Small Treedepth. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence: AAAI-21 Technical Tracks 14. Thirty-Fifth AAAI Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual. , pp. 12249-12257. ISBN 978-1-57735-866-4
Eiben, E, Ganian, R, Kanj, I et al. (2 more authors) (2021) The Parameterized Complexity of Clustering Incomplete Data. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence: AAAI-21 Technical Tracks 8. Thirty-Fifth AAAI Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual Event. , pp. 7296-7304. ISBN 978-1-57735-866-4
Ordyniak, S orcid.org/0000-0003-1935-651X and Szeider, S (2021) Parameterized Complexity of Small Decision Tree Learning. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence - AAAI-21 Technical Tracks 7. Thirty-Fifth AAAI Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual. , pp. 6454-6462. ISBN 978-1-57735-866-4
Dabrowski, K, Jonsson, P, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2021) Solving Infinite-Domain CSPs Using the Patchwork Property. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence. Thirty-Fifth AAAI Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual. , pp. 3715-3723. ISBN 978-1-57735-866-4
Dabrowski, KK orcid.org/0000-0001-9515-6945, Jonsson, P, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2020) Fine-grained complexity of temporal problems. In: Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning. 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 12-18 Sep 2020, Rhodes, Greece. IJCAI Organization , pp. 284-293. ISBN 9781713825982
Ganian, R, Kanj, I, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2020) On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. In: AAAI-20 Technical Tracks 4. The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20), 07-12 Feb 2020, New York, New York, USA. , pp. 3906-3913. ISBN 978-1-57735-835-0
Eiben, E, Ganian, R, Hamm, T et al. (1 more author) (2020) Parameterized complexity of envy-free resource allocation in social networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. Thirty-Fourth AAAI Conference on Artificial Intelligence, 07-12 Feb 2020, New York, New York, USA. , pp. 7135-7142. ISBN 9781577358350
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: 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 10-13 Mar 2020, Montpellier, France. . ISBN 978-3-95977-140-5
Ganian, R, Ordyniak, S orcid.org/0000-0003-1935-651X and Szeider, S (2019) A Join-Based Hybrid Parameter for Constraint Satisfaction. In: Lecture Notes in Computer Science. CP 2019: Principles and Practice of Constraint Programming, 30 Sep - 04 Oct 2019, Stamford, CT, USA. Springer Verlag , pp. 195-212. ISBN 978-3-030-30047-0
Ganian, R and Ordyniak, S orcid.org/0000-0003-1935-651X (2019) The Power of Cut-Based Parameters for Computing Edge Disjoint Paths. In: Lecture Notes in Computer Science. WG 2019: Graph-Theoretic Concepts in Computer Science, 19-21 Jun 2019, Vall de Núria, Spain. Springer Verlag , pp. 190-204. ISBN 9783030307851
Ganian, R, Ordyniak, S orcid.org/0000-0003-1935-651X and Rahul, CS (2019) Group Activity Selection with Few Agent Types. In: LIPIcs : Leibniz International Proceedings in Informatics. 27th Annual European Symposium on Algorithms (ESA 2019), 09-11 Sep 2019, Munich/Garching, Germany. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , 48:1-48:16.
Bäckström, C, Jonsson, P and Ordyniak, S orcid.org/0000-0003-1935-651X (2019) A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs. In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence. Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}, 10-16 Aug 2019, Macao, P.R. China. International Joint Conferences on Artificial Intelligence Organization , pp. 6126-6130. ISBN 9780999241141
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 AAAI Conference on Artificial Intelligence. The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), 27 Jan - 01 Feb 2019, Honolulu, Hawaii USA. PKP Publishing Services Network , pp. 1477-1484.
Eiben, E, Ganian, R, Knop, D et al. (3 more authors) (2019) Integer Programming and Incidence Treedepth. In: Lecture Notes in Computer Science. IPCO 2019: Integer Programming and Combinatorial Optimization, 22-24 May 2019, Ann Arbor, MI, USA. Springer Verlag , pp. 194-204. ISBN 9783030179526
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: 2019 Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX). ALENEX19, 07-08 Jan 2019, San Diego, California, USA. Society for Industrial and Applied Mathematics , pp. 117-129. ISBN 978-1-61197-549-9