Postdoctoral Researcher at TU Wien

Fionn Mc Inerney

Bio

(05/2023 - present) Postdoctoral researcher in the Algorithms and Complexity Group at the Vienna University of Technology (TU Wien), Austria. Supervised by Robert Ganian.

(02/2023 - 04/2023) Postdoctoral researcher in team ACRO of the LIS, Aix-Marseille Université, France. Supervised by Victor Chepoi.

(02/2021 - 01/2023) Postdoctoral researcher at the CISPA Helmholtz Center for Information Security, Saarbrücken, Germany. Supervised by Dániel Marx.

(01/2020 - 12/2020) Postdoctoral researcher in team ACRO of the LIS, Aix-Marseille Université, France. Supervised by Victor Chepoi.

(07/2019 - 12/2019) Postdoctoral researcher in team GOAL of the LIRIS, Université Lyon 1, France. Supervised by Eric Duchêne.

(10/2016 - 07/2019) Doctoral student at Université Côte d'Azur in team COATI of I3S/Inria Sophia Antipolis, France. Supervised by Nicolas Nisse. 

Here is my CV.

Contact Information

fmcinern(at)gmail(dot)com

Publications

In all of my publications, the authors are listed in alphabetical order.

International Journals

[21] E. Duchêne, V. Gledel, S. Gravier, F. Mc Inerney, M. Mhalla, and A. Parreau. Smash and Grab: the 0.6 Scoring Game on Graphs. Theoretical Computer Science, 990:114417, 2024.

[20] J. Chalopin, V. Chepoi, F. Mc Inerney, S. Ratel, and Y. Vaxès. Sample compression schemes for balls in graphs. SIAM Journal on Discrete Mathematics, 37(4):2585-2616, 2023.

[19] E. Galby, L. Khazaliya, F. Mc Inerney, R. Sharma, and P. Tale. Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. SIAM Journal on Discrete Mathematics, 37(4):2241-2264, 2023.

[18] S. D. Andres, F. Dross, M. Huggan, F. Mc Inerney, and R. J. Nowakowski. The Complexity of two Colouring Games. Algorithmica, 85(4):1067-1090, 2023.

[17] J. Bensmail, F. Fioravantes, F. Mc Inerney, N. Nisse, and N. Oijid. The Maker-Breaker Largest Connected Subgraph Game. Theoretical Computer Science, 943:102-120, 2023.

[16] J. Bensmail, F. Mc Inerney, and N. Nisse. Metric Dimension: from Graphs to Oriented Graphs. Discrete Applied Mathematics, 323:28-42, 2022.

[15] J. Bensmail, F. Fioravantes, F. Mc Inerney, and N. Nisse. The Largest Connected Subgraph Game. Algorithmica, 84(9):2533-2555, 2022.

[14] J. Bensmail and F. Mc Inerney. On a Vertex-Capturing Game. Theoretical Computer Science, 923:27-46, 2022.

[13] J. Bensmail, F. Mc Inerney, and K. Szabo Lyngsie. On {a,b}-edge-weightings of bipartite graphs with odd a, b. Discussiones Mathematicae Graph Theory, 42(1):159-185, 2022.

[12] J. Bensmail, F. Fioravantes, and F. Mc Inerney. On the Role of 3s for the 1-2-3 Conjecture. Theoretical Computer Science, 892:238-257, 2021.

[11] G. Bagan, V. Gledel, M. Heinrich, and F. Mc Inerney. Weighted Total Acquisition. Discrete Applied Mathematics, 304:260-282, 2021.

[10] A. Bonato, M. Huggan, T. Marbach, and F. Mc Inerney. The Game of Cops and Eternal Robbers. Theoretical Computer Science, 874:80-93, 2021.

[9] F. Mc Inerney, N. Nisse, and S. Pérennes. Eternal Domination: D-Dimensional Cartesian and Strong Grids and Everything in Between. Algorithmica, 83(5):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, 297:1-20, 2021.

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

[6] J. Bensmail, D. Mazauric, F. Mc Inerney, N. Nisse, and S. Pérennes. Sequential Metric Dimension.  Algorithmica, 82(10):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, 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, 82(2):212-244, 2020.

