Sudeshna Kolay

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 48

Top Topics

Parameterized Complexity

Top Venues

Publications

Palash Dey, Sudeshna Kolay, Sipra Singh
Knapsack: Connectedness, Path, and Shortest-Path. LATIN (2) (2024)
Anubhav Dhar, Subham Ghosh, Sudeshna Kolay
Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares. CoRR (2024)
Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh
Knapsack with Vertex Cover, Set Cover, and Hitting Set. CoRR (2024)
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. Theory Comput. Syst. 67 (6) (2023)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. Algorithmica 85 (1) (2023)
Palash Dey, Sudeshna Kolay, Sipra Singh
Knapsack: Connectedness, Path, and Shortest-Path. CoRR (2023)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. 52 (3) (2023)
Anubhav Dhar, Soumita Hait, Sudeshna Kolay
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. ISAAC (2023)
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
Almost optimal query algorithm for hitting set using a subset query. J. Comput. Syst. Sci. 137 (2023)
Anubhav Dhar, Soumita Hait, Sudeshna Kolay
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. CoRR (2023)
Bithika Pal, Arindam Biswas, Sudeshna Kolay, Pabitra Mitra, Biswajit Basu
A Study on the Ramanujan Graph Property of Winning Lottery Tickets. ICML (2022)
Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
Parameter Analysis for Guarding Terrains. Algorithmica 84 (4) (2022)
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
Exact Multi-Covering Problems with Geometric Sets. Theory Comput. Syst. 66 (1) (2022)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. 35 (3) (2021)
Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16 (2) (2020)
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. COCOON (2020)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. CoRR (2020)
Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Faster Graph bipartization. J. Comput. Syst. Sci. 109 (2020)
Sujoy Bhore, Paz Carmi, Sudeshna Kolay, Meirav Zehavi
Parameterized Study of Steiner Tree on Unit Disk Graphs. SWAT (2020)
Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi
Parameter Analysis for Guarding Terrains. SWAT (2020)
Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
FPT Algorithms for Embedding into Low-Complexity Graphic Metrics. ACM Trans. Comput. Theory 12 (1) (2020)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-Free Graph Coloring. WADS (2019)
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
Harmonious coloring: Parameterized algorithms and upper bounds. Theor. Comput. Sci. 772 (2019)
Sudeshna Kolay, Fahad Panolan, Saket Saurabh
Communication Complexity and Graph Families. ACM Trans. Comput. Theory 11 (2) (2019)
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams. CoRR (2019)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-free Graph Coloring. CoRR (2019)
Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh
Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. ISAAC (2019)
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. ISAAC (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR (2018)
Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. LATIN (2018)
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. SIAM J. Discret. Math. 32 (2) (2018)
Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
FPT algorithms for embedding into low complexity graphic metrics. CoRR (2018)
Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra
FPT Algorithms for Embedding into Low Complexity Graphic Metrics. ESA (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS (2018)
Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh
Parameterized Query Complexity of Hitting Set using Stability of Sunflowers. CoRR (2018)
Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
Exact Algorithms for Terrain Guarding. ACM Trans. Algorithms 14 (2) (2018)
Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
Quick but Odd Growth of Cacti. Algorithmica 79 (1) (2017)
Sudeshna Kolay, Fahad Panolan, Saket Saurabh
Communication Complexity of Pairs of Graph Families with Applications. MFCS (2017)
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
Multivariate Complexity Analysis of Geometric Red Blue Set Cover. Algorithmica 79 (3) (2017)
Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi
Exact Algorithms for Terrain Guarding. SoCG (2017)
Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay
Kernelization of the Subset General Position Problem in Geometry. MFCS (2017)
Pradeesha Ashok, Sudeshna Kolay, Syed Mohammad Meesum, Saket Saurabh
Parameterized complexity of Strip Packing and Minimum Volume Packing. Theor. Comput. Sci. 661 (2017)
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
Parameterized Complexity of Red Blue Set Cover for Lines. LATIN (2016)
Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma
Kernelizing Buttons and Scissors. CCCG (2016)
Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. LATIN (2016)
Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale
Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG (2016)
Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. MFCS (2016)
Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. SoCG (2016)
Sudeshna Kolay, Fahad Panolan
Parameterized Algorithms for Deletion to (r, ell)-Graphs. FSTTCS (2015)
Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh
Multivariate Complexity Analysis of Geometric {\sc Red Blue Set Cover}. CoRR (2015)
Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh
Parameterized Algorithms on Perfect Graphs for deletion to (r, ℓ)-graphs. CoRR (2015)
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. ISAAC (2015)
Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh
Unique Covering Problems with Geometric Sets. COCOON (2015)
Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
Quick but Odd Growth of Cacti. IPEC (2015)
Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay
Approximation algorithms for maximum independent set of a unit disk graph. Inf. Process. Lett. 115 (3) (2015)
Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh
A faster FPT Algorithm and a smaller Kernel for Block Graph Vertex Deletion. CoRR (2015)
Sudeshna Kolay, Fahad Panolan
Parameterized Algorithms for Deletion to (r, l)-graphs. CoRR (2015)
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
Faster Parameterized Algorithms for Deletion to Split Graphs. Algorithmica 71 (4) (2015)
Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh
Parameterized Approximations via d-Skew-Symmetric Multicut. MFCS (2) (2014)
Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. LATIN (2012)
Esha Ghosh, Sudeshna Kolay, Mrinal Kumar, Pranabendu Misra, Fahad Panolan, Ashutosh Rai, M. S. Ramanujan
Faster Parameterized Algorithms for Deletion to Split Graphs. SWAT (2012)