Fionn Mc Inerney

Cited by

	All	Since 2019
Citations	204	194
h-index	8	8
i10-index	7	7

20182019202020212022202320244 13 17 23 48 60 28

Public access

View all

29 articles

1 article

available

not available

Based on funding mandates

Co-authors

Nicolas NisseInria, FranceVerified email at inria.fr
BENSMAIL JulienUniversité Côte d'AzurVerified email at unice.fr
stephane perennescnrsVerified email at cnrs.fr
Foivos FioravantesVerified email at inria.fr
Melissa HugganVancouver Island UniversityVerified email at viu.ca
Richard NowakowskiProfessor Emeritus, Mathematics, Dalhousie University, Nova Scotia, CanadaVerified email at dal.ca
Rudini Menezes SampaioProfessor de Ciência da Computação, Universidade Federal do CearáVerified email at dc.ufc.br
Anthony BonatoProfessor of Mathematics, Toronto Metropolitan UniversityVerified email at torontomu.ca
Roohani SharmaMax Planck Institute for InformaticsVerified email at mpi-inf.mpg.de
Prafullkumar TaleINSPIRE Faculty, Mathematics Department, IISER PuneVerified email at iiserpune.ac.in
Jacob FockeCISPA Helmholtz Center for Information SecurityVerified email at cispa.de
Daniel NeuenUniversity of BremenVerified email at uni-bremen.de
Philip WellnitzNational Institute of InformaticsVerified email at nii.ac.jp
Govind S. SankarDuke UniversityVerified email at duke.edu
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Ben SeamoneUniversite de Montreal & Dawson CollegeVerified email at iro.umontreal.ca
Victor ChepoiLIS, Aix-Marseille UniversitéVerified email at lis-lab.fr
Jérémie ChalopinLIS, CNRS & Aix-Marseille UniversitéVerified email at lis-lab.fr
Valentin GledelPostdoc, Umeå SwedenVerified email at umu.se
Kasper Szabo LyngsieTechnical University of DenmarkVerified email at dtu.dk

Fionn Mc Inerney

TU Wien

Verified email at ac.tuwien.ac.at - Homepage

Graph Theory Parameterized Complexity Games on Graphs Metric Dimension Cops and Robbers


Title Sort by citations Sort by year Sort by 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	22	2018
The orthogonal colouring game SD Andres, M Huggan, F Mc Inerney, RJ Nowakowski Theoretical Computer Science 795, 312-325, 2019	17	2019
The Largest Connected Subgraph Game J Bensmail, F Fioravantes, F Mc Inerney, N Nisse Algorithmica 84 (9), 2533-2555, 2022	15	2022
Sequential metric dimension J Bensmail, D Mazauric, F Mc Inerney, N Nisse, S Pérennes Algorithmica 82 (10), 2867-2901, 2020	15	2020
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	13	2020
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	12	2023
Metric dimension: from graphs to oriented graphs J Bensmail, F Mc Inerney, N Nisse Electronic Notes in Theoretical Computer Science 346, 111-123, 2019	10	2019
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	9	2022
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	7	2023
Metric dimension: from graphs to oriented graphs J Bensmail, F Mc Inerney, N Nisse Discrete Applied Mathematics 323, 28-42, 2022	7	2022
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	7	2021
Eternal domination in grids F Mc Inerney, N Nisse, S Pérennes International Conference on Algorithms and Complexity, 311-322, 2019	7	2019
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	6	2021
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	6	2020
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	5	2023
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	5	2021
Eternal domination in grids F Mc Inerney, N Nisse, S Pérennes Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, 2018	5	2018
On a vertex-capturing game J Bensmail, F Mc Inerney Theoretical Computer Science 923, 27-46, 2022	4	2022
On the complexity of orthogonal colouring games and the NP-completeness of recognising graphs admitting a strictly matched involution SD Andres, F Dross, M Huggan, F Mc Inerney, R Nowakowski Technical report, INRIA, 2019. Research report, https://hal. inria. fr/hal …, 2019	4	2019
The game of wall cops and robbers A Bonato, FM Inerney Computational Intelligence, Cyber Security and Computational Models …, 2016	4	2016

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors