Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (CoRR, 2015)

Dynamic DFS in Undirected Graphs: breaking the O(m) barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (SODA, 2016)

Multiple Source Dual Fault Tolerant BFS Trees. - Manoj Gupta 002; Shahbaz Khan 004 (ICALP, 2017)

Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs. - Surender Baswana; Shahbaz Khan 004 (Algorithmica, 2017)

Incremental DFS algorithms: a theoretical and experimental study. - Surender Baswana; Ayush Goel; Shahbaz Khan 004 (SODA, 2018)

Simple dynamic algorithms for Maximal Independent Set and other problems. - Manoj Gupta 002; Shahbaz Khan 004 (CoRR, 2018)

Depth First Search in the Semi-streaming Model. - Shahbaz Khan 004; Shashank K. Mehta (STACS, 2019)

Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier. - Surender Baswana; Shreejit Ray Chaudhury; Keerti Choudhary; Shahbaz Khan 004 (SIAM J. Comput., 2019)

Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs. - Shahbaz Khan 004 (ACM Trans. Parallel Comput., 2019)

Dynamic Matching Algorithms in Practice. - Monika Henzinger; Shahbaz Khan 004; Richard D. Paul; Christian Schulz 003 (ESA, 2020)

Computing all s-t bridges and articulation points simplified. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (CoRR, 2020)

Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (CoRR, 2020)

Optimal Construction of Hierarchical Overlap Graphs. - Shahbaz Khan 004 (CPM, 2021)

Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. - Manoj Gupta 002; Shahbaz Khan 004 (SOSA, 2021)

Safety of Flow Decompositions in DAGs. - Shahbaz Khan 004; Alexandru I. Tomescu (CoRR, 2021)

A simplified algorithm computing all s-t bridges and articulation points. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (Discret. Appl. Math., 2021)

Optimizing Safe Flow Decompositions in DAGs. - Shahbaz Khan 004; Alexandru I. Tomescu (ESA, 2022)

Safety and Completeness in Flow Decompositions for RNA Assembly. - Shahbaz Khan 004; Milla Kortelainen; Manuel Cáceres; Lucia Williams; Alexandru I. Tomescu (RECOMB, 2022)

Safety in s-t Paths, Trails and Walks. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu (Algorithmica, 2022)

Improving RNA Assembly via Safety and Completeness in Flow Decompositions. - Shahbaz Khan 004; Milla Kortelainen; Manuel Cáceres; Lucia Williams; Alexandru I. Tomescu (J. Comput. Biol., 2022)

Cut Paths and Their Remainder Structure, with Applications. - Massimo Cairo; Shahbaz Khan 004; Romeo Rizzi; Sebastian S. Schmidt; Alexandru I. Tomescu; Elia C. Zirondelli (STACS, 2023)

Practical algorithms for Hierarchical overlap graphs. - Saumya Talera; Parth Bansal; Shabnam Khan; Shahbaz Khan 004 (CoRR, 2024)

Engineering Semi-streaming DFS algorithms. - Kancharla Nikhilesh Bhagavan; Macharla Sri Vardhan; Madamanchi Ashok Chowdary; Shahbaz Khan 004 (CoRR, 2024)

Evaluating Optimal Safe Flows Decomposition for RNA Assembly. - Bashar Ahmed; Siddharth Singh Rana; Ujjwal; Shahbaz Khan 004 (CoRR, 2024)

Width Helps and Hinders Splitting Flows. - Manuel Cáceres; Massimo Cairo; Andreas Grigorjew; Shahbaz Khan 004; Brendan Mumey; Romeo Rizzi; Alexandru I. Tomescu; Lucia Williams (ACM Trans. Algorithms, 2024)