Uniquely Restricted Matchings in Interval Graphs. - Mathew C. Francis; Dalu Jacob; Satyabrata Jana (SIAM J. Discret. Math., 2018)

Maximum Bipartite Subgraph of Geometric Intersection Graphs. - Satyabrata Jana; Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy (WALCOM, 2020)

Covering and packing of rectilinear subdivision. - Satyabrata Jana; Supantha Pandit (Theor. Comput. Sci., 2020)

Balanced Connected Graph Partition. - Satyabrata Jana; Supantha Pandit; Sasanka Roy (CALDAM, 2021)

List Homomorphism: Beyond the Known Boundaries. - Sriram Bhyravarapu; Satyabrata Jana; Fahad Panolan; Saket Saurabh 001; Shaily Verma (LATIN, 2022)

Linear-size planar Manhattan network for convex point sets. - Satyabrata Jana; Anil Maheshwari; Sasanka Roy (Comput. Geom., 2022)

Collision-free routing problem with restricted L-path. - Jammigumpula Ajay; Satyabrata Jana; Sasanka Roy (Discret. Appl. Math., 2022)

The balanced connected subgraph problem. - Sujoy Bhore; Sourav Chakraborty 001; Satyabrata Jana; Joseph S. B. Mitchell; Supantha Pandit; Sasanka Roy (Discret. Appl. Math., 2022)

The balanced connected subgraph problem for geometric intersection graphs. - Sujoy Bhore; Satyabrata Jana; Supantha Pandit; Sasanka Roy (Theor. Comput. Sci., 2022)

Parameterized Algorithms for Eccentricity Shortest Path Problem. - Sriram Bhyravarapu; Satyabrata Jana; Lawqueen Kanesh; Saket Saurabh 001; Shaily Verma (IWOCA, 2023)

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

Parameterized Approximation Scheme for Feedback Vertex Set. - Satyabrata Jana; Daniel Lokshtanov; Soumen Mandal 001; Ashutosh Rai 001; Saket Saurabh 001 (MFCS, 2023)

Maximum Bipartite Subgraphs of Geometric Intersection Graphs. - Satyabrata Jana; Anil Maheshwari; Saeed Mehrabi 001; Sasanka Roy (Int. J. Comput. Geom. Appl., 2023)

Parameterized complexity of perfectly matched sets. - Akanksha Agrawal 001; Sutanay Bhattacharjee; Satyabrata Jana; Abhishek Sahu (Theor. Comput. Sci., 2023)

Cuts in Graphs with Matroid Constraints. - Aritra Banik; Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Satyabrata Jana; Saket Saurabh 001 (ESA, 2024)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. - Václav Blazej; Satyabrata Jana; M. S. Ramanujan 001; Peter Strulo (IPEC, 2024)

Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. - Satyabrata Jana; Lawqueen Kanesh; Madhumita Kundu; Saket Saurabh 001 (IPEC, 2024)

A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. - Akanksha Agrawal 001; Satyabrata Jana; Abhishek Sahu (LATIN (2), 2024)

Roman Cycle Hitting Set. - Satyabrata Jana; Sounak Modak; Saket Saurabh 001; Kushal Singanporia (WG, 2024)

Partitioning subclasses of chordal graphs with few deletions. - Satyabrata Jana; Souvik Saha 002; Abhishek Sahu; Saket Saurabh 001; Shaily Verma (Theor. Comput. Sci., 2024)

A Parameterized Perspective of All-Colors. - Václav Blazej; Satyabrata Jana; Peter Strulo (CIAC (1), 2025)

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. - Ankit Abhinav; Satyabrata Jana; Nidhi Purohit; Abhishek Sahu; Saket Saurabh 001 (SOFSEM (1), 2025)

Multivariate Exploration of Metric Dilation. - Aritra Banik; Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Satyabrata Jana; Saket Saurabh 001 (STACS, 2025)

Towards transitive-free digraphs. - Ankit Abhinav; Satyabrata Jana; Abhishek Sahu (Theor. Comput. Sci., 2025)

Further parameterized results on weak Grundy coloring. - D. Karthika; R. Muthucumaraswamy; Sriram Bhyravarapu; Satyabrata Jana; Saket Saurabh 001 (Theor. Comput. Sci., 2025)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST. - Satyabrata Jana; Lawqueen Kanesh; Madhumita Kundu; Daniel Lokshtanov; Saket Saurabh 001 (CoRR, 2025)