Here is a link to my DBLP page.
In Journals
- P. Ashok, F. V. Fomin, S. Kolay, S. Saurabh, M. Zehavi: “Exact Algorithms for Terrain Guarding”, ACM Transactions on Algorithms 14(2), pp. 25:1-25:20 (2018)
- P. Ashok, A. Dudeja, S. Kolay: “Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs”, Siam Journal on Discrete Mathematics 32(2), pp. 1189-1208 (2018).
- P. Ashok, S. Kolay, S. Saurabh: “Multivariate Complexity Analysis of Geometric Red
Blue Set Cover”, Algorithmica, pp. 79(3): 667-697 (2017).
- S. Kolay, D. Lokshtanov, F. Panolan, S. Saurabh: “Quick but Odd Growth of Cacti”,
Algorithmica, pp. 79(1): 271-290 (2017).
- P. Ashok, S. Kolay, S. M. Meesum, S. Saurabh:``Parameterized complexity of Strip Packing and Minimum Volume Packing'', Theoretical Computer Science 661, 2017, pp. 56-64.
- E. Ghosh, S. Kolay, M. Kumar, P. Misra, F. Panolan, A. Rai, M. S. Ramanujan : ``Faster Parameterized Algorithms for Deletion to Split Graphs'', Algorithmica 71(4), 2015, pp. 989-1006.
- G. K. Das, M. De, S. Kolay, S.C. Nandy, S. Sur-Kolay:``Approximation Algorithms for Maximum Independent Set of a Unit Disk Graph'', Information Processing Letters 115(3), 2015, pp. 439-446.
In Peer-reviewed Conferences
- A. Bishnu, A. Ghosh, S. Kolay, G. Mishra, S. Saurabh: “Parameterized Query Complexity of Hitting Set
using Stability of Sunflowers”, To appear in ISAAC 2018.
- M.D. Berg, H. Bodlaender, S. Kisfaludi-Bak, S. Kolay: “An ETH-Tight Exact Algorithm for Euclidean TSP”, To appear in FOCS 2018, .
- A. Ghosh, S. Kolay, G. Mishra: “FPT algorithms for embedding into low complexity graphic metrics”, Proc. ESA 2018, pp. 35:1-35:13.
- J. D. Boissonnat, K. Dutta, A. Ghosh, S. Kolay: “Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set”, Proc. LATIN 2018, pp. 187-200.
- J. D. Boissonnat, K. Dutta, A. Ghosh, S. Kolay: “Kernelization of the Subset General Position Problem in Geometry”, Proc. MFCS 2017, pp. 25:1-25:13.
- S. Kolay, F. Panolan, S. Saurabh: “Communication Complexity of Pairs of Graph Families with Applications”, Proc. MFCS 2017, pp. 13:1-13:13.
- A. Agrawal, S. Kolay, S. Saurabh, R. Sharma: ``Kernelizing Buttons and Scissors", Proc. CCCG 2016, pp: 279-286.
- S. Kolay, F. Panolan, V. Raman, S. Saurabh: ``Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-graphs'', Proc. MFCS 2016, pp: 75:1-75:13.
- S. Kolay, R. Pandurangan, F. Panolan, V. Raman, P. Tale: ``Harmonious Coloring: Parameterized Algorithms and Upper bounds'', Proc. WG 2016, pp: 245-256.
- F. Fomin, S. Kolay, D. Lokshtanov, F. Panolan, S. Saurabh: ``Subexponential Algorithms for rectilinear Steiner tree and arborescence problems'', Proc. SOCG 2016, pp. 39:1-39:15.
- A. Agrawal, D. Lokshtanov, S. Kolay, S. Saurabh: ``A faster FPT Algorithm and a smaller kernel for Block Graph Vertex Deletion'', Proc. LATIN 2016, pp. 1-13.
- S. Kolay, F. Panolan: ``Parameterized Algorithms for Deletion to (r, l)-graphs'', Proc. FSTTCS 2015, pp. 420-433.
- P. Ashok, S. Kolay, N. Misra, S. Saurabh: ``Unique Covering Problems with Geometric Sets'', Proc. COCOON 2015, pp. 548-558.
- S. Kolay, P. Misra, M. S. Ramanujan, S. Saurabh : "Parameterized Approximation via d-Skew Symmetric Multicut", Proc. MFCS 2014}, pp. 457-468.
- A. Giannopoulou, S. Kolay, S Saurabh : ``New Lower Bound on Max-Cut of Hypergraphs with an application to r-Set Splitting'', Proc. 10th Latin American Symposium on Theoretical Informatics (LATIN 2012), LNCS vol. 7256, pp. 408-419.