Sudeshna Kolay

activity

20152026

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

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

collaborators

Showing cs.CGShow all

3 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.CG2023

Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets

Anubhav Dhar, Soumita Hait, Sudeshna Kolay

The Euclidean Steiner Minimal Tree problem takes as input a set $P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of…

cs.CG2020

Parameterized Study of Steiner Tree on Unit Disk Graphs

Sujoy Bhore, Paz Carmi, Sudeshna Kolay +1

We study the Steiner Tree problem on unit disk graphs. Given a $n$ vertex unit disk graph $G$ , a subset $R \subseteq V (G)$ of $t$ vertices and a positive integer $k$ , the objective…