Improved space efficient algorithms for BFS, DFS and applications N Banerjee, S Chakraborty, V Raman International Computing and Combinatorics Conference, 119-130, 2016 | 32 | 2016 |
Space efficient linear time algorithms for BFS, DFS and applications N Banerjee, S Chakraborty, V Raman, SR Satti Theory of Computing Systems 62, 1736-1762, 2018 | 28 | 2018 |
Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs N Banerjee, S Chakraborty, V Raman, S Roy, S Saurabh Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015 | 19 | 2015 |
Fully dynamic arboricity maintenance N Banerjee, V Raman, S Saurabh Theoretical Computer Science 822, 1-14, 2020 | 6 | 2020 |
Maintaining chordal graphs dynamically: Improved upper and lower bounds N Banerjee, V Raman, SR Satti International Computer Science Symposium in Russia, 29-40, 2018 | 3 | 2018 |
Optimal Output Sensitive Fault Tolerant Cuts N Banerjee, V Raman, S Saurabh 40th IARCS Annual Conference on Foundations of Software Technology and …, 2020 | 1 | 2020 |
Distance Recoloring N Banerjee, C Engels, DA Hoang arXiv preprint arXiv:2402.12705, 2024 | | 2024 |
The Complexity of Distance- Dominating Set Reconfiguration N Banerjee, DA Hoang arXiv preprint arXiv:2310.00241, 2023 | | 2023 |
Output sensitive fault tolerant maximum matching N Banerjee, M Gupta, V Raman, S Saurabh International Computer Science Symposium in Russia, 115-132, 2022 | | 2022 |
Dynamizing Graph Classes and Output Sensitive Fault Tolerant Subgraph Problems [HBNI Th198] N Banerjee The Institute of Mathematical Sciences, 2021 | | 2021 |
Minimum Transactions Problem N Banerjee, V Jayapaul, SR Satti International Computing and Combinatorics Conference, 650-661, 2018 | | 2018 |
Dynamizing Graph Classes and Output Sensitive Fault Tolerant Subgraph Problems N Banerjee Mumbai, 0 | | |