Foivos Fioravantes

According to our database, Foivos Fioravantes authored at least 24 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

When Agents Break Down in Multiagent Path Finding.

Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler

CoRR, August, 2025

Parameterized Complexity of Directed Traveling Salesman Problem.

Václav Blazej, Andreas Emil Feldmann, Foivos Fioravantes, Pawel Rzazewski, Ondrej Suchý

CoRR, June, 2025

Eliminating Majority Illusions.

Foivos Fioravantes, Abhiruk Lahiri, Antonio Lauerbach, Lluís Sabater, Marie Diana Sieper, Samuel Wolf

CoRR, February, 2025

Exact Algorithms for Distance to Unique Vertex Cover.

Foivos Fioravantes, Dusan Knop, Nikolaos Melissinos, Michal Opler, Manolis Vasilakis

CoRR, February, 2025

Further results on the Hunters and Rabbit game through monotonicity.

Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse

Inf. Comput., 2025

Maximum locally irregular induced subgraphs via minimum irregulators.

Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis

Discret. Appl. Math., 2025

Eliminating Majority Illusion.

Foivos Fioravantes, Abhiruk Lahiri, Antonio Lauerbach, Lluís Sabater, Marie Diana Sieper, Samuel Wolf

Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Solving Multiagent Path Finding on Highly Centralized Networks.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler, Tung Anh Vu

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 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

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size.

Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos

Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024

On proper <i>2</i>-labellings distinguishing by sums, multisets or products.

Julien Bensmail, Foivos Fioravantes

Discuss. Math. Graph Theory, 2024

Parameterised Distance to Local Irregularity.

Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

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 Pathfinding: Power of Treelike Topology.

Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler

CoRR, 2023

Recontamination Helps a Lot to Hunt a Rabbit.

Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

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

PhD thesis, 2022

On Proper Labellings of Graphs with Minimum Label Sum.

Julien Bensmail, Foivos Fioravantes, Nicolas Nisse

Algorithmica, 2022

The Largest Connected Subgraph Game.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse

Algorithmica, 2022

Complexity of Finding Maximum Locally Irregular Induced Subgraphs.

Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021

On the role of 3s for the 1-2-3 Conjecture.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney

Theor. Comput. Sci., 2021

On BMRN*-colouring of planar digraphs.

Julien Bensmail, Foivos Fioravantes

Discret. Math. Theor. Comput. Sci., 2021

Further results on an equitable 1-2-3 Conjecture.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse

Discret. Appl. Math., 2021

On the Role of 3's for the 1-2-3 Conjecture.

Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021