Service:

• Associate Editor for BMC Bioinfomratics

• International Conferences
  • GIW 2012
  • WABI 2012
  • ISBRA 2012, 2011, 2010, 2009
  • IEEE ICCABS 2012, 2011, 2010
  • RECOMB Comparative Genomics 2010, 2009, 2008
• National Conferences
  • JOBIM 2009, 2006
  • JGA 2012, 2011
• Organizing Committee
  • RECOMB Comparative Genomics 2008
  • JOBIM 2009

Publications:

• DBLP
• Microsoft Research Gate
• Google Scholar

• Books and Book Chapters
  • Combinatorics of Genome Rearrangements
    Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier and Stéphane Vialette.
    MIT Press, August 2009.
    312 pp., 44 illus.
    ISBN-10:0-262-06282-8
    ISBN-13:978-0-262-06282-4
    

  • Computing Genomic Distances: An Algorihtmic Viewpoint
    Guillaume Fertin and Irena Rusu.
    In: Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications
    Wiley Science, Chapter 34, pp. 773-798, 2011.
    ISBN 978-0-470-50519-9
    

  ---

• International Journal Papers
  • Tractability and approximability of maximal strip recovery
    Laurent Bulteau, Guillaume Fertin, Minghui Jiang and Irena Rusu.
    Theoretical Computer Science, to appear.

  • Sorting by Transpositions is Difficult
    Laurent Bulteau, Guillaume Fertin and Irena Rusu.
    SIAM J. Discrete Mathematics, to appear.

  • Upper and lower bounds for finding connected motifs in vertex-colored graphs
    Michael Fellows, Guillaume Fertin, Danny Hermelin and Stéphane Vialette.
    Journal of Computer and System Sciences 77(4), pp 799-811, 2011. pdf

  • Complexity issues in Vertex-Colored Graph Pattern Matching
    Riccardo Dondi, Guillaume Fertin and Stéphane Vialette.
    Journal of Discrete Algorithms. 9(1), pp 82-99, 2011. pdf

  • Finding Common Structured Patterns in Linear Graphs
    Guillaume Fertin, Danny Hermelin, Romeo Rizzi and Stéphane Vialette.
    Theoretical Computer Science. 411(26-28), pp. 2475-2486, 2010. pdf

  • Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs
    Guillaume Fertin, Romeo Rizzi and Stéphane Vialette.
    Journal of Discrete Algorithms, 7(1), pp. 90-101, 2009. pdf ps

  • On the Approximability of Comparing Genomes with Duplicates
    Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin and Stéphane Vialette
    Journal of Graph Algorithms and Applications. 13(1), pp. 19-53, 2009. pdf ps

  • Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints
    Guillaume Blin, Guillaume Fertin, Danny Hermelin and Stéphane Vialette
    Journal of Discrete Algorithms, 6(4), pp. 618-626, 2008. pdf ps

  • 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 and Stéphane Vialette
    Journal of Computational Biology, 15(8), pp. 1093-1115, 2008. pdf ps

  • Extracting Constrained 2-Interval Subsets in 2-Interval Sets
    Guillaume Blin, Guillaume Fertin and Stéphane Vialette
    Theoretical Computer Science, 385(1-3), pp. 241-263, 2007. pdf ps

  • Comparing Genomes with Duplications: a Computational Complexity Point of View
    Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi and Stéphane Vialette
    ACM/IEEE Trans. Computational Biology and Bioinformatics, 4(4), pp. 523-534, 2007. pdf ps

  • Exemplar Longest Common Subsequence
    Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin and Stéphane Vialette
    ACM/IEEE Trans. Computational Biology and Bioinformatics, 4(4), pp. 535-543, 2007. pdf ps

  • A General Framework for Computing Rearrangement Distances between Genomes with Duplicates
    Sébastien Angibaud, Guillaume Fertin, Irena Rusu and Stéphane Vialette
    Journal of Computational Biology. 14(4), pp. 379-393, 2007. pdf ps

  • What makes the Arc-Preserving Subsequence problem hard ?
    Guillaume Blin, Guillaume Fertin, Romeo Rizzi and Stéphane Vialette
    LNCS Transactions on Computational Systems Biology. 2, pp. 1-36, 2005. pdf ps

  • On Maximal Instances for the Original Syntenic Distance
    Cedric Chauve and Guillaume Fertin
    Theoretical Computer Science, 326, pp. 29-43, 2004. pdf ps

  ---

