Spremljaj
Sudeshna Kolay
Sudeshna Kolay
IIT Kharagpur
Preverjeni e-poštni naslov na cse.iitkgp.ac.in - Domača stran
Naslov
Navedeno
Navedeno
Leto
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
462015
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: 12th Latin American Symposium, Ensenada …, 2016
292016
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
262018
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
252018
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
212015
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
192012
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
182020
Parameterized algorithms for deletion to (r, l)-graphs
S Kolay, F Panolan
arXiv preprint arXiv:1504.08120, 2015
162015
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
132018
Parameterized complexity of conflict-free graph coloring
HL Bodlaender, S Kolay, A Pieterse
SIAM Journal on Discrete Mathematics 35 (3), 2003-2038, 2021
122021
Unique covering problems with geometric sets
P Ashok, S Kolay, N Misra, S Saurabh
International Computing and Combinatorics Conference, 548-558, 2015
122015
Quick but odd growth of cacti
S Kolay, D Lokshtanov, F Panolan, S Saurabh
Algorithmica 79 (1), 271-290, 2017
112017
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
112015
Multivariate complexity analysis of geometric red blue set cover
P Ashok, S Kolay, S Saurabh
Algorithmica 79 (3), 667-697, 2017
102017
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
102016
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
Mathematical Foundations of Computer Science 2014: 39th International …, 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
A Study on the Ramanujan Graph Property of Winning Lottery Tickets
B Pal, A Biswas, S Kolay, P Mitra, B Basu
International Conference on Machine Learning, 17186-17201, 2022
32022
Fixed parameter tractability of graph deletion problems over data streams
A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh
International Computing and Combinatorics Conference, 652-663, 2020
32020
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20