Foivos Fioravantes

Orcid: 0000-0001-8217-030X

According to our database1, Foivos Fioravantes authored at least 14 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
The Maker-Breaker Largest Connected Subgraph game.
Theor. Comput. Sci., 2023

Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology.
CoRR, 2023

Further results on the Hunters and Rabbit game through monotonicity.
CoRR, 2023

Parameterised distance to local irregularity.
CoRR, 2023

Recontamination Helps a Lot to Hunt a Rabbit.
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).
PhD thesis, 2022

On Proper Labellings of Graphs with Minimum Label Sum.
Algorithmica, 2022

The Largest Connected Subgraph Game.
Algorithmica, 2022

Complexity of Finding Maximum Locally Irregular Induced Subgraphs.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2021
On the role of 3s for the 1-2-3 Conjecture.
Theor. Comput. Sci., 2021

On BMRN*-colouring of planar digraphs.
Discret. Math. Theor. Comput. Sci., 2021

Further results on an equitable 1-2-3 Conjecture.
Discret. Appl. Math., 2021

On the Role of 3's for the 1-2-3 Conjecture.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021


  Loading...