Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths. - Guillaume Blin; Laurent Bulteau; Minghui Jiang 001; Pedro J. Tejada; Stéphane Vialette (CPM, 2012)

Sorting by Transpositions Is Difficult. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (SIAM J. Discret. Math., 2012)

Tractability and approximability of maximal strip recovery. - Laurent Bulteau; Guillaume Fertin; Minghui Jiang 001; Irena Rusu (Theor. Comput. Sci., 2012)

A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. - Laurent Bulteau; Guillaume Fertin; Christian Komusiewicz; Irena Rusu (WABI, 2013)

Maximal strip recovery problem with gaps: Hardness and approximation algorithms. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (J. Discrete Algorithms, 2013)

Inapproximability of (1, 2)-Exemplar Distance. - Laurent Bulteau; Minghui Jiang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Revisiting the Minimum Breakpoint Linearization Problem. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (Theor. Comput. Sci., 2013)

Algorithmic Aspects of Genome Rearrangements. (Ordres et désordres dans l'algorithmique du génome). - Laurent Bulteau (2013)

Reversal Distances for Strings with Few Blocks or Small Alphabets. - Laurent Bulteau; Guillaume Fertin; Christian Komusiewicz (CPM, 2014)

Star Partitions of Perfect Graphs. - René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (ICALP (1), 2014)

Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable. - Laurent Bulteau; Christian Komusiewicz (SODA, 2014)

Multivariate Algorithmics for NP-Hard String Problems. - Laurent Bulteau; Falk Hüffner; Christian Komusiewicz; Rolf Niedermeier (Bull. EATCS, 2014)

Computing an Evolutionary Ordering is Hard. - Laurent Bulteau; Gustavo Sacomoto; Blerina Sinaimeri (Electron. Notes Discret. Math., 2015)

Some algorithmic results for [2]-sumset covers. - Laurent Bulteau; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (Inf. Process. Lett., 2015)

Pancake Flipping is hard. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (J. Comput. Syst. Sci., 2015)

Fixed-parameter algorithms for scaffold filling. - Laurent Bulteau; Anna Paola Carrieri; Riccardo Dondi (Theor. Comput. Sci., 2015)

Combinatorial voter control in elections. - Laurent Bulteau; Jiehua Chen 001; Piotr Faliszewski; Rolf Niedermeier; Nimrod Talmon (Theor. Comput. Sci., 2015)

Decomposing Cubic Graphs into Connected Subgraphs of Size Three. - Laurent Bulteau; Guillaume Fertin; Anthony Labarre; Romeo Rizzi; Irena Rusu (COCOON, 2016)

Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. - René van Bevern; Robert Bredereck; Laurent Bulteau; Christian Komusiewicz; Nimrod Talmon; Gerhard J. Woeginger (DOOR, 2016)

Triangle Counting in Dynamic Graph Streams. - Laurent Bulteau; Vincent Froese; Konstantin Kutzkov; Rasmus Pagh (Algorithmica, 2016)

Co-Clustering under the Maximum Norm. - Laurent Bulteau; Vincent Froese; Sepp Hartung; Rolf Niedermeier (Algorithms, 2016)

Genome rearrangements with indels in intergenes restrict the scenario space. - Laurent Bulteau; Guillaume Fertin; Eric Tannier (BMC Bioinform., 2016)

Multi-Player Diffusion Games on Graph Classes. - Laurent Bulteau; Vincent Froese; Nimrod Talmon (Internet Math., 2016)

(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. - Laurent Bulteau; Guillaume Fertin; Christian Komusiewicz (J. Discrete Algorithms, 2016)

Beyond Adjacency Maximization: Scaffold Filling for New String Distances. - Laurent Bulteau; Guillaume Fertin; Christian Komusiewicz (CPM, 2017)

Consensus Patterns parameterized by input string length is W[1]-hard. - Laurent Bulteau (CoRR, 2017)

Partitioning Perfect Graphs into Stars. - René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (J. Graph Theory, 2017)

The Complexity of Finding Effectors. - Laurent Bulteau; Stefan Fafianie; Vincent Froese; Rolf Niedermeier; Nimrod Talmon (Theory Comput. Syst., 2017)

The Clever Shopper Problem. - Laurent Bulteau; Danny Hermelin; Anthony Labarre; Stéphane Vialette (CSR, 2018)

Pattern Matching for k-Track Permutations. - Laurent Bulteau; Romeo Rizzi; Stéphane Vialette (IWOCA, 2018)

Hardness of Consensus Problems for Circular Strings and Time Series Averaging. - Laurent Bulteau; Vincent Froese; Rolf Niedermeier (CoRR, 2018)

Finding a Small Number of Colourful Components. - Laurent Bulteau; Konrad K. Dabrowski; Guillaume Fertin; Matthew Johnson 002; Daniël Paulusma; Stéphane Vialette (CPM, 2019)

Reliability-Aware and Graph-Based Approach for Rank Aggregation of Biological Data. - Pierre Andrieu; Bryan Brancotte; Laurent Bulteau; Sarah Cohen-Boulakia; Alain Denise; Adeline Pierrot; Stéphane Vialette (eScience, 2019)

Parameterized Algorithms in Bioinformatics: An Overview. - Laurent Bulteau; Mathias Weller (Algorithms, 2019)

Consensus Strings with Small Maximum Distance and Small Distance Sum. - Laurent Bulteau; Markus L. Schmid (Algorithmica, 2020)

The Clever Shopper Problem. - Laurent Bulteau; Danny Hermelin; Dusan Knop; Anthony Labarre; Stéphane Vialette (Theory Comput. Syst., 2020)

Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. - Laurent Bulteau; Vincent Froese; Rolf Niedermeier (SIAM J. Discret. Math., 2020)

Recognizing binary shuffle squares is NP-hard. - Laurent Bulteau; Stéphane Vialette (Theor. Comput. Sci., 2020)

Partition Aggregation for Participatory Budgeting. - Pallavi Jain 001; Nimrod Talmon; Laurent Bulteau (AAMAS, 2021)

Sequence Graphs Realizations and Ambiguity in Language Models. - Sammy Khalife; Yann Ponty; Laurent Bulteau (COCOON, 2021)

Disorders and Permutations. - Laurent Bulteau; Samuele Giraudo; Stéphane Vialette (CPM, 2021)

A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics. - Laurent Bulteau; Bertrand Marchand; Yann Ponty (IPEC, 2021)

Justified Representation for Perpetual Voting. - Laurent Bulteau; Noam Hazon; Rutvik Page; Ariel Rosenfeld; Nimrod Talmon (IEEE Access, 2021)

Sorting by Multi-Cut Rearrangements. - Laurent Bulteau; Guillaume Fertin; Géraldine Jean; Christian Komusiewicz (Algorithms, 2021)

Parameterized String Equations. - Laurent Bulteau; Michael R. Fellows; Christian Komusiewicz; Frances A. Rosamond (CoRR, 2021)

Efficient, robust and effective rank aggregation for massive biological datasets. - Pierre Andrieu; Bryan Brancotte; Laurent Bulteau; Sarah Cohen-Boulakia; Alain Denise; Adeline Pierrot; Stéphane Vialette (Future Gener. Comput. Syst., 2021)

Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation. - Laurent Bulteau; Gal Shahaf; Ehud Shapiro; Nimrod Talmon (J. Artif. Intell. Res., 2021)

Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. - Laurent Bulteau; Niels Grüttemeier; Christian Komusiewicz; Manuel Sorge (J. Comput. Syst. Sci., 2021)

Decomposing subcubic graphs into claws, paths or triangles. - Laurent Bulteau; Guillaume Fertin; Anthony Labarre; Romeo Rizzi; Irena Rusu (J. Graph Theory, 2021)

Sorting Signed Permutations by Intergenic Reversals. - Andre Rodrigues Oliveira; Géraldine Jean; Guillaume Fertin; Klairton Lima Brito; Laurent Bulteau; Ulisses Dias; Zanoni Dias (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions. - Laurent Bulteau; Mark Jones 001; Rolf Niedermeier; Till Tantau (CPM, 2022)

Permutation Pattern Matching for Doubly Partially Ordered Patterns. - Laurent Bulteau; Guillaume Fertin; Vincent Jugé; Stéphane Vialette (CPM, 2022)

Reordering a Tree According to an Order on Its Leaves. - Laurent Bulteau; Philippe Gambette; Olga Seminck (CPM, 2022)

Better Collective Decisions via Uncertainty Reduction. - Shiri Alouf-Heffetz; Laurent Bulteau; Edith Elkind; Nimrod Talmon; Nicholas Teh (IJCAI, 2022)

Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. - Bertrand Marchand; Yann Ponty; Laurent Bulteau (Algorithms Mol. Biol., 2022)

2-Dimensional Euclidean Preferences. - Laurent Bulteau; Jiehua Chen 001 (CoRR, 2022)

The Problem of Discovery in Version Control Systems. - Laurent Bulteau; Pierre-Yves David; Florian Horn 001 (LAGOS, 2023)

On shuffled-square-free words. - Laurent Bulteau; Vincent Jugé; Stéphane Vialette (Theor. Comput. Sci., 2023)

Automated design of dynamic programming schemes for RNA folding with pseudoknots. - Bertrand Marchand; Sebastian Will; Sarah J. Berkemer; Yann Ponty; Laurent Bulteau (Algorithms Mol. Biol., 2023)

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)

The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings. - Laurent Bulteau; Louxin Zhang (J. Comput. Syst. Sci., 2024)

An Algorithmic Framework for Locally Constrained Homomorphisms. - Laurent Bulteau; Konrad K. Dabrowski; Noleen Köhler; Sebastian Ordyniak; Daniël Paulusma (SIAM J. Discret. Math., 2024)

LinearBPDesign. - Théo Boury; Laurent Bulteau; Yann Ponty (DROPS Artifacts, 2024)

CARDS: A collection of package, revision, and miscellaneous dependency graphs. - Euxane Tran-Girard; Laurent Bulteau; Pierre-Yves David (MSR, 2025)

A Coherent Index for Dichotomy in Version-Controlled Repositories. - Laurent Bulteau; Pierre-Yves David; Florian Horn 001; Euxane Tran-Girard (TASE, 2025)

Incremental Reachability Index. - Laurent Bulteau; Pierre-Yves David; Florian Horn 001; Euxane Tran-Girard (SEA, 2025)

String Consensus Problems with Swaps and Substitutions. - Estéban Gabory; Laurent Bulteau; Gabriele Fici; Hilde Verbeek 001 (CoRR, 2025)