Fionn Mc Inerney

Postdoctoral Researcher at

CISPA Helmholtz Center for Information Security

Bio

I am currently a postdoctoral researcher in the Algorithms & Complexity group of Dániel Marx at CISPA Helmholtz Center for Information Security (Saarbrücken, Germany), under the supervision of Dániel Marx (Feb. 2021 - present).

I was a postdoctoral researcher in the ACRO team at the LIS, Aix-Marseille Université (Marseille, France) as part of the ANR DISTANCIA project, under the supervision of Victor Chepoi (Jan. 2020 - Dec. 2020).

I was a postdoctoral researcher in the GOAL team at the LIRIS, Université Claude Bernard Lyon 1 (Lyon, France) as part of the ANR GAG project, under the supervision of Eric Duchêne and Aline Parreau (Jul. 2019 - Dec. 2019).

I was a doctoral student at Université Côte d'Azur in the COATI team which is a joint project-team between Inria Sophia Antipolis - Méditerranée and the I3S laboratory, under the supervision of Nicolas Nisse (Oct. 2016 - Jul. 2019).

Here is my CV in English.

Contact Information

fmcinern(at)gmail(dot)com

Publications

International Journals

[13] A. Bonato, M. Huggan, T. Marbach, and F. Mc Inerney. The Game of Cops and Eternal Robbers. To appear in Theoretical Computer Science.

[12] G. Bagan, V. Gledel, M. Heinrich, and F. Mc Inerney. Weighted Total Acquisition. To appear in Discrete Applied Mathematics.

[11] J. Bensmail, F. Mc Inerney, and N. Nisse. Metric Dimension: from Graphs to Oriented Graphs. DOI: https://doi.org/10.1016/j.dam.2020.09.013. Discrete Applied Mathematics, 2021.

[10] J. Bensmail, F. Mc Inerney, and K. Szabo Lyngsie. On {a,b}-edge weightings of bipartite graphs with odd a, b. DOI: https://doi.org/10.7151/dmgt.2250. Discussiones Mathematicae Graph Theory, 2021.

[9] F. Mc Inerney, N. Nisse, and S. Pérennes. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. Algorithmica, vol. 83(5), pp 1459-1492, 2021.

[8] J. Bensmail, F. Fioravantes, F. Mc Inerney, and N. Nisse. Further Results on an Equitable 1-2-3 Conjecture. Discrete Applied Mathematics, vol. 297, pp 1-20, 2021.

[7] J. Bensmail and F. Mc Inerney. On Generalisations of the AVD Conjecture to Digraphs. Graphs and Combinatorics, vol. 37(2), pp 545-558, 2021.

[6] J. Bensmail, D. Mazauric, F. Mc Inerney, N. Nisse, and S. Pérennes. Sequential Metric Dimension. Algorithmica, vol. 82(10), pp 2867-2901, 2020.

[5] A. Gagnon, A. Hassler, J. Huang, A. Krim-Yee, F. Mc Inerney, A. Mejía Zacarías, B. Seamone, and V. Virgile. A method for eternally dominating strong grids. Discrete Mathematics and Theoretical Computer Science, vol. 22(1), 2020.

[4] N. Cohen, F. Mc Inerney, N. Nisse, and S. Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica, vol. 82(2), pp 212-244, 2020.

[3] S. D. Andres, M. Huggan, F. Mc Inerney, and R. J. Nowakowski. The orthogonal colouring game. Theoretical Computer Science, vol. 795, pp 312-325, 2019.

[2] A. Bonato, N. Clarke, D. Cox, S. Finbow, F. Mc Inerney, and M. E. Messinger. Hyperopic Cops and Robbers. Theoretical Computer Science, vol. 794, pp 59-68, 2019.

[1] N. Cohen, N. Martins, F. Mc Inerney, N. Nisse, S. Pérennes, and R. Sampaio. Spy-Game on graphs: Complexity and simple topologies. Theoretical Computer Science, vol. 725, pp 1-15, 2018.

International Conferences

[7] J. Bensmail, F. Fioravantes, F. Mc Inerney, and N. Nisse. The Largest Connected Subgraph Game. In Proceedings of the 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021), Lecture Notes in Computer Science, Springer, 2021.

[6] J. Bensmail, F. Fioravantes, and F. Mc Inerney. On the Role of 3's for the 1-2-3 Conjecture. In Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC 2021), Lecture Notes in Computer Science, Springer, 2021.

