Susobhan Bandopadhyay

17 papers B 3Misc 1Journal 11Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints.
CoRR
Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu
2026 J jnl
On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints.
Inf. Comput.
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2025 J jnl
Shift Bribery over Social Networks.
CoRR
Ashlesha Hota, Susobhan Bandopadhyay, Palash Dey, Shruti Thiagu
2024 J jnl
A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs.
CoRR
Susobhan Bandopadhyay, Sagnik Sen, S. Taruni
2024 J jnl
Conflict and Fairness in Resource Allocation.
CoRR
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2024 — conf
Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints.
COCOA (2)
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2024 B conf
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints.
MFCS
Susobhan Bandopadhyay, Aritra Banik, Diptapriyo Majumdar, Abhishek Sahu
2023 J jnl
Parameterized algorithms for finding highly connected solution.
Theor. Comput. Sci.
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
2023 J jnl
Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective.
CoRR
Susobhan Bandopadhyay, Suman Banerjee, Diptapriyo Majumdar, Fahad Panolan
2023 J jnl
Structural parameterizations of budgeted graph coloring.
Theor. Comput. Sci.
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
2022 J jnl
Improved Bounds on the Span of L(1, 2)-edge Labeling of Some Infinite Regular Grids.
CoRR
Susobhan Bandopadhyay, Sasthi C. Ghosh, Subhasis Koley
2022 Misc conf
Parameterized Algorithms for Finding Highly Connected Solution.
CSR
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
2022 J jnl
Parameterized Complexity of Graph Partitioning into Connected Clusters.
CoRR
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh
2022 B conf
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets.
MFCS
Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh
2022 B conf
Structural Parameterizations of Budgeted Graph Coloring.
WALCOM
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman
2021 — conf
L(2, 1)-Edge Labeling of Infinite Triangular Grid.
ICTCS
Susobhan Bandopadhyay, Sasthi C. Ghosh, Subhasis Koley
2021 J jnl
Structural Parameterizations of Budgeted Graph Coloring.
CoRR
Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman