| 2024 | ADC | α-Persistent Temporal Clique Enumeration with an Application. | Bithika Pal, Sudeshna Kolay, Suman Banerjee |
| 2024 | ISAAC | Knapsack with Vertex Cover, Set Cover, and Hitting Set. | Palash Dey, Ashlesha Hota, Sudeshna Kolay, Sipra Singh |
| 2024 | LATIN | Knapsack: Connectedness, Path, and Shortest-Path. | Palash Dey, Sudeshna Kolay, Sipra Singh |
| 2023 | ISAAC | Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. | Anubhav Dhar, Soumita Hait, Sudeshna Kolay |
| 2022 | ICML | A Study on the Ramanujan Graph Property of Winning Lottery Tickets. | Bithika Pal, Arindam Biswas, Sudeshna Kolay, Pabitra Mitra, Biswajit Basu |
| 2020 | COCOON | Fixed Parameter Tractability of Graph Deletion Problems over Data Streams. | Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh |
| 2019 | ISAAC | Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices. | Akanksha Agrawal, Sudeshna Kolay, Jayakrishnan Madathil, Saket Saurabh |
| 2019 | WADS | Parameterized Complexity of Conflict-Free Graph Coloring. | Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse |
| 2018 | ESA | FPT Algorithms for Embedding into Low Complexity Graphic Metrics. | Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra |
| 2018 | FOCS | An ETH-Tight Exact Algorithm for Euclidean TSP. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak, Sudeshna Kolay |
| 2018 | ISAAC | Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. | Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh |
| 2018 | LATIN | Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set. | Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay |
| 2017 | MFCS | Kernelization of the Subset General Position Problem in Geometry. | Jean-Daniel Boissonnat, Kunal Dutta, Arijit Ghosh, Sudeshna Kolay |
| 2017 | MFCS | Communication Complexity of Pairs of Graph Families with Applications. | Sudeshna Kolay, Fahad Panolan, Saket Saurabh |
| 2016 | LATIN | A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion. | Akanksha Agrawal, Sudeshna Kolay, Daniel Lokshtanov, Saket Saurabh |
| 2016 | LATIN | Parameterized Complexity of Red Blue Set Cover for Lines. | Pradeesha Ashok, Sudeshna Kolay, Saket Saurabh |
| 2016 | MFCS | Parameterized Algorithms on Perfect Graphs for Deletion to (r, l)-Graphs. | Sudeshna Kolay, Fahad Panolan, Venkatesh Raman, Saket Saurabh |
| 2016 | WG | Harmonious Coloring: Parameterized Algorithms and Upper Bounds. | Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale |
| 2015 | COCOON | Unique Covering Problems with Geometric Sets. | Pradeesha Ashok, Sudeshna Kolay, Neeldhara Misra, Saket Saurabh |
| 2015 | ISAAC | Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. | Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay |
| 2014 | MFCS | Parameterized Approximations via d-Skew-Symmetric Multicut. | Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2012 | LATIN | New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. | Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh |