Research Interests
Algorithms, Data Structures, Dynamic Graph Algorithms, Fault Tolerant Datastructures, Experimental Algorithms, Bioinformatics
BioSketch
Research
Safety in s-t Paths, Trails and Walks
2022
Cairo M,Khan S,Rizzi R,Schmidt SS,Tomescu AI | Springer
Journal: Algorithmica Pages: 719-741 , Volumes: 84 (3) ,
Cut paths and their remainder structure, with applications
2023
Cairo M, Khan S, Rizzi R, Schmidt S, Tomescu AI, Zirondelli EC | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: STACS
Width Helps and Hinders Splitting Flows
2022
Cáceres M,Cairo M,Grigorjew A,Khan S,Mumey B,Rizzi R,Tomescu AI,Williams L | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: ESA Pages: 31:1-31:14 , Volumes: 244 ,
Optimizing Safe Flow Decompositions in DAGs
2022
Khan S,Tomescu AI | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: ESA Pages: 72:1-72:17 , Volumes: 244 ,
Safety and Completeness in Flow Decompositions for RNA Assembly
2022
Khan S,Kortelainen M,Cáceres M,Williams L,Tomescu AI | Springer
Journal: RECOMB Pages: 177-192 , Volumes: 13278 ,
A simplified algorithm computing all s-t bridges and articulation points
2021
Cairo M,Khan S,Rizzi R,Schmidt SS,Tomescu AI,Zirondelli EC | Elsevier
Journal: Discret. Appl. Math. Pages: 103-108 , Volumes: 305 ,
Optimal Construction of Hierarchical Overlap Graphs
2021
Khan S | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: CPM Pages: 17:1-17:11 , Volumes: 191 ,
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching
2021
Gupta M,Khan S | SIAM
Journal: SOSA Pages: 86-91 ,
Dynamic Matching Algorithms in Practice
2020
Henzinger M,Khan S,Paul R,Schulz C | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: ESA Pages: 58:1-58:20 , Volumes: 173 ,
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier
2019
Baswana S,Chaudhury SR,Choudhary K,Khan S | SIAM
Journal: SIAM J. Comput. Pages: 1335-1363 , Volumes: 48 (4) ,
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
2019
Khan S | ACM
Journal: ACM Trans. Parallel Comput. Pages: 18:1-18:33 , Volumes: 6 (3) ,
Depth First Search in the Semi-streaming Model
2019
Khan S,Mehta SK | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: STACS Pages: 42:1-42:16 , Volumes: 126 ,
Incremental DFS algorithms: a theoretical and experimental study
2018
Baswana S,Goel A,Khan S | SIAM
Journal: SODA Pages: 53-72 ,
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs
2017
Baswana S,Khan S | Springer
Journal: Algorithmica Pages: 466-483 , Volumes: 79 (2) ,
Multiple Source Dual Fault Tolerant BFS Trees
2017
Gupta M,Khan S | Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Journal: ICALP Pages: 127:1-127:15 , Volumes: 80 ,
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
2017
Khan S | ACM
Journal: SPAA Pages: 283-292 ,
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier
2016
Baswana S,Chaudhury SR,Choudhary K,Khan S | SIAM
Journal: SODA Pages: 730-739 ,
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs
2014
Baswana S,Khan S | Springer
Journal: ICALP (1) Pages: 138-149 , Volumes: 8572 ,
Honors And Awards
Teaching Engagements
Miscellaneous
I take summer interns only through the SPARK summer internship program at IIT Roorkee (https://spark.iitr.ac.in/).
DO NOT SEND ANY SUMMER/WINTER INTERNSHIP QUERIES, THEY WILL NOT BE RESPONDED.