[3] S. D. Andres, M. Huggan, F. Mc Inerney, and R. J. Nowakowski. The orthogonal colouring game. Theoretical Computer Science, 795: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, 794: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, 725:1-15, 2018. 

International Conferences

[14] B. Bergougnoux, O. Defrain, and F. Mc Inerney. Enumerating minimal solution sets for metric graph problems. In Proceedings of the 50th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2024), 2024.

[13] F. Foucaud, E. Galby, L. Khazaliya, S. Li, F. Mc Inerney, R. Sharma, and P. Tale. Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex Cover. In Proceedings of the 51st International Colloquium on Automata, Languages and Programming (ICALP 2024), 2024.

[12] V. Bartier, O. Defrain, F. Mc Inerney. Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension. In Proceedings of the 35th International Workshop on Combinatorial Algorithms (IWOCA 2024), 2024.

[11] C. Brand, R. Ganian, S. Kalyanasundaram, and F. Mc Inerney. The Complexity of Optimizing Atomic Congestion. In Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024), 38(18): 20044-20052, 2024.

[10] J. Focke, D. Marx, F. Mc Inerney, D. Neuen, G. S. Sankar, P. Schepper, and P. Wellnitz. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), 3664-3683, 2023.

[9] E. Galby, L. Khazaliya, F. Mc Inerney, R. Sharma, and P. Tale. Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. In Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), LIPIcs 241, Schloss Dagstuhl, 51:1-51:15, 2022.

[8] J. Chalopin, V. Chepoi, F. Mc Inerney, S. Ratel, and Y. Vaxès. Sample compression schemes for balls in graphs. In Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), LIPIcs 241, Schloss Dagstuhl, 31:1-31:14, 2022.

[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, 12911:296-307, 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, 12701:103-115, 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, 346: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, 11485:311-322, Springer, 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, 11312: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, 412:3-13, Springer, 2015.

National Conferences

[5] J. Bensmail, F. Fioravantes, F. Mc Inerney, N. Nisse, and N. Oijid. Une version Maker-Breaker du jeu du plus grand sous-graphe connexe. In 24es Rencontres Francophones sur les aspects d'Algorithmiques des Télécommunications (AlgoTel 2022), Paris, France, 2022.

[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)

[3] J. Focke, D. Marx, F. Mc Inerney, D. Neuen, G. S. Sankar, P. Schepper, and P. Wellnitz. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. In the 8th IGAFIT Highlights of Algorithms conference (HALG 2023), Prague, Czechia, 2023.

[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.

Submitted

Talks

Invited Talks

[2] Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. Metric Dimension and its Variants: Structural and Algorithmic Results Minisymposium of the Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2023), Winnipeg, Canada, June 2023.

[1] Eternal Domination in D-Dimensional Grids. Graph Searching Minisymposium of the Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2021), Online, May 2021. 

Conference and Workshop Talks

[22] Tight (Double) Exponential Bounds for NP-complete Problems: Treewidth and Vertex Cover Parameterizations. 25es Journées Graphes et Algorithmes (JGA 2023), Lyon, France, November 2023.

[21] Tight (Double) Exponential Bounds for NP-complete Problems: Treewidth and Vertex Cover Parameterizations. 11th Workshop on GRAph Searching, Theory & Applications (GRASTA 2023), Bertinoro, Italy, October 2023.

[20] Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. 24es Journées Graphes et Algorithmes (JGA 2022), Paris, France, November 2022.

[19] Sample compression schemes for balls in graphs. 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022), Vienna, Austria, August 2022.

[18] The Largest Connected Subgraph Game. 9th Graph Searching in Canada Workshop (GRASCan 2021), Online, August 2021.

[17] The Largest Connected Subgraph Game. 47th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2021), Online, June 2021.

[16] Distinguishing Balls in Graphs. 22es Journées Graphes et Algorithmes (JGA 2020), Online, November 2020.

[15] Metric Dimension: from Graphs to Oriented Graphs. 21es Journées Graphes et Algorithmes (JGA 2019), Brussels, Belgium, November 2019.

