Items where authors include "Ganian, R"

Article

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

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

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

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

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

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.

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

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

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

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

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

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

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.

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