[5] J. Bensmail, F. Mc Inerney, and N. Nisse. Metric Dimension: from Graphs to Oriented Graphs. In Proceedings of the 10th Latin & American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Electronic Notes in Theoretical Computer Science, vol. 346, pp 111-123, 2019.

[4] F. Mc Inerney, N. Nisse, and S. Pérennes. Eternal Domination in Grids. In Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC 2019), Lecture Notes in Computer Science, vol. 11485, pp 311-322, Springer, Cham, 2019.

[3] J. Bensmail, D. Mazauric, F. Mc Inerney, N. Nisse, and S. Pérennes. Sequential Metric Dimension. In Proceedings of the 16th Workshop on Approximation and Online Algorithms (WAOA 2018), Lecture Notes in Computer Science, vol. 11312, pp 36-50, Springer, 2018.

[2] N. Cohen, F. Mc Inerney, N. Nisse, and S. Pérennes. Study of a Combinatorial Game in Graphs Through Linear Programming. In Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), LIPIcs 92, Schloss Dagstuhl, 22:1-22:13, 2017.

[1] A. Bonato and F. Mc Inerney. The game of Wall Cops and Robbers. In Proceedings of the 2nd International Conference on Computational Models, Cyber Security, Computational Intelligence (ICC3), Advances in Intelligent Systems and Computing, vol. 412, pp 3-13, Springer, 2015.

National Conferences

[4] J. Bensmail, F. Fioravantes, F. Mc Inerney, and N. Nisse. Connexions ! Le jeu du plus grand sous-graphe connexe. In 23es Rencontres Francophones sur les aspects d'Algorithmiques des Télécommunications (AlgoTel 2021), La Rochelle, France, 2021.

[3] J. Bensmail, F. Mc Inerney, and N. Nisse. Dimension Métrique des Graphes Orientés. In 21es Rencontres Francophones sur les aspects d'Algorithmiques des Télécommunications (AlgoTel 2019), Saint Laurent de la Cabrerisse, France, 2019.

[2] J. Bensmail, D. Mazauric, F. Mc Inerney, N. Nisse, and S. Pérennes. Localiser une cible dans un graphe. In 20es Rencontres Francophones sur les aspects d'Algorithmiques des Télécommunications (AlgoTel 2018), Roscoff, France, 2018.

[1] N. Cohen, N. Martins, F. Mc Inerney, N. Nisse, S. Pérennes, and R. Sampaio. Enquêter dans les graphes. In 19es Rencontres Francophones sur les aspects d'Algorithmiques des Télécommunications (AlgoTel 2017), Quiberon, France, 2017.

International Conferences without Proceedings (selection on abstract)

[2] S. D. Andres, F. Dross, M. Huggan, F. Mc Inerney, and R. J. Nowakowski. The Orthogonal Colouring Game. In the 5th Bordeaux Graph Workshop (BGW 2019), Bordeaux, France, 2019.

[1] J. Bensmail, D. Mazauric, F. Mc Inerney, N. Nisse, and S. Pérennes. Sequential Metric Dimension. In the 10th International Colloquium on Graph Theory and Combinatorics (ICGT 2018), Lyon, France, 2018.

Talks

Conference and Workshop Talks

Seminar Talks

Scientific Dissemination and Popularization

  • Maths à modeler workshop, Fête de la Science au LIRIS, Lyon, France, October 10, 2019.

  • Café-In: Graphes et Algorithmes pour tous, Inria Sophia-Antipolis - Méditerranée, France, April 29, 2019.

  • INRIA stand, Fête de la Science: Village des Sciences et de l'Innovation, Juan les Pins, October 20-21, 2018.

  • Presentation and assisting with activities, Stage MathC2+, Inria Sophia-Antipolis - Méditerranée, France, June 19-22, 2018.

  • Supervised internship of a high school student (lycéene en seconde), Inria Sophia-Antipolis - Méditerranée, France, June 18-22, 2018.

  • Mathémagie et Jeux presentation, Collège Victor Hugo, Nevers, France, March 23, 2018.

  • Participation in the day "L'informatique, c'est pas génétique, filles ou garçons, les clics sont identiques!", Lycée Raoul Follereau, Nevers, France, March 22, 2018.

  • Mathémagie et Jeux presentation, Ecole Primaire Romain Rolland, Varennes-Vauzelles, France, March 21, 2018.

Background

  • 2013: Bachelor of Science (BSc) in Mathematics and Its Applications with a minor in Finance, Ryerson University, Toronto, Ontario, Canada.