| 2026 | WABI | RNA Inverse Folding Under Stacked Base Pair Maximization. | Tho Boury, Laurent Bulteau, Yann Ponty |
| 2026 | WABI | FPT Learning of Sparse, Robust and Interpretable Generative Models of RNA Evolution. | Samuel Gardelle, Laurent Bulteau, Yann Ponty |
| 2025 | MSR | CARDS: A collection of package, revision, and miscellaneous dependency graphs. | Euxane Tran-Girard, Laurent Bulteau, Pierre-Yves David |
| 2025 | SPIRE | String Consensus Problems with Swaps and Substitutions. | Estban Gabory, Laurent Bulteau, Gabriele Fici, Hilde Verbeek |
| 2025 | TASE | A Coherent Index for Dichotomy in Version-Controlled Repositories. | Laurent Bulteau, Pierre-Yves David, Florian Horn, Euxane Tran-Girard |
| 2024 | WABI | RNA Inverse Folding Can Be Solved in Linear Time for Structures Without Isolated Stacks or Base Pairs. | Tho Boury, Laurent Bulteau, Yann Ponty |
| 2023 | LAGOS | The Problem of Discovery in Version Control Systems. | Laurent Bulteau, Pierre-Yves David, Florian Horn |
| 2022 | CPM | An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. | Laurent Bulteau, Mark Jones, Rolf Niedermeier, Till Tantau |
| 2022 | CPM | Permutation Pattern Matching for Doubly Partially Ordered Patterns. | Laurent Bulteau, Guillaume Fertin, Vincent Jug, Stphane Vialette |
| 2022 | CPM | Reordering a Tree According to an Order on Its Leaves. | Laurent Bulteau, Philippe Gambette, Olga Seminck |
| 2022 | IJCAI | Better Collective Decisions via Uncertainty Reduction. | Shiri Alouf-Heffetz, Laurent Bulteau, Edith Elkind, Nimrod Talmon, Nicholas Teh |
| 2022 | WABI | Automated Design of Dynamic Programming Schemes for RNA Folding with Pseudoknots. | Bertrand Marchand, Sebastian Will, Sarah J. Berkemer, Laurent Bulteau, Yann Ponty |
| 2022 | WG | An Algorithmic Framework for Locally Constrained Homomorphisms. | Laurent Bulteau, Konrad K. Dabrowski, Noleen Khler, Sebastian Ordyniak, Danil Paulusma |
| 2021 | COCOON | Sequence Graphs Realizations and Ambiguity in Language Models. | Sammy Khalife, Yann Ponty, Laurent Bulteau |
| 2021 | CPM | Disorders and Permutations. | Laurent Bulteau, Samuele Giraudo, Stphane Vialette |
| 2021 | SOFSEM | Sorting by Multi-cut Rearrangements. | Laurent Bulteau, Guillaume Fertin, Graldine Jean, Christian Komusiewicz |
| 2021 | WABI | Tree Diet: Reducing the Treewidth to Unlock FPT Algorithms in RNA Bioinformatics. | Bertrand Marchand, Yann Ponty, Laurent Bulteau |
| 2019 | CIAC | Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. | Laurent Bulteau, Niels Grttemeier, Christian Komusiewicz, Manuel Sorge |
| 2019 | CPM | Finding a Small Number of Colourful Components. | Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Danil Paulusma, Stphane Vialette |
| 2018 | CSR | The Clever Shopper Problem. | Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stphane Vialette |
| 2018 | IWOCA | Pattern Matching for k-Track Permutations. | Laurent Bulteau, Romeo Rizzi, Stphane Vialette |
| 2018 | MFCS | Consensus Strings with Small Maximum Distance and Small Distance Sum. | Laurent Bulteau, Markus L. Schmid |
| 2017 | CPM | Beyond Adjacency Maximization: Scaffold Filling for New String Distances. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
| 2016 | COCOON | Decomposing Cubic Graphs into Connected Subgraphs of Size Three. | Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu |
| 2015 | TAMC | The Complexity of Finding Effectors. | Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon |
| 2015 | TAMC | Multi-player Diffusion Games on Graph Classes. | Laurent Bulteau, Vincent Froese, Nimrod Talmon |
| 2014 | CPM | Reversal Distances for Strings with Few Blocks or Small Alphabets. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
| 2014 | ICALP | Star Partitions of Perfect Graphs. | Ren van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger |
| 2014 | ISAAC | Co-Clustering Under the Maximum Norm. | Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier |
| 2014 | SODA | Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. | Laurent Bulteau, Christian Komusiewicz |
| 2013 | WABI | A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu |
| 2012 | CPM | Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. | Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stphane Vialette |
| 2012 | MFCS | Pancake Flipping Is Hard. | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
| 2011 | CPM | Tractability and Approximability of Maximal Strip Recovery. | Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu |
| 2011 | ICALP | Sorting by Transpositions Is Difficult. | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
| 2010 | TAMC | Revisiting the Minimum Breakpoint Linearization Problem. | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
| 2009 | ISAAC | Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. | Laurent Bulteau, Guillaume Fertin, Irena Rusu |