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 2023Show all

2 papers · 1 filter

cs.DS2023

Knapsack: Connectedness, Path, and Shortest-Path

Palash Dey, Sudeshna Kolay, Sipra Singh

We study the knapsack problem with graph theoretic constraints. That is, we assume that there exists a graph structure on the set of items of knapsack and the solution also needs t…

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 of points in the Euclidean plane and finds the minimum length network interconnecting all the points of…