Families of Graphs Having Broadcasting and Gossiping Properties. - Guillaume Fertin; André Raspaud (WG, 1998)

Trade-Offs for Add Gossiping. - Guillaume Fertin (SIROCCO, 1999)

Routing Permutations in the Hypercube. - Olivier Baudon; Guillaume Fertin; Ivan Havel (WG, 1999)

Diameter of the Knödel Graph. - Guillaume Fertin; André Raspaud; Heiko Schröder 001; Ondrej Sýkora; Imrich Vrto (WG, 2000)

A study of minimum gossip graphs. - Guillaume Fertin (Discret. Math., 2000)

Recognizing Recursive Circulant Graphs (Extended Abstract). - Guillaume Fertin; André Raspaud (Electron. Notes Discret. Math., 2000)

Hierarchical broadcast and gossip networks. - Guillaume Fertin (Inf. Process. Lett., 2000)

Compounding of gossip graphs. - Guillaume Fertin; Roger Labahn (Networks, 2000)

On the structure of minimum broadcast digraphs. - Guillaume Fertin (Theor. Comput. Sci., 2000)

k-Neighborhood Broadcasting. - Guillaume Fertin; André Raspaud (SIROCCO, 2001)

On Star Coloring of Graphs. - Guillaume Fertin; André Raspaud; Bruce A. Reed (WG, 2001)

Routing permutations and 2-1 routing requests in the hypercube. - Olivier Baudon; Guillaume Fertin; Ivan Havel (Discret. Appl. Math., 2001)

Neighborhood Communications in Networks. - Guillaume Fertin; André Raspaud (Electron. Notes Discret. Math., 2001)

Minimum feedback vertex set and acyclic coloring. - Guillaume Fertin; Emmanuel Godard; André Raspaud (Inf. Process. Lett., 2002)

Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. - Francesc Comellas; Guillaume Fertin; André Raspaud (SIROCCO, 2003)

Factor d-domatic colorings of graphs. - Noga Alon; Guillaume Fertin; Arthur L. Liestman; Thomas C. Shermer; Ladislav Stacho (Discret. Math., 2003)

Acyclic and k-distance coloring of the grid. - Guillaume Fertin; Emmanuel Godard; André Raspaud (Inf. Process. Lett., 2003)

On the oriented chromatic number of grids. - Guillaume Fertin; André Raspaud; Arup Roychowdhury (Inf. Process. Lett., 2003)

New Results for the 2-Interval Pattern Problem. - Guillaume Blin; Guillaume Fertin; Stéphane Vialette (CPM, 2004)

No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. - Guillaume Fertin; André Raspaud; Ondrej Sýkora (SIROCCO, 2004)

A survey on Knödel graphs. - Guillaume Fertin; André Raspaud (Discret. Appl. Math., 2004)

On maximal instances for the original syntenic distance. - Cédric Chauve; Guillaume Fertin (Theor. Comput. Sci., 2004)

What Makes the Arc-Preserving Subsequence Problem Hard? - Guillaume Blin; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (International Conference on Computational Science (2), 2005)

Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. - Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (MFCS, 2005)

Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. - Guillaume Blin; Cédric Chauve; Guillaume Fertin (Comparative Genomics, 2005)

Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. - Guillaume Blin; Guillaume Fertin; Danny Hermelin; Stéphane Vialette (WG, 2005)

Edge-disjoint spanners in Cartesian products of graphs. - Guillaume Fertin; Arthur L. Liestman; Thomas C. Shermer; Ladislav Stacho (Discret. Math., 2005)

Exemplar Longest Common Subsequence. - Paola Bonizzoni; Gianluca Della Vedova; Riccardo Dondi; Guillaume Fertin; Stéphane Vialette (International Conference on Computational Science (2), 2006)

Genomes Containing Duplicates Are Hard to Compare. - Cédric Chauve; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (International Conference on Computational Science (2), 2006)

How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Stéphane Vialette (Comparative Genomics, 2006)

Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. - Guillaume Fertin; Danny Hermelin; Romeo Rizzi; Stéphane Vialette (CPM, 2007)

Extending the Hardness of RNA Secondary Structure Comparison. - Guillaume Blin; Guillaume Fertin; Irena Rusu; Christine Sinoquet (ESCAPE, 2007)

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. - Michael R. Fellows; Guillaume Fertin; Danny Hermelin; Stéphane Vialette (ICALP, 2007)

