1 citations · 1 across the 3 of their papers we have counts for
5 papers
Quantum Query Complexity for List Search
Niranka Banerjee, Akinori Kawachi
Searching in a linked list is one of the most basic problems in classical algorithms. Although the nodes of the list come with memory addresses, classically those addresses play no…
Directed Token Sliding
Niranka Banerjee, Christian Engels, Duc A. Hoang
Reconfiguration problems involve determining whether two given configurations can be transformed into each other under specific rules. The Token Sliding problem asks whether, given…
Distance Recoloring
Niranka Banerjee, Christian Engels, Duc A. Hoang
Reconfiguration problems ask whether one feasible solution can be transformed into another by a sequence of local moves while maintaining feasibility throughout. For integers $d \g…
The Complexity of Distance- Dominating Set Reconfiguration
Niranka Banerjee, Duc A. Hoang
For a fixed integer , a distance- dominating set (DDS) of a graph is a vertex subset such that every vertex in is within distance $…
Improved Space efficient linear time algorithms for BFS, DFS and applications
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman +1
Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014), reconsidered classical fundamental graph algorithms focusing on improving the space complexity. We continu…