[14] The Orthogonal Colouring Game. 5th Bordeaux Graph Workshop (BGW 2019), Bordeaux, France, October 2019.

[13] Sequential Metric Dimension. 8th Graph Searching in Canada Workshop (GRASCan 2019), Toronto, Canada, August 2019.

[12] Metric Dimension: from Graphs to Oriented Graphs. 10th Latin & American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Belo Horizonte, Brazil, June 2019.

[11] Eternal Domination in Grids. 11th International Conference on Algorithms and Complexity (CIAC 2019), Rome, Italy, May 2019.

[10] The Orthogonal Colouring Game. Combinatorial Game Theory Colloquium III (CGTC III), Lisbon, Portugal, January 2019.

[9] Eternal Domination in Grids. 20es Journées Graphes et Algorithmes (JGA 2018), Grenoble, France, November 2018.

[8] Sequential Metric Dimension. 9th Workshop on GRAph Searching, Theory & Applications (GRASTA 2018), Berlin, Germany, September 2018.

[7] Sequential Metric Dimension. 16th Workshop on Approximation and Online Algorithms  (WAOA 2018), Helsinki, Finland, August 2018.

[6] Sequential Metric Dimension. 10th International Colloquium on Graph Theory and Combinatorics (ICGT 2018), Lyon, France, July 2018.

[5] Localiser une cible dans un graphe. 20es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel 2018), Roscoff, France, May 2018.

[4] Spy Game on Graphs. Games and Graphs Workshop (GAG), Lyon, France, October 2017.

[3] Spy Game on Graphs. 6th Graph Searching in Canada Workshop (GRASCan 2017), Corner Brook, Canada, August 2017.

[2] Enquêter dans les graphes. 19es Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel 2017), Quiberon, France, June 2017.

[1] Introduction to Designs and Steiner Triple Systems. 17èmes Journées Combinatoires et Algorithmes du Littoral Méditerranéen (JCALM17), Sophia-Antipolis, France, May 2017.

Seminar Talks

[11] The Complexity of Optimizing Atomic Congestion. NEO Seminar, Inria Sophia Antipolis, France, January 2024

[10] Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex Cover. LIMDA Seminar, Universitat Politècnica de Catalunya, Barcelona, Spain, November 2023.

[9] Eternal Domination in D-Dimensional Grids. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, June 2021.

[8] Sequential Metric Dimension. Séminaire Graphes@Lyon, LIRIS, Lyon, France, May 2019.

[7] Sequential Metric Dimension and Oriented Metric Dimension. Séminaire de l'équipe ACRO, LIS, Marseille, France, March 2019.

[6] The Orthogonal Colouring Game. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, March 2019.

[5] Sequential Metric Dimension. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, October 2018.

[4] Spy Game on Graphs. Seminario del Doctorado en Ingeniería de Sistemas Complejos, Universidad Adolfo Ibáñez, Santiago, Chile, November 2017.

[3] The Game of Cops and Robbers on Graphs. The PhD Seminars of Inria Sophia Antipolis - Méditerranée, Inria Sophia Antipolis, France, November 2017.

[2] Spy Game on Graphs. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, June 2017.

[1] Wall Cops and Robbers. Séminaire de l'équipe COATI, Inria Sophia Antipolis, France, November 2016.

Scientific Dissemination and Popularization

[8] Maths à modeler workshop, Fête de la Science au LIRIS, Lyon, France, October 2019.

[7] Café-In: Graphes et Algorithmes pour tous, Inria Sophia Antipolis, France, April 2019.

[6] Inria stand, Fête de la Science: Village des Sciences et de l'Innovation, Juan les Pins, France, October 2018.

[5] Presentation and assisting with activities, Stage MathC2+, Inria Sophia Antipolis, France, June 2018.

[4] Supervised week-long internship of a high school student, Inria Sophia Antipolis, France, June 2018.

[3] Mathémagie et Jeux presentation, Collège Victor Hugo, Nevers, France, March 2018.

[2] 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 2018.

[1] Mathémagie et Jeux presentation, Ecole Primaire Romain Rolland, Varennes-Vauzelles, France, March 2018.

Background