8 citations · 10 across the 2 of their papers we have counts for
4 papers · 1 filter
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…
On the Average Number of Edges in Theta Graphs
Pat Morin, Sander Verdonschot
Theta graphs are important geometric graphs that have many applications, including wireless networking, motion planning, real-time animation, and minimum-spanning tree construction…
On the stretch factor of the Theta-4 graph
Luis Barba, Prosenjit Bose, Jean-Lou De Carufel +2
In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a path between any pair of vertices in this graph whose length is at most a constant…