| Sorting by Transpositions Is Difficult L Bulteau, G Fertin, I Rusu SIAM Journal on Discrete Mathematics 26 (3), 1148-1180, 2012 | 199 | 2012 |
| Pancake flipping is hard L Bulteau, G Fertin, I Rusu Journal of Computer and System Sciences 81 (8), 1556-1574, 2015 | 110 | 2015 |
| Precedence-constrained scheduling problems parameterized by partial order width R Van Bevern, R Bredereck, L Bulteau, C Komusiewicz, N Talmon, ... International conference on discrete optimization and operations research …, 2016 | 52 | 2016 |
| Multivariate algorithmics for NP-hard string problems L Bulteau, F Hüffner, C Komusiewicz, R Niedermeier Bulletin-European Association for Theoretical Computer Science 114, 2014 | 51 | 2014 |
| Triangle counting in dynamic graph streams L Bulteau, V Froese, K Kutzkov, R Pagh Algorithmica 76 (1), 259-278, 2016 | 49 | 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 | 43 | 2014 |
| 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 | 39 | 2016 |
| Sorting by transpositions is difficult L Bulteau, G Fertin, I Rusu International Colloquium on Automata, Languages, and Programming, 654-665, 2011 | 38 | 2011 |
| 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 | 37* | 2017 |
| Parameterized algorithms in bioinformatics: an overview L Bulteau, M Weller Algorithms 12 (12), 256, 2019 | 36 | 2019 |
| Genome rearrangements with indels in intergenes restrict the scenario space L Bulteau, G Fertin, E Tannier BMC bioinformatics 17 (Suppl 14), 426, 2016 | 35 | 2016 |
| Justified representation for perpetual voting L Bulteau, N Hazon, R Page, A Rosenfeld, N Talmon IEEE Access 9, 96598-96612, 2021 | 34 | 2021 |
| 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 | 33 | 2013 |
| 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 | 31 | 2020 |
| 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 (2), 291-326, 2018 | 28 | 2018 |
| Maximal strip recovery problem with gaps: Hardness and approximation algorithms L Bulteau, G Fertin, I Rusu Journal of Discrete Algorithms, 2013 | 28 | 2013 |
| Combinatorial voter control in elections L Bulteau, J Chen, P Faliszewski, R Niedermeier, N Talmon Theoretical Computer Science 589, 99-120, 2015 | 26 | 2015 |
| Inapproximability of (1, 2)-exemplar distance L Bulteau, M Jiang IEEE/ACM Transactions on Computational Biology and Bioinformatics 10 (6 …, 2012 | 26 | 2012 |
| Fixed-parameter algorithms for scaffold filling L Bulteau, AP Carrieri, R Dondi Theoretical Computer Science 568, 72-83, 2015 | 25 | 2015 |
| Aggregation over metric spaces: Proposing and voting in elections, budgeting, and legislation L Bulteau, G Shahaf, E Shapiro, N Talmon Journal of Artificial Intelligence Research 70, 1413-1439, 2021 | 20 | 2021 |
