Foivos Fioravantes

PhD Student

As of October 2019, I'm a PhD Student in Computer Science at Université Côte D'Azur in the COATI team which is a joint project-team between Inria Sophia Antipolis - Méditerranée and the I3S laboratory, under the supervision of Julien Bensmail and Nicolas Nisse.

My main interests lie in theoretical Computer Science and Discrete Mathematics. I am currently working in the field of Graph Theory, exploring some of the so-called distinguishing labellings of graphs; that is functions that assign values (e.g. natural numbers) on some elements of a graph (e.g. the edges) in order to distinguish some elements (not necessarily different than the previous ones) of the same graph (e.g. the vertices).

Contact

Work Address :

Bat. Lagrange, Office L010 c,
INRIA Sophia Antipolis Méditerranée,
2004 route des Lucioles,
06902 Sophia Antipolis, France
Email:

first_name[dot]name[at]inria[dot]fr

Publications

Journals

Julien Bensmail, Foivos Fioravantes, Nicolas Nisse. On Proper Labellings of Graphs with Minimum Label Sum. Algorithmica, accepted (w/ minor revisions).
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney. On the role of 3s for the 1-2-3 Conjecture. Theoretical Computer Science.
Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse. Further Results on an Equitable 1-2-3 Conjecture. Discrete Applied Mathematics.
Julien Bensmail, Foivos Fioravantes. On BMRN*-colouring of planar graphs. Discrete Mathematics & Theoretical Computer Science.

International Conference

J. Bensmail, F. Fioravantes, F. Mc Inerney N. Nisse. The Largest Connected Subgraph Game. WG 2021, Warsaw, Poland.
J. Bensmail, F. Fioravantes, F. Mc Inerney. On the Role of 3's for the 1-2-3 Conjecture. CIAC 2021, Larnaca, Cyprus.
J. Bensmail, F. Fioravantes, N. Nisse. On Proper Labellings of Graphs with Minimum Label Sum. IWOCA 2020, Bordeaux, France.

National Conference

Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications 2021(AlgoTel 2021), Connexions ! Le jeu du plus grand sous-graphe connexe
Athens Colloquium on Algorithms and Complexity 2021(ACAC 2021), The Largest Connected Subgraph Game
Journées Graphes et Algorithmes 2020 (JGA 2020), Sur des variations de la 1-2-3 Conjecture (slides)
Journées Graphes et Algorithmes 2019 (JGA 2019), Sur la BMRN*-coloration des graphes dirigés planaires (slides)

Submitted

J. Bensmail, F. Fioravantes, F. Mc Inerney, N. Nisse, N. Oijid. The Maker-Breaker Largest Connected Subgraph Game.
F. Fioravantes, N. Melissinos, T. Triomatis. Complexity of Finding Maximum Locally Irregular Induced Subgraphs.

Teaching

Teaching assistant. Introduction aux Bases de Donées, IUT Université Côte D'Azur
Teaching assistant. Introduction à l'Interaction Homme Machine, IUT Université Côte D'Azur
Teaching assistant. Bases de la conception orientée objet, IUT Université Côte D'Azur
Co-supervision (with Julien Bensmail) of Guillaume Naffrichoux. M2 internship (1.5 months) with subject: Equitable labellings of graphs.

Projects

SticAm-Sud GALOP (2019-2020), between COATI, Univ. Federal do Ceara (UFC, Fortaleza, Brazil), and University Diego Portales (Santiago, Chile)
Graphs ALgorithms for Optimization Problems

Background

2019 : Master 2 in Ubiquitous Networking (Ubinet), Université Côte D'Azur, Nice, France.
2018 : Diploma of Applied Mathematics and Physical Sciences (SEMFE), National Technical University of Athens, Athens, Greece.

Interesting and fun video: Map of mathematics