Publications of Fionn Mc Inerney

BACK TO COATI PUBLICATION INDEX

Publications of Fionn Mc Inerney

Thesis
  1. Fionn Mc Inerney. Domination and identification games in graphs. Theses, Université Côte d'Azur, July 2019. [WWW ] [PDF ]
    Keywords: Algorithm, Graph theory, Combinatorial games, Cops and robber games, Algorithmes, Jeux combinatoires, Jeux des gendarmes et voleur, Théorie des graphes. [bibtex-entry]
     
Articles in journal or book's chapters
  1. Julien Bensmail, Fionn Mc Inerney, and Kasper Lyngsie. On a,b-edge-weightings of bipartite graphs with odd a,b. Discussiones Mathematicae Graph Theory, 42(1):159-185, 2022. [WWW ] [PDF ] [bibtex-entry]
     
  2. Julien Bensmail, Foivos Fioravantes, and Fionn Mc Inerney. On the Role of 3s for the 1-2-3 Conjecture. Theoretical Computer Science, 892:238-257, 2021. [WWW ] [PDF ]
    Keywords: Proper labellings, 3-chromatic graphs, 1-2-3 Conjecture. [bibtex-entry]
     
  3. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. Further Results on an Equitable 1-2-3 Conjecture. Discrete Applied Mathematics, 297:1-20, 2021. [WWW ] [PDF ]
    Keywords: Proper labellings, Equitable labellings, 1-2-3 Conjecture. [bibtex-entry]
     
  4. Julien Bensmail and Fionn Mc Inerney. On Generalisations of the AVD Conjecture to Digraphs. Graphs and Combinatorics, 37:545-558, 2021. [WWW ] [PDF ]
    Keywords: Digraphs, AVD Conjecture, Proper edge-colourings, proper edge-colourings, digraphs. [bibtex-entry]
     
  5. Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. Algorithmica, 83(5):1459-1492, 2021. [WWW ] [PDF ]
    Keywords: King's graph, Strong grid, Cartesian grid, Grids, Graphs, Eternal Domination, Combinatorial Games. [bibtex-entry]
     
  6. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Sequential Metric Dimension. Algorithmica, 82(10):2867-2901, 2020. [WWW ] [PDF ]
    Keywords: Complexity, Metric dimension, Games in graphs. [bibtex-entry]
     
  7. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs. Discrete Applied Mathematics, 2020. [WWW ] [PDF ]
    Keywords: Strongly-connected orientations, Metric dimension, Resolving sets. [bibtex-entry]
     
  8. Julien Bensmail and Fionn Mc Inerney. On Generalisations of the AVD Conjecture to Digraphs. Graphs and Combinatorics, 2020. [WWW ] [PDF ]
    Keywords: Digraphs, AVD Conjecture, Proper edge-colourings, proper edge-colourings, digraphs. [bibtex-entry]
     
  9. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica, 82(2):212-244, 2020. [WWW ] [PDF ]
    Keywords: Grid, Tree, Linear Programming, Domination, Graphs, Spy game, Cops and Robber games. [bibtex-entry]
     
  10. Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Mejìa Zacarìas, Ben Seamone, and Virgélot Virgile. A method for eternally dominating strong grids. Discrete Mathematics and Theoretical Computer Science, vol. 22(1), March 2020. [WWW ] [PDF ]
    Keywords: Graphs, Graph Protection, Eternal Domination, Combinatorial Games. [bibtex-entry]
     
  11. Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. Algorithmica, 2020. [WWW ] [PDF ]
    Keywords: King's graph, Strong grid, Cartesian grid, Grids, Graphs, Eternal Domination, Combinatorial Games. [bibtex-entry]
     
  12. Stephan Dominique Andres, Melissa Huggan, Fionn Mc Inerney, and Richard J Nowakowski. The Orthogonal Colouring Game. Theoretical Computer Science, 795:312-325, February 2019. [WWW ] [PDF ]
    Keywords: Orthogonal Colouring Game, strictly matched involution, games on graphs, scoring game, orthogonal graph colouring, mutually orthogonal Latin squares. [bibtex-entry]
     
  13. Julien Bensmail, Fionn Mc Inerney, and Kasper Lyngsie. On a,b-edge-weightings of bipartite graphs with odd a,b. Discussiones Mathematicae Graph Theory, 2019. [WWW ] [PDF ] [bibtex-entry]
     
  14. Anthony Bonato, Nancy Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, and Margaret-Ellen Messinger. Hyperopic Cops and Robbers. Theoretical Computer Science, 794:59-68, 2019. [WWW ] [PDF ] [bibtex-entry]
     
  15. Anthony Bonato, Nancy Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, and Margaret-Ellen Messinger. Hyperopic Cops and Robbers. Theoretical Computer Science, 2018. [WWW ] [PDF ] [bibtex-entry]
     
  16. Nathann Cohen, Nicolas Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, and Rudini Sampaio. Spy-game on graphs: Complexity and simple topologies. Theoretical Computer Science, 725:1 - 15, May 2018. [WWW ] [PDF ]
    Keywords: Graphs, Cops and Robber games, PSPACE-hard. [bibtex-entry]
     
  17. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica, August 2018. [WWW ] [PDF ]
    Keywords: Domination, Graphs, Spy game, Cops and Robber games, Linear Programming, Tree, Grid. [bibtex-entry]
     
