A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching. - Gonzalo Navarro 001; Mathieu Raffinot (CPM, 1998)

A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text. - Gonzalo Navarro 001; Mathieu Raffinot (CPM, 1999)

Factor Oracle: A New Structure for Pattern Matching. - Cyril Allauzen; Maxime Crochemore; Mathieu Raffinot (SOFSEM, 1999)

Fast Regular Expression Search. - Gonzalo Navarro 001; Mathieu Raffinot (WAE, 1999)

Asymptotic Estimation of the Average Number of Terminal States in DAWGs. - Mathieu Raffinot (Discret. Appl. Math., 1999)

Simple Optimal String Matching Algorithm. - Cyril Allauzen; Mathieu Raffinot (J. Algorithms, 2000)

Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata. - Gonzalo Navarro 001; Mathieu Raffinot (ACM J. Exp. Algorithmics, 2000)

Efficient Experimental String Matching by Weak Factor Recognition. - Cyril Allauzen; Maxime Crochemore; Mathieu Raffinot (CPM, 2001)

Fast and simple character classes and bounded gaps pattern matching, with application to protein searching. - Gonzalo Navarro 001; Mathieu Raffinot (RECOMB, 2001)

Compact DFA Representation for Fast Regular Expression Search. - Gonzalo Navarro 001; Mathieu Raffinot (WAE, 2001)

On maximal repeats in strings. - Mathieu Raffinot (Inf. Process. Lett., 2001)

Flexible pattern matching in strings - practical on-line search algorithms for texts and biological sequences. - Gonzalo Navarro 001; Mathieu Raffinot (Cambridge University Press, 2002)

High Similarity Sequence Comparison in Clustering Large Sequence Databases. - Lorie Dudoignon; Eric Glémet; Hendrik Cornelis Heus; Mathieu Raffinot (CSB, 2002)

Approximate matching of secondary structures. - Nadia El-Mabrouk; Mathieu Raffinot (RECOMB, 2002)

The Algorithmic of Gene Teams. - Anne Bergeron; Sylvie Corteel; Mathieu Raffinot (WABI, 2002)

Gene teams: a new formalization of gene clusters for comparative genomics. - Nicolas Luc; Jean-Loup Risler; Anne Bergeron; Mathieu Raffinot (Comput. Biol. Chem., 2003)

Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching. - Gonzalo Navarro 001; Mathieu Raffinot (J. Comput. Biol., 2003)

Maximal Common Connected Sets of Interval Graphs. - Michel Habib; Christophe Paul; Mathieu Raffinot (CPM, 2004)

Practical and flexible pattern matching over Ziv-Lempel compressed text. - Gonzalo Navarro 001; Mathieu Raffinot (J. Discrete Algorithms, 2004)

An algorithmic view of gene teams. - Marie-Pierre Béal; Anne Bergeron; Sylvie Corteel; Mathieu Raffinot (Theor. Comput. Sci., 2004)

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. - Anne Bergeron; Cédric Chauve; Fabien de Montgolfier; Mathieu Raffinot (ESA, 2005)

New Techniques for Regular Expression Searching. - Gonzalo Navarro 001; Mathieu Raffinot (Algorithmica, 2005)

Approximate Matching of Structured Motifs in Dna Sequences. - Nadia El-Mabrouk; Mathieu Raffinot; Jean-Eudes Duchesne; Mathieu Lajoie; Nicolas Luc (J. Bioinform. Comput. Biol., 2005)

Fast algorithms for identifying maximal common connected sets of interval graphs. - Fabien Coulon; Mathieu Raffinot (Discret. Appl. Math., 2006)

Faster Text Fingerprinting. - Roman Kolpakov; Mathieu Raffinot (SPIRE, 2008)

A note on computing set overlap classes. - Pierre Charbit; Michel Habib; Vincent Limouzy; Fabien de Montgolfier; Mathieu Raffinot; Michaël Rao (Inf. Process. Lett., 2008)

