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

3 papers · 1 filter

cs.CG2018★ 1 cited

An ETH-Tight Exact Algorithm for Euclidean TSP

Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak +1

We study exact algorithms for Euclidean TSP in $R^{d}$ . In the early 1990s algorithms with $n^{O (n)}$ running time were presented for the planar case, and some years…

cs.DS2018

Almost optimal query algorithm for hitting set using a subset query

Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay +2

Given access to the hypergraph through a subset query oracle in the query model, we give sublinear time algorithms for Hitting-Set with almost tight parameterized query complexity.…

cs.CG2018

FPT algorithms for embedding into low complexity graphic metrics

Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra

The Metric Embedding problem takes as input two metric spaces $(X, D_{X})$ and $(Y, D_{Y})$ , and a positive integer $d$ . The objective is to determine whether there is an embedding $F:X…