3 citations · 4 across the 8 of their papers we have counts for
8 papers
An Improved Bound for Plane Covering Paths
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz +8
A covering path for a finite set of points in the plane is a polygonal path such that every point of lies on a segment of the path. The vertices of the path need not be at…
Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
Prosenjit Bose, Jean-Lou De Carufel, John Stuart
A Delaunay graph built on a planar point set has an edge between two vertices when there exists a disk with the two vertices on its boundary and no vertices in its interior. When t…
Noncrossing Longest Paths and Cycles
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose +7
Edge crossings in geometric graphs are sometimes undesirable as they could lead to unwanted situations such as collisions in motion planning and inconsistency in VLSI layout. Short…
On 1-Planar Graphs with Bounded Cop-Number
Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari +1
Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and l…
Computing shortest paths amid non-overlapping weighted disks
Prosenjit Bose, Jean-Lou De Carufel, Guillermo Esteban +1
In this article, we present an approximation algorithm for solving the Weighted Region Problem amidst a set of non-overlapping weighted disks in the plane. For a given parame…
Expected Complexity of Routing in 6 and Half- 6 Graphs
Prosenjit Bose, Jean-Lou de Carufel, Olivier Devillers
We study online routing algorithms on the 6-graph and the half-6-graph (which is equivalent to a variant of the Delaunay triangulation). Given a source vertex s and a target…