Sudeshna Kolay
Indian Institute of Technology Kharagpur
H-index: 11
Asia-India
Top articles of Sudeshna Kolay
Knapsack: Connectedness, path, and shortest-path
2024/3/6
Palash Dey
H-Index: 3
Sudeshna Kolay
H-Index: 8
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
Theory of Computing Systems
2023/12
Arijit Ghosh
H-Index: 8
Sudeshna Kolay
H-Index: 8
Almost optimal query algorithm for hitting set using a subset query
Journal of Computer and System Sciences
2023/11/1
Arijit Ghosh
H-Index: 8
Sudeshna Kolay
H-Index: 8
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets
arXiv preprint arXiv:2307.00254
2023/7/1
Sudeshna Kolay
H-Index: 8
An ETH-Tight Exact Algorithm for Euclidean TSP
SIAM Journal on Computing
2023/6/30
Mark De Berg
H-Index: 19
Sudeshna Kolay
H-Index: 8
Parameterized study of steiner tree on unit disk graphs
Algorithmica
2023/1
Sudeshna Kolay
H-Index: 8
A study on the ramanujan graph property of winning lottery tickets
2022/6/28
Bithika Pal
H-Index: 3
Arindam Biswas
H-Index: 4
Sudeshna Kolay
H-Index: 8
Pabitra Mitra
H-Index: 30
Biswajit Basu
H-Index: 34
Parameter analysis for guarding terrains
Algorithmica
2022/4
Sudeshna Kolay
H-Index: 8
Exact Multi-Covering Problems with Geometric Sets
Theory of Computing Systems
2022/2
Parameterized complexity of conflict-free graph coloring
SIAM Journal on Discrete Mathematics
2021
Sudeshna Kolay
H-Index: 8
Fixed parameter tractability of graph deletion problems over data streams
2020/8/27
Arijit Ghosh
H-Index: 8
Sudeshna Kolay
H-Index: 8
Faster graph bipartization
Journal of Computer and System Sciences
2020/5/1
Sudeshna Kolay
H-Index: 8
Subexponential algorithms for rectilinear Steiner tree and arborescence problems
ACM Transactions on Algorithms (TALG)
2020/3/5
Co-Authors
