| 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: CTW2020 …, 2021 | 3 | 2021 |
| Parameterized algorithms for finding highly connected solution A Abhinav, S Bandopadhyay, A Banik, S Saurabh Theoretical Computer Science 942, 47-56, 2023 | 2 | 2023 |
| Structural parameterizations of budgeted graph coloring S Bandopadhyay, S Banerjee, A Banik, V Raman Theoretical Computer Science 940, 209-221, 2023 | 2 | 2023 |
| Parameterized Complexity of Graph Partitioning into Connected Clusters A Abhinav, S Bandopadhyay, A Banik, S Saurabh arXiv preprint arXiv:2202.12042, 2022 | 1 | 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 | 1 | 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 | 1 | 2022 |
| Conflict and Fairness in Resource Allocation S Bandopadhyay, A Banik, S Gupta, P Jain, A Sahu, S Saurabh, P Tale arXiv preprint arXiv:2403.04265, 2024 | | 2024 |
| Shortest Path with Positive Disjunctive Constraints--a Parameterized Perspective S Bandopadhyay, S Banerjee, D Majumdar, F Panolan arXiv preprint arXiv:2309.04346, 2023 | | 2023 |
| L (2, 1)-Edge Labeling of Infinite Triangular Grid. S Bandopadhyay, SC Ghosh, S Koley ICTCS, 179-192, 2021 | | 2021 |
Aritra BanikAssistant professor, NISERVerified email at niser.ac.in
