L. Bulteau

Most-cited papers

Sorting by Transpositions Is Difficult
L. Bulteau, G. Fertin, Irena Rusu
2010SIAM Journal on Discrete Mathematics166 citations Open access
Semantic Scholar
Triangle Counting in Dynamic Graph Streams
L. Bulteau, Vincent Froese, Konstantin Kutzkov, R. Pagh
2014Algorithmica76 citations Open access
Semantic Scholar
Pancake Flipping Is Hard
L. Bulteau, G. Fertin, Irena Rusu
2011International Symposium on Mathematical Foundations of Computer Science75 citations Open access
Semantic Scholar
Multivariate Algorithmics for NP-Hard String Problems
L. Bulteau, Falk Hüffner, Christian Komusiewicz, R. Niedermeier
2014Bull. EATCS45 citations
Semantic Scholar
Precedence-constrained scheduling problems parameterized by partial order width
René van Bevern, Robert Bredereck, L. Bulteau, Christian Komusiewicz +2 more
2016International Conference on Discrete Optimization and Operations Research42 citations Open access
Semantic Scholar
Justified Representation for Perpetual Voting
L. Bulteau, Noam Hazon, R. Page, Ariel Rosenfeld +1 more
2021IEEE Access37 citations Open access
Semantic Scholar
A Combinatorial Algorithm for Microbial Consortia Synthetic Design
Alice Julien-Laferrière, L. Bulteau, D. Parrot, A. Marchetti-Spaccamela +4 more
2016Scientific Reports37 citations Open access
Semantic Scholar
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
L. Bulteau, Christian Komusiewicz
2013ACM-SIAM Symposium on Discrete Algorithms35 citations Open access
Semantic Scholar
Combinatorial voter control in elections
L. Bulteau, Jiehua Chen, Piotr Faliszewski, R. Niedermeier +1 more
2014Theoretical Computer Science30 citations Open access
Semantic Scholar
Parameterized Algorithms in Bioinformatics: An Overview
L. Bulteau, Mathias Weller
2019Algorithms28 citations Open access
Semantic Scholar
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
L. Bulteau, G. Fertin, Christian Komusiewicz, Irena Rusu
2013Workshop on Algorithms in Bioinformatics27 citations Open access
Semantic Scholar
Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation
L. Bulteau, Gal Shahaf, E. Shapiro, Nimrod Talmon
2018Journal of Artificial Intelligence Research26 citations Open access
Semantic Scholar
BacHBerry: BACterial Hosts for production of Bioactive phenolics from bERRY fruits
A. Dudnik, A. Almeida, Ricardo Andrade, B. Avila +79 more
2017Phytochemistry Reviews21 citations Open access
Semantic Scholar
Genome rearrangements with indels in intergenes restrict the scenario space
L. Bulteau, G. Fertin, Eric Tannier
2016BMC Bioinformatics21 citations Open access
Semantic Scholar
Maximal strip recovery problem with gaps: Hardness and approximation algorithms
L. Bulteau, G. Fertin, Irena Rusu
2009J. Discrete Algorithms20 citations Open access
Semantic Scholar
Partitioning Perfect Graphs into Stars
René van Bevern, Robert Bredereck, L. Bulteau, Jiehua Chen +3 more
2014Journal of Graph Theory19 citations Open access
Semantic Scholar
Fixed-parameter algorithms for scaffold filling
L. Bulteau, A. Carrieri, R. Dondi
2014Theoretical Computer Science18 citations Open access
Semantic Scholar
Inapproximability of (1,2)-Exemplar Distance
L. Bulteau, Ming-Hui Jiang
2012IEEE/ACM Transactions on Computational Biology & Bioinformatics18 citations Open access
Semantic Scholar
Better Collective Decisions via Uncertainty Reduction
Shiri Alouf-Heffetz, L. Bulteau, Edith Elkind, Nimrod Talmon +1 more
2022International Joint Conference on Artificial Intelligence17 citations Open access
Semantic Scholar
Multi-Player Diffusion Games on Graph Classes
L. Bulteau, Vincent Froese, Nimrod Talmon
2014Internet Mathematics17 citations Open access
Semantic Scholar
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series
L. Bulteau, Vincent Froese, R. Niedermeier
2018SIAM Journal on Discrete Mathematics16 citations Open access
Semantic Scholar
Recognizing binary shuffle squares is NP-hard
L. Bulteau, S. Vialette
2020Theoretical Computer Science15 citations Open access
Semantic Scholar
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths
G. Blin, L. Bulteau, Ming-Hui Jiang, Pedro J. Tejada +1 more
2012Annual Symposium on Combinatorial Pattern Matching15 citations Open access
Semantic Scholar
Sorting Signed Permutations by Intergenic Reversals
A. Oliveira, Géraldine Jean, G. Fertin, Klairton Lima Brito +3 more
2020IEEE/ACM Transactions on Computational Biology & Bioinformatics13 citations
Semantic Scholar
Tractability and approximability of maximal strip recovery
L. Bulteau, G. Fertin, Ming-Hui Jiang, Irena Rusu
2011Theoretical Computer Science13 citations Open access
Semantic Scholar
Efficient, robust and effective rank aggregation for massive biological datasets
P. Andrieu, Bryan Brancotte, L. Bulteau, S. Cohen-Boulakia +3 more
2021Future generations computer systems12 citations Open access
Semantic Scholar
Consensus Strings with Small Maximum Distance and Small Distance Sum
L. Bulteau, Markus L. Schmid
2019Algorithmica12 citations Open access
Semantic Scholar
Star Partitions of Perfect Graphs
René van Bevern, Robert Bredereck, L. Bulteau, Jiehua Chen +3 more
2014International Colloquium on Automata, Languages and Programming11 citations Open access
Semantic Scholar
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics
B. Marchand, Y. Ponty, L. Bulteau
2021Algorithms for Molecular Biology9 citations Open access
Semantic Scholar
Reversal of the relative expression of cardiac and skeletal alpha1 subunit isoforms of L-type calcium channel during in vitro myogenesis
L. Bulteau, Michel Cogné, C. Cognard, Guy Raymond
1996Pflügers Archiv9 citations
Semantic Scholar
Hardness of Consensus Problems for Circular Strings and Time Series Averaging
L. Bulteau, Vincent Froese, R. Niedermeier
2018arXiv.org8 citations
Semantic Scholar
Partition Aggregation for Participatory Budgeting
P. Jain, Nimrod Talmon, L. Bulteau
2021Adaptive Agents and Multi-Agent Systems7 citations
Semantic Scholar
Beyond Adjacency Maximization: Scaffold Filling for New String Distances
L. Bulteau, G. Fertin, Christian Komusiewicz
2017Annual Symposium on Combinatorial Pattern Matching7 citations Open access
Semantic Scholar
Co-Clustering Under the Maximum Norm
L. Bulteau, Vincent Froese, Sepp Hartung, R. Niedermeier
2015International Symposium on Algorithms and Computation7 citations Open access
Semantic Scholar
Automated design of dynamic programming schemes for RNA folding with pseudoknots
B. Marchand, S. Will, Sarah J. Berkemer, Yann Ponty +1 more
2023Algorithms for Molecular Biology6 citations Open access
Semantic Scholar
Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors
L. Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge
2018International/Italian Conference on Algorithms and Complexity6 citations Open access
Semantic Scholar
Reordering a Tree According to an Order on Its Leaves
L. Bulteau, Philippe Gambette, Olga Seminck
2022Annual Symposium on Combinatorial Pattern Matching5 citations
Semantic Scholar
An Algorithmic Framework for Locally Constrained Homomorphisms
L. Bulteau, Konrad K. Dabrowski, Noleen Köhler, S. Ordyniak +1 more
2022International Workshop on Graph-Theoretic Concepts in Computer Science5 citations Open access
Semantic Scholar
On shuffled-square-free words
L. Bulteau, V. Jugé, S. Vialette
2022Theoretical Computer Science5 citations Open access
Semantic Scholar
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions
L. Bulteau, Mark Jones, R. Niedermeier, Till Tantau
2022Annual Symposium on Combinatorial Pattern Matching5 citations Open access
Semantic Scholar
Sorting by Multi-cut Rearrangements
L. Bulteau, G. Fertin, Géraldine Jean, Christian Komusiewicz
2021Conference on Current Trends in Theory and Practice of Informatics5 citations Open access
Semantic Scholar
Reversal Distances for Strings with Few Blocks or Small Alphabets
L. Bulteau, G. Fertin, Christian Komusiewicz
2014Annual Symposium on Combinatorial Pattern Matching5 citations Open access
Semantic Scholar
Revisiting the Minimum Breakpoint Linearization Problem
L. Bulteau, G. Fertin, Irena Rusu
2010Theoretical Computer Science5 citations Open access
Semantic Scholar
The effects of Securidaca longepedunculata root extract on ionic currents and contraction of cultured rat skeletal muscle cells.
A. Mouzou, L. Bulteau, Guy Raymond
1999Journal of Ethnopharmacology5 citations
Semantic Scholar
Pattern Matching for k-Track Permutations
L. Bulteau, Romeo Rizzi, S. Vialette
2018International Workshop on Combinatorial Algorithms4 citations
Semantic Scholar
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets
L. Bulteau, G. Fertin, Christian Komusiewicz
2016J. Discrete Algorithms4 citations Open access
Semantic Scholar
Permutation Pattern Matching for Doubly Partially Ordered Patterns
L. Bulteau, G. Fertin, V. Jugé, S. Vialette
2022Annual Symposium on Combinatorial Pattern Matching3 citations
Semantic Scholar
Finding a Small Number of Colourful Components
L. Bulteau, Konrad K. Dabrowski, G. Fertin, Matthew P. Johnson +2 more
2018Annual Symposium on Combinatorial Pattern Matching3 citations Open access
Semantic Scholar
Some algorithmic results for [2]-sumset covers
L. Bulteau, G. Fertin, Romeo Rizzi, S. Vialette
2015Information Processing Letters3 citations Open access
Semantic Scholar
The Complexity of Finding Effectors
L. Bulteau, S. Fafianie, Vincent Froese, R. Niedermeier +1 more
2014Theory of Computing Systems3 citations Open access
Semantic Scholar