9 citations · 10 across the 12 of their papers we have counts for
3 papers · 1 filter
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology
Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan +2
In the Multiagent Path Finding problem (MAPF for short), we focus on efficiently finding non-colliding paths for a set of agents on a given graph , where each agent seeks a…
Further results on the Hunters and Rabbit game through monotonicity
Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat +1
Hunters and Rabbit game is played on a graph where the Hunter player shoots at vertices in every round while the Rabbit player occupies an unknown vertex and, if not shot,…
Parameterised distance to local irregularity
Foivos Fioravantes, Nikolaos Melissinos, Theofilos Triommatis
A graph is \emph{locally irregular} if no two of its adjacent vertices have the same degree. In [Fioravantes et al. Complexity of finding maximum locally irregular induced subg…