default search action
Satyabrata Jana
Person information
- affiliation: University of Warwick, UK
- affiliation (former): Institute of Mathematical Sciences, Chennai, India
- affiliation (PhD 2021): Indian Statistical Institute, Kolkata, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Satyabrata Jana
, Souvik Saha
Partitioning subclasses of chordal graphs with few deletions. Theor. Comput. Sci. 983: 114288 (2024) - [c15]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 - [c14]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 - [c13]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 - [c12]Akanksha Agrawal, Satyabrata Jana
A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. LATIN (2) 2024: 208-222 - [i10]Akanksha Agrawal, Satyabrata Jana
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
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
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
Parameterized complexity of perfectly matched sets. Theor. Comput. Sci. 958: 113861 (2023) - [c11]Satyabrata Jana
Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC 2023: 293-307 - [c10]Sriram Bhyravarapu, Satyabrata Jana
Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA 2023: 74-86 - [c9]Sriram Bhyravarapu, Satyabrata Jana
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC 2023: 5:1-5:14 - [c8]Satyabrata Jana
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS 2023: 56:1-56:15 - [i7]Sriram Bhyravarapu, Satyabrata Jana
Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR abs/2304.03233 (2023) - 2022
- [j6]Satyabrata Jana
Linear-size planar Manhattan network for convex point sets. Comput. Geom. 100: 101819 (2022) - [j5]Jammigumpula Ajay
Collision-free routing problem with restricted L-path. Discret. Appl. Math. 319: 71-80 (2022) - [j4]Sujoy Bhore
The balanced connected subgraph problem. Discret. Appl. Math. 319: 111-120 (2022) - [j3]Sujoy Bhore, Satyabrata Jana
The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. 929: 69-80 (2022) - [c7]Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana
Parameterized Complexity of Perfectly Matched Sets. IPEC 2022: 2:1-2:13 - [c6]Sriram Bhyravarapu, Satyabrata Jana
List Homomorphism: Beyond the Known Boundaries. LATIN 2022: 593-609 - 2021
- [c5]Satyabrata Jana
Balanced Connected Graph Partition. CALDAM 2021: 487-499 - 2020
- [j2]Satyabrata Jana
Covering and packing of rectilinear subdivision. Theor. Comput. Sci. 840: 166-176 (2020) - [c4]Satyabrata Jana
Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM 2020: 158-169
2010 – 2019
- 2019
- [c3]Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana
The Balanced Connected Subgraph Problem. CALDAM 2019: 201-215 - [c2]Sujoy Bhore, Satyabrata Jana
Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA 2019: 56-68 - [c1]Satyabrata Jana
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
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 2024-12-08 01:31 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by: