The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Guillaume Fertin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guillaume Blin, Guillaume Fertin, Stéphane Vialette
    New Results for the 2-Interval Pattern Problem. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:311-322 [Conf]
  2. Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    What Makes the Arc-Preserving Subsequence Problem Hard? [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:860-868 [Conf]
  3. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
    Exemplar Longest Common Subsequence. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:622-629 [Conf]
  4. Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    Genomes Containing Duplicates Are Hard to Compare. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2006, pp:783-790 [Conf]
  5. Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:328-339 [Conf]
  6. Guillaume Blin, Cedric Chauve, Guillaume Fertin
    Genes Order and Phylogenetic Reconstruction: Application to gamma-Proteobacteria. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2005, pp:11-20 [Conf]
  7. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette
    How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2006, pp:75-86 [Conf]
  8. Guillaume Fertin
    Trade-Offs for Add Gossiping. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:137-152 [Conf]
  9. Guillaume Fertin, André Raspaud
    k-Neighborhood Broadcasting. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:133-146 [Conf]
  10. Guillaume Fertin, André Raspaud, Ondrej Sýkora
    No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:138-148 [Conf]
  11. Francesc Comellas, Guillaume Fertin, André Raspaud
    Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:73-87 [Conf]
  12. Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
    Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:271-282 [Conf]
  13. Olivier Baudon, Guillaume Fertin, Ivan Havel
    Routing Permutations in the Hypercube. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:179-190 [Conf]
  14. Guillaume Fertin, André Raspaud
    Families of Graphs Having Broadcasting and Gossiping Properties. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:63-77 [Conf]
  15. Guillaume Fertin, André Raspaud, Bruce A. Reed
    On Star Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:140-153 [Conf]
  16. Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Diameter of the Knödel Graph. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:149-160 [Conf]
  17. Olivier Baudon, Guillaume Fertin, Ivan Havel
    Routing permutations and 2-1 routing requests in the hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:1, pp:43-58 [Journal]
  18. Guillaume Fertin, André Raspaud
    A survey on Knödel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:2, pp:173-195 [Journal]
  19. Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
    Factor d-domatic colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:17-25 [Journal]
  20. Guillaume Fertin
    A study of minimum gossip graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:215, n:, pp:33-57 [Journal]
  21. Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho
    Edge-disjoint spanners in Cartesian products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:296, n:2-3, pp:167-186 [Journal]
  22. Guillaume Fertin
    Hierarchical broadcast and gossip networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:3-4, pp:131-136 [Journal]
  23. Guillaume Fertin, Emmanuel Godard, André Raspaud
    Minimum feedback vertex set and acyclic coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:131-139 [Journal]
  24. Guillaume Fertin, Emmanuel Godard, André Raspaud
    Acyclic and k-distance coloring of the grid. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:51-58 [Journal]
  25. Guillaume Fertin, André Raspaud, Arup Roychowdhury
    On the oriented chromatic number of grids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:5, pp:261-266 [Journal]
  26. Guillaume Fertin, Roger Labahn
    Compounding of gossip graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:126-137 [Journal]
  27. Cedric Chauve, Guillaume Fertin
    On maximal instances for the original syntenic distance. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:29-43 [Journal]
  28. Guillaume Fertin
    On the structure of minimum broadcast digraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:2, pp:203-216 [Journal]
  29. Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette
    What Makes the Arc-Preserving Subsequence Problem Hard? [Citation Graph (0, 0)][DBLP]
    T. Comp. Sys. Biology, 2005, v:2, n:, pp:1-36 [Journal]
  30. Guillaume Fertin, André Raspaud, Bruce A. Reed
    Star coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:163-182 [Journal]
  31. Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette
    Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:241-252 [Conf]
  32. Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette
    Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:340-351 [Conf]
  33. Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette
    A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. [Citation Graph (0, 0)][DBLP]
    RECOMB-CG, 2007, pp:16-29 [Conf]
  34. Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette
    Comparing RNA Structures: Towards an Intermediate Model Between the Editand the LapcsProblems. [Citation Graph (0, 0)][DBLP]
    BSB, 2007, pp:101-112 [Conf]
  35. Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet
    Extending the Hardness of RNA Secondary Structure Comparison. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:140-151 [Conf]
  36. Guillaume Fertin, André Raspaud
    L(p, q) labeling of d-dimensional grids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2132-2140 [Journal]
  37. Guillaume Blin, Guillaume Fertin, Stéphane Vialette
    Extracting constrained 2-interval subsets in 2-interval sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:241-263 [Journal]

  38. On Finding Small 2-Generating Sets. [Citation Graph (, )][DBLP]


  39. Maximum Motif Problem in Vertex-Colored Graphs. [Citation Graph (, )][DBLP]


  40. Weak pattern matching in colored graphs: Minimizing the number of connected components. [Citation Graph (, )][DBLP]


  41. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. [Citation Graph (, )][DBLP]


  42. Pseudo Boolean Programming for Partially Ordered Genomes. [Citation Graph (, )][DBLP]


  43. Revisiting the Minimum Breakpoint Linearization Problem. [Citation Graph (, )][DBLP]


  44. Comparison of Spectra in Unsequenced Species. [Citation Graph (, )][DBLP]


  45. The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. [Citation Graph (, )][DBLP]


  46. On the Approximability of Comparing Genomes with Duplicates. [Citation Graph (, )][DBLP]


  47. Comparing Bacterial Genomes by Searching Their Common Intervals. [Citation Graph (, )][DBLP]


  48. On the Approximability of Comparing Genomes with Duplicates [Citation Graph (, )][DBLP]


Search in 0.920secs, Finished in 0.923secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002