Satyabrata Jana


Portrait of Satyabrata Jana
Assistant Professor
Email: satyabrataj [at] iiserbpr [dot] ac [dot] in
satyamtma [at] gmail [dot] com
Phone: +91-XXXXXXXXXX

Research Interests

Parameterized Complexity
Computational Geometry
Kernelization
Exact Exponential Time Algorithms
Graph Algorithms
Computational Social Choice Theory
Top

News

I am 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 areas, please feel free to contact me.

Top

Current and Past Positions

Top

Education

Top

Teaching

Top

Publications

Journals
  1. Multivariate Exploration of Metric Dilation DOI Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, S. Jana, Saket Saurabh ACM Transactions on Computation Theory 2026
  2. A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion DOI Akanksha Agrawal, S. Jana, Abhishek Sahu Discrete Mathematics 2026
  3. Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints DOI Ankit Abhinav, S. Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh Journal of Computer and System Sciences 2026
  4. Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset DOI S. Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh Journal of Computer and System Sciences 2026
  5. Parameterized Approximation Scheme for Feedback Vertex Set DOI S. Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh Theoretical Computer Science 2026
  6. A Parameterized Perspective of All-Colors DOI Václav Blažej, S. Jana, Peter Strulo Theoretical Computer Science 2026
  7. On the Parameterized Complexity of Eulerian Strong Component Deletion DOI Václav Blažej, S. Jana, M. S. Ramanujan, Peter Strulo Algorithmica 2025
  8. Further Parameterized Results on Weak Grundy Coloring DOI Karthika D, Muthucumaraswamy R, Sriram Bhyravarapu, S. Jana, Saket Saurabh Theoretical Computer Science 2025
  9. Towards Transitive-free Digraphs DOI Ankit Abhinav, S. Jana, Abhishek Sahu Theoretical Computer Science 2025
  10. Partitioning Subclasses of Chordal Graphs with Few Deletions DOI S. Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma Theoretical Computer Science 2024
  11. Maximum Bipartite Subgraph of Geometric Intersection Graphs DOI S. Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy International Journal of Computational Geometry and Applications 2023
  12. Parameterized Complexity of Perfectly Matched Sets DOI Akanksha Agrawal, Sutanay Bhattacharjee, S. Jana, Abhishek Sahu Theoretical Computer Science 2023
  13. Linear-size Planar Manhattan Network for Convex Point Sets DOI S. Jana, Anil Maheshwari, Sasanka Roy Computational Geometry 2022
  14. Collision-free Routing Problem with Restricted L-path DOI Jammigumpula Ajay, S. Jana, Sasanka Roy Discrete Applied Mathematics 2022
  15. The Balanced Connected Subgraph Problem DOI Sujoy Bhore, Sourav Chakraborty, S. Jana, Joseph SB Mitchell, Supantha Pandit, Sasanka Roy Discrete Applied Mathematics 2022
  16. The Balanced Connected Subgraph Problem for Geometric Intersection Graphs DOI Sujoy Bhore, S. Jana, Supantha Pandit, Sasanka Roy Theoretical Computer Science 2022
  17. Covering and Packing of Rectilinear Subdivision DOI S. Jana, Supantha Pandit Theoretical Computer Science 2020
  18. Uniquely Restricted Matchings in Interval Graphs DOI Mathew C. Francis, Dalu Jacob, S. Jana SIAM Journal on Discrete Mathematics 2018
Conferences
  1. Breaking the 2n Barrier for Defensive Alliance S. Jana FSTTCS 2026
  2. A Quadratic Vertex Kernel and Subexponential Algorithms for Subset-FAST Tian Bai, S. Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh ISAAC 2026
  3. Computational Boundaries for Escaping Rectangles DOI Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, S. Jana, Abishek Sahu, Saket Saurabh, Kushal Singanporia ESA 2026
  4. FPT Approximations for Connected Maximum Coverage DOI Tanmay Inamdar, S. Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi ITCS 2026
  5. Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants DOI S. Jana, Soumen Mandal, Ashutosh Rai, Saket Saurabh FSTTCS 2025
  6. Parameterized Reunion with Achromatic Number DOI S. Jana, Souvik Saha, Saket Saurabh, Anannya Upasana ISAAC 2025
  7. Bridging Treewidth and Clique-width via Cograph-Modular-Treewidth DOI Václav Blažej, S. Jana, M. S. Ramanujan, Peter Strulo IPEC 2025
  8. A Parameterized Perspective of All-Colors DOI Václav Blažej, S. Jana, Peter Strulo CIAC 2025
  9. Multivariate Exploration of Metric Dilation DOI Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, S. Jana, Saket Saurabh STACS 2025
  10. Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints DOI Ankit Abhinav, S. Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh SOFSEM 2025
  11. Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset DOI S. Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh IPEC 2024
  12. On the Parameterized Complexity of Eulerian Strong Component Deletion DOI Václav Blažej, S. Jana, M. S. Ramanujan, Peter Strulo IPEC 2024
  13. Cuts in Graphs with Matroid Constraints DOI Aritra Banik, Fedor Fomin, Petr Golovach, Tanmay Inamdar, S. Jana, Saket Saurabh ESA 2024
  14. Roman Cycle Hitting Set DOI S. Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia WG 2024
  15. A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion DOI Akanksha Agrawal, S. Jana, Abhishek Sahu LATIN 2022
  16. Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity DOI Sriram Bhyravarapu, S. Jana, Saket Saurabh, Roohani Sharma IPEC 2023
  17. Parameterized Approximation Scheme for Feedback Vertex Set DOI S. Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh MFCS 2023
  18. Partitioning Subclasses of Chordal Graphs with Few Deletions DOI S. Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma CIAC 2023
  19. Parameterized Algorithms for Eccentricity Shortest Path Problem DOI Sriram Bhyravarapu, S. Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma IWOCA 2023
  20. Parameterized Complexity of Perfectly Matched Sets DOI Akanksha Agrawal, Sutanay Bhattacharjee, S. Jana, Abhishek Sahu IPEC 2022
  21. List Homomorphism: Beyond the Known Boundaries DOI Sriram Bhyravarapu, S. Jana, Fahad Panolan, Saket Saurabh, Shaily Verma LATIN 2022
  22. Balanced Connected Graph Partition DOI S. Jana, Supantha Pandit, Sasanka Roy CALDAM 2021
  23. Maximum Bipartite Subgraph of Geometric Intersection Graphs DOI S. Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy WALCOM 2020
  24. Balanced Connected Subgraph Problem in Geometric Intersection Graphs DOI Sujoy Bhore, S. Jana, Supantha Pandit, Sasanka Roy COCOA 2019
  25. The Balanced Connected Subgraph Problem DOI Sujoy Bhore, Sourav Chakraborty, S. Jana, Joseph SB Mitchell, Supantha Pandit, Sasanka Roy CALDAM 2019
  26. Covering and Packing of Rectilinear Subdivision DOI S. Jana, Supantha Pandit WALCOM 2019
Theses
  1. Computing Well-Structured Subgraph in Geometric Intersection Graphs PDF Ph.D. thesis
  2. Julia Sets of Relaxed Newton’s Method for Polynomials with Two Distinct Roots PDF M.Sc. thesis