Publications

(2024). Width Helps and Hinders Splitting Flows. In TALG.

PDF

(2023). Sorting Finite Automata via Partition Refinement. In ESA 2023.

PDF

(2023). Minimum Path Cover: The Power of Parameterization. In arXiv.

PDF

(2023). Minimum Chain Cover in Almost Linear Time. Best student paper (track A) in ICALP 2023.

PDF

(2023). Finding Maximal Exact Matches in Graphs. In WABI 2023.

PDF

(2023). Chaining of Maximal Exact Matches in Graphs. In SPIRE 2023.

PDF

(2023). A Safety Framework for Flow Decomposition Problems via Integer Linear Programming. In Bioinformatics.

PDF

(2022). Minimum Path Cover in Parameterized Linear Time. In arXiv.

PDF

(2022). Improving RNA Assembly via Safety and Completeness in Flow Decompositions. In Journal of Computational Biology.

PDF Code DOI

(2022). Width Helps and Hinders Splitting Flows. In ESA 2022.

PDF

(2022). Safety and Completeness in Flow Decompositions for RNA Assembly. In RECOMB 2022.

PDF Code Slides

(2022). Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time. In SODA 2022.

PDF Slides DOI

(2022). Chaining for Accurate Alignment of Erroneous Long Reads to Acyclic Variation Graphs. In Bioinformatics.

PDF Slides

(2022). Safety in multi-assembly via paths appearing in all path covers of a DAG. In IEEE/ACM Transactions on Computational Biology and Bioinformatics.

PDF Code DOI

(2021). A linear-time parameterized algorithm for computing the width of a DAG. In WG 2021.

PDF Slides Video DOI

(2020). Block Trees. In Journal of Computer and System Sciences.

PDF Code DOI

(2020). Fast Indexes for Gapped Pattern Matching. In SOFSEM 2020.

PDF DOI