Niranka Banerjee

According to our database1, Niranka Banerjee authored at least 10 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Distance Recoloring.
CoRR, 2024

2023
The Complexity of Distance-r Dominating Set Reconfiguration.
CoRR, 2023

2022
Output Sensitive Fault Tolerant Maximum Matching.
Proceedings of the Computer Science - Theory and Applications, 2022

2020
Fully dynamic arboricity maintenance.
Theor. Comput. Sci., 2020

Optimal Output Sensitive Fault Tolerant Cuts.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2018
Space Efficient Linear Time Algorithms for BFS, DFS and Applications.
Theory Comput. Syst., 2018

Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds.
Proceedings of the Computer Science - Theory and Applications, 2018

Minimum Transactions Problem.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2016
Improved Space Efficient Algorithms for BFS, DFS and Applications.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015


  Loading...