L(2, 1)-Edge Labeling of Infinite Triangular Grid. - Susobhan Bandopadhyay; Sasthi C. Ghosh 001; Subhasis Koley (ICTCS, 2021)

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 001 (MFCS, 2022)

Improved Bounds on the Span of L(1, 2)-edge Labeling of Some Infinite Regular Grids. - Susobhan Bandopadhyay; Sasthi C. Ghosh 001; Subhasis Koley (CoRR, 2022)

Parameterized Complexity of Graph Partitioning into Connected Clusters. - Ankit Abhinav; Susobhan Bandopadhyay; Aritra Banik; Saket Saurabh 001 (CoRR, 2022)

Shortest Path with Positive Disjunctive Constraints - a Parameterized Perspective. - Susobhan Bandopadhyay; Suman Banerjee 002; Diptapriyo Majumdar; Fahad Panolan (CoRR, 2023)

Parameterized algorithms for finding highly connected solution. - Ankit Abhinav; Susobhan Bandopadhyay; Aritra Banik; Saket Saurabh 001 (Theor. Comput. Sci., 2023)

Structural parameterizations of budgeted graph coloring. - Susobhan Bandopadhyay; Suman Banerjee 002; Aritra Banik; Venkatesh Raman 001 (Theor. Comput. Sci., 2023)

Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. - Susobhan Bandopadhyay; Suman Banerjee 002; Diptapriyo Majumdar; Fahad Panolan (COCOA (2), 2024)

Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints. - Susobhan Bandopadhyay; Aritra Banik; Diptapriyo Majumdar; Abhishek Sahu (MFCS, 2024)

Conflict and Fairness in Resource Allocation. - Susobhan Bandopadhyay; Aritra Banik; Sushmita Gupta; Pallavi Jain 001; Abhishek Sahu; Saket Saurabh 001; Prafullkumar Tale (CoRR, 2024)

A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs. - Susobhan Bandopadhyay; Sagnik Sen 001; S. Taruni (CoRR, 2024)