| 2025 | CPM | Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms. | Cyril Nicaud, Carine Pivoteau, Stphane Vialette |
| 2024 | MFCS | Generalizing Roberts' Characterization of Unit Interval Graphs. | Virginia Ardvol Martnez, Romeo Rizzi, Abdallah Saffidine, Florian Sikora, Stphane Vialette |
| 2023 | ISAAC | Recognizing Unit Multiple Intervals Is Hard. | Virginia Ardvol Martnez, Romeo Rizzi, Florian Sikora, Stphane Vialette |
| 2023 | WALCOM | Parity Permutation Pattern Matching. | Virginia Ardvol Martnez, Florian Sikora, Stphane Vialette |
| 2022 | CPM | Permutation Pattern Matching for Doubly Partially Ordered Patterns. | Laurent Bulteau, Guillaume Fertin, Vincent Jug, Stphane Vialette |
| 2022 | WG | Algorithmic Aspects of Small Quasi-Kernels. | Hlne Langlois, Frdric Meunier, Romeo Rizzi, Stphane Vialette |
| 2021 | CPM | Disorders and Permutations. | Laurent Bulteau, Samuele Giraudo, Stphane Vialette |
| 2019 | CPM | Finding a Small Number of Colourful Components. | Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Danil Paulusma, Stphane Vialette |
| 2019 | TAMC | Unshuffling Permutations: Trivial Bijections and Compositions. | Guillaume Fertin, Samuele Giraudo, Sylvie Hamel, 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 |
| 2016 | LATIN | Unshuffling Permutations. | Samuele Giraudo, Stphane Vialette |
| 2016 | SPIRE | Pattern Matching for Separable Permutations. | Both Emerite Neou, Romeo Rizzi, Stphane Vialette |
| 2015 | ISAAC | Obtaining a Triangular Matrix by Independent Row-Column Permutations. | Guillaume Fertin, Irena Rusu, Stphane Vialette |
| 2015 | IWOCA | Algorithmic Aspects of the S-Labeling Problem. | Guillaume Fertin, Irena Rusu, Stphane Vialette |
| 2015 | IWOCA | Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time. | Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stphane Vialette, Louxin Zhang |
| 2015 | RECOMB | Locating a Tree in a Phylogenetic Network in Quadratic Time. | Philippe Gambette, Andreas D. M. Gunawan, Anthony Labarre, Stphane Vialette, Louxin Zhang |
| 2014 | SOFSEM | Towards Unlocking the Full Potential of Multileaf Collimators. | Guillaume Blin, Paul Morel, Romeo Rizzi, Stphane Vialette |
| 2013 | CSR | On Recognizing Words That Are Squares for the Shuffle Product. | Romeo Rizzi, Stphane Vialette |
| 2013 | ISAAC | Single and Multiple Consecutive Permutation Motif Search. | Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stphane Vialette |
| 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 | ISAAC | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. | Danny Hermelin, Romeo Rizzi, Stphane Vialette |
| 2012 | SPIRE | The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences. | Guillaume Blin, Minghui Jiang, Stphane Vialette |
| 2011 | COCOA | Algorithmic Aspects of Heterogeneous Biological Networks Comparison. | Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stphane Vialette |
| 2011 | CPM | Finding Approximate and Constrained Motifs in Graphs. | Riccardo Dondi, Guillaume Fertin, Stphane Vialette |
| 2011 | CSR | A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. | Guillaume Blin, Romeo Rizzi, Stphane Vialette |
| 2010 | CiE | A Faster Algorithm for Finding Minimum Tucker Submatrices. | Guillaume Blin, Romeo Rizzi, Stphane Vialette |
| 2010 | WALCOM | Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. | Guillaume Blin, Sylvie Hamel, Stphane Vialette |
| 2009 | COCOON | On Finding Small 2-Generating Sets. | Isabelle Fagnot, Guillaume Fertin, Stphane Vialette |
| 2009 | CPM | Maximum Motif Problem in Vertex-Colored Graphs. | Riccardo Dondi, Guillaume Fertin, Stphane Vialette |
| 2009 | ISAAC | Pattern Matching for 321-Avoiding Permutations. | Sylvain Guillemot, Stphane Vialette |
| 2009 | RECOMB | Pseudo Boolean Programming for Partially Ordered Genomes. | Sbastien Angibaud, Guillaume Fertin, Annelyse Thvenin, Stphane Vialette |
| 2009 | WALCOM | The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. | Guillaume Blin, Guillaume Fertin, Florian Sikora, Stphane Vialette |
| 2007 | CPM | Longest Common Separable Pattern Among Permutations. | Mathilde Bouvel, Dominique Rossin, Stphane Vialette |
| 2007 | CPM | Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. | Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stphane Vialette |
| 2007 | FCT | Pattern Matching in Protein-Protein Interaction Graphs. | Galle Brevier, Romeo Rizzi, Stphane Vialette |
| 2007 | ICALP | Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. | Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stphane Vialette |
| 2007 | RECOMB | A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. | Sbastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thvenin, Stphane Vialette |
| 2007 | WAOA | The Minimum Substring Cover Problem. | Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stphane Vialette |
| 2007 | WG | On Restrictions of Balanced 2-Interval Graphs. | Philippe Gambette, Stphane Vialette |
| 2006 | CPM | Approximation of RNA Multiple Structural Alignment. | Marcin Kubica, Romeo Rizzi, Stphane Vialette, Tomasz Walen |
| 2006 | ICCS | Exemplar Longest Common Subsequence. | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stphane Vialette |
| 2006 | ICCS | Genomes Containing Duplicates Are Hard to Compare. | Cdric Chauve, Guillaume Fertin, Romeo Rizzi, Stphane Vialette |
| 2006 | RECOMB | How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. | Sbastien Angibaud, Guillaume Fertin, Irena Rusu, Stphane Vialette |
| 2005 | ESA | Approximating the 2-Interval Pattern Problem. | Maxime Crochemore, Danny Hermelin, Gad M. Landau, Stphane Vialette |
| 2005 | ICCS | What Makes the Arc-Preserving Subsequence Problem Hard? | Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stphane Vialette |
| 2005 | MFCS | Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. | Guillaume Fertin, Romeo Rizzi, Stphane Vialette |
| 2005 | WG | Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. | Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stphane Vialette |
| 2004 | CPM | New Results for the 2-Interval Pattern Problem. | Guillaume Blin, Guillaume Fertin, Stphane Vialette |
| 2002 | CPM | Pattern Matching Problems over 2-Interval Sets. | Stphane Vialette |