Susobhan Bandopadhyay

According to our database, Susobhan Bandopadhyay authored at least 14 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints.

Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu

CoRR, February, 2026

On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints.

Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan

Inf. Comput., 2026

2025

Shift Bribery over Social Networks.

Ashlesha Hota, Susobhan Bandopadhyay, Palash Dey, Shruti Thiagu

CoRR, October, 2025

2024

A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs.

Susobhan Bandopadhyay, Sagnik Sen, S. Taruni

CoRR, 2024

Conflict and Fairness in Resource Allocation.

Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale

CoRR, 2024

Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints.

Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints.

Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan

Proceedings of the Combinatorial Optimization and Applications, 2024

2023

Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective.

Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan

CoRR, 2023

2022

Parameterized Complexity of Graph Partitioning into Connected Clusters.

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh

CoRR, 2022

Improved Bounds on the Span of L(1, 2)-edge Labeling of Some Infinite Regular Grids.

Susobhan Bandopadhyay, Sasthi C. Ghosh, Subhasis Koley

CoRR, 2022

Structural Parameterizations of Budgeted Graph Coloring.

Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman

Proceedings of the WALCOM: Algorithms and Computation, 2022

Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Parameterized Algorithms for Finding Highly Connected Solution.

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh

Proceedings of the Computer Science - Theory and Applications, 2022

2021

L(2, 1)-Edge Labeling of Infinite Triangular Grid.

Susobhan Bandopadhyay, Sasthi C. Ghosh, Subhasis Koley

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021