default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatyabrata Jana
Person information
- affiliation: Indian Institute of Science Education and Research (IISER) Berhampur, Berhampur, India
- affiliation (former): University of Warwick, Coventry, UK
- affiliation (former): Institute of Mathematical Sciences (IMSc), Chennai, India
- affiliation (PhD 2021): Indian Statistical Institute (ISI), Kolkata, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j17]Akanksha Agrawal, Satyabrata Jana
, Abhishek Sahu:
A polynomial kernel for proper Helly circular-arc vertex deletion. Discret. Math. 349(11): 115269 (2026)- [j16]Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh:
Parameterized complexity of feedback vertex set with connectivity constraints. J. Comput. Syst. Sci. 161: 103816 (2026) - [j15]Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh:
Subset feedback vertex set in tournaments as fast as without the subset. J. Comput. Syst. Sci. 161: 103818 (2026) - [j14]Václav Blazej, Satyabrata Jana, Peter Strulo:
A parameterized perspective of all-colors. Theor. Comput. Sci. 1059: 115573 (2026) - [j13]Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh:
Parameterized approximation scheme for feedback vertex set. Theor. Comput. Sci. 1081: 116060 (2026) - [c24]Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abhishek Sahu, Saket Saurabh, Kushal Singanporia:
Computational Boundaries for Escaping Rectangles. ESA 2026: 49:1-49:22 - [c23]Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
FPT Approximations for Connected Maximum Coverage. ITCS 2026: 80:1-80:24 - [i17]Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
FPT Approximations for Connected Maximum Coverage. CoRR abs/2601.08639 (2026) - [i16]Satyabrata Jana, Debabrata Pal, Bodhayan Roy, Sasanka Roy:
Witness Set: A Visibility Problem in NP ∩ XP. CoRR abs/2605.01592 (2026) - [i15]Satyabrata Jana, Shivesh K. Roy, R. B. Sandeep:
Hardness of Vertex Splitting: Cographs, Chordal Graphs, and Beyond. CoRR abs/2607.13517 (2026) - 2025
- [j12]Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. Algorithmica 87(11): 1669-1709 (2025) - [j11]Ankit Abhinav, Satyabrata Jana, Abhishek Sahu:
Towards transitive-free digraphs. Theor. Comput. Sci. 1044: 115270 (2025) - [j10]D. Karthika, R. Muthucumaraswamy, Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh:
Further parameterized results on weak Grundy coloring. Theor. Comput. Sci. 1049: 115361 (2025) - [c22]Václav Blazej, Satyabrata Jana, Peter Strulo:
A Parameterized Perspective of All-Colors. CIAC (1) 2025: 222-239 - [c21]Satyabrata Jana, Soumen Mandal, Ashutosh Rai, Saket Saurabh:
Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants. FSTTCS 2025: 39:1-39:20 - [c20]Satyabrata Jana, Souvik Saha, Saket Saurabh, Anannya Upasana:
Parameterized Reunion with Achromatic Number. ISAAC 2025: 42:1-42:20 - [c19]Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth. IPEC 2025: 18:1-18:18 - [c18]Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh:
Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. SOFSEM (1) 2025: 23-36 - [c17]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Multivariate Exploration of Metric Dilation. STACS 2025: 14:1-14:17 - [i14]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Multivariate Exploration of Metric Dilation. CoRR abs/2501.04555 (2025) - [i13]Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh:
A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST. CoRR abs/2503.07208 (2025) - [i12]Ankit Abhinav, Satyabrata Jana, Abhishek Sahu:
Towards Transitive-free Digraphs. CoRR abs/2503.10541 (2025) - [i11]Udvas Das, Binayak Dutta, Satyabrata Jana, Debabrata Pal, Sasanka Roy:
Witness Set in Monotone Polygons: Exact and Approximate. CoRR abs/2511.10224 (2025) - 2024
- [j9]Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning subclasses of chordal graphs with few deletions. Theor. Comput. Sci. 983: 114288 (2024) - [c16]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. ESA 2024: 17:1-17:15 - [c15]Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. IPEC 2024: 4:1-4:20 - [c14]Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh:
Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. IPEC 2024: 17:1-17:17 - [c13]Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu:
A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. LATIN (2) 2024: 208-222 - [c12]Satyabrata Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia:
Roman Cycle Hitting Set. WG 2024: 282-296 - [i10]Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu:
A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion. CoRR abs/2401.03415 (2024) - [i9]Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. CoRR abs/2406.19134 (2024) - [i8]Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo:
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. CoRR abs/2408.13819 (2024) - 2023
- [j8]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraphs of Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. 33(3&4): 133-157 (2023) - [j7]Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu:
Parameterized complexity of perfectly matched sets. Theor. Comput. Sci. 958: 113861 (2023) - [c11]Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma:
Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC 2023: 293-307 - [c10]Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA 2023: 74-86 - [c9]Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma:
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC 2023: 5:1-5:14 - [c8]Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS 2023: 56:1-56:15 - [i7]Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma:
Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR abs/2304.03233 (2023) - 2022
- [j6]Satyabrata Jana, Anil Maheshwari, Sasanka Roy:
Linear-size planar Manhattan network for convex point sets. Comput. Geom. 100: 101819 (2022) - [j5]Jammigumpula Ajay, Satyabrata Jana, Sasanka Roy:
Collision-free routing problem with restricted L-path. Discret. Appl. Math. 319: 71-80 (2022) - [j4]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem. Discret. Appl. Math. 319: 111-120 (2022) - [j3]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. 929: 69-80 (2022) - [c7]Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu:
Parameterized Complexity of Perfectly Matched Sets. IPEC 2022: 2:1-2:13 - [c6]Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma:
List Homomorphism: Beyond the Known Boundaries. LATIN 2022: 593-609 - 2021
- [c5]Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Graph Partition. CALDAM 2021: 487-499 - 2020
- [j2]Satyabrata Jana, Supantha Pandit:
Covering and packing of rectilinear subdivision. Theor. Comput. Sci. 840: 166-176 (2020) - [c4]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM 2020: 158-169
2010 – 2019
- 2019
- [c3]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CALDAM 2019: 201-215 - [c2]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA 2019: 56-68 - [c1]Satyabrata Jana, Supantha Pandit:
Covering and Packing of Rectilinear Subdivision. WALCOM 2019: 381-393 - [i6]Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy:
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. CoRR abs/1909.03872 (2019) - [i5]Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy:
Maximum Bipartite Subgraph of Geometric Intersection Graphs. CoRR abs/1909.03896 (2019) - [i4]Satyabrata Jana, Anil Maheshwari, Sasanka Roy:
Linear Size Planar Manhattan Network for Convex Point Sets. CoRR abs/1909.06457 (2019) - 2018
- [j1]Mathew C. Francis, Dalu Jacob, Satyabrata Jana:
Uniquely Restricted Matchings in Interval Graphs. SIAM J. Discret. Math. 32(1): 148-172 (2018) - [i3]Satyabrata Jana, Supantha Pandit:
Covering and Packing of Rectilinear Subdivision. CoRR abs/1809.07214 (2018) - [i2]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy:
The Balanced Connected Subgraph Problem. CoRR abs/1809.08856 (2018) - 2016
- [i1]Mathew C. Francis, Dalu Jacob, Satyabrata Jana:
Uniquely Restricted Matchings in Interval Graphs. CoRR abs/1604.07016 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-08-29 00:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
