FPT Approximations for Connected Maximum Coverage
Tanmay Inamdar, S. Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
ITCS, 2026  (Link).

A Parameterized Perspective of All-Colors
Václav Blažej, S. Jana, Peter Strulo
Theoretical Computer Science, 2026  (Link) (Extended version of CIAC 2025 (Link))

Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of its Variants
S. Jana, Soumen Mandal, Ashutosh Rai, Saket Saurabh
FSTTCS, 2025  (Link).

Parameterized Reunion with Achromatic Number
S. Jana, Souvik Saha, Saket Saurabh, Anannya Upasana
ISAAC, 2025  (Link).

Bridging Treewidth and Clique-width via Cograph-Modular-Treewidth
Václav Blažej, S. Jana, M. S. Ramanujan, Peter Strulo
IPEC, 2025  (Link).

Further parameterized results on weak Grundy coloring
Karthika D, Muthucumaraswamy R, Sriram Bhyravarapu, S. Jana, Saket Saurabh
Theoretical Computer Science, 2025  (Link).

Towards Transitive-free Digraphs
Ankit Abhinav, S. Jana, Abhishek Sahu
Theoretical Computer Science, 2025  (Link).

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints
Ankit Abhinav, S. Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh
SOFSEM, 2025  (Link).

On the Parameterized Complexity of Eulerian Strong Component Deletion
Václav Blažej, S. Jana, M. S. Ramanujan, Peter Strulo
Algorithmica, 2025  (Link) (Extended version of IPEC 2024 (Link))

Multivariate Exploration of Metric Dilation
Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, S. Jana, Saket Saurabh
STACS, 2024  (Link).

Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset
S. Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh
IPEC, 2024  (Link).

Cuts in Graphs with Matroid Constraint
Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, S. Jana, Saket Saurabh
ESA, 2024  (Link).

Roman Cycle Hitting Set
S. Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia
WG, 2024  (Link).

A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion
Akanksha Agrawal, S. Jana, Abhishek Sahu
LATIN, 2024  (Link).

Partitioning Subclasses of Chordal Graphs with Few Deletions
S. Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma
Theoretical Computer Science, 2024  (Link) (Extended version of CIAC 2023 (Link))

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity
Sriram Bhyravarapu, S. Jana, Saket Saurabh, Roohani Sharma
IPEC, 2023  (Link).

Parameterized Approximation Scheme for Feedback Vertex Set
S. Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh
MFCS, 2023  (Link).

Parameterized algorithms for Eccentricity Shortest Path Problem
Sriram Bhyravarapu, S. Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma
IWOCA, 2023 (Link).

Parameterized Complexity of Perfectly Matched Sets
Akanksha Agrawal, Sutanay Bhattacharjee, S. Jana, Abhishek Sahu
Theoretical Computer Science, 2023  (Link) (Extended version of IPEC 2022 (Link))

Maximum Bipartite Subgraph of Geometric Intersection Graphs
S. Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
International Journal of Computational Geometry and Applications, 2023  (Link) (Extended version of  WALCOM 2020 (Link))

List Homomorphism: Beyond the Known Boundaries
Sriram Bhyravarapu, S. Jana, Fahad Panolan, Saket Saurabh, Shaily Verma
LATIN, 2022  (Link).

Linear-size Planar Manhattan Network for Convex Point Sets
S. Jana, Anil Maheshwari, Sasanka Roy
Computational Geometry, 2022  (Link).  

Collision-free Routing Problem with Restricted L-path
Jammigumpula Ajay, S. Jana, Sasanka Roy
Discrete Applied Mathematics, 2022  (Link).  

Balanced Connected Subgraph Problem in Geometric Intersection Graphs
Sujoy Bhore, S. Jana, Supantha Pandit, Sasanka Roy
Theoretical Computer Science, 2022  (Link) (Extended version of COCOA 2019 (Link))

The Balanced Connected Subgraph Problem
Sujoy Bhore, Sourav Chakraborty, S. Jana, Joseph SB Mitchell, Supantha Pandit, Sasanka Roy
Discrete Applied Mathematics, 2022  (Link) (Extended version of CALDAM 2019 (Link))

Balanced Connected Graph Partition
S. Jana, Supantha Pandit, Sasanka Roy
CALDAM, 2021 (Link).

Covering and Packing of Rectilinear Subdivision
S. Jana, Supantha Pandit
Theoretical Computer Science, 2020  (Link) (Extended version of WALCOM 2019 (Link))

Uniquely Restricted Matchings in Interval Graphs
Mathew C. Francis, Dalu Jacob, S. Jana
SIAM Journal on Discrete Mathematics, 2018  (Link).