Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. - Surender Baswana; Shiv Kumar Gupta 001; Ayush Tulsyan (MFCS, 2019)

Mincut Sensitivity Data Structures for the Insertion of an Edge. - Surender Baswana; Shiv Kumar Gupta 001; Till Knollmann (Algorithmica, 2022)

Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient. - Surender Baswana; Shiv Kumar Gupta 001; Ayush Tulsyan (Algorithmica, 2022)