| No. |
Title |
Author |
Year |
| 1 |
Cut Paths and Their Remainder Structure, with Applications |
Cairo, Massimo et al. |
2023 |
| 2 |
Optimizing Safe Flow Decompositions in DAGs |
Khan, Shahbaz et al. |
2022 |
| 3 |
Width Helps and Hinders Splitting Flows |
Cáceres, Manuel et al. |
2022 |
| 4 |
Algorithms and Complexity on Indexing Elastic Founder Graphs |
Equi, Massimo et al. |
2021 |
| 5 |
Flow Decomposition with Subpath Constraints |
Williams, Lucia et al. |
2021 |
| 6 |
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time |
Cairo, Massimo et al. |
2021 |
| 7 |
Linear Time Construction of Indexable Founder Block Graphs |
Mäkinen, Veli et al. |
2020 |
| 8 |
On the Complexity of String Matching for Graphs |
Equi, Massimo et al. |
2019 |
| 9 |
Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding |
Kiirala, Niko et al. |
2019 |
| 10 |
Optimal Omnitig Listing for Safe and Complete Contig Assembly |
Cairo, Massimo et al. |
2017 |
