Laurent Bulteau

704 total citations
30 papers, 221 citations indexed

About

Laurent Bulteau is a scholar working on Molecular Biology, Artificial Intelligence and Genetics. According to data from OpenAlex, Laurent Bulteau has authored 30 papers receiving a total of 221 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Molecular Biology, 13 papers in Artificial Intelligence and 11 papers in Genetics. Recurrent topics in Laurent Bulteau's work include Algorithms and Data Compression (11 papers), Genome Rearrangement Algorithms (10 papers) and DNA and Biological Computing (7 papers). Laurent Bulteau is often cited by papers focused on Algorithms and Data Compression (11 papers), Genome Rearrangement Algorithms (10 papers) and DNA and Biological Computing (7 papers). Laurent Bulteau collaborates with scholars based in France, Germany and Israel. Laurent Bulteau's co-authors include Guillaume Fertin, Irena Rusu, Nimrod Talmon, Rolf Niedermeier, Konstantin Kutzkov, Rasmus Pagh, Jiehua Chen, Minghui Jiang, Piotr Faliszewski and Éric Tannier and has published in prestigious journals such as Scientific Reports, IEEE Access and BMC Bioinformatics.

In The Last Decade

Laurent Bulteau

27 papers receiving 214 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Laurent Bulteau France 8 111 95 76 71 39 30 221
Haoyong Zhang China 5 45 0.4× 271 2.9× 158 2.1× 38 0.5× 73 1.9× 5 441
Guillaume Blin France 8 38 0.3× 74 0.8× 101 1.3× 14 0.2× 20 0.5× 19 225
Bhadrachalam Chitturi India 11 143 1.3× 146 1.5× 160 2.1× 47 0.7× 32 0.8× 36 338
Jan Taubert United Kingdom 9 44 0.4× 249 2.6× 24 0.3× 58 0.8× 31 0.8× 13 359
Liliana Ironi Italy 11 27 0.2× 105 1.1× 122 1.6× 26 0.4× 13 0.3× 34 315
Yuko Tsumoto Japan 10 24 0.2× 213 2.2× 54 0.7× 231 3.3× 35 0.9× 18 393
Tzvika Hartman Israel 10 192 1.7× 177 1.9× 174 2.3× 112 1.6× 26 0.7× 16 324
Tieyan Liu China 11 20 0.2× 195 2.1× 69 0.9× 221 3.1× 12 0.3× 17 486
Riccardo Dondi Italy 11 111 1.0× 178 1.9× 97 1.3× 38 0.5× 44 1.1× 27 267
Irena Rusu France 9 243 2.2× 189 2.0× 116 1.5× 138 1.9× 99 2.5× 45 365

Countries citing papers authored by Laurent Bulteau

Since Specialization
Citations

This map shows the geographic impact of Laurent Bulteau's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Laurent Bulteau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Laurent Bulteau more than expected).

Fields of papers citing papers by Laurent Bulteau

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Laurent Bulteau. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Laurent Bulteau. The network helps show where Laurent Bulteau may publish in the future.

Co-authorship network of co-authors of Laurent Bulteau

This figure shows the co-authorship network connecting the top 25 collaborators of Laurent Bulteau. A scholar is included among the top collaborators of Laurent Bulteau based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Laurent Bulteau. Laurent Bulteau is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bulteau, Laurent, et al.. (2025). RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs. Algorithms for Molecular Biology. 20(1). 20–20. 1 indexed citations
2.
Bulteau, Laurent & Louxin Zhang. (2024). The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings. Journal of Computer and System Sciences. 144. 103546–103546.
3.
Bulteau, Laurent, et al.. (2022). On shuffled-square-free words. Theoretical Computer Science. 941. 91–103. 1 indexed citations
4.
Bulteau, Laurent, et al.. (2022). Better Collective Decisions via Uncertainty Reduction. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. 24–30.
5.
Bulteau, Laurent, Guillaume Fertin, Anthony Labarre, Roméo Rizzi, & Irena Rusu. (2021). Decomposing subcubic graphs into claws, paths or triangles. Journal of Graph Theory. 98(4). 557–588. 1 indexed citations
6.
Bulteau, Laurent & Stéphane Vialette. (2019). Recognizing binary shuffle squares is NP-hard. Theoretical Computer Science. 806. 116–132. 2 indexed citations
7.
Bulteau, Laurent & Markus L. Schmid. (2019). Consensus Strings with Small Maximum Distance and Small Distance Sum. Algorithmica. 82(5). 1378–1409. 1 indexed citations
8.
Bulteau, Laurent & Markus L. Schmid. (2018). Consensus Strings with Small Maximum Distance and Small Distance Sum. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
9.
Bulteau, Laurent, Guillaume Fertin, & Christian Komusiewicz. (2016). (Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Journal of Discrete Algorithms. 37. 44–55. 2 indexed citations
10.
Bulteau, Laurent, et al.. (2016). Co-Clustering under the Maximum Norm. Algorithms. 9(1). 17–17. 3 indexed citations
11.
Bulteau, Laurent, Guillaume Fertin, & Éric Tannier. (2016). Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinformatics. 17(S14). 426–426. 11 indexed citations
12.
Bevern, René van, Robert Bredereck, Laurent Bulteau, et al.. (2016). Partitioning Perfect Graphs into Stars. Journal of Graph Theory. 85(2). 297–335. 7 indexed citations
13.
Bulteau, Laurent, Delphine Parrot, Alberto Marchetti-Spaccamela, et al.. (2016). A Combinatorial Algorithm for Microbial Consortia Synthetic Design. Scientific Reports. 6(1). 29182–29182. 24 indexed citations
14.
Bulteau, Laurent, Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, & Nimrod Talmon. (2015). Combinatorial voter control in elections. Theoretical Computer Science. 589. 99–120. 19 indexed citations
15.
Bulteau, Laurent, Guillaume Fertin, & Irena Rusu. (2015). Pancake Flipping is hard. Journal of Computer and System Sciences. 81(8). 1556–1574. 18 indexed citations
16.
Bulteau, Laurent, Guillaume Fertin, Roméo Rizzi, & Stéphane Vialette. (2014). Some algorithmic results for [2]-sumset covers. Information Processing Letters. 115(1). 1–5. 1 indexed citations
17.
Bulteau, Laurent, Guillaume Fertin, & Irena Rusu. (2013). Revisiting the Minimum Breakpoint Linearization Problem. Theoretical Computer Science. 494. 122–133. 1 indexed citations
18.
Bulteau, Laurent, Guillaume Fertin, & Irena Rusu. (2013). Maximal strip recovery problem with gaps: Hardness and approximation algorithms. Journal of Discrete Algorithms. 19. 1–22. 1 indexed citations
19.
Bulteau, Laurent, Guillaume Fertin, Minghui Jiang, & Irena Rusu. (2012). Tractability and approximability of maximal strip recovery. Theoretical Computer Science. 440-441. 14–28. 3 indexed citations
20.
Bulteau, Laurent & Minghui Jiang. (2012). Inapproximability of (1,2)-Exemplar Distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 10(6). 1384–1390. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026