default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFoivos Fioravantes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Foivos Fioravantes:
Edge-labellings, vertex-colourings and combinatorial games on graphs. (Étiquetages d'arêtes, colorations de sommets et jeux combinatoires sur des graphes). Côte d'Azur University, Nice, France, 2022
Journal Articles
- 2024
- [j7]Julien Bensmail
, Foivos Fioravantes:
On proper 2-labellings distinguishing by sums, multisets or products. Discuss. Math. Graph Theory 44(3): 863 (2024) - 2023
- [j6]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid:
The Maker-Breaker Largest Connected Subgraph game. Theor. Comput. Sci. 943: 102-120 (2023) - 2022
- [j5]Julien Bensmail, Foivos Fioravantes, Nicolas Nisse:
On Proper Labellings of Graphs with Minimum Label Sum. Algorithmica 84(4): 1030-1063 (2022) - [j4]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. Algorithmica 84(9): 2533-2555 (2022) - 2021
- [j3]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
Further results on an equitable 1-2-3 Conjecture. Discret. Appl. Math. 297: 1-20 (2021) - [j2]Julien Bensmail, Foivos Fioravantes:
On BMRN*-colouring of planar digraphs. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j1]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney:
On the role of 3s for the 1-2-3 Conjecture. Theor. Comput. Sci. 892: 238-257 (2021)
Conference and Workshop Papers
- 2024
- [c6]Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler:
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. AAAI 2024: 17380-17388 - 2023
- [c5]Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse:
Recontamination Helps a Lot to Hunt a Rabbit. MFCS 2023: 42:1-42:14 - 2022
- [c4]Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis:
Complexity of Finding Maximum Locally Irregular Induced Subgraphs. SWAT 2022: 24:1-24:20 - 2021
- [c3]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney:
On the Role of 3's for the 1-2-3 Conjecture. CIAC 2021: 103-115 - [c2]Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse:
The Largest Connected Subgraph Game. WG 2021: 296-307 - 2020
- [c1]Julien Bensmail, Foivos Fioravantes, Nicolas Nisse:
On Proper Labellings of Graphs with Minimum Label Sum. IWOCA 2020: 56-68
Informal and Other Publications
- 2023
- [i3]Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis:
Parameterised distance to local irregularity. CoRR abs/2307.04583 (2023) - [i2]Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse:
Further results on the Hunters and Rabbit game through monotonicity. CoRR abs/2309.16533 (2023) - [i1]Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler:
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. CoRR abs/2312.09646 (2023)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