• International Conferences
  • Algorithms for subnetwork mining in heterogeneous networks
    Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu.
    In Proc. 11th Symposium on Experimental Algorithms (SEA 2012), Bordeaux, France. LNCS Vol. 7276, pp 184-194. pdf
    

  • Algorithmic Aspects of Heterogeneous Biological Networks Comparison
    Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora and Stéphane Vialette.
    In Proc. 5th International Conference on Combinatorial Optimization and Applications (COCOA 2011), Zhangjiajie, China. LNCS Vol. 6831, pp 272-286. pdf
    

  • Sorting by Transpositions is Difficult
    Laurent Bulteau, Guillaume Fertin, Irena Rusu.
    In Proc. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Zürich, Switzerland. LNCS Vol. 6755, pp 654-665. pdf
    A long version of the paper is available on arxiv.

  • Tractability and Approximability of Maximal Strip Recovery
    Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu.
    In Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Palermo, Italy. LNCS Vol. 6661, pp 336-349. pdf

  • Finding Approximate and Constrained Motifs in Graphs
    Riccardo Dondi, Guillaume Fertin, Stéphane Vialette.
    In Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), Palermo, Italy. LNCS Vol. 6661, pp 388-401. pdf

  • Integration of omics data to investigate common intervals
    Sébastien Angibaud, Philippe Bordron, Damien Eveillard, Guillaume Fertin, Irena Rusu.
    In Proc. 1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), Singapore. IEEE, pp. 101-105. pdf

  • Revisiting the Minimum Breakpoint Linearization Problem
    Laurent Bulteau, Guillaume Fertin, Irena Rusu.
    In Proc. 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Prague, Czech Republic. LNCS Vol. 6108, pp 163-174. pdf

  • Proper Alignment of MS/MS Spectra from Unsequenced Species
    Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier.
    In Proc. 11th International Conference on Bioinformatics and Computational Biology (BIOCOMP 2010), Las Vegas, USA. CSREA Press, pp. 766-772. pdf

  • Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
    Laurent Bulteau, Guillaume Fertin, Irena Rusu.
    In Proc. 20th International Symposium on Algorithms and Computation (ISAAC 2009), Hawaii, USA. LNBI Vol. 5878, pp 710-719. pdf

  • Pseudo-Boolean Programming for Partially Ordered Genomes
    Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin and Stéphane Vialette.
    In Proc. 7th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2009), Budapest, Hungary. LNBI Vol. 5817, pp 126-137. pdf

  • Comparison of Spectra in Unsequenced Species
    Freddy Cliquet, Guillaume Fertin, Irena Rusu and Dominique Tessier.
    In Proc. 4th Brazilian Symposium on Bioinformatics (BSB 2009), Porto Alegre, Brazil. LNBI Vol. 5576, pp 24-35. pdf

  • Maximum Motif Problem in Vertex-Colored Graphs
    Riccardo Dondi, Guillaume Fertin and Stéphane Vialette.
    In Proc. 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), Lille, France. LNCS Vol. 5577, pp 221-235. pdf

  • Comparing Bacterial Genomes by Searching their Common Intervals
    Sébastien Angibaud, Damien Eveillard, Guillaume Fertin and Irena Rusu.
    In Proc. 1st International Conference on Bioinformatics and Computational Biology (BICoB 2009), New Orleans, USA. LNBI Vol. 5462, pp 102-113. pdf

  • The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated
    Guillaume Blin, Guillaume Fertin, Florian Sikora and Stéphane Vialette.
    In Proc. 3rd Workshop on Algorithms and Computation (WALCOM 2009), Kolkata, India. LNCS Vol. 5431, pp 357-368. pdf ps

  • On the Approximability of Comparing Genomes with Duplicates
    Sébastien Angibaud, Guillaume Fertin and Irena Rusu.
    In Proc. 2nd Workshop on Algorithms and Computation (WALCOM 2008), Dhaka, Bangladesh. LNCS Vol. 4921, pp 34-45. pdf ps

  • 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 and Stéphane Vialette.
    In Proc. 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), San Diego, USA. LNBI Vol. 4751, pp 16-29. pdf ps

  • Weak pattern matching in colored graphs: Minimizing the number of connected components
    Riccardo Dondi, Guillaume Fertin and Stéphane Vialette.
    In Proc. 10th Italian Conference on Theoretical Computer Science (ICTCS 2007), Roma, Italy. World-Scientific Conference Proceedings, pp 27-38. pdf ps

  • Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems
    Guillaume Blin, Guillaume Fertin, Gaël Herry and Stéphane Vialette.
    In Proc. Brazilian Symposium on Bioinformatics (BSB 2007), Angra dos Reis, Brazil. LNBI Vol. 4643, pp 101-112. pdf ps

  • Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
    Michael Fellows, Guillaume Fertin, Danny Hermelin and Stéphane Vialette.
    In Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Wroclaw, Poland. LNCS Vol.4596, pp 340-351. pdf ps

  • Common Structured Patterns in Linear Graphs: Approximations and Combinatorics
    Guillaume Fertin, Danny Hermelin, Romeo Rizzi and Stéphane Vialette.
    In Proc. 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), London (Ontario), July 2007. LNCS Vol.4580, pp 214-252. pdf ps

  • Extending the Hardness of RNA Secondary Structure Comparison
    Guillaume Blin, Guillaume Fertin, Irena Rusu and Christine Sinoquet.
    In Proc. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Hangzhou, April 2007. LNCS Vol. 4614, pp 140-151. pdf ps

  • How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation
    Sébastien Angibaud, Guillaume Fertin, Irena Rusu and Stéphane Vialette.
    In Proc. 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), Montreal, September 2006. LNBI Vol.4205, pp 75-86. pdf ps

  • Genomes containing Duplicates are Hard to compare (extended abstract)
    Cedric Chauve, Guillaume Fertin, Romeo Rizzi and Stéphane Vialette.
    In Proc. 2006 International Workshop on Bioinformatics Research and Applications (IWBRA 2006), Reading, May 2006. LNCS Vol.3992, pp 783-790. pdf ps

  • Exemplar Longest Common Subsequence (extended abstract)
    Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin and Stéphane Vialette.
    In Proc. 2006 International Workshop on Bioinformatics Research and Applications (IWBRA 2006), Reading, May 2006. LNCS Vol. 3992, pp 622-629. pdf ps

  • Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria
    Guillaume Blin, Guillaume Fertin and Cedric Chauve.
    In Proc. 3rd RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2005), Dublin, Ireland, September 2005. LNBI Vol. 3678, pp 11-20. pdf ps

  • Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs
    Guillaume Fertin, Romeo Rizzi and Stéphane Vialette.
    In Proc. 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), Gdansk, August 2005. LNCS Vol. 3618, pp 328-339. pdf ps

  • What makes the Arc-Preserving Subsequence problem hard ? (extended abstract)
    Guillaume Blin, Guillaume Fertin, Romeo Rizzi and Stéphane Vialette.
    In Proc. 2005 International Workshop on Bioinformatics Research and Applications (IWBRA 2005), Atlanta, May 2005. LNCS Vol. 3515, pp 860-868. pdf ps

  • Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
    Guillaume Blin, Guillaume Fertin, Danny Hermelin and Stéphane Vialette.
    In Proc. 31st International Workshop International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), Metz, June 2005. LNCS Vol. 3787, pp 271-282. pdf ps

  • The breakpoint distance for signed sequences
    Guillaume Blin, Guillaume Fertin and Cedric Chauve.
    In Proc. 1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets 2004), Recife, December 2004. Vol. 3 of Texts in Algorithms, pp 3-16, KCL publications, King's College, London, 2004. pdf ps

  • New results for the 2-interval pattern problem
    Guillaume Blin, Guillaume Fertin and Stéphane Vialette.
    In Proc. Fifteenth Annual Combinatorial Pattern Matching Symposium (CPM 2004), Istanbul, July 2004. LNCS Vol. 3109, pp. 311-322. pdf ps

  ---

• French Conference
  • Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem
    Guillaume Blin, Guillaume Fertin, Romeo Rizzi and Stéphane Vialette.
    In Proc. 5èmes Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2004), Montreal, June 2004. pdf ps

• International Journal Papers
  • Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough
    Guillaume Fertin and André Raspaud.
    Information Processing Letters, 105 (2), pp.65-72, 2008. pdf ps

  • L(p,q) Labeling of d-Dimensional Grids
    Guillaume Fertin and André Raspaud.
    Discrete Mathematics 307 (16), pp.2132-2140, 2007. pdf ps

  • New Bounds for the L(h,k) Number of Regular Grids
    Tiziana Calamoneri and Saverio Caminiti and Guillaume Fertin.
    International Journal of Mobile Network Design and Innovation 1(2), pp 92-101, 2006. pdf ps

  • Star Coloring of Graphs
    Guillaume Fertin, André Raspaud and Bruce Reed.
    Journal of Graph Theory, 47 (3), pp.163-182, 2004. pdf ps

  • On the Oriented Chromatic Number of Grids
    Guillaume Fertin, André Raspaud and Arup Roychowdhury.
    Information Processing Letters, 85 (5), pp. 216-266, 2003. pdf ps

  • Acyclic and k-distance Coloring of the Grid
    Guillaume Fertin, Emmanuel Godard and André Raspaud.
    Information Processing Letters, 87 (1), pp. 51-58, 2003. pdf ps

  • Factor d-Domatic Colorings of Graphs
    Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer and Ladislav Stacho.
    Discrete Mathematics, 262 (1-3), pp. 17-25, 2003. pdf ps

  • Minimum Feedback Vertex Set and Acyclic Coloring
    Guillaume Fertin, Emmanuel Godard and André Raspaud.
    Information Processing Letters, 84 (3), pp. 131-139, 2002. pdf ps

  ---

• International Conferences
  • On the S-labeling Problem
    Guillaume Fertin and Stéphane Vialette.
    In Proc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), Bordeaux, September 2009.
    Electronic Notes on Discrete Mathematics, Vol. 34, pp. 273-277, 2009. pdf

  • Acyclic coloring of graphs with maximum degree Delta
    Guillaume Fertin and André Raspaud.
    In Proc. 3rd Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2005), Berlin, September 2005.
    Discrete Mathematics and Theoretical Computer Science, DMTCS Conference Volume AE (2005), pp. 389-396. pdf ps

  • No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes
    Guillaume Fertin, André Raspaud and Ondrej Sykora.
    In Proc. 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), Smolenice Castle, Slovakia, June 2004. LNCS Vol. 3104, pp. 138-148. pdf ps

  • L(p,q) Labeling of d-Dimensional Grids
    Guillaume Fertin and André Raspaud.
    In Proc. 2nd Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB'03), Prague, September 2003. pdf ps

  • On Star Coloring of Graphs
    Guillaume Fertin, André Raspaud and Bruce Reed.
    In Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), Boltenhagen, Germany, June 2001. LNCS Vol. 2204, pp. 140-153. pdf ps

  ---

• French Conferences
  • No-Hole L(p,0) Labelings
    Guillaume Fertin, André Raspaud and Ondrej Sykora.
    In Proc. 6èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL 2004), Batz-sur-Mer, Mai 2004. Proceedings INRIA, pp 33-37. pdf ps

• International Journal Papers
  • Edge-Disjoint Spanners in Cartesian products of graphs
    Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer and Ladislav Stacho.
    Discrete Mathematics, 167 (2-3) pp 167-186, 2005. pdf ps

  • A Survey on Knödel Graphs
    Guillaume Fertin and André Raspaud.
    Discrete Applied Mathematics, 137 (2) pp 173-195, 2004. pdf ps

  • Compounding of Gossip Graphs
    Guillaume Fertin and Roger Labahn.
    Networks 36 (2), pp. 126-137, 2000. pdf ps

  • Hierarchical Broadcast and Gossip Networks.
    Guillaume Fertin.
    Information Processing Letters 73 (3-4), pp. 131-136, 2000. pdf ps

  • A study of Minimum Gossip Graphs.
    Guillaume Fertin.
    Discrete Mathematics 215 (1-3), pp. 33-57, 2000. pdf ps

  • On the Structure of Minimum Broadcast Digraphs.
    Guillaume Fertin.
    Theoretical Computer Science 245 (2), pp. 203-216, 2000. pdf ps

  ---

• International Conferences
  • Neighborhood Communications in Networks
    Guillaume Fertin and André Raspaud.
    In Proc. Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB'01), Barcelona, Spain, September 2001. Electronic Notes on Discrete Mathematics, VOL. 10. pdf ps

  • k-Neighborhood Broadcasting
    Guillaume Fertin and André Raspaud.
    In Proc. 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), Vall de Núria, Spain, June 2001. Vol. 11 of Proceedings in Informatics, Carleton Scientific, pp 133-146. pdf ps

  • Gossiping in Directed Graphs
    Guillaume Fertin and André Raspaud.
    In Proc. 9th International Conference on Fibonacci Numbers and their Applications, Luxemburg, July 2000. pdf ps

  • Diameter of Knödel Graph
    Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora and Imrich Vr'to.
    In Proc. 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), Konstanz, Germany, June 2000. LNCS Vol. 1928, pp 149-160. pdf ps

  • Trade-Offs for Odd Gossiping.
    Guillaume Fertin.
    In Proc. 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO'99), Lacanau, France, July 1999. Vol. 5 of Proceedings in Informatics, Carleton Scientific, pp 137-151. pdf ps

  • Odd Gossiping in the Linear-Cost Model
    Guillaume Fertin and Joseph G. Peters.
    In Proc. Workshop on Communications - 23rd Int. Symp. on Mathematical Foundations of Computer Science (MFCS '98), Brno, Czech Republic, August 1998. pdf ps

  • Families of Graphs Having Broadcasting and Gossiping Properties
    Guillaume Fertin and André Raspaud.
    In Proc. of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98), Smolenice Castle, Slovak Republic, June 1998. LNCS Vol. 1517, pp 63-77. pdf ps

  ---

