Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001; Sasanka Roy; Saket Saurabh 001 (COCOON, 2015)

Improved Space Efficient Algorithms for BFS, DFS and Applications. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001 (COCOON, 2016)

Minimum Transactions Problem. - Niranka Banerjee; Varunkumar Jayapaul; Srinivasa Rao Satti (COCOON, 2018)

Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. - Niranka Banerjee; Venkatesh Raman 001; Srinivasa Rao Satti (CSR, 2018)

Space Efficient Linear Time Algorithms for BFS, DFS and Applications. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001; Srinivasa Rao Satti (Theory Comput. Syst., 2018)

Optimal Output Sensitive Fault Tolerant Cuts. - Niranka Banerjee; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2020)

Fully dynamic arboricity maintenance. - Niranka Banerjee; Venkatesh Raman 001; Saket Saurabh 001 (Theor. Comput. Sci., 2020)

Output Sensitive Fault Tolerant Maximum Matching. - Niranka Banerjee; Manoj Gupta 002; Venkatesh Raman 001; Saket Saurabh 001 (CSR, 2022)

The Complexity of Distance-r Dominating Set Reconfiguration. - Niranka Banerjee; Duc A. Hoang 001 (COCOON (1), 2024)

Distance Recoloring. - Niranka Banerjee; Christian Engels; Duc A. Hoang 001 (CoRR, 2024)

Directed Token Sliding. - Niranka Banerjee; Christian Engels; Duc A. Hoang 001 (CoRR, 2024)