Weak pattern matching in colored graphs: Minimizing the number of connected components. - Riccardo Dondi; Guillaume Fertin; Stéphane Vialette (ICTCS, 2007)

A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (RECOMB-CG, 2007)

Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. - Guillaume Blin; Guillaume Fertin; Gaël Herry; Stéphane Vialette (BSB, 2007)

L(p, q) labeling of d-dimensional grids. - Guillaume Fertin; André Raspaud (Discret. Math., 2007)

A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Stéphane Vialette (J. Comput. Biol., 2007)

Comparing Genomes with Duplications: A Computational Complexity Point of View. - Guillaume Blin; Cédric Chauve; Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

Exemplar Longest Common Subsequence. - Paola Bonizzoni; Gianluca Della Vedova; Riccardo Dondi; Guillaume Fertin; Raffaella Rizzi; Stéphane Vialette (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

Extracting constrained 2-interval subsets in 2-interval sets. - Guillaume Blin; Guillaume Fertin; Stéphane Vialette (Theor. Comput. Sci., 2007)

On the Approximability of Comparing Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu (WALCOM, 2008)

Acyclic coloring of graphs of maximum degree five: Nine colors are enough. - Guillaume Fertin; André Raspaud (Inf. Process. Lett., 2008)

Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (J. Comput. Biol., 2008)

Combinatorics of Genome Rearrangements. - Guillaume Fertin; Anthony Labarre; Irena Rusu; Eric Tannier; Stéphane Vialette (MIT Press, 2009)

Comparing Bacterial Genomes by Searching Their Common Intervals. - Sébastien Angibaud; Damien Eveillard; Guillaume Fertin; Irena Rusu (BICoB, 2009)

On Finding Small 2-Generating Sets. - Isabelle Fagnot; Guillaume Fertin; Stéphane Vialette (COCOON, 2009)

Maximum Motif Problem in Vertex-Colored Graphs. - Riccardo Dondi; Guillaume Fertin; Stéphane Vialette (CPM, 2009)

Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (ISAAC, 2009)

Pseudo Boolean Programming for Partially Ordered Genomes. - Sébastien Angibaud; Guillaume Fertin; Annelyse Thévenin; Stéphane Vialette (RECOMB-CG, 2009)

The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. - Guillaume Blin; Guillaume Fertin; Florian Sikora; Stéphane Vialette (WALCOM, 2009)

Comparison of Spectra in Unsequenced Species. - Freddy Cliquet; Guillaume Fertin; Irena Rusu; Dominique Tessier (BSB, 2009)

On the S-Labeling problem. - Guillaume Fertin; Stéphane Vialette (Electron. Notes Discret. Math., 2009)

Finding occurrences of protein complexes in protein-protein interaction graphs. - Guillaume Fertin; Romeo Rizzi; Stéphane Vialette (J. Discrete Algorithms, 2009)

On the Approximability of Comparing Genomes with Duplicates. - Sébastien Angibaud; Guillaume Fertin; Irena Rusu; Annelyse Thévenin; Stéphane Vialette (J. Graph Algorithms Appl., 2009)

Proper Alignment of MS/MS Spectra from Unsequenced Species. - Freddy Cliquet; Guillaume Fertin; Irena Rusu; Dominique Tessier (BIOCOMP, 2010)

Revisiting the Minimum Breakpoint Linearization Problem. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (TAMC, 2010)

Finding common structured patterns in linear graphs. - Guillaume Fertin; Danny Hermelin; Romeo Rizzi; Stéphane Vialette (Theor. Comput. Sci., 2010)

Algorithmic Aspects of Heterogeneous Biological Networks Comparison. - Guillaume Blin; Guillaume Fertin; Hafedh Mohamed-Babou; Irena Rusu; Florian Sikora; Stéphane Vialette (COCOA, 2011)

Tractability and Approximability of Maximal Strip Recovery. - Laurent Bulteau; Guillaume Fertin; Minghui Jiang 001; Irena Rusu (CPM, 2011)

Finding Approximate and Constrained Motifs in Graphs. - Riccardo Dondi; Guillaume Fertin; Stéphane Vialette (CPM, 2011)

Sorting by Transpositions Is Difficult. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (ICALP (1), 2011)

Upper and lower bounds for finding connected motifs in vertex-colored graphs. - Michael R. Fellows; Guillaume Fertin; Danny Hermelin; Stéphane Vialette (J. Comput. Syst. Sci., 2011)

Complexity issues in vertex-colored graph pattern matching. - Riccardo Dondi; Guillaume Fertin; Stéphane Vialette (J. Discrete Algorithms, 2011)

Pancake Flipping Is Hard. - Laurent Bulteau; Guillaume Fertin; Irena Rusu (MFCS, 2012)

Algorithms for Subnetwork Mining in Heterogeneous Networks. - Guillaume Fertin; Hafedh Mohamed-Babou; Irena Rusu (SEA, 2012)

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

DExTaR: Detection of exact tandem repeats based on the de Bruijn graph. - Guillaume Fertin; Géraldine Jean; Andreea Radulescu; Irena Rusu (BIBM, 2014)

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

Towards an Algorithmic Guide to Spiral Galaxies. - Guillaume Fertin; Shahrad Jamshidi; Christian Komusiewicz (FUN, 2014)

Obtaining a Triangular Matrix by Independent Row-Column Permutations. - Guillaume Fertin; Irena Rusu; Stéphane Vialette (ISAAC, 2015)

Algorithmic Aspects of the S-Labeling Problem. - Guillaume Fertin; Irena Rusu; Stéphane Vialette (IWOCA, 2015)

Prefix and Suffix Reversals on Strings. - Guillaume Fertin; Loïc Jankowiak; Géraldine Jean (SPIRE, 2015)

Finding Supported Paths in Heterogeneous Networks. - Guillaume Fertin; Christian Komusiewicz; Hafedh Mohamed-Babou; Irena Rusu (Algorithms, 2015)

Path-driven orientation of mixed graphs. - Guillaume Fertin; Hafedh Mohamed-Babou; Irena Rusu (Discret. Appl. Math., 2015)

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

Approximation algorithms for sorting by length-weighted prefix and suffix operations. - Carla Negri Lintzmayer; Guillaume Fertin; Zanoni Dias (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)

Graph Motif Problems Parameterized by Dual. - Guillaume Fertin; Christian Komusiewicz (CPM, 2016)

SpecTrees: An Efficient Without a Priori Data Structure for MS/MS Spectra Identification. - Matthieu David; Guillaume Fertin; Dominique Tessier (WABI, 2016)

Genome Rearrangements on Both Gene Order and Intergenic Regions. - Guillaume Fertin; Géraldine Jean; Eric Tannier (WABI, 2016)

Genome rearrangements with indels in intergenes restrict the scenario space. - Laurent Bulteau; Guillaume Fertin; Eric Tannier (BMC Bioinform., 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)

Algorithmic Aspects of the Maximum Colorful Arborescence Problem. - Guillaume Fertin; Julien Fradin; Géraldine Jean (TAMC, 2017)

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. - Guillaume Fertin; Géraldine Jean; Eric Tannier (Algorithms Mol. Biol., 2017)

The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. - Guillaume Fertin; Julien Fradin; Christian Komusiewicz (CoRR, 2017)

Odd gossiping. - Guillaume Fertin; Joseph G. Peters; Lynette Raabe; Charlie Xu (Discret. Appl. Math., 2017)

Sorting permutations by prefix and suffix rearrangements. - Carla Negri Lintzmayer; Guillaume Fertin; Zanoni Dias (J. Bioinform. Comput. Biol., 2017)

On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. - Guillaume Fertin; Julien Fradin; Christian Komusiewicz (CPM, 2018)

Super Short Reversals on Both Gene Order and Intergenic Sizes. - Andre Rodrigues Oliveira; Géraldine Jean; Guillaume Fertin; Ulisses Dias; Zanoni Dias (BSB, 2018)

Sorting signed circular permutations by super short operations. - Andre Rodrigues Oliveira; Guillaume Fertin; Ulisses Dias; Zanoni Dias (Algorithms Mol. Biol., 2018)

Matching algorithms for assigning orthologs after genome duplication events. - Guillaume Fertin; Falk Hüffner; Christian Komusiewicz; Manuel Sorge (Comput. Biol. Chem., 2018)

Optimal odd gossiping. - Guillaume Fertin; Joseph G. Peters (Discret. Appl. Math., 2018)

The S-labeling problem: An algorithmic tour. - Guillaume Fertin; Irena Rusu; Stéphane Vialette (Discret. Appl. Math., 2018)

Editorial. - Riccardo Dondi; Guillaume Fertin; Giancarlo Mauri (Theor. Comput. Sci., 2018)

Sorting permutations and binary strings by length-weighted rearrangements. - Carla Negri Lintzmayer; Guillaume Fertin; Zanoni Dias (Theor. Comput. Sci., 2018)

Mass Spectra Interpretation and the Interest of SpecFit for Identifying Uncommon Modifications. - Guillaume Fertin; Matthieu David; Hélène Rogniaux; Dominique Tessier (CIBB, 2019)

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)

Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes. - Klairton Lima Brito; Géraldine Jean; Guillaume Fertin; Andre Rodrigues Oliveira; Ulisses Dias; Zanoni Dias (ISBRA, 2019)

