| Dynamic DFS in Undirected Graphs: breaking the O(m) barrier S Baswana, SR Chaudhury, K Choudhary, S Khan Proceedings of the twenty-seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 52 | 2016 |
| Simple dynamic algorithms for maximal independent set, maximum flow and maximum matching M Gupta, S Khan Symposium on Simplicity in Algorithms (SOSA), 86-91, 2021 | 42* | 2021 |
| Multiple source dual fault tolerant BFS trees M Gupta, S Khan arXiv preprint arXiv:1704.06907, 2017 | 31 | 2017 |
| Safety and completeness in flow decompositions for RNA assembly S Khan, M Kortelainen, M Cáceres, L Williams, AI Tomescu International Conference on Research in Computational Molecular Biology, 177-192, 2022 | 13 | 2022 |
| Incremental algorithm for maintaining a DFS tree for undirected graphs S Baswana, S Khan Algorithmica 79 (2), 466-483, 2017 | 13 | 2017 |
| Dynamic matching algorithms in practice M Henzinger, S Khan, R Paul, C Schulz arXiv preprint arXiv:2004.09099, 2020 | 12 | 2020 |
| Near optimal parallel algorithms for dynamic DFS in undirected graphs S Khan ACM Transactions on Parallel Computing (TOPC) 6 (3), 1-33, 2019 | 12 | 2019 |
| Depth first search in the semi-streaming model S Khan, SK Mehta arXiv preprint arXiv:1901.03689, 2019 | 11 | 2019 |
| The hydrostructure: a universal framework for safe and complete algorithms for genome assembly M Cairo, S Khan, R Rizzi, S Schmidt, AI Tomescu, EC Zirondelli arXiv preprint arXiv:2011.12635, 2020 | 9 | 2020 |
| Incremental DFS algorithms: a theoretical and experimental study S Baswana, A Goel, S Khan Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 9 | 2018 |
| Width helps and hinders splitting flows M Cáceres, M Cairo, A Grigorjew, S Khan, B Mumey, R Rizzi, AI Tomescu, ... ACM Transactions on Algorithms 20 (2), 1-20, 2024 | 8 | 2024 |
| Improving RNA assembly via safety and completeness in flow decompositions S Khan, M Kortelainen, M Cáceres, L Williams, AI Tomescu Journal of Computational Biology 29 (12), 1270-1287, 2022 | 7 | 2022 |
| Matchtigs: minimum plain text representation of k-mer sets S Schmidt, S Khan, JN Alanko, GE Pibiri, AI Tomescu Genome Biology 24 (1), 136, 2023 | 5 | 2023 |
| Cut paths and their remainder structure, with applications M Cairo, S Khan, R Rizzi, S Schmidt, AI Tomescu, EC Zirondelli arXiv preprint arXiv:2210.07530, 2022 | 5 | 2022 |
| Optimal construction of hierarchical overlap graphs S Khan arXiv preprint arXiv:2102.02873, 2021 | 5 | 2021 |
| A simplified algorithm computing all st bridges and articulation points M Cairo, S Khan, R Rizzi, S Schmidt, AI Tomescu, EC Zirondelli Discrete Applied Mathematics 305, 103-108, 2021 | 3 | 2021 |
| Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms M Cairo, S Khan, R Rizzi, S Schmidt, AI Tomescu, EC Zirondelli arXiv preprint arXiv:2011.12635, 2020 | 3 | 2020 |
| Safety in s-t Paths, Trails and Walks M Cairo, S Khan, R Rizzi, S Schmidt, AI Tomescu Algorithmica 84 (3), 719-741, 2022 | 2 | 2022 |
| Optimizing safe flow decompositions in DAGs S Khan, AI Tomescu arXiv preprint arXiv:2102.06480, 2021 | 2 | 2021 |
| Safety of flow decompositions in dags S Khan, AI Tomescu ArXiv, 2021 | 2 | 2021 |
Surender BaswanaProfessor, Department of Computer Science and Engineering, IIT Kanpur, INDIA.Verified email at cse.iitk.ac.in
