Publications

(2025). Maximum Coverage k-Antichains and Chains: A Greedy Approach. In arXiv.
(2024). Exploiting uniqueness: seed-chain-extend alignment on elastic founder graphs. In biorXiv.
(2024). Practical Minimum Path Cover. In SEA 2024.
(2024). Finding Maximal Exact Matches in Graphs. In AMB.
(2024). Width Helps and Hinders Splitting Flows. In TALG.
(2023). Sorting Finite Automata via Partition Refinement. In ESA 2023.
(2023). Minimum Chain Cover in Almost Linear Time. Best student paper (track A) in ICALP 2023.
(2023). Finding Maximal Exact Matches in Graphs. In WABI 2023.
(2023). Chaining of Maximal Exact Matches in Graphs. In SPIRE 2023.