9 citations · 10 across the 12 of their papers we have counts for
5 papers · 1 filter
Graph Irregularity via Edge Deletions
Julien Bensmail, Noémie Catherinot, Foivos Fioravantes +2
We pursue the study of edge-irregulators of graphs, which were recently introduced in [Fioravantes et al. Parametrised Distance to Local Irregularity. IPEC, 2024]. That is, we are…
When Agents Break Down in Multiagent Path Finding
Foivos Fioravantes, Dušan Knop, Nikolaos Melissinos +1
In Multiagent Path Finding (MAPF), the goal is to compute efficient, collision-free paths for multiple agents navigating a network from their sources to targets, minimizing the sch…
Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
Foivos Fioravantes, Harmender Gahlawat, Nikolaos Melissinos
Imagine we want to split a group of agents into teams in the most \emph{efficient} way, considering that each agent has their own preferences about their teammates. This scenario i…
Eliminating Majority Illusions
Foivos Fioravantes, Abhiruk Lahiri, Antonio Lauerbach +3
An opinion illusion refers to a phenomenon in social networks where agents may witness distributions of opinions among their neighbours that do not accurately reflect the true dist…
Exact Algorithms for Distance to Unique Vertex Cover
Foivos Fioravantes, Dušan Knop, Nikolaos Melissinos +2
Horiyama et al. (AAAI 2024) studied the problem of generating graph instances that possess a unique minimum vertex cover under specific conditions. Their approach involved pre-assi…