Fionn Mc Inerney

According to our database, Fionn Mc Inerney authored at least 34 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

The Boundaries of Tractability in Hierarchical Task Network Planning.

Cornelius Brand, Robert Ganian, Fionn Mc Inerney, Simon Wietheger

CoRR, 2024

The Complexity of Optimizing Atomic Congestion.

Cornelius Brand, Robert Ganian, Subrahmanyam Kalyanasundaram, Fionn Mc Inerney

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

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., December, 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., December, 2023

The Complexity of Two Colouring Games.

Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski

Algorithmica, April, 2023

The Maker-Breaker Largest Connected Subgraph game.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid

Theor. Comput. Sci., 2023

Enumerating minimal solution sets for metric graph problems.

Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney

CoRR, 2023

Non-Clashing Teaching Maps for Balls in Graphs.

Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel

CoRR, 2023

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

CoRR, 2023

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

CoRR, 2023

Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree.

Valentin Bartier, Oscar Defrain, Fionn Mc Inerney

CoRR, 2023

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

CoRR, 2023

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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

On a vertex-capturing game.

Julien Bensmail, Fionn Mc Inerney

Theor. Comput. Sci., 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

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

CoRR, 2022

The Largest Connected Subgraph Game.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse

Algorithmica, 2022

2021

The game of Cops and Eternal Robbers.

Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, Fionn Mc Inerney

Theor. Comput. Sci., 2021

On the role of 3s for the 1-2-3 Conjecture.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney

Theor. Comput. Sci., 2021

On Generalisations of the AVD Conjecture to Digraphs.

Julien Bensmail, Fionn Mc Inerney

Graphs Comb., 2021

Further results on an equitable 1-2-3 Conjecture.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse

Discret. Appl. Math., 2021

Weighted total acquisition.

Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney

Discret. Appl. Math., 2021

Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between.

Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Algorithmica, 2021

On the Role of 3's for the 1-2-3 Conjecture.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

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

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

Study of a Combinatorial Game in Graphs Through Linear Programming.

Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Algorithmica, 2020

Sequential Metric Dimension.

Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Algorithmica, 2020

2019

Domination and Identification Games in Graphs. (Jeux de Domination et d'Identification dans les Graphes).

Fionn Mc Inerney

PhD thesis, 2019

Hyperopic Cops and Robbers.

Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger

Theor. Comput. Sci., 2019

The orthogonal colouring game.

Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski

Theor. Comput. Sci., 2019

Metric Dimension: from Graphs to Oriented Graphs.

Julien Bensmail, Fionn Mc Inerney, Nicolas Nisse

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Eternal Domination in Grids.

Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes

Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018

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