Fionn Mc Inerney

Recent Publications

Makespan Minimization in Split Learning: From Theory to Practice
IEEE INFOCOM 2026 - IEEE Conference on Computer Communications, Tokyo, Japan, May 18-21, 2026, pages 1–10, 2026, IEEE.
A Structural Complexity Analysis of Hierarchical Task Network Planning
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2025, Montreal, Canada, August 16-22, 2025, pages 4391–4400, 2025, ijcai.org.
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025, Jena, Germany, March 4-7, 2025 (Olaf Beyersdorff and Michal Pilipczuk and Elaine Pimentel and Kim Thang Nguyen), pages 33:1–33:20, 2025, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Parameterized Complexity of Caching in Networks
AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25 - March 4, 2025, Philadelphia, PA, USA (Toby Walsh and Julie Shah and Zico Kolter), pages 11229–11237, 2025, AAAI Press.
The Computational Complexity of Positive Non-Clashing Teaching in Graphs
The Thirteenth International Conference on Learning Representations, ICLR 2025, Singapore, April 24-28, 2025, 2025, OpenReview.net.
Enumerating Minimal Solution Sets for Metric Graph Problems
Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers (Daniel Král and Martin Milanic), volume 14760 of Lecture Notes in Computer Science, pages 50–64, 2024, Springer.
Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension
Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings (Adele Anna Rescigno and Ugo Vaccaro), volume 14764 of Lecture Notes in Computer Science, pages 111–125, 2024, Springer.
Non-Clashing Teaching Maps for Balls in Graphs
The Thirty Seventh Annual Conference on Learning Theory, June 30 - July 3, 2023, Edmonton, Canada (Shipra Agrawal and Aaron Roth), volume 247 of Proceedings of Machine Learning Research, pages 840–875, 2024, PMLR.
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia (Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson), volume 297 of LIPIcs, pages 66:1–66:19, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.