On the Role of 3's for the 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney (CIAC, 2021)

Further results on an equitable 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse (Discret. Appl. Math., 2021)

On BMRN*-colouring of planar digraphs. - Julien Bensmail; Foivos Fioravantes (Discret. Math. Theor. Comput. Sci., 2021)

On the role of 3s for the 1-2-3 Conjecture. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney (Theor. Comput. Sci., 2021)

Complexity of Finding Maximum Locally Irregular Induced Subgraphs. - Foivos Fioravantes; Nikolaos Melissinos; Theofilos Triommatis (SWAT, 2022)

The Largest Connected Subgraph Game. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse (Algorithmica, 2022)

On Proper Labellings of Graphs with Minimum Label Sum. - Julien Bensmail; Foivos Fioravantes; Nicolas Nisse (Algorithmica, 2022)

Edge-labellings, vertex-colourings and combinatorial games on graphs. (Étiquetages d'arêtes, colorations de sommets et jeux combinatoires sur des graphes). - Foivos Fioravantes (2022)

Recontamination Helps a Lot to Hunt a Rabbit. - Thomas Dissaux; Foivos Fioravantes; Harmender Gahlawat; Nicolas Nisse (MFCS, 2023)

Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (CoRR, 2023)

The Maker-Breaker Largest Connected Subgraph game. - Julien Bensmail; Foivos Fioravantes; Fionn Mc Inerney; Nicolas Nisse; Nacim Oijid (Theor. Comput. Sci., 2023)

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (AAAI, 2024)

Parameterised Distance to Local Irregularity. - Foivos Fioravantes; Nikolaos Melissinos; Theofilos Triommatis (IPEC, 2024)

On proper 2-labellings distinguishing by sums, multisets or products. - Julien Bensmail; Foivos Fioravantes (Discuss. Math. Graph Theory, 2024)

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size. - Foivos Fioravantes; Harmender Gahlawat; Nikolaos Melissinos (AAAI, 2025)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler (AAAI, 2025)

Solving Multiagent Path Finding on Highly Centralized Networks. - Foivos Fioravantes; Dusan Knop; Jan Matyás Kristan; Nikolaos Melissinos; Michal Opler; Tung Anh Vu (AAAI, 2025)

Eliminating Majority Illusion. - Foivos Fioravantes; Abhiruk Lahiri; Antonio Lauerbach; Lluís Sabater; Marie Diana Sieper; Samuel Wolf (AAMAS, 2025)

Maximum locally irregular induced subgraphs via minimum irregulators. - Foivos Fioravantes; Nikolaos Melissinos; Theofilos Triommatis (Discret. Appl. Math., 2025)

Further results on the Hunters and Rabbit game through monotonicity. - Thomas Dissaux; Foivos Fioravantes; Harmender Gahlawat; Nicolas Nisse (Inf. Comput., 2025)

Exact Algorithms for Distance to Unique Vertex Cover. - Foivos Fioravantes; Dusan Knop; Nikolaos Melissinos; Michal Opler; Manolis Vasilakis (CoRR, 2025)

Eliminating Majority Illusions. - Foivos Fioravantes; Abhiruk Lahiri; Antonio Lauerbach; Lluís Sabater; Marie Diana Sieper; Samuel Wolf (CoRR, 2025)

Parameterized Complexity of Directed Traveling Salesman Problem. - Václav Blazej; Andreas Emil Feldmann; Foivos Fioravantes; Pawel Rzazewski; Ondrej Suchý 001 (CoRR, 2025)

When Agents Break Down in Multiagent Path Finding. - Foivos Fioravantes; Dusan Knop; Nikolaos Melissinos; Michal Opler (CoRR, 2025)