Laurent Bulteau

Présentation

Publications

Article dans une revue (39)

Bipartite Independent Set Reconfiguration: General and RNA-Inspired Parameterized Algorithms Théo Boury,Laurent Bulteau,Bertrand Marchand,Yann Ponty Algorithmica, 2026, 88 (2), 59 p. ⟨10.1007/s00453-026-01371-x⟩ Article dans une revue hal-04094405v5
CREMSA: Compressed indexing of (ultra) large multiple sequence alignments Mikaël Salson,Arthur Boddaert,Awa Bousso Gueye,Laurent Bulteau,Yohan Hernandez--Courbevoieet al. Bioinformatics, 2025, ISMB 2025, 41 (Supplement_1), pp.i246-i254. ⟨10.1093/bioinformatics/btaf211⟩ Article dans une revue hal-04910677v2
RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs Théo Boury,Samuel Gardelle,Laurent Bulteau,Yann Ponty Algorithms for Molecular Biology, 2025, 20 (1), pp.20. ⟨10.1186/s13015-025-00278-6⟩ Article dans une revue hal-04761629v3
An Algorithmic Framework for Locally Constrained Homomorphisms Laurent Bulteau,Konrad Dabrowski,Noleen Köhler,Sebastian Ordyniak,Daniël Paulusma SIAM Journal on Discrete Mathematics, 2024, 38 (2), pp.1315-1350. ⟨10.1137/22M1513290⟩ Article dans une revue hal-04797299v1
On shuffled-square-free words Laurent Bulteau,Vincent Jugé,Stéphane Vialette Theoretical Computer Science, 2023, 941, pp.91-103. ⟨10.1016/j.tcs.2022.10.028⟩ Article dans une revue hal-04290576v1
Automated design of dynamic programming schemes for RNA folding with pseudoknots Bertrand Marchand,Sebastian Will,Sarah Berkemer,Yann Ponty,Laurent Bulteau Algorithms for Molecular Biology, 2023, 18 (1), pp.18. ⟨10.1186/s13015-023-00229-z⟩ Article dans une revue hal-04103565v1
Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics Bertrand Marchand,Yann Ponty,Laurent Bulteau Algorithms for Molecular Biology, 2022, 17 (1), pp.8. ⟨10.1186/s13015-022-00213-z⟩ Article dans une revue hal-03608412v2
Efficient, robust and effective rank aggregation for massive biological datasets Pierre Andrieu,Bryan Brancotte,Laurent Bulteau,Sarah Cohen-Boulakia,Alain Deniseet al. Future Generation Computer Systems, 2021, 124, pp.406-421. ⟨10.1016/j.future.2021.06.013⟩ Article dans une revue hal-03388443v1
Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation Laurent Bulteau,Gal Shahaf,Ehud Shapiro,Nimrod Talmon Journal of Artificial Intelligence Research, 2021, ⟨10.1613/jair.1.12388⟩ Article dans une revue hal-03388474v1
Sorting by Multi-Cut Rearrangements Laurent Bulteau,Guillaume Fertin,Géraldine Jean,Christian Komusiewicz Algorithms, 2021, 14 (6), pp.169. ⟨10.3390/a14060169⟩ Article dans une revue hal-03388451v1
Decomposing Subcubic Graphs into Claws, Paths or Triangles Laurent Bulteau,Guillaume Fertin,Anthony Labarre,Romeo Rizzi,Irena Rusu Journal of Graph Theory, 2021, 98 (4), pp.557-588. ⟨10.1002/jgt.22713⟩ Article dans une revue hal-03388424v1
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors Laurent Bulteau,Niels Grüttemeier,Christian Komusiewicz,Manuel Sorge Journal of Computer and System Sciences, 2021, 120, pp.75 - 96. ⟨10.1016/j.jcss.2021.03.001⟩ Article dans une revue hal-03388392v1
Justified Representation for Perpetual Voting Laurent Bulteau,Noam Hazon,Rutvik Page,Ariel Rosenfeld,Nimrod Talmon IEEE Access, 2021, 9, pp.96598 - 96612. ⟨10.1109/access.2021.3095087⟩ Article dans une revue hal-03388430v1
Consensus Strings with Small Maximum Distance and Small Distance Sum Laurent Bulteau,Markus L. Schmid Algorithmica, 2020, 82 (5), pp.1378-1409. ⟨10.1007/s00453-019-00647-9⟩ Article dans une revue hal-02382881v1
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series Laurent Bulteau,Vincent Froese,Rolf Niedermeier SIAM Journal on Discrete Mathematics, 2020, 34 (3), pp.1854-1883. ⟨10.1137/19M1255781⟩ Article dans une revue hal-03031331v1
Sorting Signed Permutations by Intergenic Reversals Andre Rodrigues Oliveira,Géraldine Jean,Guillaume Fertin,Klairton Lima Brito,Laurent Bulteauet al. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2020, ⟨10.1109/TCBB.2020.2993002⟩ Article dans une revue hal-02901617v1
Recognizing binary shuffle squares is NP-hard Laurent Bulteau,Stéphane Vialette Theoretical Computer Science, 2020, 806, pp.116-132. ⟨10.1016/j.tcs.2019.01.012⟩ Article dans une revue hal-01986646v1
Parameterized Algorithms in Bioinformatics: An Overview Laurent Bulteau,Mathias Weller Algorithms, 2019, 12 (12), pp.256. ⟨10.3390/a12120256⟩ Article dans une revue hal-03004037v1
The Clever Shopper Problem Laurent Bulteau,Danny Hermelin,Dušan Knop,Anthony Labarre,Stéphane Vialette Theory of Computing Systems, 2019, 64, pp.17-34. ⟨10.1007/s00224-019-09917-z⟩ Article dans une revue hal-01998054v1
The Complexity of Finding Effectors Laurent Bulteau,Stefan Fafianie,Vincent Froese,Rolf Niedermeier,Nimrod Talmon Theory of Computing Systems, 2017, 60 (2), pp.253-279. ⟨10.1007/s00224-016-9670-8⟩ Article dans une revue hal-01494357v1
Partitioning Perfect Graphs into Stars René van Bevern,Robert Bredereck,Laurent Bulteau,Jiehua Chen,Vincent Froeseet al. Journal of Graph Theory, 2017, 85 (2), pp.297-335. ⟨10.1002/jgt.22062⟩ Article dans une revue hal-01494420v1
BacHBerry: BACterial Hosts for production of Bioactive phenolics from bERRY fruits Alexey Dudnik,Filipa Almeida,Ricardo Andrade,Barbara Avila,Pilar Bañadoset al. Phytochemistry Reviews, 2017, pp.1-36. ⟨10.1007/s11101-017-9532-2⟩ Article dans une revue hal-01673596v1
Genome rearrangements with indels in intergenes restrict the scenario space Laurent Bulteau,Guillaume Fertin,Eric Tannier BMC Bioinformatics, 2016, 17 (Suppl 14), 426 (7 p.). ⟨10.1186/s12859-016-1264-6⟩ Article dans une revue hal-01396842v1
Co-Clustering under the Maximum Norm Laurent Bulteau,Vincent Froese,Sepp Hartung,Rolf Niedermeier Algorithms, 2016, 9 (1), pp.15 - 17. ⟨10.3390/a9010017⟩ Article dans une revue hal-01494976v1
A Combinatorial Algorithm for Microbial Consortia Synthetic Design Alice Julien-Laferrière,Laurent Bulteau,Delphine Parrot,Alberto Marchetti-Spaccamela,Leen Stougieet al. Scientific Reports, 2016, ⟨10.1038/srep29182⟩ Article dans une revue hal-01344296v1
Multi-Player Diffusion Games on Graph Classes Laurent Bulteau,Vincent Froese,Nimrod Talmon Internet Mathematics, 2016, 12 (6), pp.363 - 380. ⟨10.1080/15427951.2016.1197167⟩ Article dans une revue hal-01494989v1
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets Laurent Bulteau,Guillaume Fertin,Christian Komusiewicz Journal of Discrete Algorithms, 2016, 37, pp.44-55. ⟨10.1016/j.jda.2016.05.002⟩ Article dans une revue hal-01318663v1
Triangle Counting in Dynamic Graph Streams Laurent Bulteau,Vincent Froese,Konstantin Kutzkov,Rasmus Pagh Algorithmica, 2016, 76 (1), pp.259 - 278. ⟨10.1007/s00453-015-0036-4⟩ Article dans une revue hal-01494399v1
Computing an Evolutionary Ordering is Hard Laurent Bulteau,Gustavo Sacomoto,Blerina Sinaimeri Electronic Notes in Discrete Mathematics, 2015, ⟨10.1016/j.endm.2015.07.043⟩ Article dans une revue hal-01249259v1
Some algorithmic results for [2]-sumset covers Laurent Bulteau,Guillaume Fertin,Stéphane Vialette,Roméo Rizzi Information Processing Letters, 2015, 115 (1), pp.1-5 Article dans une revue hal-01044891v1
Fixed-parameter algorithms for scaffold filling Laurent Bulteau,Anna Paola Carrieri,Riccardo Dondi Theoretical Computer Science, 2015, 568, ⟨10.1016/j.tcs.2014.12.005⟩ Article dans une revue hal-01260577v1
Combinatorial voter control in elections Laurent Bulteau,Jiehua Chen,Piotr Faliszewski,Rolf Niedermeier,Nimrod Talmon Theoretical Computer Science, 2015, 589, pp.99-120. ⟨10.1016/j.tcs.2015.04.023⟩ Article dans une revue hal-01260623v1
Pancake Flipping Is Hard Laurent Bulteau,Guillaume Fertin,Irena Rusu Journal of Computer and System Sciences, 2015, 81 (8), pp.1556-1574. ⟨10.1016/j.jcss.2015.02.003⟩ Article dans une revue hal-01053461v1
Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau,Falk Hüffner,Christian Komusiewicz,Rolf Niedermeier Bulletin- European Association for Theoretical Computer Science, 2014, 114 Article dans une revue hal-01260610v1
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms Laurent Bulteau,Guillaume Fertin,Irena Rusu Journal of Discrete Algorithms, 2013, 19, pp.1-22 Article dans une revue hal-00826876v1
Inapproximability of (1,2)-Exemplar Distance Laurent Bulteau,Minghui Jiang IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2013, 10 (6), pp.1384-1390. ⟨10.1109/TCBB.2012.144⟩ Article dans une revue hal-01171580v1
Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science Laurent Bulteau,Guillaume Fertin,Irena Rusu Theoretical Computer Science, 2013, 494, pp.122-133 Article dans une revue hal-00826880v1
Sorting by Transpositions is Difficult Laurent Bulteau,Guillaume Fertin,Irena Rusu SIAM Journal on Discrete Mathematics, 2012, 26 (3), pp.1148-1180. ⟨10.1137/110851390⟩ Article dans une revue hal-00826867v1
Tractability and approximability of maximal strip recovery Laurent Bulteau,Guillaume Fertin,Minghui Jiang,Irena Rusu Theoretical Computer Science, 2012, 440-441, pp.14-28. ⟨10.1016/j.tcs.2012.04.034⟩ Article dans une revue hal-00700598v1

