1 citations · 1 across the 2 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2022
Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh +2
Suppose we are given a pair of points and a set of geometric objects in the plane, called obstacles. We show that in polynomial time one can construct an auxiliary (…
cs.CG2021
The Maximum Exposure Problem
Neeraj Kumar, Stavros Sintos, Subhash Suri
Given a set of points and axis-aligned rectangles in the plane, a point is called \emph{exposed} if it lies outside all rectangles in . In…
cs.CG2020
A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh +1
Given two points s and t in the plane and a set of obstacles defined by closed curves, what is the minimum number of obstacles touched by a path connecting s and t? This is a funda…