Spy-game on graphs: Complexity and simple topologies. - Nathann Cohen; Nicolas Almeida Martins; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes; Rudini M. Sampaio (Theor. Comput. Sci., 2018)

Eternal Domination in Grids. - Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (CIAC, 2019)

The orthogonal colouring game. - Stephan Dominique Andres; Melissa A. Huggan; Fionn Mc Inerney; Richard J. Nowakowski (Theor. Comput. Sci., 2019)

Hyperopic Cops and Robbers. - Anthony Bonato; Nancy E. Clarke; Danielle Cox; Stephen Finbow; Fionn Mc Inerney; Margaret-Ellen Messinger (Theor. Comput. Sci., 2019)

Domination and Identification Games in Graphs. (Jeux de Domination et d'Identification dans les Graphes). - Fionn Mc Inerney (2019)

Sequential Metric Dimension. - Julien Bensmail; Dorian Mazauric; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2020)

Study of a Combinatorial Game in Graphs Through Linear Programming. - Nathann Cohen; Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2020)

A method for eternally dominating strong grids. - Alizée Gagnon; Alexander Hassler; Jerry Huang; Aaron Krim-Yee; Fionn Mc Inerney; Andrés Zacarías; Ben Seamone; Virgélot Virgile (Discret. Math. Theor. Comput. Sci., 2020)

Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325]. - Stephan Dominique Andres; Melissa A. Huggan; Fionn Mc Inerney; Richard J. Nowakowski (Theor. Comput. Sci., 2020)

On the Role of 3's for the 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney (CIAC, 2021)

Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. - Fionn Mc Inerney; Nicolas Nisse; Stéphane Pérennes (Algorithmica, 2021)

Weighted total acquisition. - Guillaume Bagan; Valentin Gledel; Marc Heinrich; Fionn Mc Inerney (Discret. Appl. Math., 2021)

Further results on an equitable 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse (Discret. Appl. Math., 2021)

On Generalisations of the AVD Conjecture to Digraphs. - Julien Bensmail; Fionn Mc Inerney (Graphs Comb., 2021)

On the role of 3s for the 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney (Theor. Comput. Sci., 2021)

The game of Cops and Eternal Robbers. - Anthony Bonato; Melissa A. Huggan; Trent G. Marbach; Fionn Mc Inerney (Theor. Comput. Sci., 2021)

The Largest Connected Subgraph Game. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse (Algorithmica, 2022)

Metric dimension: From graphs to oriented graphs. - Julien Bensmail; Fionn Mc Inerney; Nicolas Nisse (Discret. Appl. Math., 2022)

On {a, b}-edge-weightings of bipartite graphs with odd a, b. - Julien Bensmail; Fionn Mc Inerney; Kasper Szabo Lyngsie (Discuss. Math. Graph Theory, 2022)

On a vertex-capturing game. - Julien Bensmail; Fionn Mc Inerney (Theor. Comput. Sci., 2022)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (SODA, 2023)

Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree. - Valentin Bartier; Oscar Defrain; Fionn Mc Inerney (CoRR, 2023)

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (CoRR, 2023)

The Maker-Breaker Largest Connected Subgraph game. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid (Theor. Comput. Sci., 2023)

The Complexity of Two Colouring Games. - Stephan Dominique Andres; François Dross; Melissa A. Huggan; Fionn Mc Inerney; Richard J. Nowakowski (Algorithmica, 2023)

Sample Compression Schemes for Balls in Graphs. - Jérémie Chalopin; Victor Chepoi; Fionn Mc Inerney; Sébastien Ratel; Yann Vaxès (SIAM J. Discret. Math., 2023)

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. - Esther Galby; Liana Khazaliya; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (SIAM J. Discret. Math., 2023)

Non-Clashing Teaching Maps for Balls in Graphs. - Jérémie Chalopin; Victor Chepoi; Fionn Mc Inerney; Sébastien Ratel (COLT, 2024)

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (ICALP, 2024)

Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. - Valentin Bartier; Oscar Defrain; Fionn Mc Inerney (IWOCA, 2024)

The Boundaries of Tractability in Hierarchical Task Network Planning. - Cornelius Brand; Robert Ganian; Fionn Mc Inerney; Simon Wietheger (CoRR, 2024)

Smash and grab: The 0 ⋅ 6 scoring game on graphs. - Éric Duchêne; Valentin Gledel; Sylvain Gravier; Fionn Mc Inerney; Mehdi Mhalla; Aline Parreau (Theor. Comput. Sci., 2024)

Parameterized Complexity of Caching in Networks. - Robert Ganian; Fionn Mc Inerney; Dimitra Tsigkari (AAAI, 2025)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs. - Robert Ganian; Liana Khazaliya; Fionn Mc Inerney; Mathis Rocton (ICLR, 2025)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (STACS, 2025)

The complexity of optimizing atomic congestion. - Cornelius Brand; Robert Ganian; Subrahmanyam Kalyanasundaram; Fionn Mc Inerney (Artif. Intell., 2025)

Complexity of Maker-Breaker games on edge sets of graphs. - Éric Duchêne; Valentin Gledel; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid; Aline Parreau; Milos Stojakovic (Discret. Appl. Math., 2025)

Enumerating Minimal Solution Sets for Metric Graph Problems. - Benjamin Bergougnoux; Oscar Defrain; Fionn Mc Inerney (Algorithmica, 2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (ACM Trans. Comput. Theory, 2025)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results. - Jacob Focke; Dániel Marx; Fionn Mc Inerney; Daniel Neuen; Govind S. Sankar; Philipp Schepper; Philip Wellnitz (ACM Trans. Algorithms, 2025)