1 citations · 1 across the 7 of their papers we have counts for
8 papers
On the Spanning Ratio of the Greedy Triangulation for Convex Point Sets
Prosenjit Bose, Jean Lou de Carufel, Anil Maheshwari +3
The greedy triangulation of a finite planar point set is obtained by considering all segments in nondecreasing order of length and inserting each segment that does not cross an ear…
3-packings in Triangulations: Algorithms, bounds, and Complexity
Prosenjit Bose, Anil Maheshwari, Bobby Miraftab +1
We study -packings in plane triangulations for the three-vertex graphs . For a graph , let denote the maximum size of an -packing in…
The basis number of 1-planar graphs
Saman Bazargani, Therese Biedl, Prosenjit Bose +2
Let be a set of Eulerian subgraphs of a graph . We say forms a -basis if it is a minimum set that generates the cycle space of , and any edge of lies in at mos…
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…
Sparse graphs with local covering conditions on edges
Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari +1
In 1988, Erdős suggested the question of minimizing the number of edges in a connected -vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman…
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…
On Separating Path and Tree Systems in Graphs
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel +6
We explore the concept of separating systems of vertex sets of graphs. A separating system of a set is a collection of subsets of such that for any pair of distinct element…