| Uniquely restricted matchings in interval graphs MC Francis, D Jacob, S Jana SIAM Journal on Discrete Mathematics 32 (1), 148-172, 2018 | 15 | 2018 |
| The balanced connected subgraph problem S Bhore, S Chakraborty, S Jana, JSB Mitchell, S Pandit, S Roy Discrete Applied Mathematics 319, 111-120, 2022 | 10 | 2022 |
| The balanced connected subgraph problem for geometric intersection graphs S Bhore, S Jana, S Pandit, S Roy Theoretical Computer Science 929, 69-80, 2022 | 9 | 2022 |
| Maximum bipartite subgraph of geometric intersection graphs S Jana, A Maheshwari, S Mehrabi, S Roy International Workshop on Algorithms and Computation, 158-169, 2020 | 3 | 2020 |
| Balanced connected graph partition S Jana, S Pandit, S Roy Conference on Algorithms and Discrete Applied Mathematics, 487-499, 2021 | 2 | 2021 |
| Covering and packing of rectilinear subdivision S Jana, S Pandit Theoretical Computer Science 840, 166-176, 2020 | 2 | 2020 |
| Covering and Packing of Rectilinear Subdivision S Jana, S Pandit International Workshop on Algorithms and Computation 11355, 381-393, 2019 | 2 | 2019 |
| Collision-free routing problem with restricted L-path J Ajay, S Jana, S Roy Discrete Applied Mathematics 319, 71-80, 2022 | 1 | 2022 |
| Linear-size planar Manhattan network for convex point sets S Jana, A Maheshwari, S Roy Computational Geometry 100, 101819, 2022 | 1 | 2022 |
| Parameterized Algorithms for Eccentricity Shortest Path Problem S Bhyravarapu, S Jana, L Kanesh, S Saurabh, S Verma International Workshop on Combinatorial Algorithms, 74-86, 2023 | | 2023 |
| Parameterized complexity of perfectly matched sets A Agrawal, S Bhattacharjee, S Jana, A Sahu Theoretical Computer Science 958, 113861, 2023 | | 2023 |
| Partitioning Subclasses of Chordal Graphs with Few Deletions S Jana, S Saha, A Sahu, S Saurabh, S Verma International Conference on Algorithms and Complexity, 293-307, 2023 | | 2023 |
| Parameterized Approximation Scheme for Feedback Vertex Set S Jana, D Lokshtanov, S Mandal, A Rai, S Saurabh 48th International Symposium on Mathematical Foundations of Computer Science …, 2023 | | 2023 |
| List Homomorphism: Beyond the Known Boundaries S Bhyravarapu, S Jana, F Panolan, S Saurabh, S Verma Latin American Symposium on Theoretical Informatics, 593-609, 2022 | | 2022 |
| Computing Well-Structured Subgraphs in Geometric Intersection Graphs S Jana PQDT-Global, 2021 | | 2021 |
| The balanced connected subgraph problem S Bhore, S Chakraborty, S Jana, JSB Mitchell, S Pandit, S Roy Conference on Algorithms and Discrete Applied Mathematics 11394, 201--215, 2019 | | 2019 |
| Parameterized Complexity of Perfectly Matched Sets S JANA, S Bhattacharjee, A Agrawal, A Sahu Available at SSRN 4289703, 0 | | |
| The Balanced Connected Subgraph Problem for Geometric Intersection Graphs S JANA, S Bhore, S Pandit, S Roy Available at SSRN 4025072, 0 | | |
Sasanka RoyProfessor at Indian Statistical InstituteVerified email at isical.ac.in