Conference's articles
  1. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. Connexions ! Le jeu du plus grand sous-graphe connexe. In ALGOTEL 2021 - 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, La Rochelle, France, September 2021. [WWW ] [PDF ]
    Keywords: Games on graphs, Scoring games, Connection games, PSPACE-complete, Jeux à deux joueurs dans les graphes, Jeux de connexion, Jeux à score. [bibtex-entry]
     
  2. Julien Bensmail, Foivos Fioravantes, and Fionn Mc Inerney. On the Role of 3's for the 1-2-3 Conjecture. In CIAC 2021 - 12th International Conference on Algorithms and Complexity, volume 12701 of Lecture Notes in Computer Science, Larnaca, Cyprus, pages 103-115, May 2021. Springer. [WWW ] [PDF ]
    Keywords: 3-chromatic graphs, Proper labellings, 1-2-3 Conjecture. [bibtex-entry]
     
  3. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. The Largest Connected Subgraph Game. In WG 2021 - The 47th International Workshop on Graph-Theoretic Concepts in Computer Science, volume 12911 of Lecture Notes in Computer Science, Warsaw, Poland, pages 296-307, June 2021. Springer. [WWW ] [PDF ]
    Keywords: Games on graphs, Scoring games, Connection games, PSPACE-complete. [bibtex-entry]
     
  4. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Dimension Métrique des Graphes Orientés. In AlgoTel 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Saint Laurent de la Cabrerisse, France, June 2019. [WWW ] [PDF ]
    Keywords: Graphes, Dimension Métrique, Ensembles Resolvants, Orientations fortement connexes. [bibtex-entry]
     
  5. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs. In LAGOS 2019 - 10th Latin & American Algorithms, Graphs and Optimization Symposium, volume 346 of Electronic Notes in Theoretical Computer Science, Belo Horizonte, Brazil, pages 111-123, June 2019. [WWW ] [PDF ]
    Keywords: Strongly-connected orientations, Resolving sets, Metric dimension. [bibtex-entry]
     
  6. Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination in Grids. In CIAC 2019 - 11th International Conference on Algorithms and Complexity, volume 11485 of Algorithms and Complexity. Lecture Notes in Computer Science, Rome, Italy, pages 311-322, May 2019. [WWW ] [PDF ]
    Keywords: Grids, Combinatorial Games, Graphs, Eternal Domination. [bibtex-entry]
     
  7. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Sequential Metric Dimension. In 16th Workshop on Approximation and Online Algorithms (WAOA 2018), Helsinki, Finland, August 2018. [WWW ] [PDF ]
    Keywords: metric dimension, Games in graphs, complexity. [bibtex-entry]
     
  8. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Localiser une cible dans un graphe. In ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France, May 2018. [WWW ] [PDF ]
    Keywords: Mots-clefs : Graphes, Dimension Métrique, Dimension Centro¨idaleCentro¨idale, Jeux dans les graphes. [bibtex-entry]
     
  9. Nathann Cohen, Nìcolas A Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, and Rudini Sampaio. Enquêter dans les graphes. In ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Quiberon, France, May 2017. [WWW ] [PDF ]
    Keywords: Jeu de Gendarmes et Voleur, Programmation Linéaire, Mots-clefs : Jeux combinatoires à deux joueurs dans les graphes. [bibtex-entry]
     
  10. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming. In 28th International Symposium on Algorithms and Computation (ISAAC 2017), Phuket, Thailand, 2017. [WWW ] [PDF ]
    Keywords: Turn-by-turn games in graphs, Graph algorithms, Linear Programming. [bibtex-entry]
     
