| Publication | Date of Publication | Type |
|---|
| Genome assembly, from practice to theory: safe, complete and linear-time | 2026-05-12 | Paper |
| Width helps and hinders splitting flows | 2025-06-19 | Paper |
Genome assembly, from practice to theory: safe, complete and \textit{linear-time}
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Width helps and hinders splitting flows
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| Cut paths and their remainder structure, with applications | 2024-10-08 | Paper |
| Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time | 2024-07-19 | Paper |
A streamlined model of conditional simple temporal networks -- semantics and equivalence results
1515.68288 | 2023-02-03 | Paper |
Incorporating decision nodes into conditional simple temporal networks
1515.68287 | 2023-02-03 | Paper |
Dynamic controllability made simple
1515.68289 | 2023-02-03 | Paper |
| Cut paths and their remainder structure, with applications | 2022-10-14 | Paper |
A linear-time parameterized algorithm for computing the width of a DAG
(available as arXiv preprint) | 2022-06-08 | Paper |
| Faster dynamic controllability checking for simple temporal networks with uncertainty | 2022-05-28 | Paper |
Safety in s-t paths, trails and walks
Algorithmica | 2022-03-22 | Paper |
A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points
Discrete Applied Mathematics | 2021-10-21 | Paper |
| The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly | 2020-11-25 | Paper |
| Optimal Omnitig Listing for Safe and Complete Contig Assembly | 2020-05-25 | Paper |
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks
Journal of Logical and Algebraic Methods in Programming | 2020-04-22 | Paper |
Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks
Journal of Logical and Algebraic Methods in Programming | 2020-04-22 | Paper |
| Genome assembly, from practice to theory: safe, complete and linear-time | 2020-02-24 | Paper |
An optimal O(nm) algorithm for enumerating all walks common to all closed edge-covering walks of a graph
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Dynamic controllability of simple temporal networks with uncertainty: simple rules and fast real-time execution
Theoretical Computer Science | 2019-11-07 | Paper |
The complexity of simulation and matrix multiplication
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
New bounds for approximating extremal distances in undirected graphs
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
