5 citations · 6 across the 2 of their papers we have counts for
10 papers
Cut paths and their remainder structure, with applications
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
In a strongly connected graph , a cut arc (also called strong bridge) is an arc whose removal makes the graph no longer strongly connected. Equivalently, there…
Safety and Completeness in Flow Decompositions for RNA Assembly
Shahbaz Khan, Milla Kortelainen, Manuel Cáceres +2
Decomposing a network flow into weighted paths has numerous applications. Some applications require any decomposition that is optimal w.r.t. some property such as number of paths,…
Optimal Construction of Hierarchical Overlap Graphs
Shahbaz Khan
Genome assembly is a fundamental problem in Bioinformatics, where for a given set of overlapping substrings of a genome, the aim is to reconstruct the source genome. The classical…
The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
Genome assembly is a fundamental problem in Bioinformatics, requiring to reconstruct a source genome from an assembly graph built from a set of reads (short strings sequenced from…
Computing all - bridges and articulation points simplified
Massimo Cairo, Shahbaz Khan, Romeo Rizzi +3
Given a directed graph and a pair of nodes and , an - bridge of is an edge whose removal breaks all - paths of . Similarly, an - articulation po…
Dynamic Matching Algorithms in Practice
Monika Henzinger, Shahbaz Khan, Richard Paul +1
In recent years, significant advances have been made in the design and analysis of fully dynamic maximal matching algorithms. However, these theoretical results have received very…