Communication dans un congrès (42)

A coherent index for dichotomy in version-controlled repositories Laurent Bulteau,Pierre-Yves David,Florian Horn,Euxane Tran-Girard 19th International Symposium on Theoretical Aspects of Software Engineering (TASE 2025), University of Cyprus, Jul 2025, Limassol, Cyprus Communication dans un congrès hal-04778558v2
Incremental Reachability Index Laurent Bulteau,Pierre-Yves David,Florian Horn,Euxane Tran-Girard 23rd Symposium on Experimental Algorithms (SEA 2025), Jul 2025, Venice, Italy Communication dans un congrès hal-04929088v2
Compressed indexing of (ultra) large viral alignments Mikael Salson,Thomas Baudeau,Arthur Boddaert,Awa Bousso Gueye,Laurent Bulteauet al. SEQBIM 2024 - Journées du groupe de travail Séquences en Bioinformatique, Nov 2024, Rennes, France Communication dans un congrès hal-04773755v1
RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs Théo Boury,Laurent Bulteau,Yann Ponty SEQBIM 2024 - Journées du groupe de travail Séquences en Bioinformatique, Nov 2024, Rennes, France Communication dans un congrès hal-04773768v1
RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs Théo Boury,Laurent Bulteau,Yann Ponty WABI 2024 - 24th Workshop on Algorithms in Bioinformatics, 2024, London, United Kingdom Communication dans un congrès hal-04589901v2
The Problem of Discovery in Version Control Systems Laurent Bulteau,Pierre-Yves David,Florian Horn XII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023), Sep 2023, Huatulco, Oaxaca, México, Mexico. pp.209-216, ⟨10.1016/j.procs.2023.08.231⟩ Communication dans un congrès hal-03830513v2
Reordering a tree according to an order on its leaves Laurent Bulteau,Philippe Gambette,Olga Seminck CPM 2022, Jun 2022, Prague, Czech Republic. pp.24:1-24:15, ⟨10.4230/LIPIcs.CPM.2022.24⟩ Communication dans un congrès hal-03413413v2
Permutation Pattern Matching for Doubly Partially Ordered Patterns Laurent Bulteau,Guillaume Fertin,Vincent Jugé,Stéphane Vialette 33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic. ⟨10.4230/lipics.cpm.2022.21⟩ Communication dans un congrès hal-03624311v1
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions Laurent Bulteau,Mark Jones,Rolf Niedermeier,Till Tantau 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022), Jun 2022, Pragues (CZ), Czech Republic. ⟨10.4230/LIPIcs.CPM.2022.6⟩ Communication dans un congrès hal-03852740v1
Automated design of dynamic programming schemes for RNA folding with pseudoknots Bertrand Marchand,Sebastian Will,Sarah Berkemer,Laurent Bulteau,Yann Ponty WABI 2022 - 22nd Workshop on Algorithms in Bioinformatics, Sep 2022, Potsdam, Germany Communication dans un congrès hal-03676377v2
An Algorithmic Framework for Locally Constrained Homomorphisms Laurent Bulteau,Konrad Dabrowski,Noleen Köhler,Sebastian Ordyniak,Daniël Paulusma International Workshop on Graph-Theoretic Concepts in Computer Science, 2022, Tübingen, Germany. pp.114-128, ⟨10.1007/978-3-031-15914-5_9⟩ Communication dans un congrès hal-04495171v1
Partition Aggregation for Participatory Budgeting Pallavi Jain,Nimrod Talmon,Laurent Bulteau AAMAS'21, 2021, London (virtual), United Kingdom Communication dans un congrès hal-03388463v1
A new parametrization for independent set reconfiguration and applications to RNA kinetics Laurent Bulteau,Bertrand Marchand,Yann Ponty IPEC 2021 - 16th International Symposium on Parameterized and Exact Computation, Sep 2021, Lisbon, Portugal. ⟨10.4230/lipics.ipec.2021.11⟩ Communication dans un congrès hal-03272963v2
Sequence graphs realizations and ambiguity in language models Sammy Khalife,Yann Ponty,Laurent Bulteau COCOON 2021 - 27th International Computing and Combinatorics Conference, Oct 2021, Tainan, Taiwan. ⟨10.1007/978-3-030-89543-3_13⟩ Communication dans un congrès hal-02495333v4
Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics Bertrand Marchand,Yann Ponty,Laurent Bulteau WABI 2021 - 21st Workshop on Algorithms in Bioinformatics, 2021, Paris, France Communication dans un congrès hal-03206132v1
Sorting by Multi-cut Rearrangements Laurent Bulteau,Guillaume Fertin,Géraldine Jean,Christian Komusiewicz SOFSEM 2021, Jan 2021, Bolzano-Bozen, Italy. pp.593-607, ⟨10.1007/978-3-030-67731-2_43⟩ Communication dans un congrès hal-03346830v1
Disorders and Permutations Laurent Bulteau,Samuele Giraudo,Stéphane Vialette 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021), Jul 2021, Wroclaw, Poland. ⟨10.4230/LIPIcs.CPM.2021.11⟩ Communication dans un congrès hal-03388489v1
Partition Aggregation for Budgeting Laurent Bulteau,Pallavi Jain,Nimrod Talmon M-PREF2020, 2020, Santiago de Compostela, Spain Communication dans un congrès hal-03388503v1
Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data Pierre Andrieu,Bryan Brancotte,Laurent Bulteau,Sarah Cohen-Boulakia,Alain Deniseet al. 2019 15th International Conference on eScience (eScience), Sep 2019, San Diego, France. pp.136-145, ⟨10.1109/eScience.2019.00022⟩ Communication dans un congrès hal-02527738v1
Finding a Small Number of Colourful Components Laurent Bulteau,Konrad K. Dabrowski,Guillaume Fertin,Matthew Johnson,Daniël Paulusmaet al. CPM 2019, Jul 2019, Pise, Italy. ⟨10.4230/LIPIcs.CPM.2019.20⟩ Communication dans un congrès hal-02304030v1
Your Rugby Mates Don’t Need to Know Your Colleagues: Triadic Closure with Edge Colors Laurent Bulteau,Niels Grüttemeier,Christian Komusiewicz,Manuel Sorge CIAC 2019, May 2019, Rome, Italy. pp.99-111, ⟨10.1007/978-3-030-17402-6_9⟩ Communication dans un congrès hal-02382897v1
Consensus Strings with Small Maximum Distance and Small Distance Sum Laurent Bulteau,Markus L. Schmid 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)., Aug 2018, Liverpool, United Kingdom. ⟨10.4230/LIPIcs.MFCS.2018.1⟩ Communication dans un congrès hal-01930623v1
The Clever Shopper Problem Laurent Bulteau,Danny Hermelin,Anthony Labarre,Stéphane Vialette The 13th International Computer Science Symposium in Russia (CSR), Jun 2018, Moscow, Russia. ⟨10.1007/978-3-319-90530-3_6⟩ Communication dans un congrès hal-01715824v1
Pattern Matching for k-Track Permutations Laurent Bulteau,Romeo Rizzi,Stéphane Vialette International Workshop on Combinatorial Algorithms (IWOCA), Jul 2018, Singapore, Singapore. pp.102-114, ⟨10.1007/978-3-319-94667-2_9⟩ Communication dans un congrès hal-01935941v1
Beyond Adjacency Maximization: Scaffold Filling for New String Distances Laurent Bulteau,Guillaume Fertin,Christian J Komusiewicz 28th Annual Symposium on Combinatorial Pattern Matching, 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2017.27⟩ Communication dans un congrès hal-01615671v1
Decomposing Cubic Graphs into Connected Subgraphs of Size Three Laurent Bulteau,Guillaume Fertin,Anthony Labarre,Romeo Rizzi,Irena Rusu The 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨10.1007/978-3-319-42634-1_32⟩ Communication dans un congrès hal-01309152v1
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width René van Bevern,Robert Bredereck,Laurent Bulteau,Christian J Komusiewicz,Nimrod Talmonet al. DOOR 2016: Discrete Optimization and Operations Research, Sep 2016, Vladivostok, Russia. pp.345 - 120, ⟨10.1007/978-3-319-44914-2_9⟩ Communication dans un congrès hal-01495042v1
Multi-player Diffusion Games on Graph Classes Laurent Bulteau,Vincent Froese,Nimrod Talmon TAMC, May 2015, Singapore, Singapore. ⟨10.1007/978-3-319-17142-5_18⟩ Communication dans un congrès hal-01260620v1
The Complexity of Finding Effectors Laurent Bulteau,Stefan Fafianie,Vincent Froese,Rolf Niedermeier,Nimrod Talmon TAMC, 2015, Singapore, China. ⟨10.1007/978-3-319-17142-5_20⟩ Communication dans un congrès hal-01260613v1
Co-Clustering Under the Maximum Norm Laurent Bulteau,Vincent Froese,Sepp Hartung,Rolf Niedermeier ISAAC, 2014, Jeonju, South Korea. ⟨10.1007/978-3-319-13075-0_24⟩ Communication dans un congrès hal-01260592v1
Fixed-Parameter Algorithms for Scaffold Filling Laurent Bulteau,Anna Paola Carrieri,Riccardo Dondi ISCO, 2014, Lisbon, Portugal. ⟨10.1007/978-3-319-09174-7_12⟩ Communication dans un congrès hal-01260583v1
Star Partitions of Perfect Graphs René van Bevern,Robert Bredereck,Laurent Bulteau,Jiehua Chen,Vincent Froeseet al. ICALP, 2014, Copenhague, Denmark. ⟨10.1007/978-3-662-43948-7_15⟩ Communication dans un congrès hal-01260593v1
Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable Laurent Bulteau,Christian Komusiewicz SODA, 2014, University of Illinois, Urbana-Champaign, Illinois, United States. pp.102-121, ⟨10.1137/1.9781611973402.8⟩ Communication dans un congrès hal-01176597v1
Reversal Distances for Strings with Few Blocks or Small Alphabets Laurent Bulteau,Guillaume Fertin,Christian Komusiewicz 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Jun 2014, Moscou, Russia. pp.50-59, ⟨10.1007/978-3-319-07566-2_6⟩ Communication dans un congrès hal-01044938v1
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications Laurent Bulteau,Guillaume Fertin,Christian Komusiewicz,Irena Rusu 13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. pp.244-258, ⟨10.1007/978-3-642-40453-5_19⟩ Communication dans un congrès hal-00906903v1
Inapproximability of (1,2)-Exemplar Distance Laurent Bulteau,Minghui Jiang Bioinformatics Research and Applications, 2012, Dallas, United States. pp.13-23, ⟨10.1007/978-3-642-30191-9_2⟩ Communication dans un congrès hal-01171579v1
Pancake Flipping is Hard Laurent Bulteau,Guillaume Fertin,Irena Rusu 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. pp.247-258 Communication dans un congrès hal-00717712v1
Hardness of longest common subsequence for sequences with bounded run-lengths Guillaume Blin,Laurent Bulteau,Minghui Jiang,Pedro J. Tejada,Stéphane Vialette 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. pp.138-148, ⟨10.1007/978-3-642-31265-6_11⟩ Communication dans un congrès hal-00683311v1
Tractability and Approximability of Maximal Strip Recovery Laurent Bulteau,Guillaume Fertin,Minghui Jiang,Irena Rusu 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. pp.336-349 Communication dans un congrès hal-00606167v1
Sorting by Transpositions is Difficult Laurent Bulteau,Guillaume Fertin,Irena Rusu 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665 Communication dans un congrès hal-00606223v1
Revisiting the Minimum Breakpoint Linearization Problem Laurent Bulteau,Guillaume Fertin,Irena Rusu 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. pp.163-174 Communication dans un congrès hal-00482856v1
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms Laurent Bulteau,Guillaume Fertin,Irena Rusu ISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. pp.710-719 Communication dans un congrès hal-00425145v1

