Sudeshna Kolay

activity

20152026

most citedParameterized Algorithms for Deletion to (r,l)-graphs

3 citations · 4 across the 15 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.CG2024

Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares

Anubhav Dhar, Subham Ghosh, Sudeshna Kolay

Let $P$ be an orthogonal polygon of $n$ vertices, without holes. The Orthogonal Polygon Covering with Squares (OPCS) problem takes as input such an orthogonal polygon $P$ with inte…

cs.DS2024

Knapsack with Vertex Cover, Set Cover, and Hitting Set

Palash Dey, Ashlesha Hota, Sudeshna Kolay +1

Given an undirected graph $G = (V, E)$ , with vertex weights $(w (u))_{u \in V}$ , vertex values $(α (u))_{u \in V}$ , a knapsack size $s$ , an…