Follow
Susobhan Bandopadhyay
Susobhan Bandopadhyay
NISER Bhubaneswar
Verified email at niser.ac.in
Title
Cited by
Cited by
Year
Improved Bounds on the Span of L(1, 2)-edge Labeling of Some Infinite Regular Grids
S Bandopadhyay, SC Ghosh, S Koley
Graphs and Combinatorial Optimization: from Theory to Applications, 53-65, 2021
22021
Parameterized Complexity of Graph Partitioning into Connected Clusters
A Abhinav, S Bandopadhyay, A Banik, S Saurabh
arXiv preprint arXiv:2202.12042, 2022
12022
Structural parameterizations of budgeted graph coloring
S Bandopadhyay, S Banerjee, A Banik, V Raman
International Conference and Workshops on Algorithms and Computation, 340-351, 2022
2022
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets
A Abhinav, S Bandopadhyay, A Banik, Y Kobayashi, S Nagano, Y Otachi, ...
47th International Symposium on Mathematical Foundations of Computer Science …, 2022
2022
Parameterized Algorithms for Finding Highly Connected Solution
A Abhinav, S Bandopadhyay, A Banik, S Saurabh
International Computer Science Symposium in Russia, 1-16, 2022
2022
L (2, 1)-Edge Labeling of Infinite Triangular Grid.
S Bandopadhyay, SC Ghosh, S Koley
ICTCS, 179-192, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–6