[c20] F. Foucaud, H. Gahlawat, F. Mc Inerney, and P. Tale. The Parameterized Complexity of Computing the VC-Dimension. In Proceedings of Advances in Neural Information Processing Systems 39 (NeurIPS 2025), 2025.

[c19] C. Brand, R. Ganian, F. Mc Inerney, and S. Wietheger. A Structural Complexity Analysis of Hierarchical Task Network Planning. In Proceedings of the 34th International Joint Conference on Artificial Intelligence (IJCAI 2025), 4391-4400, 2025.

[c18] R. Ganian, L. Khazaliya, F. Mc Inerney, M. Rocton. The Computational Complexity of Positive Non-Clashing Teaching in Graphs. In Proceedings of the 13th International Conference on Learning Representations (ICLR 2025), 2025.

[c17] F. Foucaud, E. Galby, L. Khazaliya, S. Li, F. Mc Inerney, R. Sharma, and P. Tale. Metric Dimension and Geodetic Set Parameterized by Vertex Cover. In Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), LIPIcs 327, Schloss Dagstuhl, 33:1-33:20, 2025.

[c16] R. Ganian, F. Mc Inerney, and D. Tsigkari. Parameterized Complexity of Caching in Networks. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI 2025), 39(11):11229-11237, 2025.

[c15] J. Chalopin, V. Chepoi, F. Mc Inerney, and S. Ratel. Non-Clashing Teaching Maps for Balls in Graphs. In Proceedings of the 37th Annual Conference on Learning Theory (COLT 2024), PMLR, 247:840-875, 2024.

[c14] 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), LNCS, 14760:50-64, Springer, 2024.

[c13] 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 or Vertex Cover. In Proceedings of the 51st International Colloquium on Automata, Languages and Programming (ICALP 2024), LIPIcs 297, Schloss Dagstuhl, 66:1-66:19, 2024.

[c12] 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), LNCS, 14764:111-125, Springer, 2024.

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

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

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

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

[c7] 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), LNCS, 12911:296-307, Springer, 2021.

[c6] 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), LNCS, 12701:103-115, Springer, 2021.

[c5] 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), ENTCS, 346:111-123, 2019.

[c4] 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), LNCS, 11485:311-322, Springer, 2019.

[c3] 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), LNCS, 11312:36-50, Springer, 2018.

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

[c1] 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, 2016.

[j26] 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 Part I: Algorithmic Results. ACM Transactions on Algorithms, 21(3):27:1-27:45, 2025.

[j25] 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 Part II: Hardness Results. ACM Transactions on Computation Theory, 17(2):10:1-10:101, 2025.

[j24] B. Bergougnoux, O. Defrain, and F. Mc Inerney. Enumerating minimal solution sets for metric graph problems. Algorithmica, 87:712-735, 2025.

[j23] C. Brand, R. Ganian, S. Kalyanasundaram, and F. Mc Inerney. The Complexity of Optimizing Atomic Congestion. Artificial Intelligence, 338:104241, 2025.

[j22] E. Duchêne, V. Gledel, F. Mc Inerney, N. Nisse, N. Oijid, A. Parreau, and M. Stojaković. Complexity of Maker-Breaker Games on Edge Sets of Graphs. Discrete Applied Mathematics, 361:502-522, 2025.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[n5] 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), 2022.

[n4] 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), 2021.

[n3] 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), 2019.

[n2] 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), 2018.

[n1] 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), 2017.

[s2] F. Foucaud, E. Galby, L. Khazaliya, S. Li, F. Mc Inerney, R. Sharma, and P. Tale. Metric Dimension and Geodetic Set Parameterized by Vertex Cover.

[s1] 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 or Vertex Cover.