3 papers
cs.DM2024
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…
math.CO2024
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…
cs.CG2024
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…