Unshuffling Permutations: Trivial Bijections and Compositions. - Guillaume Fertin; Samuele Giraudo; Sylvie Hamel; Stéphane Vialette (TAMC, 2019)

Super short operations on both gene order and intergenic sizes. - Andre Rodrigues Oliveira; Géraldine Jean; Guillaume Fertin; Ulisses Dias; Zanoni Dias (Algorithms Mol. Biol., 2019)

A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions. - Andre Rodrigues Oliveira; Géraldine Jean; Guillaume Fertin; Klairton Lima Brito; Ulisses Dias; Zanoni Dias (AlCoB, 2020)

Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes. - Klairton Lima Brito; Géraldine Jean; Guillaume Fertin; Andre Rodrigues Oliveira; Ulisses Dias; Zanoni Dias (J. Comput. Biol., 2020)

Improved Lower Bounds for the Cyclic Bandwidth Problem. - Hugues Déprés; Guillaume Fertin; Éric Monfroy (ICCS (1), 2021)

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

Evaluation of open search methods based on theoretical mass spectra comparison. - Albane Lysiak; Guillaume Fertin; Géraldine Jean; Dominique Tessier (BMC Bioinform., 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)

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

The Maximum Colorful Arborescence problem: How (computationally) hard can it be? - Guillaume Fertin; Julien Fradin; Géraldine Jean (Theor. Comput. Sci., 2021)

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

