Publications

Links are provided towards the open access version of the articles that follow (the title of each article is a hyperlink). 

My PhD thesis can be found here.

International journals

• J. Bensmail, F. Fioravantes. On proper 2-labellings distinguishing by sums, multisets or products. Discussiones Mathematicae Graph Theory, 44(3):863-878, 2024.

• J. Bensmail, F. Fioravantes, F. M. Inerney, N. Nisse, N. Oijid. The Maker-Breaker Largest Connected Subgraph Game. Theoretical Computer Science, 943:102-120, 2023.

• J. Bensmail, F. Fioravantes. On proper 2-labellings distinguishing by sums, multisets or products. Discussiones Mathematicae Graph Theory, in press.

• J. Bensmail, F. Fioravantes, F. M. Inerney, N. Nisse. The largest connected subgraph game. Algorithmica, 84(9):2533-2555, 2022.

• J. Bensmail, F. Fioravantes, N. Nisse. On Proper Labellings of Graphs with Minimum Label Sum. Algorithmica, 84(4):1030-1063, 2022.

• J. Bensmail, F. Fioravantes, F. M. Inerney. On the role of 3s for the 1-2-3 conjecture. Theoretical Computer Science, 892:238-257, 2021.

• J. Bensmail, F. Fioravantes, F. M. Inerney, N. Nisse. Further results on an equitable 1-2-3 conjecture. Discrete Applied Mathematics, 297:1–20, 2021.

• J. Bensmail, F. Fioravantes. On BMRN*-colouring of planar digraphs. Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 1, 2021.

International conferences

•  F. Fioravantes, D. Knop, J.M. Křišťan, N. Melissinos, and M. Opler. Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. Proceedings of the 38th AAAI Conference on Artificial Intelligence, AAAI 2024.

•  T. Dissaux, F. Fioravantes, H. Gahlawat, and N. Nisse. Recontamination helps a lot to hunt a rabbit. In 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, volume 272 of LIPIcs, pages 42:1–42:14. Schloss Dagstuhl - Leibniz-Zentrum f ̈ur Informatik, 2023.

• F. Fioravantes, N. Melissinos, T. Triomatis. Complexity of finding maximum locally irregular induced subgraphs. In 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands, volume 227 of LIPIcs, pages 24:1–24:20. Schloss Dagstuhl - Leibniz-Zentrum f ̈ur Informatik, 2022.

• J. Bensmail, F. Fioravantes, F. M. Inerney, and N. Nisse. The largest connected subgraph game. In Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers, volume 12911 of Lecture Notes in Computer Science, pages 296–307. Springer, 2021.

• J. Bensmail, F. Fioravantes, F. M. Inerney. On the Role of 3’s for the 1-2-3 Conjecture. In Algorithms and Complexity - 12th International Conference, CIAC 2021, Virtual Event, May 10-12, 2021, Proceedings, volume 12701 of Lecture Notes in Computer Science, pages 103–115. Springer, 2021.

• J. Bensmail, F. Fioravantes, and N. Nisse. On proper labellings of graphs with minimum label sum. In Combinatorial Algorithms -31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, volume 12126 of Lecture Notes in Computer Science, pages 56–68. Springer, 2020.