Satyabrata Jana

51 papers A 3B 11C 3Journal 28Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A parameterized perspective of all-colors. Theor. Comput. Sci. Václav Blazej, Satyabrata Jana, Peter Strulo
2026	A	`conf`	FPT Approximations for Connected Maximum Coverage. ITCS Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2026	J	`jnl`	FPT Approximations for Connected Maximum Coverage. CoRR Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
2025	—	`conf`	A Parameterized Perspective of All-Colors. CIAC (1) Václav Blazej, Satyabrata Jana, Peter Strulo
2025	J	`jnl`	A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST. CoRR Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Daniel Lokshtanov, Saket Saurabh
2025	B	`conf`	Bridging Treewidth and Clique-Width via Cograph-Modular-Treewidth. IPEC Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo
2025	J	`jnl`	Further parameterized results on weak Grundy coloring. Theor. Comput. Sci. D. Karthika, R. Muthucumaraswamy, Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh
2025	—	`conf`	Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants. FSTTCS Satyabrata Jana, Soumen Mandal, Ashutosh Rai, Saket Saurabh
2025	A	`conf`	Multivariate Exploration of Metric Dilation. STACS Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2025	J	`jnl`	Multivariate Exploration of Metric Dilation. CoRR Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2025	J	`jnl`	On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. Algorithmica Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo
2025	—	`conf`	Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. SOFSEM (1) Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh
2025	B	`conf`	Parameterized Reunion with Achromatic Number. ISAAC Satyabrata Jana, Souvik Saha, Saket Saurabh, Anannya Upasana
2025	J	`jnl`	Towards Transitive-free Digraphs. CoRR Ankit Abhinav, Satyabrata Jana, Abhishek Sahu
2025	J	`jnl`	Towards transitive-free digraphs. Theor. Comput. Sci. Ankit Abhinav, Satyabrata Jana, Abhishek Sahu
2025	J	`jnl`	Witness Set in Monotone Polygons: Exact and Approximate. CoRR Udvas Das, Binayak Dutta, Satyabrata Jana, Debabrata Pal, Sasanka Roy
2024	—	`conf`	A Polynomial Kernel for Proper Helly Circular-Arc Vertex Deletion. LATIN (2) Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu
2024	J	`jnl`	A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion. CoRR Akanksha Agrawal, Satyabrata Jana, Abhishek Sahu
2024	A	`conf`	Cuts in Graphs with Matroid Constraints. ESA Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2024	J	`jnl`	Cuts in Graphs with Matroid Constraints. CoRR Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh
2024	B	`conf`	On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. IPEC Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo
2024	J	`jnl`	On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. CoRR Václav Blazej, Satyabrata Jana, M. S. Ramanujan, Peter Strulo
2024	J	`jnl`	Partitioning subclasses of chordal graphs with few deletions. Theor. Comput. Sci. Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma
2024	B	`conf`	Roman Cycle Hitting Set. WG Satyabrata Jana, Sounak Modak, Saket Saurabh, Kushal Singanporia
2024	B	`conf`	Subset Feedback Vertex Set in Tournaments as Fast as Without the Subset. IPEC Satyabrata Jana, Lawqueen Kanesh, Madhumita Kundu, Saket Saurabh
2023	B	`conf`	Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma
2023	J	`jnl`	Maximum Bipartite Subgraphs of Geometric Intersection Graphs. Int. J. Comput. Geom. Appl. Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
2023	C	`conf`	Parameterized Algorithms for Eccentricity Shortest Path Problem. IWOCA Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma
2023	B	`conf`	Parameterized Approximation Scheme for Feedback Vertex Set. MFCS Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh
2023	J	`jnl`	Parameterized algorithms for Eccentricity Shortest Path Problem. CoRR Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma
2023	J	`jnl`	Parameterized complexity of perfectly matched sets. Theor. Comput. Sci. Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu
2023	C	`conf`	Partitioning Subclasses of Chordal Graphs with Few Deletions. CIAC Satyabrata Jana, Souvik Saha, Abhishek Sahu, Saket Saurabh, Shaily Verma
2022	J	`jnl`	Collision-free routing problem with restricted L-path. Discret. Appl. Math. Jammigumpula Ajay, Satyabrata Jana, Sasanka Roy
2022	J	`jnl`	Linear-size planar Manhattan network for convex point sets. Comput. Geom. Satyabrata Jana, Anil Maheshwari, Sasanka Roy
2022	B	`conf`	List Homomorphism: Beyond the Known Boundaries. LATIN Sriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh, Shaily Verma
2022	B	`conf`	Parameterized Complexity of Perfectly Matched Sets. IPEC Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu
2022	J	`jnl`	The balanced connected subgraph problem for geometric intersection graphs. Theor. Comput. Sci. Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
2022	J	`jnl`	The balanced connected subgraph problem. Discret. Appl. Math. Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
2021	—	`conf`	Balanced Connected Graph Partition. CALDAM Satyabrata Jana, Supantha Pandit, Sasanka Roy
2020	J	`jnl`	Covering and packing of rectilinear subdivision. Theor. Comput. Sci. Satyabrata Jana, Supantha Pandit
2020	B	`conf`	Maximum Bipartite Subgraph of Geometric Intersection Graphs. WALCOM Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
2019	C	`conf`	Balanced Connected Subgraph Problem in Geometric Intersection Graphs. COCOA Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
2019	J	`jnl`	Balanced Connected Subgraph Problem in Geometric Intersection Graphs. CoRR Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy
2019	B	`conf`	Covering and Packing of Rectilinear Subdivision. WALCOM Satyabrata Jana, Supantha Pandit
2019	J	`jnl`	Linear Size Planar Manhattan Network for Convex Point Sets. CoRR Satyabrata Jana, Anil Maheshwari, Sasanka Roy
2019	J	`jnl`	Maximum Bipartite Subgraph of Geometric Intersection Graphs. CoRR Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
2019	—	`conf`	The Balanced Connected Subgraph Problem. CALDAM Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
2018	J	`jnl`	Covering and Packing of Rectilinear Subdivision. CoRR Satyabrata Jana, Supantha Pandit
2018	J	`jnl`	The Balanced Connected Subgraph Problem. CoRR Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy
2018	J	`jnl`	Uniquely Restricted Matchings in Interval Graphs. SIAM J. Discret. Math. Mathew C. Francis, Dalu Jacob, Satyabrata Jana
2016	J	`jnl`	Uniquely Restricted Matchings in Interval Graphs. CoRR Mathew C. Francis, Dalu Jacob, Satyabrata Jana