Graphs & Applications
Publications of Guillaume FERTIN
(bibtex format)
Copyrights for some of the papers below have been
transfered, or will be transfered to various publishers of journals,
conferences proceedings, etc. For such papers I am required to post the
following notice: This material is presented to ensure timely dissemination
of scholarly and technical work. Copyright and all rights therein are
retained by authors or by other copyright holders. All persons copying
this information are expected to adhere to the terms and constraints
invoked by each author's copyright. Publisher's copyright policy
are available at
© SIAM,
© ACM,
© IEEE,
© Springer,
© Elsevier,
© Ideal,
© King's College.
[
2004 |
2003 |
2002 |
2001 |
2000 |
1999 |
1998 |
1995]
2004
- C. Chauve and G. Fertin. On maximal instances for the original syntenic distance. Theoretical Computer Science, 326:29-43, 2004.
- G. Blin, G. Fertin, and S. Vialette. New results for the 2-interval problem. In Proc. Fifteenth Annual Combinatorial Pattern Matching Symposium (CPM 2004), volume 3109 of Lecture Notes in Computer Science, pages 311-322. Springer-Verlag, 2004.
- G. Fertin, A. Raspaud, and O. Sýkora. No-hole L(p,0) labelling of grids, tori and hypercubes. In Proc. 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO '04), volume 3104 of Lecture Notes in Computer Science, pages 138-148. Springer-Verlag, 2004.
- G. Fertin, A. Raspaud, and O. Sýkora. No-hole L(p,0) labelings. In 6èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel '04). INRIA, 2004. To appear.
- G. Blin, G. Fertin, R. Rizzi, and S. Vialette. Pattern matching in arc-annotated sequences: New results for the APS problem. Technical report, LINA, Université de Nantes, 2004. Submitted for publication.
- G. Fertin, A. Raspaud, and B. Reed. On star coloring of graphs. Journal of Graph Theory, 47(3):163-182, 2004.
- G. Fertin and A. Raspaud. L(p,q) labeling of d-dimensional grids. Discrete Mathematics, 2004. To appear.
- G. Blin, C. Chauve, and G. Fertin. The breakpoint distance for signed sequences. In Proc. 1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks(CompBioNets 2004). King's College London, 2004. To appear.
- F. Comellas, G. Fertin, and A. Raspaud. Recursive graphs with small-world scale-free properties. Physical Review E, Brief Notes, 69-037104, 2004.
2003
- C. Chauve and G. Fertin. On maximal instances for the original syntenic distance. In Proc. 2nd European Conference on Computational Biology (ECCB 2003) - Short Papers and Posters, pages 285-286. INRIA, 2003.
- G. Blin, G. Fertin, and S. Vialette. A polynomial algorithm for the 2-interval pattern problem. In Poster session of the 3rd Workshop on Algorithms in Bioinformatics (WABI 2003), 2003.
- G. Blin, G. Fertin, I. Rusu, and C. Sinoquet. RNA sequences and the EDIT(NESTED,NESTED) problem. Research Report RR-IRIN-03.07, IRIN, Université de Nantes, 2003. Submitted for publication.
- G. Fertin, A. Raspaud, and A. Roychowdhury. On the oriented chromatic number of grids. Information Processing Letters, 85(5):261-266, 2003.
- G. Fertin and A. Raspaud. A survey on Knödel graphs. Discrete Applied Mathematics, 137(2):173-195, 2003.
- G. Fertin and A. Raspaud. L(p,q) labeling of d-dimensional grids. In Proc. Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB'03), 2003.
- G. Fertin, A.L. Liestman, T.C. Shermer, and L. Stacho. Edge-disjoint spanners in cartesian products of graphs. Technical report, Simon Fraser University, Vancouver, Canada, 2003. Submitted for publication.
- G. Fertin, E. Godard, and A. Raspaud. Acyclic and k-distance coloring of the grid. Information Processing Letters, 87(1):51-58, 2003.
- F. Comellas, G. Fertin, and A. Raspaud. Vertex labeling and routing in recursive clique-trees, a new family of small-world scale-free graphs. In Proc. 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO '03), volume 17 of Proceedings in Informatics, pages 73-87. Carleton Scientific, 2003.
- N. Alon, G. Fertin, A.L. Liestman, T.C. Shermer, and L. Stacho. Factor d-domatic colorings of graphs. Discrete Mathematics, 262(1-3):17-25, 2003.
2002
- G. Fertin, E. Godard, and A. Raspaud. Minimum feedback vertex set and acyclic coloring. Information Processing Letters, 84(3):131-139, 2002.
- G. Fertin, E. Godard, and A. Raspaud. Conversion de longueur d'onde dans les réseaux optiques - facteur d'optimalité \frac53. In 4èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel '02), pages 33-39. INRIA, 2002.
2001
- G. Fertin, A. Raspaud, and B. Reed. On star coloring of graphs. In 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), volume 2204 of Lecture Notes in Computer Science, pages 140-153. Springer-Verlag, 2001.
- G. Fertin and A. Raspaud. Neighborhood communications in networks. In Proc. Euroconference on Combinatorics, Graph Theory and Applications (COMB'01), Electronic Notes on Discrete Mathematics, 2001.
- G. Fertin and A. Raspaud. k-neighborhood broadcasting. In 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), volume 11 of Proceedings in Informatics, pages 133-146. Carleton Scientific, 2001.
- O. Baudon, G. Fertin, and I. Havel. Routing permutations and 2-1 routing requests in the hypercube. Discrete Applied Mathematics, 113(1):43-58, 2001.
2000
- G. Fertin, A. Raspaud, O. Sýkora, H. Schröder, and I. Vrto. Diameter of Knödel graph. In 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), volume 1928 of Lecture Notes in Computer Science, pages 149-160. Springer-Verlag, 2000.
- G. Fertin and A. Raspaud. Recognizing recursive circulant graphs G(cd^m,d). Research Report RR-1235-00, LaBRI, Université Bordeaux 1, 2000.
- G. Fertin and A. Raspaud. Recognizing recursive circulant graphs. In 6th International Conference on Graph Theory (ICGT 2000), volume 5 of Electronic Notes on Discrete Mathematics, 2000.
- G. Fertin and A. Raspaud. Gossiping in directed graphs. In 9th International Conference on Fibonacci Numbers and their Applications, 2000.
- G. Fertin and R. Labahn. Compounding of gossip graphs. Networks, 36(2):126-137, 2000.
- G. Fertin. A study of minimum gossip graphs. Discrete Mathematics, 215(1-3):33-57, 2000.
- G. Fertin. On the structure of minimum broadcast digraphs. Theoretical Computer Science, 245(2):203-216, 2000.
- G. Fertin. Hierarchical broadcast and gossip networks. Information Processing Letters, 73(3-4):131-136, 2000.
1999
- G. Fertin and A. Raspaud. Minimum gossip digraphs. Research Report RR-1223-99, LaBRI, Université Bordeaux 1, 1999.
- G. Fertin. Trade-offs for odd gossiping. Research Report RR-1216-99, LaBRI, Université Bordeaux 1, 1999. Submitted for publication.
- G. Fertin. Trade-offs for odd gossiping. In 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO '99), volume 6 of Proceedings in Informatics, pages 137-151. Carleton Scientific, 1999.
- G. Fertin. Étude des communications dans les réseaux d'interconnexion. PhD thesis, Université Bordeaux I, 1999.
- G. Fertin. Compromis pour l'échange total impair. In 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel '99), pages 47-52. INRIA, 1999.
- O. Baudon, G. Fertin, and I. Havel. Routing permutations in the hypercube. In 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '99), volume 1665 of Lecture Notes in Computer Science, pages 179-190. Springer-Verlag, 1999.
1998
- G. Fertin and A. Raspaud. Families of graphs having broadcasting and gossiping properties. In 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98), volume 1517 of Lecture Notes in Computer Science, pages 63-77. Springer-Verlag, 1998.
- G. Fertin and J.G. Peters. Optimal odd gossiping. Research Report CMPT TR 1998-24, Simon Fraser University, Burnaby, B.C., 1998. Submitted for publication.
- G. Fertin and J.G. Peters. Odd gossiping in the linear cost model. In Workshop on Communication - 23rd Int. Symp. on Mathematical Foundations of Computer Science (MFCS '98), 1998.
1995
- G. Fertin. Etude des graphes minimaux pour l'échange total. Master's thesis, DEA Informatique, Université Bordeaux 1, 1995.
10 janvier 2008 (43)
[home page of the team]