%------ 2004 --------------------------------------------------------- @TechReport{APSus, AUTHOR = {Blin, G. and Fertin, G. and Rizzi, R. and Vialette, S.}, TITLE = {Pattern Matching in Arc-Annotated Sequences: New Results for the {APS} Problem}, INSTITUTION = {LINA, Universit\'e de Nantes}, NOTE = {Submitted for publication}, YEAR = {2004} } @InProceedings{Nohole_algotel04, AUTHOR = {Fertin, G. and Raspaud, A. and S\'ykora, O.}, TITLE = {No-Hole ${L}(p,0)$ labelings}, BOOKTITLE = {6\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel '04)}, PUBLISHER = {INRIA}, YEAR = {2004}, NOTE = {To appear} } @InProceedings{GD, AUTHOR = {Blin, G. and Chauve, C. and Fertin, G.}, TITLE = {The breakpoint distance for signed sequences}, BOOKTITLE = {Proc. 1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks(CompBioNets 2004)}, PUBLISHER = {King's College London}, YEAR = {2004}, NOTE = {To appear} } @InProceedings{Nohole, AUTHOR = {Fertin, G. and Raspaud, A. and S\'ykora, O.}, TITLE = {No-Hole ${L}(p,0)$ labelling of Grids, Tori and Hypercubes}, BOOKTITLE = {Proc. 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO '04)}, PUBLISHER = {Springer-Verlag}, VOLUME = {3104 of Lecture Notes in Computer Science}, YEAR = {2004}, PAGES = {138-148} } @InProceedings{2int, AUTHOR = {Blin, G. and Fertin, G. and Vialette, S.}, TITLE = {New Results for the 2-Interval Problem}, BOOKTITLE = {Proc. Fifteenth Annual Combinatorial Pattern Matching Symposium (CPM 2004)}, PUBLISHER = {Springer-Verlag}, VOLUME = {3109 of Lecture Notes in Computer Science}, PAGES = {311-322}, YEAR = {2004} } @Article{Lpq-Journal, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {${L}(p,q)$ labeling of $d$-Dimensional Grids}, JOURNAL = {Discrete Mathematics}, YEAR = {2004}, NOTE = {To appear} } @Article{synteny, AUTHOR = {Chauve, C. and Fertin, G.}, TITLE = {On Maximal Instances for the Original Syntenic Distance}, JOURNAL = {Theoretical Computer Science}, VOLUME = {326}, PAGES = {29-43}, YEAR = {2004} } @Article{starJournal, AUTHOR = {Fertin, G. and Raspaud, A. and Reed, B.}, TITLE = {On Star Coloring of Graphs}, JOURNAL = {Journal of Graph Theory}, VOLUME = {47(3)}, PAGES = {163-182}, YEAR = {2004} } @Article{SFSW_PRE, AUTHOR = {Comellas, F. and Fertin, G. and Raspaud, A.}, TITLE = {Recursive graphs with small-world scale-free properties}, JOURNAL = {Physical Review E, Brief Notes}, VOLUME = {69-037104}, YEAR = {2004} } %------ 2003 --------------------------------------------------------- @Article{arup, AUTHOR = {Fertin, G. and Raspaud, A. and Roychowdhury, A.}, TITLE = {On the Oriented Chromatic Number of Grids}, JOURNAL = {Information Processing Letters}, VOLUME = {85(5)}, PAGES = {261-266}, YEAR = {2003} } @Article{domatic, AUTHOR = {Alon, N. and Fertin, G. and Liestman, A.L. and Shermer, T.C. and Stacho, L.}, JOURNAL = {Discrete Mathematics}, TITLE = {Factor $d$-Domatic Colorings of Graphs}, YEAR = {2003}, VOLUME = {262(1-3)}, PAGES = {17-25} } @TechReport{nested, AUTHOR = {Blin, G. and Fertin, G. and Rusu, I. and Sinoquet, C.}, TITLE = {{RNA} Sequences and the {EDIT(NESTED,NESTED)} Problem}, INSTITUTION = {IRIN, Universit\'e de Nantes}, YEAR = {2003}, TYPE = {{Research Report}}, NUMBER = {RR-IRIN-03.07}, NOTE = {Submitted for publication} } @TechReport{SpannersDM_submitted, AUTHOR = {Fertin, G. and Liestman, A.L. and Shermer, T.C. and Stacho, L.}, TITLE = {Edge-Disjoint Spanners in Cartesian Products of Graphs}, INSTITUTION = {Simon Fraser University, Vancouver, Canada}, NOTE = {Submitted for publication}, YEAR = {2003} } @InProceedings{Pvialette, AUTHOR = {Blin, G. and Fertin, G. and Vialette, S.}, TITLE = {A polynomial algorithm for the 2-interval pattern problem}, BOOKTITLE = {Poster session of the 3rd Workshop on Algorithms in Bioinformatics (WABI 2003)}, YEAR = {2003} } @InProceedings{Psynteny, AUTHOR = {Chauve, C. and Fertin, G.}, TITLE = {On maximal instances for the original syntenic distance}, BOOKTITLE = {Proc. 2nd European Conference on Computational Biology (ECCB 2003) - Short Papers and Posters}, PAGES = {285-286}, YEAR = {2003}, OPTNOTE = {ISBN 2-7261-1257}, PUBLISHER = {INRIA} } @InProceedings{Lpq, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {${L}(p,q)$ labeling of $d$-Dimensional Grids}, BOOKTITLE = {Proc. Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB'03)}, YEAR = {2003} } @InProceedings{SFSW_Sirocco, AUTHOR = {Comellas, F. and Fertin, G. and Raspaud, A.}, TITLE = {Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs}, BOOKTITLE = {Proc. 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO '03)}, VOLUME = {17}, SERIES = {Proceedings in Informatics}, PAGES = {73-87}, YEAR = {2003}, OPTNOTE = {To appear}, PUBLISHER = {Carleton Scientific} } @Article{acycl, AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.}, TITLE = {Acyclic and $k$-distance Coloring of the Grid}, JOURNAL = {Information Processing Letters}, VOLUME = {87(1)}, PAGES = {51-58}, YEAR = {2003} } @Article{survey-knodel, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {A Survey on {K}n\"odel Graphs}, JOURNAL = {Discrete Applied Mathematics}, VOLUME = {137(2)}, PAGES = {173-195}, YEAR = {2003} } %------ 2002 --------------------------------------------------------- @Article{fvs_ipl, AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.}, JOURNAL = {Information Processing Letters}, TITLE = {Minimum Feedback Vertex Set and Acyclic Coloring}, YEAR = {2002}, VOLUME = {84(3)}, PAGES = {131-139} } @InProceedings{fvs_algotel02, AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.}, TITLE = {Conversion de Longueur d'Onde dans les R\'eseaux Optiques - Facteur d'Optimalit\'e $\frac{5}{3}$ }, OPTNOTE = {To appear}, BOOKTITLE = {4\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel '02)}, PAGES = {33-39}, YEAR = {2002}, PUBLISHER = {INRIA} } %------ 2001 --------------------------------------------------------- @Article{routingDAM, AUTHOR = {Baudon, O. and Fertin, G. and Havel, I.}, JOURNAL = {Discrete Applied Mathematics}, TITLE = {Routing Permutations and 2-1 Routing Requests in the Hypercube}, YEAR = {2001}, VOLUME = {113(1)}, PAGES = {43-58} } @InProceedings{kNeighb_COMB, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Neighborhood Communications in Networks}, BOOKTITLE = {Proc. Euroconference on Combinatorics, Graph Theory and Applications (COMB'01)}, SERIES = {Electronic Notes on Discrete Mathematics}, YEAR = {2001} } @InProceedings{kNB_Sirocco, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {$k$-Neighborhood Broadcasting}, BOOKTITLE = {8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001)}, VOLUME = {11}, SERIES = {Proceedings in Informatics}, PAGES = {133-146}, YEAR = {2001}, PUBLISHER = {Carleton Scientific} } @InProceedings{starWG, AUTHOR = {Fertin, G. and Raspaud, A. and Reed, B.}, TITLE = {On Star Coloring of Graphs}, BOOKTITLE = {27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001)}, YEAR = {2001}, VOLUME = {2204 of Lecture Notes in Computer Science}, PUBLISHER = {Springer-Verlag}, PAGES = {140-153} } %------ 2000 --------------------------------------------------------- @Article{flcomp, AUTHOR = {Fertin, G. and Labahn, R.}, TITLE = {Compounding of Gossip Graphs}, YEAR = {2000}, VOLUME = {36(2)}, JOURNAL = {Networks}, PAGES = {126-137} } @TechReport{recogn, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Recognizing Recursive Circulant Graphs {$G(cd^m,d)$}}, INSTITUTION = {LaBRI, Universit\'e Bordeaux 1}, YEAR = {2000}, TYPE = {{Research Report}}, NUMBER = {RR-1235-00} } @Article{fertin-hier, AUTHOR = {Fertin, G.}, JOURNAL = {Information Processing Letters}, TITLE = {Hierarchical Broadcast and Gossip Networks}, YEAR = {2000}, VOLUME = {73(3-4)}, PAGES = {131-136} } @Article{fertinmbd, AUTHOR = {Fertin, G.}, JOURNAL = {Theoretical Computer Science}, TITLE = {On the Structure of Minimum Broadcast Digraphs}, YEAR = {2000}, VOLUME = {245(2)}, PAGES = {203-216} } @InProceedings{ICGT200, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Recognizing Recursive Circulant Graphs}, BOOKTITLE = {6th International Conference on Graph Theory (ICGT 2000)}, VOLUME = {5}, SERIES = {Electronic Notes on Discrete Mathematics}, YEAR = {2000} } @InProceedings{Fibo, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Gossiping in Directed Graphs}, BOOKTITLE = {9th International Conference on Fibonacci Numbers and their Applications}, YEAR = {2000} } @InProceedings{diamknodel, AUTHOR = {Fertin, G. and Raspaud, A. and S\'ykora, O. and Schr\"oder, H. and Vr\v{t}o, I.}, TITLE = {Diameter of {K}n\"odel Graph}, BOOKTITLE = {26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000)}, YEAR = {2000}, PUBLISHER = {Springer-Verlag}, VOLUME = {1928 of Lecture Notes in Computer Science}, PAGES = {149-160} } @Article{annex-fertin, AUTHOR = {Fertin, G.}, JOURNAL = {Discrete Mathematics}, TITLE = {A Study of Minimum Gossip Graphs}, YEAR = {2000}, VOLUME = {215(1-3)}, PAGES = {33-57} } %------ 1999 --------------------------------------------------------- @TechReport{fertin-mgd, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Minimum Gossip Digraphs}, INSTITUTION = {LaBRI, Universit\'e Bordeaux 1}, YEAR = {1999}, TYPE = {{Research Report}}, NUMBER = {RR-1223-99} } @TechReport{tradeoffs, AUTHOR = {Fertin, G.}, TITLE = {Trade-Offs for Odd Gossiping}, INSTITUTION = {LaBRI, Universit\'e Bordeaux 1}, YEAR = {1999}, TYPE = {{Research Report}}, NUMBER = {RR-1216-99}, NOTE = {Submitted for publication} } @InProceedings{fertin-algotel99, AUTHOR = {Fertin, G.}, TITLE = {Compromis pour l'\'Echange Total Impair}, BOOKTITLE = {1\`eres Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel '99)}, PAGES = {47-52}, YEAR = {1999}, PUBLISHER = {INRIA} } @InProceedings{fertin-troff, AUTHOR = {Fertin, G.}, TITLE = {Trade-Offs for Odd Gossiping}, BOOKTITLE = {6th International Colloquium on Structural Information and Communication Complexity (SIROCCO '99)}, VOLUME = {6}, SERIES = {Proceedings in Informatics}, PAGES = {137-151}, YEAR = {1999}, PUBLISHER = {Carleton Scientific} } @InProceedings{routing, AUTHOR = {Baudon, O. and Fertin, G. and Havel, I.}, TITLE = {Routing Permutations in the Hypercube}, BOOKTITLE = {25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '99)}, YEAR = {1999}, PUBLISHER = {Springer-Verlag}, VOLUME = {1665 of Lecture Notes in Computer Science}, PAGES = {179-190} } @PhdThesis{fertin_thesis, AUTHOR = {Fertin, G.}, SCHOOL = {Universit\'e Bordeaux I}, TITLE = {{\'E}tude des Communications dans les R\'eseaux d'Interconnexion}, YEAR = {1999} } %------ 1998 --------------------------------------------------------- @TechReport{pfodd2, AUTHOR = {Fertin, G. and Peters, J.G.}, TITLE = {Optimal Odd Gossiping}, INSTITUTION = {Simon Fraser University, Burnaby, B.C.}, YEAR = {1998}, TYPE = {{Research Report}}, NUMBER = {CMPT TR 1998-24}, NOTE = {Submitted for publication} } @InProceedings{petersfertinodd, AUTHOR = {Fertin, G. and Peters, J.G.}, TITLE = {Odd Gossiping in the Linear Cost Model}, BOOKTITLE = {Workshop on Communication - 23rd Int. Symp. on Mathematical Foundations of Computer Science (MFCS '98)}, YEAR = {1998} } @InProceedings{famfertin, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Families of Graphs having Broadcasting and Gossiping Properties}, BOOKTITLE = {24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98)}, YEAR = {1998}, PUBLISHER = {Springer-Verlag}, VOLUME = {1517 of Lecture Notes in Computer Science}, PAGES = {63-77} } %------ 1995 --------------------------------------------------------- @MastersThesis{Fer95DEA, author = "Fertin, G.", title = "Etude des Graphes Minimaux pour l'\'Echange Total", school = "DEA Informatique, Universit\'e Bordeaux 1", year = "1995" }