17 citations · 58 across the 18 of their papers we have counts for
23 papers
Convex Polygons in Cartesian Products
Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans +4
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of real numbers (for short, \emph{grid}). First, we prove that every…
Improved Bounds for Guarding Plane Graphs with Edges
Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms +1
An "edge guard set" of a plane graph is a subset of edges of such that each face of is incident to an endpoint of an edge in . Such a set is said to guard . W…
Routing on the Visibility Graph
Prosenjit Bose, Matias Korman, André van Renssen +1
We consider the problem of routing on a network in the presence of line segment constraints (i.e., obstacles that edges in our network are not allowed to cross). Let be a set o…
Reconstructing a convex polygon from its -cloud
Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel +1
An -wedge is the closed set of points contained between two rays that are emanating from a single point (the apex), and are separated by an angle . Given a convex polygon…
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…