Laurent Bulteau
Citée par
Citée par
Sorting by Transpositions Is Difficult
L Bulteau, G Fertin, I Rusu
SIAM Journal on Discrete Mathematics 26 (3), 1148-1180, 2012
Pancake flipping is hard
L Bulteau, G Fertin, I Rusu
Journal of Computer and System Sciences 81 (8), 1556-1574, 2015
Multivariate algorithmics for NP-hard string problems
L Bulteau, F Hüffner, C Komusiewicz, R Niedermeier
Maximal strip recovery problem with gaps: Hardness and approximation algorithms
L Bulteau, G Fertin, I Rusu
Journal of Discrete Algorithms, 2013
Triangle counting in dynamic graph streams
L Bulteau, V Froese, K Kutzkov, R Pagh
Algorithmica 76 (1), 259-278, 2016
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
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
Combinatorial voter control in elections
L Bulteau, J Chen, P Faliszewski, R Niedermeier, N Talmon
Theoretical Computer Science 589, 99-120, 2015
Inapproximability of (1, 2)-exemplar distance
L Bulteau, M Jiang
IEEE/ACM transactions on computational biology and bioinformatics 10 (6 …, 2012
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
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
Genome rearrangements with indels in intergenes restrict the scenario space
L Bulteau, G Fertin, E Tannier
BMC bioinformatics 17 (14), 225-231, 2016
A combinatorial algorithm for microbial consortia synthetic design
A Julien-Laferrière, L Bulteau, D Parrot, A Marchetti-Spaccamela, ...
Scientific reports 6, 29182, 2016
Fixed-parameter algorithms for scaffold filling
L Bulteau, AP Carrieri, R Dondi
Theoretical Computer Science 568, 72-83, 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
Tractability and approximability of maximal strip recovery
L Bulteau, G Fertin, M Jiang, I Rusu
Theoretical Computer Science 440, 14-28, 2012
Hardness of longest common subsequence for sequences with bounded run-lengths
G Blin, L Bulteau, M Jiang, PJ Tejada, S Vialette
Annual Symposium on Combinatorial Pattern Matching, 138-148, 2012
Hardness of consensus problems for circular strings and time series averaging
L Bulteau, V Froese, R Niedermeier
arXiv preprint arXiv:1804.02854, 2018
Multi-player diffusion games on graph classes
L Bulteau, V Froese, N Talmon
International Conference on Theory and Applications of Models of Computation …, 2015
Tractability and approximability of maximal strip recovery
L Bulteau, G Fertin, M Jiang, I Rusu
Annual Symposium on Combinatorial Pattern Matching, 336-349, 2011
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20