Fionn Mc Inerney

66 papers A* 7A 1B 6C 4Journal 47
YearRankTypeTitle / Venue / Authors
2026 J jnl
Makespan Minimization in Split Learning: From Theory to Practice.
CoRR
Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari
2026 J jnl
Non-Clashing Teaching in Graphs: Algorithms, Complexity, and Bounds.
CoRR
Sujoy Bhore, Liana Khazaliya, Fionn Mc Inerney
2025 A* conf
A Structural Complexity Analysis of Hierarchical Task Network Planning.
IJCAI
Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger
2025 J jnl
Complexity of Maker-Breaker games on edge sets of graphs.
Discret. Appl. Math.
Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic
2025 J jnl
Enumerating Minimal Solution Sets for Metric Graph Problems.
Algorithmica
Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2025 A conf
Metric Dimension and Geodetic Set Parameterized by Vertex Cover.
STACS
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2025 A* conf
Parameterized Complexity of Caching in Networks.
AAAI
Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari
2025 A* conf
The Computational Complexity of Positive Non-Clashing Teaching in Graphs.
ICLR
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
2025 J jnl
The Computational Complexity of Positive Non-Clashing Teaching in Graphs.
CoRR
Robert Ganian, Liana Khazaliya, Fionn Mc Inerney, Mathis Rocton
2025 J jnl
The Parameterized Complexity of Computing the VC-Dimension.
CoRR
Florent Foucaud, Harmender Gahlawat, Fionn Mc Inerney, Prafullkumar Tale
2025 J jnl
The complexity of optimizing atomic congestion.
Artif. Intell.
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2025 J jnl
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results.
ACM Trans. Algorithms
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2025 J jnl
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.
ACM Trans. Comput. Theory
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2024 B conf
Enumerating Minimal Solution Sets for Metric Graph Problems.
WG
Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2024 C conf
Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension.
IWOCA
Valentin Bartier, Oscar Defrain, Fionn Mc Inerney
2024 J jnl
Metric Dimension and Geodetic Set Parameterized by Vertex Cover.
CoRR
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024 A* conf
Non-Clashing Teaching Maps for Balls in Graphs.
COLT
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel
2024 J jnl
Parameterized Complexity of Caching in Networks.
CoRR
Robert Ganian, Fionn Mc Inerney, Dimitra Tsigkari
2024 A* conf
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.
ICALP
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024 J jnl
Smash and grab: The 0 ⋅ 6 scoring game on graphs.
Theor. Comput. Sci.
Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney, Mehdi Mhalla, Aline Parreau
2024 J jnl
The Boundaries of Tractability in Hierarchical Task Network Planning.
CoRR
Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger
2024 A* conf
The Complexity of Optimizing Atomic Congestion.
AAAI
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2023 J jnl
Complexity of Maker-Breaker Games on Edge Sets of Graphs.
CoRR
Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic
2023 J jnl
Enumerating minimal solution sets for metric graph problems.
CoRR
Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2023 J jnl
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
SIAM J. Discret. Math.
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2023 J jnl
Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree.
CoRR
Valentin Bartier, Oscar Defrain, Fionn Mc Inerney
2023 J jnl
Non-Clashing Teaching Maps for Balls in Graphs.
CoRR
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel
2023 J jnl
Sample Compression Schemes for Balls in Graphs.
SIAM J. Discret. Math.
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
2023 J jnl
The Complexity of Optimizing Atomic Congestion.
CoRR
Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney
2023 J jnl
The Complexity of Two Colouring Games.
Algorithmica
Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
2023 J jnl
The Maker-Breaker Largest Connected Subgraph game.
Theor. Comput. Sci.
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid
2023 J jnl
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.
CoRR
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2023 J jnl
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results.
CoRR
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2023 A* conf
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.
SODA
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2022 B conf
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
MFCS
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022 J jnl
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
CoRR
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022 J jnl
Metric dimension: From graphs to oriented graphs.
Discret. Appl. Math.
Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse
2022 J jnl
On a vertex-capturing game.
Theor. Comput. Sci.
Julien Bensmail, Fionn Mc Inerney
2022 J jnl
On {a, b}-edge-weightings of bipartite graphs with odd a, b.
Discuss. Math. Graph Theory
Julien Bensmail, Fionn Mc Inerney, Kasper Szabo Lyngsie
2022 B conf
Sample Compression Schemes for Balls in Graphs.
MFCS
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
2022 J jnl
Sample compression schemes for balls in graphs.
CoRR
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
2022 J jnl
The Largest Connected Subgraph Game.
Algorithmica
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
2022 J jnl
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results.
CoRR
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz
2021 J jnl
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.
Algorithmica
Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
2021 J jnl
Further results on an equitable 1-2-3 Conjecture.
Discret. Appl. Math.
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
2021 J jnl
On Generalisations of the AVD Conjecture to Digraphs.
Graphs Comb.
Julien Bensmail, Fionn Mc Inerney
2021 C conf
On the Role of 3's for the 1-2-3 Conjecture.
CIAC
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
2021 J jnl
On the role of 3s for the 1-2-3 Conjecture.
Theor. Comput. Sci.
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney
2021 B conf
The Largest Connected Subgraph Game.
WG
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse
2021 J jnl
The game of Cops and Eternal Robbers.
Theor. Comput. Sci.
Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, Fionn Mc Inerney
2021 J jnl
Weighted total acquisition.
Discret. Appl. Math.
Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney
2020 J jnl
A method for eternally dominating strong grids.
CoRR
Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile
2020 J jnl
A method for eternally dominating strong grids.
Discret. Math. Theor. Comput. Sci.
Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile
2020 J jnl
Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325].
Theor. Comput. Sci.
Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
2020 J jnl
Sequential Metric Dimension.
Algorithmica
Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
2020 J jnl
Study of a Combinatorial Game in Graphs Through Linear Programming.
Algorithmica
Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
2020 J jnl
The Game of Cops and Eternal Robbers.
CoRR
Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, Fionn Mc Inerney
2019 — —
Domination and Identification Games in Graphs. (Jeux de Domination et d'Identification dans les Graphes).
Fionn Mc Inerney
2019 C conf
Eternal Domination in Grids.
CIAC
Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
2019 J jnl
Hyperopic Cops and Robbers.
Theor. Comput. Sci.
Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger
2019 C conf
Metric Dimension: from Graphs to Oriented Graphs.
LAGOS
Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse
2019 J jnl
The orthogonal colouring game.
Theor. Comput. Sci.
Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
2018 B conf
Sequential Metric Dimension.
WAOA
Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes
2018 J jnl
Spy-game on graphs: Complexity and simple topologies.
Theor. Comput. Sci.
Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio
2017 J jnl
Hyperopic Cops and Robbers.
CoRR
Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger
2017 B conf
Study of a Combinatorial Game in Graphs Through Linear Programming.
ISAAC
Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes