Guillaume Fertin

149 papers A* 1A 1B 28C 12Misc 6Journal 79Unranked 21

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Partition Based Algorithms for Rearrangement Distances With Flexible Intergenic Regions. IEEE Trans. Comput. Biol. Bioinform. Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Zanoni Dias
2025	J	`jnl`	Sorting genomes by prefix double-cut-and-joins. Theor. Comput. Sci. Guillaume Fertin, Géraldine Jean, Anthony Labarre
2025	J	`jnl`	The Exact Subset MultiCover problem. Theor. Comput. Sci. Emile Benoist, Guillaume Fertin, Géraldine Jean
2024	J	`jnl`	Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs. J. Heuristics Gabriel Siqueira, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Zanoni Dias
2024	—	`conf`	Best of Both Worlds: Solving the Cyclic Bandwidth Problem by Combining Pre-existing Knowledge and Constraint Programming Techniques. ICCS (5) Guillaume Fertin, Éric Monfroy, Claudia Vasconcellos-Gaete
2024	J	`jnl`	The Maximum Zero-Sum Partition problem. Theor. Comput. Sci. Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette
2023	—	`conf`	Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions. ISBRA Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Zanoni Dias
2023	J	`jnl`	Approximation algorithms for sorting by k-cuts on signed permutations. J. Comb. Optim. Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias
2023	J	`jnl`	Fast alignment of mass spectra in large proteomics datasets, capturing dissimilarities arising from multiple complex modifications of peptides. BMC Bioinform. 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
2023	J	`jnl`	Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information. J. Comput. Biol. Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias
2022	B	`conf`	Permutation Pattern Matching for Doubly Partially Ordered Patterns. CPM Laurent Bulteau, Guillaume Fertin, Vincent Jugé, Stéphane Vialette
2022	C	`conf`	Sorting Genomes by Prefix Double-Cut-and-Joins. SPIRE Guillaume Fertin, Géraldine Jean, Anthony Labarre
2022	J	`jnl`	Sorting Genomes by Prefix Double-Cut-and-Joins. CoRR Guillaume Fertin, Géraldine Jean, Anthony Labarre
2022	—	`conf`	Sorting by k-Cuts on Signed Permutations. RECOMB-CG Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias
2022	C	`conf`	The Exact Subset MultiCover Problem. TAMC Emile Benoist, Guillaume Fertin, Géraldine Jean
2022	A	`conf`	The Maximum Zero-Sum Partition Problem. ICS Guillaume Fertin, Oscar Fontaine, Géraldine Jean, Stéphane Vialette
2022	—	`conf`	Transposition Distance Considering Intergenic Regions for Unbalanced Genomes. ISBRA Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias
2021	J	`jnl`	Decomposing subcubic graphs into claws, paths or triangles. J. Graph Theory Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2021	J	`jnl`	Evaluation of open search methods based on theoretical mass spectra comparison. BMC Bioinform. Albane Lysiak, Guillaume Fertin, Géraldine Jean, Dominique Tessier
2021	—	`conf`	Improved Lower Bounds for the Cyclic Bandwidth Problem. ICCS (1) Hugues Déprés, Guillaume Fertin, Éric Monfroy
2021	J	`jnl`	Sorting Permutations by Intergenic Operations. IEEE ACM Trans. Comput. Biol. Bioinform. Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Ulisses Dias, Zanoni Dias
2021	J	`jnl`	Sorting Signed Permutations by Intergenic Reversals. IEEE ACM Trans. Comput. Biol. Bioinform. Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Laurent Bulteau, Ulisses Dias, Zanoni Dias
2021	J	`jnl`	Sorting by Multi-Cut Rearrangements. Algorithms Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
2021	B	`conf`	Sorting by Multi-cut Rearrangements. SOFSEM Laurent Bulteau, Guillaume Fertin, Géraldine Jean, Christian Komusiewicz
2021	J	`jnl`	The Maximum Colorful Arborescence problem: How (computationally) hard can it be? Theor. Comput. Sci. Guillaume Fertin, Julien Fradin, Géraldine Jean
2020	—	`conf`	A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions. AlCoB Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Ulisses Dias, Zanoni Dias
2020	J	`jnl`	Graph Motif Problems Parameterized by Dual. J. Graph Algorithms Appl. Guillaume Fertin, Christian Komusiewicz
2020	J	`jnl`	Sorting by Genome Rearrangements on Both Gene Order and Intergenic Sizes. J. Comput. Biol. Klairton Lima Brito, Géraldine Jean, Guillaume Fertin, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias
2019	B	`conf`	Finding a Small Number of Colourful Components. CPM Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2019	J	`jnl`	Graph Motif Problems Parameterized by Dual. CoRR Guillaume Fertin, Christian Komusiewicz
2019	—	`conf`	Mass Spectra Interpretation and the Interest of SpecFit for Identifying Uncommon Modifications. CIBB Guillaume Fertin, Matthieu David, Hélène Rogniaux, Dominique Tessier
2019	—	`conf`	Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic Sizes. ISBRA Klairton Lima Brito, Géraldine Jean, Guillaume Fertin, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias
2019	J	`jnl`	Super short operations on both gene order and intergenic sizes. Algorithms Mol. Biol. Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias
2019	C	`conf`	Unshuffling Permutations: Trivial Bijections and Compositions. TAMC Guillaume Fertin, Samuele Giraudo, Sylvie Hamel, Stéphane Vialette
2018	J	`jnl`	Editorial. Theor. Comput. Sci. Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri
2018	J	`jnl`	Finding a Small Number of Colourful Components. CoRR Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2018	J	`jnl`	Matching algorithms for assigning orthologs after genome duplication events. Comput. Biol. Chem. Guillaume Fertin, Falk Hüffner, Christian Komusiewicz, Manuel Sorge
2018	B	`conf`	On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure. CPM Guillaume Fertin, Julien Fradin, Christian Komusiewicz
2018	J	`jnl`	Optimal odd gossiping. Discret. Appl. Math. Guillaume Fertin, Joseph G. Peters
2018	J	`jnl`	Prefix and suffix reversals on strings. Discret. Appl. Math. Guillaume Fertin, Loïc Jankowiak, Géraldine Jean
2018	J	`jnl`	Sorting permutations and binary strings by length-weighted rearrangements. Theor. Comput. Sci. Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias
2018	J	`jnl`	Sorting signed circular permutations by super short operations. Algorithms Mol. Biol. Andre Rodrigues Oliveira, Guillaume Fertin, Ulisses Dias, Zanoni Dias
2018	—	`conf`	Super Short Reversals on Both Gene Order and Intergenic Sizes. BSB Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias
2018	J	`jnl`	The S-labeling problem: An algorithmic tour. Discret. Appl. Math. Guillaume Fertin, Irena Rusu, Stéphane Vialette
2017	C	`conf`	Algorithmic Aspects of the Maximum Colorful Arborescence Problem. TAMC Guillaume Fertin, Julien Fradin, Géraldine Jean
2017	J	`jnl`	Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. Algorithms Mol. Biol. Guillaume Fertin, Géraldine Jean, Eric Tannier
2017	B	`conf`	Beyond Adjacency Maximization: Scaffold Filling for New String Distances. CPM Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2017	J	`jnl`	Odd gossiping. Discret. Appl. Math. Guillaume Fertin, Joseph G. Peters, Lynette Raabe, Charlie Xu
2017	J	`jnl`	Sorting permutations by prefix and suffix rearrangements. J. Bioinform. Comput. Biol. Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias
2017	J	`jnl`	The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph. CoRR Guillaume Fertin, Julien Fradin, Christian Komusiewicz
2016	J	`jnl`	(Prefix) reversal distance for (signed) strings with few blocks or small alphabets. J. Discrete Algorithms Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2016	C	`ed.`	Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings AAIM Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri
2016	Misc	`conf`	Decomposing Cubic Graphs into Connected Subgraphs of Size Three. COCOON Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2016	J	`jnl`	Decomposing Cubic Graphs into Connected Subgraphs of Size Three. CoRR Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu
2016	C	`conf`	Genome Rearrangements on Both Gene Order and Intergenic Regions. WABI Guillaume Fertin, Géraldine Jean, Eric Tannier
2016	J	`jnl`	Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. Laurent Bulteau, Guillaume Fertin, Eric Tannier
2016	B	`conf`	Graph Motif Problems Parameterized by Dual. CPM Guillaume Fertin, Christian Komusiewicz
2016	C	`conf`	SpecTrees: An Efficient Without a Priori Data Structure for MS/MS Spectra Identification. WABI Matthieu David, Guillaume Fertin, Dominique Tessier
2015	C	`conf`	Algorithmic Aspects of the S-Labeling Problem. IWOCA Guillaume Fertin, Irena Rusu, Stéphane Vialette
2015	J	`jnl`	Approximation algorithms for sorting by length-weighted prefix and suffix operations. Theor. Comput. Sci. Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias
2015	J	`jnl`	Finding Supported Paths in Heterogeneous Networks. Algorithms Guillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu
2015	B	`conf`	Obtaining a Triangular Matrix by Independent Row-Column Permutations. ISAAC Guillaume Fertin, Irena Rusu, Stéphane Vialette
2015	J	`jnl`	Pancake Flipping is hard. J. Comput. Syst. Sci. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2015	J	`jnl`	Path-driven orientation of mixed graphs. Discret. Appl. Math. Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu
2015	C	`conf`	Prefix and Suffix Reversals on Strings. SPIRE Guillaume Fertin, Loïc Jankowiak, Géraldine Jean
2015	J	`jnl`	Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2015	J	`jnl`	Towards an algorithmic guide to Spiral Galaxies. Theor. Comput. Sci. Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz
2014	—	`conf`	DExTaR: Detection of exact tandem repeats based on the de Bruijn graph. BIBM Guillaume Fertin, Géraldine Jean, Andreea Radulescu, Irena Rusu
2014	B	`conf`	Reversal Distances for Strings with Few Blocks or Small Alphabets. CPM Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
2014	Misc	`conf`	Towards an Algorithmic Guide to Spiral Galaxies. FUN Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz
2013	C	`conf`	A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. WABI Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
2013	J	`jnl`	A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. CoRR Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu
2013	J	`jnl`	Finding approximate and constrained motifs in graphs. Theor. Comput. Sci. Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2013	J	`jnl`	Maximal strip recovery problem with gaps: Hardness and approximation algorithms. J. Discrete Algorithms Laurent Bulteau, Guillaume Fertin, Irena Rusu
2013	J	`jnl`	Revisiting the Minimum Breakpoint Linearization Problem. Theor. Comput. Sci. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	B	`conf`	Algorithms for Subnetwork Mining in Heterogeneous Networks. SEA Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu
2012	B	`conf`	Pancake Flipping Is Hard. MFCS Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	J	`jnl`	Sorting by Transpositions Is Difficult. SIAM J. Discret. Math. Laurent Bulteau, Guillaume Fertin, Irena Rusu
2012	J	`jnl`	Tractability and approximability of maximal strip recovery. Theor. Comput. Sci. Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
2011	C	`conf`	Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, Stéphane Vialette
2011	J	`jnl`	Complexity issues in vertex-colored graph pattern matching. J. Discrete Algorithms Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2011	B	`conf`	Finding Approximate and Constrained Motifs in Graphs. CPM Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2011	J	`jnl`	Pancake Flipping is Hard CoRR Laurent Bulteau, Guillaume Fertin, Irena Rusu
2011	—	`conf`	Sorting by Transpositions Is Difficult. ICALP (1) Laurent Bulteau, Guillaume Fertin, Irena Rusu
2011	B	`conf`	Tractability and Approximability of Maximal Strip Recovery. CPM Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
2011	J	`jnl`	Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2010	J	`jnl`	Finding common structured patterns in linear graphs. Theor. Comput. Sci. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2010	—	`conf`	Proper Alignment of MS/MS Spectra from Unsequenced Species. BIOCOMP Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier
2010	C	`conf`	Revisiting the Minimum Breakpoint Linearization Problem. TAMC Laurent Bulteau, Guillaume Fertin, Irena Rusu
2010	J	`jnl`	Sorting by Transpositions is Difficult CoRR Laurent Bulteau, Guillaume Fertin, Irena Rusu
2009	—	`book`	Combinatorics of Genome Rearrangements. Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette
2009	—	`conf`	Comparing Bacterial Genomes by Searching Their Common Intervals. BICoB Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu
2009	—	`conf`	Comparison of Spectra in Unsequenced Species. BSB Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier
2009	J	`jnl`	Finding occurrences of protein complexes in protein-protein interaction graphs. J. Discrete Algorithms Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2009	B	`conf`	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC Laurent Bulteau, Guillaume Fertin, Irena Rusu
2009	B	`conf`	Maximum Motif Problem in Vertex-Colored Graphs. CPM Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2009	Misc	`conf`	On Finding Small 2-Generating Sets. COCOON Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette
2009	J	`jnl`	On the Approximability of Comparing Genomes with Duplicates. J. Graph Algorithms Appl. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2009	J	`jnl`	On the S-Labeling problem. Electron. Notes Discret. Math. Guillaume Fertin, Stéphane Vialette
2009	—	`conf`	Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette
2009	B	`conf`	The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. WALCOM Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette
2008	J	`jnl`	Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Inf. Process. Lett. Guillaume Fertin, André Raspaud
2008	J	`jnl`	Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. J. Comput. Biol. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2008	J	`jnl`	Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. J. Discrete Algorithms Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2008	J	`jnl`	On the Approximability of Comparing Genomes with Duplicates CoRR Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2008	B	`conf`	On the Approximability of Comparing Genomes with Duplicates. WALCOM Sébastien Angibaud, Guillaume Fertin, Irena Rusu
2007	J	`jnl`	A Pseudo-Boolean Framework for Computing Rearrangement Distances between Genomes with Duplicates. J. Comput. Biol. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
2007	—	`conf`	A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
2007	B	`conf`	Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
2007	J	`jnl`	Comparing Genomes with Duplications: A Computational Complexity Point of View. IEEE ACM Trans. Comput. Biol. Bioinform. Guillaume Blin, Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2007	—	`conf`	Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. BSB Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette
2007	J	`jnl`	Exemplar Longest Common Subsequence. IEEE ACM Trans. Comput. Biol. Bioinform. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, Stéphane Vialette
2007	—	`conf`	Extending the Hardness of RNA Secondary Structure Comparison. ESCAPE Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet
2007	J	`jnl`	Extracting constrained 2-interval subsets in 2-interval sets. Theor. Comput. Sci. Guillaume Blin, Guillaume Fertin, Stéphane Vialette
2007	J	`jnl`	L(p, q) labeling of d-dimensional grids. Discret. Math. Guillaume Fertin, André Raspaud
2007	A*	`conf`	Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. ICALP Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2007	—	`conf`	Weak pattern matching in colored graphs: Minimizing the number of connected components. ICTCS Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2006	Misc	`conf`	Exemplar Longest Common Subsequence. International Conference on Computational Science (2) Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
2006	Misc	`conf`	Genomes Containing Duplicates Are Hard to Compare. International Conference on Computational Science (2) Cédric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2006	—	`conf`	How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. Comparative Genomics Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
2005	J	`jnl`	Edge-disjoint spanners in Cartesian products of graphs. Discret. Math. Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2005	B	`conf`	Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2005	B	`conf`	Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. WG Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
2005	—	`conf`	Genes Order and Phylogenetic Reconstruction: Application to Comparative Genomics Guillaume Blin, Cédric Chauve, Guillaume Fertin
2005	Misc	`conf`	What Makes the Arc-Preserving Subsequence Problem Hard? International Conference on Computational Science (2) Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2005	J	`jnl`	What Makes the Arc-Preserving Subsequence Problem Hard? Trans. Comp. Sys. Biology Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
2004	J	`jnl`	A survey on Knödel graphs. Discret. Appl. Math. Guillaume Fertin, André Raspaud
2004	B	`conf`	New Results for the 2-Interval Pattern Problem. CPM Guillaume Blin, Guillaume Fertin, Stéphane Vialette
2004	B	`conf`	No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. SIROCCO Guillaume Fertin, André Raspaud, Ondrej Sýkora
2004	J	`jnl`	On maximal instances for the original syntenic distance. Theor. Comput. Sci. Cédric Chauve, Guillaume Fertin
2004	J	`jnl`	Star coloring of graphs. J. Graph Theory Guillaume Fertin, André Raspaud, Bruce A. Reed
2003	J	`jnl`	Acyclic and k-distance coloring of the grid. Inf. Process. Lett. Guillaume Fertin, Emmanuel Godard, André Raspaud
2003	J	`jnl`	Factor Discret. Math. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
2003	J	`jnl`	On the oriented chromatic number of grids. Inf. Process. Lett. Guillaume Fertin, André Raspaud, Arup Roychowdhury
2003	B	`conf`	Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. SIROCCO Francesc Comellas, Guillaume Fertin, André Raspaud
2002	J	`jnl`	Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. Guillaume Fertin, Emmanuel Godard, André Raspaud
2001	J	`jnl`	Neighborhood Communications in Networks. Electron. Notes Discret. Math. Guillaume Fertin, André Raspaud
2001	B	`conf`	On Star Coloring of Graphs. WG Guillaume Fertin, André Raspaud, Bruce A. Reed
2001	J	`jnl`	Routing permutations and 2-1 routing requests in the hypercube. Discret. Appl. Math. Olivier Baudon, Guillaume Fertin, Ivan Havel
2001	B	`conf`	k-Neighborhood Broadcasting. SIROCCO Guillaume Fertin, André Raspaud
2000	J	`jnl`	A study of minimum gossip graphs. Discret. Math. Guillaume Fertin
2000	J	`jnl`	Compounding of gossip graphs. Networks Guillaume Fertin, Roger Labahn
2000	B	`conf`	Diameter of the Knödel Graph. WG Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
2000	J	`jnl`	Hierarchical broadcast and gossip networks. Inf. Process. Lett. Guillaume Fertin
2000	J	`jnl`	On the structure of minimum broadcast digraphs. Theor. Comput. Sci. Guillaume Fertin
2000	J	`jnl`	Recognizing Recursive Circulant Graphs (Extended Abstract). Electron. Notes Discret. Math. Guillaume Fertin, André Raspaud
1999	B	`conf`	Routing Permutations in the Hypercube. WG Olivier Baudon, Guillaume Fertin, Ivan Havel
1999	B	`conf`	Trade-Offs for Add Gossiping. SIROCCO Guillaume Fertin
1998	B	`conf`	Families of Graphs Having Broadcasting and Gossiping Properties. WG Guillaume Fertin, André Raspaud