New algorithms for text fingerprinting. - Roman Kolpakov; Mathieu Raffinot (J. Discrete Algorithms, 2008)

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. - Anne Bergeron; Cédric Chauve; Fabien de Montgolfier; Mathieu Raffinot (SIAM J. Discret. Math., 2008)

A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs - Pierre Charbit; Fabien de Montgolfier; Mathieu Raffinot (CoRR, 2009)

Consecutive Ones Property Testing: Cut or Swap. - Mathieu Raffinot (CiE, 2011)

Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract). - Aïda Ouangraoua; Mathieu Raffinot (CPM, 2012)

Faster and Simpler Minimal Conflicting Set Identification - Aïda Ouangraoua; Mathieu Raffinot (CoRR, 2012)

Linear Time Split Decomposition Revisited. - Pierre Charbit; Fabien de Montgolfier; Mathieu Raffinot (SIAM J. Discret. Math., 2012)

Average Optimal String Matching in Packed Strings. - Djamal Belazzougui; Mathieu Raffinot (CIAC, 2013)

Single and Multiple Consecutive Permutation Motif Search. - Djamal Belazzougui; Adeline Pierrot; Mathieu Raffinot; Stéphane Vialette (ISAAC, 2013)

Easy identification of generalized common nested intervals - Fabien de Montgolfier; Mathieu Raffinot; Irena Rusu (CoRR, 2013)

Various improvements to text fingerprinting. - Djamal Belazzougui; Roman Kolpakov; Mathieu Raffinot (J. Discrete Algorithms, 2013)

Approximate regular expression matching with multi-strings. - Djamal Belazzougui; Mathieu Raffinot (J. Discrete Algorithms, 2013)

Easy Identification of Generalized Common and Conserved Nested Intervals. - Fabien de Montgolfier; Mathieu Raffinot; Irena Rusu (J. Comput. Biol., 2014)

On the Identification of Conflicting Contiguities in Ancestral Genome Reconstruction. - Aïda Ouangraoua; Mathieu Raffinot (J. Comput. Biol., 2014)

Composite Repetition-Aware Data Structures. - Djamal Belazzougui; Fabio Cunial; Travis Gagie; Nicola Prezza; Mathieu Raffinot (CPM, 2015)

Practical combinations of repetition-aware data structures. - Djamal Belazzougui; Fabio Cunial; Travis Gagie; Nicola Prezza; Mathieu Raffinot (CoRR, 2016)

A note on the shortest common superstring of NGS reads. - Tristan Braquelaire; Marie Gasparoux; Mathieu Raffinot; Raluca Uricaru (CoRR, 2016)

Indexing and querying color sets of images. - Djamal Belazzougui; Roman Kolpakov; Mathieu Raffinot (Theor. Comput. Sci., 2016)

Flexible Indexing of Repetitive Collections. - Djamal Belazzougui; Fabio Cunial; Travis Gagie; Nicola Prezza; Mathieu Raffinot (CiE, 2017)

On the Shortest Common Superstring of NGS Reads. - Tristan Braquelaire; Marie Gasparoux; Mathieu Raffinot; Raluca Uricaru (TAMC, 2017)

Optimizing Google Shopping Campaigns Structures With Query-Level Matching. - Mathieu Raffinot; Romain Rivière (CoRR, 2017)

On improving the approximation ratio of the r-shortest common superstring problem. - Tristan Braquelaire; Marie Gasparoux; Mathieu Raffinot; Raluca Uricaru (CoRR, 2018)

VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints. - Arnaud Casteigts; Mathieu Raffinot; Jason Schoeters (ALGOSENSORS, 2020)

On the Approximability of the Minimum Weight $t$-partite Clique Problem. - Geoffrey Solano; Guillaume Blin; Mathieu Raffinot; Jhoirene B. Clemente; Jaime Caro (J. Graph Algorithms Appl., 2020)

Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem. - Guillaume Blin; Alexandru Popa 001; Mathieu Raffinot; Raluca Uricaru (SPIRE, 2023)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints. - Arnaud Casteigts; Mathieu Raffinot; Mikhail A. Raskin; Jason Schoeters (Discret. Appl. Math., 2025)