Assistant Professor
Email:
satyabrataj [at] iiserbpr [dot] ac [dot] in
satyamtma [at] gmail [dot] com
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
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.
Current and Past Positions
- May 2026 - Present Assistant Professor, Dept. of Computer Science, IISER Berhampur, Brahmapur, India
-
Jan 2026 - May 2026
Visiting Scientist, ACMU,
ISI,
Kolkata, India
Host: Prof. Sasanka Roy -
Apr 2024 - Dec 2025
Postdoctoral Fellow,
University of Warwick,
United Kingdom
Host: Dr. Maadapuzhi Sridharan Ramanujan -
Jul 2021 - Mar 2024
Postdoctoral Fellow,
IMSc,
Chennai, India
Host: Prof. Saket Saurabh -
Aug 2015 - Jun 2016
Project Associate,
ISI,
Chennai, India
Supervisor: Dr. Mathew C. Francis
Education
-
Aug 2016 - Jul 2021
Ph.D. in Computer Science, ACMU,
ISI,
Kolkata, India
Supervisor: Prof. Sasanka Roy - 2013 - 2015 M.Sc. in Mathematics, IIT Bhubaneswar, India
- 2010 - 2013 B.Sc. in Mathematics, Scottish Church College, University of Calcutta, Kolkata, India
People
Current Postdoctoral Fellow
-
Tithy Dwary
(Nov 2026 - Mar 2027)
PhD, IIT Guwahati
Teaching
Publications
Conferences
- Important Cuts with Logical Constraints: A Meta-Theorem for Eulerian Digraphs
- Breaking the 2n Barrier for Defensive Alliance
- A Quadratic Vertex Kernel and Subexponential Algorithms for Subset-FAST
- Acyclic Edge Coloring in the MPC Model
- Computational Boundaries for Escaping Rectangles DOI
- FPT Approximations for Connected Maximum Coverage DOI
- Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants DOI
- Parameterized Reunion with Achromatic Number DOI
- Bridging Treewidth and Clique-width via Cograph-Modular-Treewidth DOI
- A Parameterized Perspective of All-Colors DOI
- Multivariate Exploration of Metric Dilation DOI
- Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints DOI
- Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset DOI
- On the Parameterized Complexity of Eulerian Strong Component Deletion DOI
- Cuts in Graphs with Matroid Constraints DOI
- Roman Cycle Hitting Set DOI
- A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion DOI
- Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity DOI
- Parameterized Approximation Scheme for Feedback Vertex Set DOI
- Partitioning Subclasses of Chordal Graphs with Few Deletions DOI
- Parameterized Algorithms for Eccentricity Shortest Path Problem DOI
- Parameterized Complexity of Perfectly Matched Sets DOI
- List Homomorphism: Beyond the Known Boundaries DOI
- Balanced Connected Graph Partition DOI
- Maximum Bipartite Subgraph of Geometric Intersection Graphs DOI
- Balanced Connected Subgraph Problem in Geometric Intersection Graphs DOI
- The Balanced Connected Subgraph Problem DOI
- Covering and Packing of Rectilinear Subdivision DOI
Journals
- Witness Set in Monotone Polygons: Exact and Approximate SIAM Journal on Discrete Mathematics 2026
- Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants DOI Theoretical Computer Science 2026
- Parameterized Reunion with Achromatic Number DOI Information and Computation 2026
- Multivariate Exploration of Metric Dilation DOI ACM Transactions on Computation Theory 2026
- A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion DOI Discrete Mathematics 2026
- Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints DOI Journal of Computer and System Sciences 2026
- Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset DOI Journal of Computer and System Sciences 2026
- Parameterized Approximation Scheme for Feedback Vertex Set DOI Theoretical Computer Science 2026
- A Parameterized Perspective of All-Colors DOI Theoretical Computer Science 2026
- On the Parameterized Complexity of Eulerian Strong Component Deletion DOI Algorithmica 2025
- Further Parameterized Results on Weak Grundy Coloring DOI Theoretical Computer Science 2025
- Towards Transitive-free Digraphs DOI Theoretical Computer Science 2025
- Partitioning Subclasses of Chordal Graphs with Few Deletions DOI Theoretical Computer Science 2024
- Maximum Bipartite Subgraph of Geometric Intersection Graphs DOI International Journal of Computational Geometry and Applications 2023
- Parameterized Complexity of Perfectly Matched Sets DOI Theoretical Computer Science 2023
- Linear-size Planar Manhattan Network for Convex Point Sets DOI Computational Geometry 2022
- Collision-free Routing Problem with Restricted L-path DOI Discrete Applied Mathematics 2022
- The Balanced Connected Subgraph Problem DOI Discrete Applied Mathematics 2022
- The Balanced Connected Subgraph Problem for Geometric Intersection Graphs DOI Theoretical Computer Science 2022
- Covering and Packing of Rectilinear Subdivision DOI Theoretical Computer Science 2020
- Uniquely Restricted Matchings in Interval Graphs DOI SIAM Journal on Discrete Mathematics 2018
Theses