The Maximum Zero-Sum Partition Problem. - Guillaume Fertin; Oscar Fontaine; Géraldine Jean; Stéphane Vialette (ICS, 2022)

Transposition Distance Considering Intergenic Regions for Unbalanced Genomes. - Alexsandro Oliveira Alexandrino; Andre Rodrigues Oliveira; Géraldine Jean; Guillaume Fertin; Ulisses Dias; Zanoni Dias (ISBRA, 2022)

Sorting by k-Cuts on Signed Permutations. - Andre Rodrigues Oliveira; Alexsandro Oliveira Alexandrino; Géraldine Jean; Guillaume Fertin; Ulisses Dias; Zanoni Dias (RECOMB-CG, 2022)

Sorting Genomes by Prefix Double-Cut-and-Joins. - Guillaume Fertin; Géraldine Jean; Anthony Labarre (SPIRE, 2022)

The Exact Subset MultiCover Problem. - Emile Benoist; Guillaume Fertin; Géraldine Jean (TAMC, 2022)

Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions. - Gabriel Siqueira; Alexsandro Oliveira Alexandrino; Andre Rodrigues Oliveira; Géraldine Jean; Guillaume Fertin; Zanoni Dias (ISBRA, 2023)

Approximation algorithms for sorting by k-cuts on signed permutations. - Andre Rodrigues Oliveira; Alexsandro Oliveira Alexandrino; Géraldine Jean; Guillaume Fertin; Ulisses Dias; Zanoni Dias (J. Comb. Optim., 2023)

Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information. - Alexsandro Oliveira Alexandrino; Andre Rodrigues Oliveira; Géraldine Jean; Guillaume Fertin; Ulisses Dias; Zanoni Dias (J. Comput. Biol., 2023)

Fast alignment of mass spectra in large proteomics datasets, capturing dissimilarities arising from multiple complex modifications of peptides. - Grégoire Prunier; Mehdi Cherkaoui; Albane Lysiak; Olivier Langella; Mélisande Blein-Nicolas; Virginie Lollier; Emile Benoist; Géraldine Jean; Guillaume Fertin; Hélène Rogniaux; Dominique Tessier (BMC Bioinform., 2023)

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 (ICCS (5), 2024)

Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs. - Gabriel Siqueira; Andre Rodrigues Oliveira; Alexsandro Oliveira Alexandrino; Géraldine Jean; Guillaume Fertin; Zanoni Dias (J. Heuristics, 2024)