• French Conferences
  • Compromis pour l'Echange Total Impair.
    Guillaume Fertin.
    In Proc. 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL'99), Roscoff, Mai 1999. Proceedings INRIA, ISBN 2-7261-1145-9, pp 47-52. pdf ps

  • Conversion de Longueur d'Onde dans les Réseaux Optiques (Facteur d'Optimalité 5/3).
    Guillaume Fertin, Emmanuel Godard and André Raspaud.
    In Proc. 4èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL 2002), Mèze, Mai 2002. Proceedings INRIA, ISBN 2-7261-1204-8, pp 33-39. pdf ps

  ---

• Research Reports
  • Trade-Offs for Odd Gossiping.
    Guillaume Fertin.
    Research Report 1216-99, LaBRI (2000). pdf ps

  • Minimum Gossip Digraphs
    Guillaume Fertin and André Raspaud.
    Research Report 1223-99, LaBRI (1999). pdf ps

  • Optimal Odd Gossiping
    Guillaume Fertin and Joseph G. Peters.
    Research Report CMPT1998-24, Simon Fraser University (Vancouver, Canada) (1998). pdf ps

• International Journal Papers
  • Vertex labeling and routing in expanded Apollonian networks
    Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, André Raspaud and Lili Rong.
    Journal of Physics A: Mathematical and Theoretical, 41(3)-035004, 2008. pdf ps

  • High dimensional Apollonian networks
    Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin and Lili Rong.
    Journal of Physics A: Mathematical and General, 39, pp 1811-1818, 2006. pdf ps

  • Recursive graphs with small-world scale-free properties
    Francesc Comellas, Guillaume Fertin and André Raspaud.
    Physical Review E, 69-037104, 2004. pdf ps

  • Routing Permutations and 2-1 Routing Requests in the Hypercube
    Olivier Baudon, Guillaume Fertin and Ivan Havel.
    Discrete Applied Mathematics 113 (1), pp. 43-58, 2001. pdf ps

  ---

• International Conferences
  • On Finding Small 2-Generating Sets
    Isabelle Fagnot, Guillaume Fertin and Stéphane Vialette.
    In Proc. 15th International Computing and Combinatorics Conference (COCOON 2009), Niagara Falls, USA, July 2009. LNCS Vol. 5609, pp 378-387. pdf

  • Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs
    Francesc Comellas, Guillaume Fertin and André Raspaud.
    In Proc. 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), Umeå, Sweden, June 2003. Vol. 17 of Proceedings in Informatics, Carleton Scientific, pp 73-87. pdf ps

  • Recognizing Recursive Circulant Graphs
    Guillaume Fertin and André Raspaud.
    In Proc. 6th International Conference on Graph Theory (ICGT 2000), Marseille, September 2000. Electronic Notes on Discrete Mathematics, VOL.5. pdf ps

  • Routing Permutations in the Hypercube
    Olivier Baudon, Guillaume Fertin and Ivan Havel.
    In Proc. 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '99), Ascona, Switzerland, June 1999. LNCS Vol. 1665, pp. 179-190. pdf ps

  ---

• Research Reports
  • Recognizing Recursive Circulant Graphs G(cd^m,d)
    Guillaume Fertin and André Raspaud.
    Research Report 1235-00, LaBRI (2000). pdf ps

  ---

• Master Thesis, PhD Thesis, "Habilitation à Diriger des Recherches"
  • Algorithmique et Optimisation Combinatoire: Applications aux Réseaux d'Interconnexion, à la Coloration de Graphes et à la Bio-Informatique.
    Guillaume Fertin.
    Habilitation à Diriger des Recherches, LINA, Université de Nantes, 2004. pdf ps

  • Etude des Communications dans les Réseaux d'Interconnexion.
    Guillaume Fertin.
    PhD Thesis, LaBRI, Université Bordeaux 1, 1999. pdf ps

  • Etude des Graphes Minimaux pour l'Echange Total.
    Guillaume Fertin.
    Master Thesis, LaBRI, Université Bordeaux 1, 1995. pdf ps