2 papers
cs.DM2024
Fast winning strategies for the attacker in eternal domination
Guillaume Bagan, Nicolas Bousquet, Nacim Oijid +1
Dominating sets in graphs are often used to model some monitoring of the graph: guards are posted on the vertices of the dominating set, and they can thus react to attacks occurrin…
cs.CG2023
Reconfiguration of plane trees in convex geometric graphs
Nicolas Bousquet, Lucas De Meyer, Théo Pierron +1
A non-crossing spanning tree of a set of points in the plane is a spanning tree whose edges pairwise do not cross. Avis and Fukuda in 1996 proved that there always exists a flip se…