Shahbaz Khan

39 papers A* 3A 5B 3C 1Journal 25Unranked 2
YearRankTypeTitle / Venue / Authors
2025 C conf
Practical Algorithms for Hierarchical Overlap Graphs.
SPIRE
Saumya Talera, Parth Bansal, Shabnam Khan, Shahbaz Khan
2024 J jnl
Engineering Semi-streaming DFS algorithms.
CoRR
Kancharla Nikhilesh Bhagavan, Macharla Sri Vardhan, Madamanchi Ashok Chowdary, Shahbaz Khan
2024 J jnl
Evaluating Optimal Safe Flows Decomposition for RNA Assembly.
CoRR
Bashar Ahmed, Siddharth Singh Rana, Ujjwal, Shahbaz Khan
2024 J jnl
Practical algorithms for Hierarchical overlap graphs.
CoRR
Saumya Talera, Parth Bansal, Shabnam Khan, Shahbaz Khan
2024 J jnl
Width Helps and Hinders Splitting Flows.
ACM Trans. Algorithms
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2023 A conf
Cut Paths and Their Remainder Structure, with Applications.
STACS
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2022 J jnl
Cut paths and their remainder structure, with applications.
CoRR
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2022 J jnl
Improving RNA Assembly via Safety and Completeness in Flow Decompositions.
J. Comput. Biol.
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022 A conf
Optimizing Safe Flow Decompositions in DAGs.
ESA
Shahbaz Khan, Alexandru I. Tomescu
2022 B conf
Safety and Completeness in Flow Decompositions for RNA Assembly.
RECOMB
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022 J jnl
Safety and Completeness in Flow Decompositions for RNA Assembly.
CoRR
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu
2022 J jnl
Safety in s-t Paths, Trails and Walks.
Algorithmica
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu
2022 A conf
Width Helps and Hinders Splitting Flows.
ESA
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2022 J jnl
Width Helps and Hinders Splitting Flows.
CoRR
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams
2021 J jnl
A simplified algorithm computing all s-t bridges and articulation points.
Discret. Appl. Math.
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2021 B conf
Optimal Construction of Hierarchical Overlap Graphs.
CPM
Shahbaz Khan
2021 J jnl
Optimal Construction of Hierarchical Overlap Graphs.
CoRR
Shahbaz Khan
2021 J jnl
Safety of Flow Decompositions in DAGs.
CoRR
Shahbaz Khan, Alexandru I. Tomescu
2021 — conf
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching.
SOSA
Manoj Gupta, Shahbaz Khan
2020 J jnl
Computing all s-t bridges and articulation points simplified.
CoRR
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2020 A conf
Dynamic Matching Algorithms in Practice.
ESA
Monika Henzinger, Shahbaz Khan, Richard D. Paul, Christian Schulz
2020 J jnl
Dynamic Matching Algorithms in Practice.
CoRR
Monika Henzinger, Shahbaz Khan, Richard D. Paul, Christian Schulz
2020 J jnl
Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms.
CoRR
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli
2020 J jnl
Safety in s-t Paths, Trails and Walks.
CoRR
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu
2019 A conf
Depth First Search in the Semi-streaming Model.
STACS
Shahbaz Khan, Shashank K. Mehta
2019 J jnl
Depth First Search in the Semi-streaming Model.
CoRR
Shahbaz Khan, Shashank K. Mehta
2019 J jnl
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier.
SIAM J. Comput.
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2019 J jnl
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs.
ACM Trans. Parallel Comput.
Shahbaz Khan
2018 A* conf
Incremental DFS algorithms: a theoretical and experimental study.
SODA
Surender Baswana, Ayush Goel, Shahbaz Khan
2018 J jnl
Simple dynamic algorithms for Maximal Independent Set and other problems.
CoRR
Manoj Gupta, Shahbaz Khan
2017 J jnl
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs.
Algorithmica
Surender Baswana, Shahbaz Khan
2017 J jnl
Incremental DFS algorithms: a theoretical and experimental study.
CoRR
Surender Baswana, Ayush Goel, Shahbaz Khan
2017 A* conf
Multiple Source Dual Fault Tolerant BFS Trees.
ICALP
Manoj Gupta, Shahbaz Khan
2017 J jnl
Multiple Source Dual Fault Tolerant BFS Trees.
CoRR
Manoj Gupta, Shahbaz Khan
2017 B conf
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs.
SPAA
Shahbaz Khan
2017 J jnl
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs.
CoRR
Shahbaz Khan
2016 A* conf
Dynamic DFS in Undirected Graphs: breaking the O(
SODA
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2015 J jnl
Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier.
CoRR
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan
2014 — conf
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs.
ICALP (1)
Surender Baswana, Shahbaz Khan