2 papers
math.CO2025
Hunting a rabbit: complexity, approximability and some characterizations
Walid Ben-Ameur, Harmender Gahlawat, Alessandro Maddaloni
In the Hunters and Rabbit game, hunters attempt to shoot an invisible rabbit on a given graph . In each round, the hunters select vertices to shoot at, while the rabbit…
cs.CC2024
Complexity results for a cops and robber game on directed graphs
Walid Ben-Ameur, Alessandro Maddaloni
We investigate a cops and robber game on directed graphs, where the robber moves along the arcs of the graph, while the cops can select any position at each time step. Our main foc…