| 2026 | WABI | GSI: A New Approach to the Protein Inference Problem. | Aurlien Berthier, Emile Benoist, Guillaume Fertin, Graldine Jean |
| 2024 | ICCS | Best of Both Worlds: Solving the Cyclic Bandwidth Problem by Combining Pre-existing Knowledge and Constraint Programming Techniques. | Guillaume Fertin, ric Monfroy, Claudia Vasconcellos-Gaete |
| 2022 | CPM | Permutation Pattern Matching for Doubly Partially Ordered Patterns. | Laurent Bulteau, Guillaume Fertin, Vincent Jug, Stphane Vialette |
| 2022 | SPIRE | Sorting Genomes by Prefix Double-Cut-and-Joins. | Guillaume Fertin, Graldine Jean, Anthony Labarre |
| 2022 | TAMC | The Exact Subset MultiCover Problem. | Emile Benoist, Guillaume Fertin, Graldine Jean |
| 2021 | ICCS | Improved Lower Bounds for the Cyclic Bandwidth Problem. | Hugues Dprs, Guillaume Fertin, ric Monfroy |
| 2021 | SOFSEM | Sorting by Multi-cut Rearrangements. | Laurent Bulteau, Guillaume Fertin, Graldine Jean, Christian Komusiewicz |
| 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 | CPM | On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. | Guillaume Fertin, Julien Fradin, Christian Komusiewicz |
| 2017 | CPM | Beyond Adjacency Maximization: Scaffold Filling for New String Distances. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
| 2017 | TAMC | Algorithmic Aspects of the Maximum Colorful Arborescence Problem. | Guillaume Fertin, Julien Fradin, Graldine Jean |
| 2016 | COCOON | Decomposing Cubic Graphs into Connected Subgraphs of Size Three. | Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu |
| 2016 | CPM | Graph Motif Problems Parameterized by Dual. | Guillaume Fertin, Christian Komusiewicz |
| 2016 | WABI | SpecTrees: An Efficient Without a Priori Data Structure for MS/MS Spectra Identification. | Matthieu David, Guillaume Fertin, Dominique Tessier |
| 2016 | WABI | Genome Rearrangements on Both Gene Order and Intergenic Regions. | Guillaume Fertin, Graldine Jean, Eric Tannier |
| 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 | SPIRE | Prefix and Suffix Reversals on Strings. | Guillaume Fertin, Loc Jankowiak, Graldine Jean |
| 2014 | CPM | Reversal Distances for Strings with Few Blocks or Small Alphabets. | Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz |
| 2014 | FUN | Towards an Algorithmic Guide to Spiral Galaxies. | Guillaume Fertin, Shahrad Jamshidi, 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 | MFCS | Pancake Flipping Is Hard. | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
| 2011 | COCOA | Algorithmic Aspects of Heterogeneous Biological Networks Comparison. | Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stphane Vialette |
| 2011 | CPM | Tractability and Approximability of Maximal Strip Recovery. | Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu |
| 2011 | CPM | Finding Approximate and Constrained Motifs in Graphs. | Riccardo Dondi, Guillaume Fertin, Stphane Vialette |
| 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 | 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 | Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. | Laurent Bulteau, Guillaume Fertin, Irena Rusu |
| 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 |
| 2008 | WALCOM | On the Approximability of Comparing Genomes with Duplicates. | Sbastien Angibaud, Guillaume Fertin, Irena Rusu |
| 2007 | CPM | Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. | Guillaume Fertin, Danny Hermelin, 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 |
| 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 | 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 | RECOMB | Genes Order and Phylogenetic Reconstruction: Application to | Guillaume Blin, Cdric Chauve, Guillaume Fertin |
| 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 |
| 2004 | SIROCCO | No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. | Guillaume Fertin, Andr Raspaud, Ondrej Skora |
| 2003 | SIROCCO | Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. | Francesc Comellas, Guillaume Fertin, Andr Raspaud |
| 2001 | SIROCCO | k-Neighborhood Broadcasting. | Guillaume Fertin, Andr Raspaud |
| 2001 | WG | On Star Coloring of Graphs. | Guillaume Fertin, Andr Raspaud, Bruce A. Reed |
| 2000 | WG | Diameter of the Kndel Graph. | Guillaume Fertin, Andr Raspaud, Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 1999 | SIROCCO | Trade-Offs for Add Gossiping. | Guillaume Fertin |
| 1999 | WG | Routing Permutations in the Hypercube. | Olivier Baudon, Guillaume Fertin, Ivan Havel |
| 1998 | WG | Families of Graphs Having Broadcasting and Gossiping Properties. | Guillaume Fertin, Andr Raspaud |