Items where authors include "Eiben, E"

Article

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

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

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

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.

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

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

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

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

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