J. Keil

activity

20182024

collaborators

Showing 2022Show all

3 papers · 1 filter

cs.CG2022

Improved and Generalized Algorithms for Burning a Planar Point Set

Prashant Gokhale, J. Mark Keil, Debajyoti Mondal

Given a set $P$ of points in the plane, a point burning process is a discrete time process to burn all the points of $P$ where fires must be initiated at the given points. Specific…

cs.CG2022

Minimum Ply Covering of Points with Unit Squares

Stephane Durocher, J. Mark Keil, Debajyoti Mondal

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes t…

cs.CG2022

Burning Number for the Points in the Plane

J. Mark Keil, Debajyoti Mondal, Ehsan Moradi

The burning process on a graph $G$ starts with a single burnt vertex, and at each subsequent step, burns the neighbors of the currently burnt vertices, as well as one other unburnt…