Get started
Author

Sudeshna Kolay

Observed names: Kolay Sudeshna, Kolay, S, Kolay, Sudeshna
ORCID: 0000-0002-2975-4856
Observed ORCID: 0000-0002-2975-4856
OpenAlex ID: A5000594690
Faster Parameterized Algorithms for Deletion to Split Graphs
2013 · Esha Ghosh, Sudeshna Kolay, et al. · Algorithmica · 42
Approximation algorithms for maximum independent set of a unit disk graph
2014 · Gautam K. Das, Minati De, et al. · Information Processing Letters · 26
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
2016 · Akanksha Agrawal, Sudeshna Kolay, et al. · Lecture notes in computer science · 19
PDF
Exact Algorithms for Terrain Guarding
2018 · Pradeesha Ashok, Fedor V. Fomin, et al. · ACM Transactions on Algorithms · 17
PDF
Faster Parameterized Algorithms for Deletion to Split Graphs
2012 · Esha Ghosh, Sudeshna Kolay, et al. · Lecture notes in computer science · 16
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
2020 · Fedor V. Fomin, Daniel Lokshtanov, et al. · ACM Transactions on Algorithms · 14
PDF
An ETH-Tight Exact Algorithm for Euclidean TSP
2018 · Mark de Berg, Hans L. Bodlaender, et al. · Annual Symposium on Foundations of Computer Science · 14
Unique Covering Problems with Geometric Sets
2015 · Pradeesha Ashok, Sudeshna Kolay, et al. · Lecture notes in computer science · 11
Quick but Odd Growth of Cacti
2017 · Sudeshna Kolay, Daniel Lokshtanov, et al. · Algorithmica · 9
PDF
Parameterized Algorithms for Deletion to (r,ell)-Graphs
2015 · Kolay, Sudeshna, Panolan, Fahad · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 9
PDF
Parameterized Complexity of Conflict-Free Graph Coloring
2019 · Hans L. Bodlaender, Sudeshna Kolay, et al. · Lecture notes in computer science · 7
PDF
Multivariate Complexity Analysis of Geometric Red Blue Set Cover
2016 · Pradeesha Ashok, Sudeshna Kolay, et al. · Algorithmica · 7
An ETH-Tight Exact Algorithm for Euclidean TSP
2023 · Mark de Berg, Hans L. Bodlaender, et al. · SIAM Journal on Computing · 5
Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs
2016 · Kolay, Sudeshna, Panolan, Fahad, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 5
PDF
Parameter Analysis for Guarding Terrains
2022 · Akanksha Agrawal, Sudeshna Kolay, et al. · Algorithmica · 4
PDF
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams
2020 · Arijit Bishnu, Arijit Ghosh, et al. · Lecture notes in computer science · 4
Faster Graph bipartization
2019 · Sudeshna Kolay, Pranabendu Misra, et al. · Journal of Computer and System Sciences · 4
Harmonious coloring: Parameterized algorithms and upper bounds
2018 · Sudeshna Kolay, Ragukumar Pandurangan, et al. · Theoretical Computer Science · 4
PDF
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs
2015 · Pradeesha Ashok, Aditi Dudeja, et al. · Lecture notes in computer science · 4
Parameterized Study of Steiner Tree on Unit Disk Graphs
2022 · Sujoy Bhore, Paz Carmi, et al. · Algorithmica · 3
Parameterized complexity of Strip Packing and Minimum Volume Packing
2016 · Pradeesha Ashok, Sudeshna Kolay, et al. · Theoretical Computer Science · 3
Parameterized Algorithms for Deletion to (r,l)-graphs
2015 · Kolay, Sudeshna, Panolan, Fahad · arXiv (Cornell University) · 3
PDF
Parameterized Approximations via d-Skew-Symmetric Multicut
2014 · Sudeshna Kolay, Pranabendu Misra, et al. · Lecture notes in computer science · 3
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers
2018 · Bishnu, Arijit, Ghosh, Arijit, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2
PDF
Harmonious Coloring: Parameterized Algorithms and Upper Bounds
2016 · Sudeshna Kolay, Ragukumar Pandurangan, et al. · Lecture notes in computer science · 2
Works count: 63
Citation count: 247
H-index: 9
I10-index: 8
Year
Topic
Type