Fionn Mc Inerney
Researcher at Telefónica
Bio
(10/2024 - present) Researcher in the Systems AI Lab (SAIL) at Telefónica, Barcelona, Spain.
(05/2023 - 09/2024) Postdoctoral researcher in the Algorithms and Complexity Group at TU Wien, Austria. Supervised by Robert Ganian.
(02/2023 - 04/2023) Postdoctoral researcher in team ACRO of the LIS, Aix-Marseille University, France. Supervised by Victor Chepoi.
(02/2021 - 01/2023) Postdoctoral researcher at the CISPA Helmholtz Center for Information Security, Saarbrücken, Germany. Supervised by Dániel Marx.
(01/2020 - 12/2020) Postdoctoral researcher in team ACRO of the LIS, Aix-Marseille University, France. Supervised by Victor Chepoi.
(07/2019 - 12/2019) Postdoctoral researcher in team GOAL of the LIRIS, University Lyon 1, France. Supervised by Eric Duchêne.
(10/2016 - 07/2019) PhD student at Côte d'Azur University in team COATI of I3S/Inria Sophia Antipolis, France. Supervised by Nicolas Nisse.
Selected Publications
My publications consist of 25 journals and 18 conferences. In each, the authors are listed in alphabetical order.
R. Ganian, L. Khazaliya, F. Mc Inerney, M. Rocton. The Computational Complexity of Positive Non-Clashing Teaching in Graphs. In Proceedings of the 13th International Conference on Learning Representations (ICLR 2025), 2025.
R. Ganian, F. Mc Inerney, and D. Tsigkari. Parameterized Complexity of Caching in Networks. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI 2025), 2025.
J. Chalopin, V. Chepoi, F. Mc Inerney, and S. Ratel. Non-Clashing Teaching Maps for Balls in Graphs. In Proceedings of the 37th Annual Conference on Learning Theory (COLT 2024), PMLR, 247:840-875, 2024.
F. Foucaud, E. Galby, L. Khazaliya, S. Li, F. Mc Inerney, R. Sharma, and P. Tale. Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex Cover. In Proceedings of the 51st International Colloquium on Automata, Languages and Programming (ICALP 2024), LIPIcs 297, Schloss Dagstuhl, 66:1-66:19, 2024.
C. Brand, R. Ganian, S. Kalyanasundaram, and F. Mc Inerney. The Complexity of Optimizing Atomic Congestion. In Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024), 38(18): 20044-20052, 2024.
J. Focke, D. Marx, F. Mc Inerney, D. Neuen, G. S. Sankar, P. Schepper, and P. Wellnitz. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), 3664-3683, 2023.
Grants
Consortium member of the French National Research Agency project ANR PARADUAL (€242 000, 2025-2029).
Contact Information
fmcinern(at)gmail(dot)com