Poster de conférence (1)

MultiPus: Conception de communautés microbiennes pour la production de composés d'intérêt A Julien-Laferrière,Laurent Bulteau,D Parrot,A Marchetti-Spaccamela,L Stougieet al. Jobim, Jun 2016, Lyon, France Poster de conférence hal-01394119v1

Pré-publication, Document de travail (5)

Designing RNA structures while maximizing stacking interactions Théo Boury,Laurent Bulteau,Yann Ponty 2026 Pré-publication, Document de travail hal-05510148v2
CARDS: A collection of package, revision, and miscellaneous dependency graphs Euxane Tran-Girard,Laurent Bulteau,Pierre-Yves David 2024 Pré-publication, Document de travail hal-04929691v1
On Turning A Graph Into A Phylogenetic Network Laurent Bulteau,Mathias Weller,Louxin Zhang 2023 Pré-publication, Document de travail hal-04085424v1
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Number of Deletions Laurent Bulteau,Mark Jones,Rolf Niedermeier,Till Tantau 2021 Pré-publication, Document de travail hal-03322887v1
Finding a Small Number of Colourful Components Laurent Bulteau,Konrad K. Dabrowski,Guillaume Fertin,Matthew Johnson,Daniel Paulusmaet al. 2019 Pré-publication, Document de travail hal-01986725v1

Thèse (1)

Algorithmic Aspects of Genome Rearrangements Laurent Bulteau Data Structures and Algorithms [cs.DS]. Université de Nantes, 2013. English. ⟨NNT : ⟩ Thèse tel-00906929v1