Shahbaz Khan

Orcid: 0000-0001-9352-0088

Affiliations:

Indian Institute of Technology Roorkee, India
University of Helsinki, Department of Computer Science, Finland (former)
University of Vienna, Research Group Theory and Applications of Algorithms, Austria (2017 - 2018)
Indian Institute of Technology Kanpur, India (PhD 2017)

According to our database¹, Shahbaz Khan authored at least 25 papers between 2015 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2024

Width Helps and Hinders Splitting Flows.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2024

Evaluating Optimal Safe Flows Decomposition for RNA Assembly.

[BibT_eX]

[DOI]

CoRR, 2024

Engineering Semi-streaming DFS algorithms.

[BibT_eX]

[DOI]

Kancharla Nikhilesh Bhagavan

Macharla Sri Vardhan

Madamanchi Ashok Chowdary

Shahbaz Khan

CoRR, 2024

Practical algorithms for Hierarchical overlap graphs.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Cut Paths and Their Remainder Structure, with Applications.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Improving RNA Assembly via Safety and Completeness in Flow Decompositions.

[BibT_eX]

[DOI]

J. Comput. Biol., 2022

Safety in s-t Paths, Trails and Walks.

[BibT_eX]

[DOI]

Algorithmica, 2022

Safety and Completeness in Flow Decompositions for RNA Assembly.

[BibT_eX]

[DOI]

Proceedings of the Research in Computational Molecular Biology, 2022

Optimizing Safe Flow Decompositions in DAGs.

[BibT_eX]

[DOI]

Shahbaz Khan

Alexandru I. Tomescu

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

A simplified algorithm computing all s-t bridges and articulation points.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Safety of Flow Decompositions in DAGs.

[BibT_eX]

[DOI]

Shahbaz Khan

Alexandru I. Tomescu

CoRR, 2021

Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching.

[BibT_eX]

[DOI]

Manoj Gupta

Shahbaz Khan

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Optimal Construction of Hierarchical Overlap Graphs.

[BibT_eX]

[DOI]

Shahbaz Khan

Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020

Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms.

[BibT_eX]

[DOI]

CoRR, 2020

Computing all s-t bridges and articulation points simplified.

[BibT_eX]

[DOI]

CoRR, 2020

Dynamic Matching Algorithms in Practice.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs.

[BibT_eX]

[DOI]

Shahbaz Khan

ACM Trans. Parallel Comput., 2019

Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier.

[BibT_eX]

[DOI]

Surender Baswana

Shreejit Ray Chaudhury

Keerti Choudhary

Shahbaz Khan

SIAM J. Comput., 2019

Depth First Search in the Semi-streaming Model.

[BibT_eX]

[DOI]

Shahbaz Khan

Shashank K. Mehta

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Simple dynamic algorithms for Maximal Independent Set and other problems.

[BibT_eX]

[DOI]

Manoj Gupta

Shahbaz Khan

CoRR, 2018

Incremental DFS algorithms: a theoretical and experimental study.

[BibT_eX]

[DOI]

Surender Baswana

Ayush Goel

Shahbaz Khan

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs.

[BibT_eX]

[DOI]

Surender Baswana

Shahbaz Khan

Algorithmica, 2017

Multiple Source Dual Fault Tolerant BFS Trees.

[BibT_eX]

[DOI]

Manoj Gupta

Shahbaz Khan

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier.

[BibT_eX]

[DOI]

Surender Baswana

Shreejit Ray Chaudhury

Keerti Choudhary

Shahbaz Khan

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier.

[BibT_eX]

[DOI]

Surender Baswana

Shreejit Ray Chaudhury

Keerti Choudhary

Shahbaz Khan

CoRR, 2015

Shahbaz Khan

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...