Shahbaz Khan

Employment

• Indian Institute of Technology Roorkee Assistant Professor
  2021 - Present
• University of Helsinki Post Doctoral Researcher
  2020 - 2021
• University of Vienna Post Doctorate Researcher
  2017 - 2018

Education

• Indian Institute of Technology Kanpur Doctor of Philosophy
  2013 - 2017
• Indian Institute of Technology Kanpur Master of Technology
  2011 - 2013
• Zakir Hussain College of Engineering and Technology Bachelor of Technology
  2007 - 2011

Projects & Funding

Projects & funding information is unavailable.

Publications (20)

• Width Helps and Hinders Splitting Flows
  ACM Transactions on Algorithms 2024 DOI: 10.1145/3641820
  +Save
• Matchtigs: minimum plain text representation of kmer sets
  Genome Biology 2023 DOI: 10.1186/s13059-023-02968-z
  +Save
• Cut paths and their remainder structure, with applications
  40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023 2023 DOI: 10.4230/LIPIcs.STACS.2023.17
  +Save
• Improving RNA Assembly via Safety and Completeness in Flow Decompositions
  Journal of Computational Biology 2022 DOI: 10.1089/cmb.2022.0261
  +Save
• Safety in s-t Paths, Trails and Walks
  Algorithmica 2022 DOI: 10.1007/s00453-021-00877-w
  +Save
• Safety and Completeness in Flow Decompositions for RNA Assembly
  Research in Computational Molecular Biology - 26th Annual International Conference, RECOMB 2022, San Diego, CA, USA, May 22-25, 2022, Proceedings 2022 DOI: 10.1007/978-3-031-04749-7_11
  +Save
• Width Helps and Hinders Splitting Flows
  30th Annual European Symposium on Algorithms (ESA 2022) 2022 DOI: 10.4230/LIPIcs.ESA.2022.31
  +Save
• A simplified algorithm computing all s-t bridges and articulation points
  Discrete Applied Mathematics 2021 DOI: 10.1016/j.dam.2021.08.026
  +Save
• Optimal Construction of Hierarchical Overlap Graphs
  32nd Annual Symposium on Combinatorial Pattern Matching 2021 DOI: 10.4230/LIPIcs.CPM.2021.17
  +Save
• Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching
  Proceedings Symposium on Simplicity in Algorithms (SOSA) 2021 DOI: 10.1137/1.9781611976496.10
  +Save