Sorting by Transpositions Is Difficult L Bulteau, G Fertin, I Rusu SIAM Journal on Discrete Mathematics 26 (3), 1148-1180, 2012 | 201 | 2012 |

Pancake flipping is hard L Bulteau, G Fertin, I Rusu Journal of Computer and System Sciences 81 (8), 1556-1574, 2015 | 85 | 2015 |

Triangle counting in dynamic graph streams L Bulteau, V Froese, K Kutzkov, R Pagh Algorithmica 76 (1), 259-278, 2016 | 44 | 2016 |

Multivariate algorithmics for NP-hard string problems L Bulteau, F Hüffner, C Komusiewicz, R Niedermeier Bulletin of EATCS 3 (114), 2014 | 41 | 2014 |

Precedence-constrained scheduling problems parameterized by partial order width R Van Bevern, R Bredereck, L Bulteau, C Komusiewicz, N Talmon, ... Discrete Optimization and Operations Research: 9th International Conference …, 2016 | 34 | 2016 |

Minimum common string partition parameterized by partition size is fixed-parameter tractable L Bulteau, C Komusiewicz Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 102-121, 2014 | 33 | 2014 |

A fixed-parameter algorithm for minimum common string partition with few duplications L Bulteau, G Fertin, C Komusiewicz, I Rusu Algorithms in Bioinformatics, 244-258, 2013 | 29 | 2013 |

A combinatorial algorithm for microbial consortia synthetic design A Julien-Laferrière, L Bulteau, D Parrot, A Marchetti-Spaccamela, ... Scientific Reports 6 (1), 29182, 2016 | 28 | 2016 |

BacHBerry: BACterial Hosts for production of Bioactive phenolics from bERRY fruits A Dudnik, AF Almeida, R Andrade, B Avila, P Bañados, D Barbay, ... Phytochemistry reviews 17, 291-326, 2018 | 25 | 2018 |

Maximal strip recovery problem with gaps: Hardness and approximation algorithms L Bulteau, G Fertin, I Rusu Journal of Discrete Algorithms, 2013 | 25* | 2013 |

Genome rearrangements with indels in intergenes restrict the scenario space L Bulteau, G Fertin, E Tannier BMC bioinformatics 17 (14), 225-231, 2016 | 24 | 2016 |

Combinatorial voter control in elections L Bulteau, J Chen, P Faliszewski, R Niedermeier, N Talmon Theoretical Computer Science 589, 99-120, 2015 | 23 | 2015 |

Inapproximability of (1, 2)-exemplar distance L Bulteau, M Jiang IEEE/ACM Transactions on Computational Biology and Bioinformatics 10 (6 …, 2012 | 23 | 2012 |

Partitioning perfect graphs into stars R Van Bevern, R Bredereck, L Bulteau, J Chen, V Froese, R Niedermeier, ... Journal of Graph Theory 85 (2), 297-335, 2017 | 22* | 2017 |

Fixed-parameter algorithms for scaffold filling L Bulteau, AP Carrieri, R Dondi Theoretical Computer Science 568, 72-83, 2015 | 19 | 2015 |

Tractability and approximability of maximal strip recovery L Bulteau, G Fertin, M Jiang, I Rusu Theoretical Computer Science 440, 14-28, 2012 | 17 | 2012 |

Parameterized algorithms in bioinformatics: an overview L Bulteau, M Weller Algorithms 12 (12), 256, 2019 | 14 | 2019 |

Multi-player diffusion games on graph classes L Bulteau, V Froese, N Talmon Internet Mathematics 12 (6), 363-380, 2016 | 14 | 2016 |

Hardness of longest common subsequence for sequences with bounded run-lengths G Blin, L Bulteau, M Jiang, PJ Tejada, S Vialette Combinatorial Pattern Matching: 23rd Annual Symposium, CPM 2012, Helsinki …, 2012 | 13 | 2012 |

Sorting signed permutations by intergenic reversals AR Oliveira, G Jean, G Fertin, KL Brito, L Bulteau, U Dias, Z Dias IEEE/ACM Transactions on Computational Biology and Bioinformatics 18 (6 …, 2020 | 12 | 2020 |