Obserwuj
Sudeshna Kolay
Sudeshna Kolay
IIT Kharagpur
Zweryfikowany adres z cse.iitkgp.ac.in - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
472015
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
362016
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
312018
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
272018
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
242015
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
212020
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
202012
Parameterized algorithms for deletion to (r, l)-graphs
S Kolay, F Panolan
arXiv preprint arXiv:1504.08120, 2015
192015
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
162022
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
152015
Parameterized query complexity of hitting set using stability of sunflowers
A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh
29th International Symposium on Algorithms and Computation (ISAAC 2018), 25 …, 2018
142018
Parameterized complexity of conflict-free graph coloring
HL Bodlaender, S Kolay, A Pieterse
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
132019
Quick but odd growth of cacti
S Kolay, D Lokshtanov, F Panolan, S Saurabh
Algorithmica 79 (1), 271-290, 2017
132017
Unique covering problems with geometric sets
P Ashok, S Kolay, N Misra, S Saurabh
International Computing and Combinatorics Conference, 548-558, 2015
132015
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 -graphs
S Kolay, F Panolan, V Raman, S Saurabh
arXiv preprint arXiv:1512.04200, 2015
82015
Parameterized complexity of conflict-free graph coloring
HL Bodlaender, S Kolay, A Pieterse
SIAM Journal on Discrete Mathematics 35 (3), 2003-2038, 2021
72021
Parameter analysis for guarding terrains
A Agrawal, S Kolay, M Zehavi
Algorithmica 84 (4), 961-981, 2022
62022
Faster graph bipartization
S Kolay, P Misra, MS Ramanujan, S Saurabh
Journal of Computer and System Sciences 109, 45-55, 2020
62020
Parameterized complexity of strip packing and minimum volume packing
P Ashok, S Kolay, SM Meesum, S Saurabh
Theoretical Computer Science 661, 56-64, 2017
62017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20