Follow
Sudeshna Kolay
Sudeshna Kolay
Verified email at cse.iitkgp.ac.in - Homepage
Title
Cited by
Cited by
Year
Faster parameterized algorithms for deletion to split graphs
E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan
Algorithmica 71 (4), 989-1006, 2015
422015
Exact algorithms for terrain guarding
P Ashok, FV Fomin, S Kolay, S Saurabh, M Zehavi
ACM Transactions on Algorithms (TALG) 14 (2), 1-20, 2018
222018
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
A Agrawal, S Kolay, D Lokshtanov, S Saurabh
LATIN 2016: theoretical informatics, 1-13, 2016
222016
Approximation algorithms for maximum independent set of a unit disk graph
GK Das, M De, S Kolay, SC Nandy, S Sur-Kolay
Information Processing Letters 115 (3), 439-446, 2015
192015
An ETH-tight exact algorithm for Euclidean TSP
M de Berg, HL Bodlaender, S Kisfaludi-Bak, S Kolay
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
182018
Faster parameterized algorithms for deletion to split graphs
E Ghosh, S Kolay, M Kumar, P Misra, F Panolan, A Rai, MS Ramanujan
Scandinavian Workshop on Algorithm Theory, 107-118, 2012
182012
Parameterized Algorithms for Deletion to (r, l)-Graphs
S Kolay, F Panolan
arXiv preprint arXiv:1504.08120, 2015
142015
Subexponential algorithms for rectilinear Steiner tree and arborescence problems
F Fomin, S Kolay, D Lokshtanov, F Panolan, S Saurabh
32nd International Symposium on Computational Geometry (SoCG 2016), 2016
102016
Exact and FPT algorithms for max-conflict free coloring in hypergraphs
P Ashok, A Dudeja, S Kolay
International Symposium on Algorithms and Computation, 271-282, 2015
102015
Unique covering problems with geometric sets
P Ashok, S Kolay, N Misra, S Saurabh
International Computing and Combinatorics Conference, 548-558, 2015
102015
Parameterized complexity of conflict-free graph coloring
HL Bodlaender, S Kolay, A Pieterse
SIAM Journal on Discrete Mathematics 35 (3), 2003-2038, 2021
92021
Quick but odd growth of cacti
S Kolay, D Lokshtanov, F Panolan, S Saurabh
Algorithmica 79 (1), 271-290, 2017
92017
Parameterized algorithms on perfect graphs for deletion to (r, l)-graphs
S Kolay, F Panolan, V Raman, S Saurabh
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
92016
Subexponential algorithms for rectilinear Steiner tree and arborescence problems
FV Fomin, D Lokshtanov, S Kolay, F Panolan, S Saurabh
ACM Transactions on Algorithms (TALG) 16 (2), 1-37, 2020
72020
Parameterized query complexity of hitting set using stability of sunflowers
A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh
arXiv preprint arXiv:1807.06272, 2018
72018
Multivariate complexity analysis of geometric red blue set cover
P Ashok, S Kolay, S Saurabh
Algorithmica 79 (3), 667-697, 2017
52017
Parameter analysis for guarding terrains
A Agrawal, S Kolay, M Zehavi
Algorithmica 84 (4), 961-981, 2022
42022
Parameterized Approximations via d-Skew-Symmetric Multicut
S Kolay, P Misra, MS Ramanujan, S Saurabh
International Symposium on Mathematical Foundations of Computer Science, 457-468, 2014
42014
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting
AC Giannopoulou, S Kolay, S Saurabh
Latin American Symposium on Theoretical Informatics, 408-419, 2012
42012
Harmonious coloring: Parameterized algorithms and upper bounds
S Kolay, R Pandurangan, F Panolan, V Raman, P Tale
Theoretical Computer Science 772, 132-142, 2019
32019
The system can't perform the operation now. Try again later.
Articles 1–20