Satyabrata Jana

Orcid: 0000-0002-7046-0091

Affiliations:
  • University of Warwick, UK
  • Institute of Mathematical Sciences, Chennai, India (former)
  • Indian Statistical Institute, Kolkata, India (PhD 2021)


According to our database1, Satyabrata Jana authored at least 26 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST.
CoRR, March, 2025

Further parameterized results on weak Grundy coloring.
Theor. Comput. Sci., 2025

Towards transitive-free digraphs.
Theor. Comput. Sci., 2025

Multivariate Exploration of Metric Dilation.
Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints.
Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

A Parameterized Perspective of All-Colors.
Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024
Roman Cycle Hitting Set.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion.
Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

Cuts in Graphs with Matroid Constraints.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023
Maximum Bipartite Subgraphs of Geometric Intersection Graphs.
Int. J. Comput. Geom. Appl., 2023

Parameterized Approximation Scheme for Feedback Vertex Set.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Algorithms for Eccentricity Shortest Path Problem.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Partitioning Subclasses of Chordal Graphs with Few Deletions.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022
Collision-free routing problem with restricted L-path.
Discret. Appl. Math., 2022

Linear-size planar Manhattan network for convex point sets.
Comput. Geom., 2022

List Homomorphism: Beyond the Known Boundaries.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Parameterized Complexity of Perfectly Matched Sets.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021
Balanced Connected Graph Partition.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020
Maximum Bipartite Subgraph of Geometric Intersection Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019
Covering and Packing of Rectilinear Subdivision.
Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

Balanced Connected Subgraph Problem in Geometric Intersection Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2019

The Balanced Connected Subgraph Problem.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Uniquely Restricted Matchings in Interval Graphs.
SIAM J. Discret. Math., 2018


  Loading...