Ancestrally from Paschim Medinipur, West Bengal. I am currently working as an assistant professor in the Department of Computer Science at IISER Berhampur, Odisha since May 2026. Prior to joining IISER, I was a Visiting Scientist at ACMU of ISI Kolkata, from Jan 2026 to May 2026. Before that I was a postdoctoral fellow at the University of Warwick, UK from Apr 2024 to Dec 2025, under Dr. M. S. Ramanujan. Earlier, I worked as a postdoctoral fellow at IMSc Chennai, India from Aug 2021 to Mar 2024, under Prof. Saket Saurabh.
In July 2021, I obtained my PhD in Computer Science from the ISI Kolkata, advised by Prof. Sasanka Roy. Prior to this, I worked as a Project-linked Person in the Computer Science Unit at ISI Chennai under Dr. Mathew C. Francis (Aug 2015 - Jun 2016). I hold an MSc in Mathematics from IIT Bhubaneswar (2015) and a BSc in Mathematics from Scottish Church College, University of Calcutta (2013).
My primary research interests lie in the design and analysis of parameterized algorithms, particularly for graph-theoretic problems, with broader interests in algorithm design and computational complexity.
I am always looking for sincere and motivated students and researchers to join my research group at various levels (Ph.D., postdoctoral fellows, interns, and Bachelor's/Master's thesis students).
If you are interested in my research area, please feel free to contact.
Links to my DBLP profile and latest CV.
Links to my current courses: Theory of Computation (CDS 303) and Approximation Algorithms (CDS 409).
[23] Tanmay Inamdar, S. Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. “FPT Approximations for Connected Maximum Coverage”. In 17th Innovations in Theoretical Computer Science Conference, (ITCS 2026), Bocconi University, Milan, Italy, January 27-30, 2026, LIPIcs, vol. 362, pp. 80:1–80:24, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2026. [DOI: 10.4230/LIPICS.ITCS.2026.80]
[22] S. Jana, Soumen Mandal, Ashutosh Rai, and Saket Saurabh. “Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of its Variants”. In 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, (FSTTCS 2025), BITS Pilani, Birla Goa Campus, India, December 17-19, 2025, LIPIcs, vol. 360, pp. 39:1–39:20, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2025. [DOI: 10.4230/LIPICS.FSTTCS.2025.39]
[21] S. Jana, Souvik Saha, Saket Saurabh, and Anannya Upasana. “Parameterized Reunion with Achromatic Number”. In 36th International Symposium on Algorithms and Computation, (ISAAC 2025), Tainan, Taiwan, December 7-10, 2025, LIPIcs, vol. 359, pp. 42:1–42:20, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2025. [DOI: 10.4230/LIPICS.ISAAC.2025.42]
[20] Václav Blažej, S. Jana, M. S. Ramanujan, and Peter Strulo. “Bridging Treewidth and Clique-width via Cograph-Modular-Treewidth”. In 20th International Symposium on Parameterized and Exact Computation, (IPEC 2025), Warsaw, Poland, September 15-19, 2025, LIPIcs, vol. 358, pp. 18:1–18:18, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2026. [DOI: 10.4230/LIPICS.IPEC.2025.18]
[19] Václav Blažej, S. Jana, and Peter Strulo. “A Parameterized Perspective of All-Colors”. In 14th International Conference on Algorithms and Complexity (CIAC 2025), Rome, Italy, June 10-12, 2025, LNCS, vol. 15679, pp. 222–239, Springer, 2025. [DOI: 10.1007/978-3-031-92932-8_15]
[18] Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, S. Jana, and Saket Saurabh. “Multivariate Exploration of Metric Dilation”. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Jena, Germany, March 4-7, 2025, LIPIcs, vol. 327, pp. 14:1–14:17, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2025. [DOI: 10.4230/LIPICS.STACS.2025.14]
[17] Ankit Abhinav, S. Jana, Nidhi Purohit, Abhishek Sahu, and Saket Saurabh. “Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints”. In 50th International Conference on Current Trends in Theory and Practice of Computer Science, (SOFSEM 2025), Bratislava, Slovakia, January 20-23, 2025, LNCS, vol. 15538, pp. 23–36, Springer, 2025. [DOI: 10.1007/978-3-031-82670-2_3]
[16] S. Jana, Lawqueen Kanesh, Madhumita Kundu, and Saket Saurabh. “Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset”. In 19th International Symposium on Parameterized and Exact Computation, (IPEC 2024), Royal Holloway, University of London, Egham, United Kingdom, September 4-6, 2024, LIPIcs, vol. 321, pp. 17:1–17:17, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2024. [DOI: 10.4230/LIPICS.IPEC.2024.17]
[15] Václav Blažej, S. Jana, M. S. Ramanujan, and Peter Strulo. “On the Parameterized Complexity of Eulerian Strong Component Deletion”. In 19th International Symposium on Parameterized and Exact Computation, (IPEC 2024), Royal Holloway, University of London, Egham, United Kingdom, September 4-6, 2024, LIPIcs, vol. 321, pp. 4:1–4:20, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2024. [DOI: 10.4230/LIPICS.IPEC.2024.4]
[14] Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, S. Jana, and Saket Saurabh. “Cuts in Graphs with Matroid Constraints”. In 32nd Annual European Symposium on Algorithms (ESA 2024), Royal Holloway, London, United Kingdom, September 2-4, 2024, LIPIcs, vol. 308, pp. 17:1–17:15, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2024. [DOI: 10.4230/LIPICS.ESA.2024.17]
[13] S. Jana, Sounak Modak, Saket Saurabh, and Kushal Singanporia. “Roman Cycle Hitting Set”. In 50th International Workshop on Graph-Theoretic Concepts in Computer Science, (WG 2024), Gozd Martuljek, Slovenia, June 19-21, 2024, LNCS, vol. 14760, pp. 282-296, Springer, 2025. [DOI: 10.1007/978-3-031-75409-8_20]
[12] Akanksha Agrawal, S. Jana, and Abhishek Sahu. “A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion.” In Theoretical Informatics: 16th Latin American Symposium, (LATIN 2022), Puerto Varas, Chile, March 18-22, 2024, LNCS, vol. 14579, pp. 208-222, Springer, 2024. [DOI: 10.1007/978-3-031-55601-2_14]
[11] Sriram Bhyravarapu, S. Jana, Saket Saurabh, and Roohani Sharma. “Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity”. In 18th International Symposium on Parameterized and Exact Computation, (IPEC 2023). Amsterdam, the Netherlands, Sept 04-08, 2023, LIPIcs, vol. 285, pp. 5:1–5:14, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023. [DOI: 10.4230/LIPICS.IPEC.2023.5]
[10] S. Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, and Saket Saurabh. “Parameterized Approximation Scheme for Feedback Vertex Set.” In 48th International Symposium on Mathematical Foundations of Computer Science, (MFCS 2023). Bordeaux, France, Aug 28- Sept 01, 2023, LIPIcs, vol. 272, pp. 56:1–56:15, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2023. [DOI: 10.4230/LIPIcs.MFCS.2023.56]
[9] S. Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, and Shaily Verma. “Partitioning Subclasses of Chordal Graphs with Few Deletions.” In Algorithms and Complexity: 13th International Conference, (CIAC 2023). Larnaca, Cyprus, June 13-16, 2023, LNCS, vol. 13898, pp. 293-307, Springer, 2023. [DOI: 10.1007/978-3-031-30448-4_21]
[8] Sriram Bhyravarapu, S. Jana, Lawqueen Kanesh, Saket Saurabh, and Shaily Verma. “Parameterized algorithms for Eccentricity Shortest Path Problem.” In Combinatorial Algorithms: 34th International Workshop, (IWOCA 2023). Tainan, Taiwan, June 07-10, 2023, LNCS, vol. 13889, pp. 74-86, Springer, 2023. [DOI: 10.1007/978-3-031-34347-6_7]
[7] Akanksha Agrawal, Sutanay Bhattacharjee, S. Jana, and Abhishek Sahu. “Parameterized Complexity of Perfectly Matched Sets.” In 17th International Symposium on Parameterized and Exact Computation, (IPEC 2022). Potsdam, Germany, September 7-9, 2022, LIPIcs, vol. 249, pp. 2:1–2:13, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022. [DOI: 10.4230/LIPIcs.IPEC.2022.2]
[6] Sriram Bhyravarapu, S. Jana, Fahad Panolan, Saket Saurabh, and Shaily Verma. “List Homomorphism: Beyond the Known Boundaries.” In Theoretical Informatics: 15th Latin American Symposium, (LATIN 2022), Guanajuato, Mexico, November 7–11, 2022, LNCS, vol. 13568, pp. 593-609, Springer, 2022. [DOI: 10.1007/978-3-031-20624-5_36]
[5] S. Jana, Supantha Pandit, and Sasanka Roy. “Balanced connected graph partition.” In Algorithms and Discrete Applied Mathematics: 7th International Conference, (CALDAM 2021), Rupnagar, India, February 11–13, 2021, LNCS, vol. 12601, pp. 487-499, Springer, 2021. [DOI: 10.1007/978-3-030-67899-9_38]
[4] S. Jana, Anil Maheshwari, Saeed Mehrabi, and Sasanka Roy. “Maximum bipartite subgraph of geometric intersection graphs.” In Algorithms and Computation: 14th International Conference, (WALCOM 2020), Singapore, March 31–April 2, 2020, LNCS, vol. 12049, pp. 158-169, Springer, 2020. [DOI: 10.1007/978-3-030-39881-1_14]
[3] Sujoy Bhore, S. Jana, Supantha Pandit, and Sasanka Roy. “Balanced Connected Subgraph Problem in Geometric Intersection Graphs.” In Combinatorial Optimization and Applications: 13th International Conference, (COCOA 2019), Xiamen, China, December 13–15, 2019, LNCS, vol. 11949, pp. 56-68, Springer, 2019. [DOI: 10.1007/978-3-030-36412-0_5]
[2] Sujoy Bhore, Sourav Chakraborty, S. Jana, Joseph SB Mitchell, Supantha Pandit, and Sasanka Roy. “The Balanced Connected Subgraph Problem.” In Algorithms and Discrete Applied Mathematics: 5th International Conference, (CALDAM 2019), Kharagpur, India, February 14-16, 2019, LNCS, vol. 11394, pp. 201-215, Springer, 2019. [DOI: 10.1007/978-3-030-11509-8_17]
[1] S. Jana and Supantha Pandit. “Covering and Packing of Rectilinear Subdivision.” In Algorithms and Computation: 13th International Conference, (WALCOM 2019), Guwahati, India, February 27–March 2, 2019, LNCS, vol. 11355, pp. 381-393, Springer, 2019. [DOI: 10.1007/978-3-030-10564-8_30]