Internal reports
  1. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, and Nacim Oijid. The Maker-Breaker Largest Connected Subgraph Game. Research Report, Université Côte d’Azur, CNRS, Inria, I3S, Biot, France, 2021. [WWW ] [PDF ]
    Keywords: Maker-Breaker games, Largest connected subgraph game, Connection games, PSPACE-complete. [bibtex-entry]
     
  2. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. The Largest Connected Subgraph Game. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France ; CISPA Helmholtz Center for Information Security, Saarbrücken, Germany, 2021. [WWW ] [PDF ]
    Keywords: Games on graphs, Scoring games, Connection games, PSPACE-complete, GI-hard. [bibtex-entry]
     
  3. Julien Bensmail and Fionn Mc Inerney. The Vertex-Capturing Game. Research Report, Université Côte d'Azur ; CISPA Helmholtz Center for Information Security, 2021. [WWW ] [PDF ]
    Keywords: scoring game, combinatorial game, 2-player game, graph. [bibtex-entry]
     
  4. Julien Bensmail, Foivos Fioravantes, and Fionn Mc Inerney. On the Role of 3's for the 1-2-3 Conjecture. Research Report, Université côte d'azur ; Aix-Marseille Universite, 2020. [WWW ] [PDF ]
    Keywords: Proper labellings, 3-chromatic graphs, 1-2-3 Conjecture. [bibtex-entry]
     
  5. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, and Nicolas Nisse. Further Results on an Equitable 1-2-3 Conjecture. Research Report, Université Côte d'Azur, CNRS, I3S, France ; Inria Sophia Antipolis ; Aix-Marseille Université (AMU), April 2020. [WWW ] [PDF ]
    Keywords: Proper labellings, Equitable labellings, 1-2-3 Conjecture. [bibtex-entry]
     
  6. Stephan Dominique Andres, François Dross, Melissa Huggan, Fionn Mc Inerney, and Richard J Nowakowski. On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution. Research Report, Inria - Sophia Antipolis, March 2019. [WWW ] [PDF ]
    Keywords: scoring game, strictly matched involution, NP-completeness, combinatorial game, Orthogonal Colouring Game, orthogonal graph colouring, PSPACE-completeness. [bibtex-entry]
     
  7. Julien Bensmail, Dorian Mazauric, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Sequential Metric Dimension. Research Report, Inria, 2018. [WWW ] [PDF ]
    Keywords: complexity, Metric dimension, Games in graphs. [bibtex-entry]
     
  8. Julien Bensmail, Fionn Mc Inerney, and Nicolas Nisse. Metric Dimension: from Graphs to Oriented Graphs. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, November 2018. [WWW ] [PDF ]
    Keywords: Strongly-connected orientations, Metric dimension, Resolving sets. [bibtex-entry]
     
  9. Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Eternal Domination in Grids. Research Report, Inria & Université Cote d'Azur, CNRS, I3S, Sophia Antipolis, France, May 2018. [WWW ] [PDF ]
    Keywords: Eternal Domination, Combinatorial Games, Graphs, Grids. [bibtex-entry]
     
  10. Nathann Cohen, Nìcolas A Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, and Rudini Sampaio. Spy-Game on graphs: complexity and simple topologies. Research Report, Inria Sophia Antipolis, 2017. [WWW ] [PDF ]
    Keywords: PSPACE-hard, Cops and Robber games, graphs. [bibtex-entry]
     
  11. Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, and Stéphane Pérennes. Study of a combinatorial game in graphs through Linear Programming. Research Report, Inria Sophia Antipolis, 2017. [WWW ] [PDF ]
    Keywords: Linear Programming, Cops and Robber games, Graphs. [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX


Last modified: Sat Jan 29 19:00:45 2022