Sudeshna Kolay

Most-cited papers

Faster Parameterized Algorithms for Deletion to Split Graphs
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra +3 more
2012Algorithmica54 citations
Semantic Scholar
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
A. Agrawal, Sudeshna Kolay, D. Lokshtanov, Saket Saurabh
2015Latin American Symposium on Theoretical Informatics28 citations Open access
Semantic Scholar
An ETH-Tight Exact Algorithm for Euclidean TSP
M. de Berg, H. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018IEEE Annual Symposium on Foundations of Computer Science27 citations Open access
Semantic Scholar
Approximation algorithms for maximum independent set of a unit disk graph
G. Das, Minati De, Sudeshna Kolay, S. Nandy +1 more
2015Information Processing Letters23 citations
Semantic Scholar
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
F. Fomin, D. Lokshtanov, Sudeshna Kolay, Fahad Panolan +1 more
2020International Symposium on Computational Geometry21 citations Open access
Semantic Scholar
Parameterized Algorithms for Deletion to (r, ell)-Graphs
Sudeshna Kolay, Fahad Panolan
2015Foundations of Software Technology and Theoretical Computer Science20 citations
Semantic Scholar
Parameterized Complexity of Conflict-free Graph Coloring
H. Bodlaender, Sudeshna Kolay, A. Pieterse
2019Workshop on Algorithms and Data Structures17 citations Open access
Semantic Scholar
Exact Algorithms for Terrain Guarding
Pradeesha Ashok, F. Fomin, Sudeshna Kolay, Saket Saurabh +1 more
2018International Symposium on Computational Geometry16 citations Open access
Semantic Scholar
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra +1 more
2018International Symposium on Algorithms and Computation14 citations
Semantic Scholar
Unique Covering Problems with Geometric Sets
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2015International Computing and Combinatorics Conference13 citations
Semantic Scholar
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay
2015International Symposium on Algorithms and Computation12 citations
Semantic Scholar
A Study on the Ramanujan Graph Property of Winning Lottery Tickets
Bithika Pal, Arindam Biswas, Sudeshna Kolay, Pabitra Mitra +1 more
2022International Conference on Machine Learning11 citations
Semantic Scholar
Quick but Odd Growth of Cacti
Sudeshna Kolay, D. Lokshtanov, Fahad Panolan, Saket Saurabh
2017Algorithmica9 citations Open access
Semantic Scholar
Multivariate Complexity Analysis of Geometric Red Blue Set Cover
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2015Algorithmica9 citations
Semantic Scholar
Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs
Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
2015International Symposium on Mathematical Foundations of Computer Science9 citations
Semantic Scholar
Knapsack: Connectedness, Path, and Shortest-Path
P. Dey, Sudeshna Kolay, Sipra Singh
2023Latin American Symposium on Theoretical Informatics5 citations Open access
Semantic Scholar
Faster Graph bipartization
Sudeshna Kolay, Pranabendu Misra, M. Ramanujan, Saket Saurabh
2020Journal of computer and system sciences (Print)5 citations Open access
Semantic Scholar
Harmonious Coloring: Parameterized Algorithms and Upper Bounds
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman +1 more
2016International Workshop on Graph-Theoretic Concepts in Computer Science5 citations Open access
Semantic Scholar
Parameterized Approximations via d-Skew-Symmetric Multicut
Sudeshna Kolay, Pranabendu Misra, M. Ramanujan, Saket Saurabh
2014International Symposium on Mathematical Foundations of Computer Science5 citations
Semantic Scholar
Parameterized Study of Steiner Tree on Unit Disk Graphs
S. Bhore, Paz Carmi, Sudeshna Kolay, M. Zehavi
2020Algorithmica4 citations
Semantic Scholar
Faster Parameterized Algorithms for Deletion to Split Graphs
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra +3 more
2013Algorithmica4 citations
Semantic Scholar
Parameter Analysis for Guarding Terrains
A. Agrawal, Sudeshna Kolay, M. Zehavi
2022Algorithmica3 citations Open access
Semantic Scholar
Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra +1 more
2019International Computing and Combinatorics Conference2 citations
Semantic Scholar
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set
J. Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay
2018Latin American Symposium on Theoretical Informatics2 citations
Semantic Scholar
Almost optimal query algorithm for hitting set using a subset query
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra +1 more
2018Journal of computer and system sciences (Print)2 citations Open access
Semantic Scholar
Parameterized complexity of Strip Packing and Minimum Volume Packing
Pradeesha Ashok, Sudeshna Kolay, S. M. Meesum, Saket Saurabh
2017Theoretical Computer Science2 citations Open access
Semantic Scholar
Kernelization of the Subset General Position Problem in Geometry
J. Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay
2017International Symposium on Mathematical Foundations of Computer Science2 citations Open access
Semantic Scholar
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting
Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh
2012Latin American Symposium on Theoretical Informatics2 citations
Semantic Scholar
Minimizing Envy and Maximizing Happiness in Graphical House Allocation
A. Dhar, Ashlesha Hota, Palash Dey, Sudeshna Kolay
2025Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems1 citations Open access
Semantic Scholar
Knapsack with Vertex Cover, Set Cover, and Hitting Set
Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh
2024International Symposium on Algorithms and Computation1 citations
Semantic Scholar
Exact Multi-Covering Problems with Geometric Sets
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2021Theory of Computing Systems1 citations
Semantic Scholar
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh
2018SIAM Journal on Discrete Mathematics1 citations Open access
Semantic Scholar
Communication Complexity of Pairs of Graph Families with Applications
Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2017International Symposium on Mathematical Foundations of Computer Science1 citations
Semantic Scholar
Multivariate Complexity Analysis of Geometric Red Blue Set Cover
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2016Algorithmica1 citations
Semantic Scholar
Kernelizing Buttons and Scissors
A. Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma
2016Canadian Conference on Computational Geometry1 citations
Semantic Scholar
Parameterized Complexity of Red Blue Set Cover for Lines
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
2016Latin American Symposium on Theoretical Informatics1 citations
Semantic Scholar
Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
Palash Dey, A. Dhar, Ashlesha Hota, Sudeshna Kolay +1 more
2026arXiv.org0 citations
Semantic Scholar
On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
Aryan Sanghi, A. Dhar, Sudeshna Kolay
2026arXiv.org0 citations
Semantic Scholar
Universal Solvability for Robot Motion Planning on Graphs
A. Dhar, Pranav Nyati, T. Prasad, Ashlesha Hota +1 more
2025Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems0 citations
Semantic Scholar
Knapsack on Graphs with Relaxed Neighborhood Constraints
Palash Dey, Ashlesha Hota, Sudeshna Kolay
2025arXiv.org0 citations
Semantic Scholar
α-Persistent Temporal Clique Enumeration with an Application
Bithika Pal, Sudeshna Kolay, Suman Banerjee
2024Australasian Database Conference0 citations
Semantic Scholar
Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
A. Dhar, Subham Ghosh, Sudeshna Kolay
2024arXiv.org0 citations
Semantic Scholar
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets
A. Dhar, Soumita Hait, Sudeshna Kolay
2023International Symposium on Algorithms and Computation0 citations Open access
Semantic Scholar
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra +1 more
2023Theory of Computing Systems0 citations Open access
Semantic Scholar
Exact Multi-Covering Problems with Geometric Sets
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
2021Theory of Computing Systems0 citations
Semantic Scholar
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices
A. Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh
2019International Symposium on Algorithms and Computation0 citations
Semantic Scholar
Structural Parameterization for Graph Deletion Problems over Data Streams
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra +1 more
20190 citations
Semantic Scholar
Communication Complexity and Graph Families
Sudeshna Kolay, Fahad Panolan, Saket Saurabh
2019ACM Transactions on Computation Theory0 citations
Semantic Scholar
FPT Algorithms for Embedding into Low-Complexity Graphic Metrics
Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
2018Embedded Systems and Applications0 citations Open access
Semantic Scholar
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada
Erin W. Chambers, D. Eppstein, M. Smid, S. Langerman +45 more
2017Canadian Conference on Computational Geometry0 citations
Semantic Scholar