Research Interests
Algorithms, Data Structures, Dynamic Graph Algorithms, Fault Tolerant Datastructures, Experimental Algorithms, Bioinformatics, Algorithms with Predictions
BioSketch
Research
[J9] Flowtigs: Safety in flow decompositions for assembly graphs
2024
Francisco Sena, Eliel Ingervo, Shahbaz Khan, Andrey Prjibelski, Sebastian Schmidt, Alexandru I. Tomescu | Cell Press
Journal: iScience Pages: 111208 , Volumes: 27(12) ,
[J8] Width Helps and Hinders Splitting Flows
2024
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams | ACM
Journal: Transactions on Algorithms Pages: 13:1-20 , Volumes: 20 (2) ,
[J7] Matchtigs: minimum plain text representation of k-mer sets
2023
Sebastian Schmidt, Shahbaz Khan, Jarno N. Alanko, Giulio E. Pibiri, Alexandru I. Tomescu | BioMed Central
Journal: Genome Biol Pages: 136 , Volumes: 24 ,
[J6] Improving RNA Assembly via Safety and Completeness in Flow Decompositions
2022
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu | Mary Ann Liebert, Inc.
Journal: J. Comput. Biol. Pages: 1270-1287 , Volumes: 29(12) ,
[J5] Safety in s-t Paths, Trails and Walks
2022
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu | Springer
Journal: Algorithmica Pages: 719-741 , Volumes: 84 (3) ,
[J4] A simplified algorithm computing all s-t bridges and articulation points
2021
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli | Elsevier
Journal: Discret. Appl. Math. Pages: 103-108 , Volumes: 305 ,
[J3] Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
2019
Shahbaz Khan | ACM
Journal: ACM Trans. Parallel Comput. Pages: 18:1-18:33 , Volumes: 6 (3) ,
[J2] Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier
2019
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan | SIAM
Journal: SIAM J. Comput. Pages: 1335-1363 , Volumes: 48 (4) ,
[J1] Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
2017
Surender Baswana, Shahbaz Khan | Springer
Journal: Algorithmica Pages: 466-483 , Volumes: 79 (2) ,
[C14] Flowtigs: safety in flow decompositions for assembly graphs
2024
Francisco Sena, Eliel Ingervo, Shahbaz Khan, Andrey Prjibelski, Sebastian Schmidt, Alexandru I. Tomescu | NA
Journal: Conference: RECOMB-Seq
[C13] Cut paths and their remainder structure, with applications
2023
Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: Conference: STACS Pages: 17:1-17:17 ,
[C12] Width Helps and Hinders Splitting Flows
2022
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: Conference: ESA Pages: 31:1-31:14 , Volumes: 244 ,
[C11] Optimizing Safe Flow Decompositions in DAGs
2022
Shahbaz Khan, Alexandru I. Tomescu | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: Conference: ESA Pages: 72:1-72:17 , Volumes: 244 ,
[C10] Safety and Completeness in Flow Decompositions for RNA Assembly
2022
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu | Springer
Journal: Conference: RECOMB Pages: 177-192 , Volumes: 13278 ,
[C9] Optimal Construction of Hierarchical Overlap Graphs
2021
Shahbaz Khan | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: Conference: CPM Pages: 17:1-17:11 , Volumes: 191 ,
[C8] Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching
2021
Manoj Gupta, Shahbaz Khan | SIAM
Journal: Conference: SOSA Pages: 86-91 ,
[C7] Dynamic Matching Algorithms in Practice
2020
Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: ESA Pages: 58:1-58:20 , Volumes: 173 ,
[C6] Depth First Search in the Semi-streaming Model
2019
Shahbaz Khan, Shashank K. Mehta | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: Conference: STACS Pages: 42:1-42:16 , Volumes: 126 ,
[C5] Incremental DFS algorithms: a theoretical and experimental study
2018
Surender Baswana, Ayush Goel, Shahbaz Khan | SIAM
Journal: Conference: SODA Pages: 53-72 ,
[C4] Multiple Source Dual Fault Tolerant BFS Trees
2017
Manoj Gupta, Shahbaz Khan | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: Conference: ICALP Pages: 127:1-127:15 , Volumes: 80 ,
[C3] Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
2017
Shahbaz Khan | ACM
Journal: Conference: SPAA Pages: 283-292 ,
[C2] Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
2016
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan | SIAM
Journal: Conference: SODA Pages: 730-739 ,
[C1] Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
2014
Surendra Baswana, Shahbaz Khan | Springer
Journal: Conference: ICALP (1) Pages: 138-149 , Volumes: 8572 ,
Honors And Awards
Teaching Engagements
Students
Miscellaneous
I take summer interns only through the SPARK summer internship program at IIT Roorkee (https://spark.iitr.ac.in/), and NPTEL Predoc Internship (https://nptel.ac.in/predocfellowship/).
DO NOT SEND ANY SUMMER/WINTER INTERNSHIP QUERIES, THEY WILL NOT BE RESPONDED.