research
∙
02/08/2023
Shortcut Detection with Variational Autoencoders
For real-world applications of machine learning (ML), it is essential th...
share
research
∙
10/14/2022
Cut paths and their remainder structure, with applications
In a strongly connected graph G = (V,E), a cut arc (also called strong b...
research
∙
07/05/2022
Width Helps and Hinders Splitting Flows
Minimum flow decomposition (MFD) is the NP-hard problem of finding a sma...
research
∙
01/25/2022
Safety and Completeness in Flow Decompositions for RNA Assembly
Decomposing a network flow into weighted paths has numerous applications...
research
∙
02/12/2021
Safety of Flow Decompositions in DAGs
Network flows are one of the most studied combinatorial optimization pro...
research
∙
02/04/2021
Optimal Construction of Hierarchical Overlap Graphs
Genome assembly is a fundamental problem in Bioinformatics, where for a ...
research
∙
11/25/2020
Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms
Genome assembly is a fundamental problem in Bioinformatics, requiring to...
research
∙
07/09/2020
Safety in s-t Paths, Trails and Walks
Given a directed graph G and a pair of nodes s and t, an s-t bridge of G...
research
∙
06/26/2020
Computing all s-t bridges and articulation points simplified
Given a directed graph G and a pair of nodes s and t, an s-t bridge of G...
research
∙
04/20/2020
Dynamic Matching Algorithms in Practice
In recent years, significant advances have been made in the design and a...
research
∙
01/11/2019
Depth First Search in the Semi-streaming Model
Depth first search (DFS) tree is a fundamental data structure for solvin...
research
∙
04/05/2018
