Follow
Fionn Mc Inerney
Title
Cited by
Cited by
Year
Spy-game on graphs: Complexity and simple topologies
N Cohen, NA Martins, F Mc Inerney, N Nisse, S Pérennes, R Sampaio
Theoretical Computer Science 725, 1-15, 2018
222018
The orthogonal colouring game
SD Andres, M Huggan, F Mc Inerney, RJ Nowakowski
Theoretical Computer Science 795, 312-325, 2019
172019
The Largest Connected Subgraph Game
J Bensmail, F Fioravantes, F Mc Inerney, N Nisse
Algorithmica 84 (9), 2533-2555, 2022
152022
Sequential metric dimension
J Bensmail, D Mazauric, F Mc Inerney, N Nisse, S Pérennes
Algorithmica 82 (10), 2867-2901, 2020
152020
Study of a combinatorial game in graphs through Linear Programming
N Cohen, F Mc Inerney, N Nisse, S Pérennes
Algorithmica 82 (2), 212-244, 2020
132020
Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs
J Focke, D Marx, FM Inerney, D Neuen, GS Sankar, P Schepper, ...
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
122023
Metric dimension: from graphs to oriented graphs
J Bensmail, F Mc Inerney, N Nisse
Electronic Notes in Theoretical Computer Science 346, 111-123, 2019
102019
On {a,b}-Edge-Weightings of Bipartite Graphs with Odd
J Bensmail, F Mc Inerney, KS Lyngsie
Discussiones Mathematicae Graph Theory 42 (1), 159-185, 2022
92022
The Maker-Breaker Largest Connected Subgraph Game
J Bensmail, F Fioravantes, F Mc Inerney, N Nisse, N Oijid
Theoretical Computer Science 943, 102-120, 2023
72023
Metric dimension: from graphs to oriented graphs
J Bensmail, F Mc Inerney, N Nisse
Discrete Applied Mathematics 323, 28-42, 2022
72022
Further results on an equitable 1-2-3 Conjecture
J Bensmail, F Fioravantes, F Mc Inerney, N Nisse
Discrete Applied Mathematics 297, 1-20, 2021
72021
Eternal domination in grids
F Mc Inerney, N Nisse, S Pérennes
International Conference on Algorithms and Complexity, 311-322, 2019
72019
Metric dimension parameterized by feedback vertex set and other structural parameters
E Galby, L Khazaliya, F Mc Inerney, R Sharma, P Tale
SIAM Journal on Discrete Mathematics 37 (4), 2241-2264, 2023
62023
Sample compression schemes for balls in graphs
J Chalopin, V Chepoi, F Mc Inerney, S Ratel, Y Vaxès
SIAM Journal on Discrete Mathematics 37 (4), 2585-2616, 2023
62023
Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between
F Mc Inerney, N Nisse, S Pérennes
Algorithmica 83, 1459-1492, 2021
62021
A method for eternally dominating strong grids
A Gagnon, A Hassler, J Huang, A Krim-Yee, F Mc Inerney, A Zacarías, ...
Discrete Mathematics & Theoretical Computer Science 22 (Graph Theory), 2020
62020
On the Role of 3s for the 1-2-3 Conjecture
J Bensmail, F Fioravantes, F Mc Inerney
Theoretical Computer Science 892, 238-257, 2021
52021
Eternal domination in grids
F Mc Inerney, N Nisse, S Pérennes
Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, 2018
52018
Non-clashing teaching maps for balls in graphs
J Chalopin, V Chepoi, FM Inerney, S Ratel
arXiv preprint arXiv:2309.02876, 2023
42023
On a vertex-capturing game
J Bensmail, F Mc Inerney
Theoretical Computer Science 923, 27-46, 2022
42022
The system can't perform the operation now. Try again later.
Articles 1–20