17 citations · 58 across the 18 of their papers we have counts for
4 papers · 1 filter
Constrained Routing Between Non-Visible Vertices
Prosenjit Bose, Matias Korman, André van Renssen +1
In this paper we study local routing strategies on geometric graphs. Such strategies use geometric properties of the graph like the coordinates of the current and target nodes to r…
Dynamic Graph Coloring
Luis Barba, Jean Cardinal, Matias Korman +4
In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertice…
Power domination on triangular grids
Prosenjit Bose, Claire Pennarun, Sander Verdonschot
The concept of power domination emerged from the problem of monitoring electrical systems. Given a graph G and a set S V (G), a set M of monitored vertices is built as…
On Plane Constrained Bounded-Degree Spanners
Prosenjit Bose, Rolf Fagerberg, André van Renssen +1
Let be a finite set of points in the plane and a set of non-crossing line segments with endpoints in . The visibility graph of with respect to , denoted $Vis(P,S)…