| No. |
Title |
Author |
Year |
| 1 |
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions |
Bulteau, Laurent et al. |
2022 |
| 2 |
Automated Design of Dynamic Programming Schemes for RNA Folding with Pseudoknots |
Marchand, Bertrand et al. |
2022 |
| 3 |
Permutation Pattern Matching for Doubly Partially Ordered Patterns |
Bulteau, Laurent et al. |
2022 |
| 4 |
Reordering a Tree According to an Order on Its Leaves |
Bulteau, Laurent et al. |
2022 |
| 5 |
A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics |
Bulteau, Laurent et al. |
2021 |
| 6 |
Disorders and Permutations |
Bulteau, Laurent et al. |
2021 |
| 7 |
Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics |
Marchand, Bertrand et al. |
2021 |
| 8 |
Finding a Small Number of Colourful Components |
Bulteau, Laurent et al. |
2019 |
| 9 |
Consensus Strings with Small Maximum Distance and Small Distance Sum |
Bulteau, Laurent et al. |
2018 |
| 10 |
Beyond Adjacency Maximization: Scaffold Filling for New String Distances |
Bulteau, Laurent et al. |
2017 |
