Combinatorics of genome rearrangements G Fertin MIT press, 2009 | 444 | 2009 |
Star coloring of graphs G Fertin, A Raspaud, B Reed Journal of graph theory 47 (3), 163-182, 2004 | 187 | 2004 |
Sorting by transpositions is difficult L Bulteau, G Fertin, I Rusu SIAM Journal on Discrete Mathematics 26 (3), 1148-1180, 2012 | 184 | 2012 |
Recursive graphs with small-world scale-free properties F Comellas, G Fertin, A Raspaud physical review E 69 (3), 037104, 2004 | 134 | 2004 |
High-dimensional Apollonian networks Z Zhang, F Comellas, G Fertin, L Rong Journal of Physics A: Mathematical and General 39 (8), 1811, 2006 | 123 | 2006 |
Acyclic and k-distance coloring of the grid G Fertin, E Godard, A Raspaud Information Processing Letters 87 (1), 51-58, 2003 | 103 | 2003 |
Pancake flipping is hard L Bulteau, G Fertin, I Rusu Journal of Computer and System Sciences 81 (8), 1556-1574, 2015 | 94 | 2015 |
Upper and lower bounds for finding connected motifs in vertex-colored graphs MR Fellows, G Fertin, D Hermelin, S Vialette Journal of Computer and System Sciences 77 (4), 799-811, 2011 | 83 | 2011 |
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs MR Fellows, G Fertin, D Hermelin, S Vialette Automata, Languages and Programming: 34th International Colloquium, ICALP …, 2007 | 80 | 2007 |
On the approximability of comparing genomes with duplicates. S Angibaud, G Fertin, I Rusu, A Thévenin, S Vialette Journal of Graph Algorithms and Applications 13 (1), 19-53, 2009 | 74 | 2009 |
A survey on Knödel graphs G Fertin, A Raspaud Discrete Applied Mathematics 137 (2), 173-195, 2004 | 74 | 2004 |
On star coloring of graphs G Fertin, A Raspaud, B Reed Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001 | 72 | 2001 |
The breakpoint distance for signed sequences G Blin, G Fertin, C Chauve 1st conference on algorithms and computational methods for biochemical and …, 2004 | 62 | 2004 |
Comparing genomes with duplications: a computational complexity point of view G Blin, C Chauve, G Fertin, R Rizzi, S Vialette IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (4), 523-534, 2007 | 49 | 2007 |
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated G Blin, G Fertin, F Sikora, S Vialette WALCOM: Algorithms and Computation: Third International Workshop, WALCOM …, 2009 | 46 | 2009 |
On the oriented chromatic number of grids G Fertin, A Raspaud, A Roychowdhury Information Processing Letters 85 (5), 261-266, 2003 | 45 | 2003 |
Exemplar longest common subsequence P Bonizzoni, G Della Vedova, R Dondi, G Fertin, R Rizzi, S Vialette IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (4), 535-543, 2007 | 44 | 2007 |
Minimum feedback vertex set and acyclic coloring G Fertin, E Godard, A Raspaud Information Processing Letters 84 (3), 131-139, 2002 | 43 | 2002 |
Sorting by transpositions is difficult L Bulteau, G Fertin, I Rusu Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011 | 42 | 2011 |
Acyclic coloring of graphs of maximum degree five: nine colors are enough G Fertin, A Raspaud Information Processing Letters 105 (2), 65-72, 2008 | 40 | 2008 |