Guillaume Fertin

Cited by

	All	Since 2016
Citations	2797	1009
h-index	27	16
i10-index	55	26

260

130

195

20002001200220032004200520062007200820092010201120122013201420152016201720182019202012 3 8 17 35 48 72 136 102 155 150 172 199 231 243 176 243 152 209 207 192

Co-authors

Stéphane VialetteLIGM, Univ Gustave Eiffel, CNRS, F-77454 Marne-la-Vallée, FranceVerified email at univ-eiffel.fr
André RaspaudProfessor emeritus, LaBRI, Bordeaux University, FranceVerified email at labri.fr
Laurent BulteauCNRS / Université Paris-Est Marne-la-ValléeVerified email at u-pem.fr
Guillaume BlinFull Professor of Computer Science, Université de Bordeaux, FranceVerified email at labri.fr
Riccardo DondiUniversità degli studi di BergamoVerified email at unibg.it
Romeo RizziProfessore Associato di Ricerca Operativa, Verona UniversityVerified email at univr.it
Géraldine JeanAssociate Professor, Université of Nantes, LS2NVerified email at univ-nantes.fr
Eric TannierINRIA, Université de Lyon 1Verified email at inria.fr
Cedric ChauveProfessor of Mathematics, Simon Fraser UniversityVerified email at sfu.ca
Francesc ComellasProfessor of Applied Mathematics, Univ. Politècnica de Catalunya - Barcelona TechVerified email at upc.edu
Zanoni DiasInstitute of Computing - University of CampinasVerified email at ic.unicamp.br
Christian KomusiewiczPhilipps-Universität MarburgVerified email at informatik.uni-marburg.de
Bruce ReedMcGill UniversityVerified email at cs.mcgill.ca
Anthony LabarreAssociate Professor at Université Gustave EiffelVerified email at univ-mlv.fr
Ulisses DiasFaculdade de Tecnologia - UnicampVerified email at ft.unicamp.br
Andre Rodrigues OliveiraInstitute of Computing - University of CampinasVerified email at ic.unicamp.br
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Gianluca Della VedovaUniversità degli Studi di Milano-BicoccaVerified email at dellavedova.org
Paola BonizzoniUniversity of Milano BicoccaVerified email at unimib.it
Sinoquet ChristineAssociate Professor in Computer Science, Nantes University, FranceVerified email at univ-nantes.fr

Guillaume Fertin

University of Nantes, LS2N, France

Verified email at univ-nantes.fr

Algorithms Computational Complexity Bioinformatics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Combinatorics of genome rearrangements G Fertin, A Labarre, I Rusu, S Vialette, E Tannier MIT press, 2009	362	2009
Sorting by transpositions is difficult L Bulteau, G Fertin, I Rusu SIAM Journal on Discrete Mathematics 26 (3), 1148-1180, 2012	184	2012
Star coloring of graphs G Fertin, A Raspaud, B Reed Journal of graph theory 47 (3), 163-182, 2004	147	2004
Recursive graphs with small-world scale-free properties F Comellas, G Fertin, A Raspaud physical review E 69 (3), 037104, 2004	127	2004
High-dimensional Apollonian networks Z Zhang, F Comellas, G Fertin, L Rong Journal of Physics A: Mathematical and General 39 (8), 1811, 2006	108	2006
Acyclic and k-distance coloring of the grid G Fertin, E Godard, A Raspaud Information Processing Letters 87 (1), 51-58, 2003	88	2003
Pancake flipping is hard L Bulteau, G Fertin, I Rusu Journal of Computer and System Sciences 81 (8), 1556-1574, 2015	79	2015
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs MR Fellows, G Fertin, D Hermelin, S Vialette International Colloquium on Automata, Languages, and Programming, 340-351, 2007	78	2007
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	77	2011
Multiple genome rearrangement by swaps and by element duplications VY Popov Theoretical Computer Science 385 (1-3), 115-126, 2007	77	2007
On star coloring of graphs G Fertin, A Raspaud, B Reed International Workshop on Graph-Theoretic Concepts in Computer Science, 140-153, 2001	67	2001
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	59	2009
The breakpoint distance for signed sequences G Blin, G Fertin, C Chauve	58	2004
A survey on Knödel graphs G Fertin, A Raspaud Discrete Applied Mathematics 137 (2), 173-195, 2004	55	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 International Workshop on Algorithms and Computation, 357-368, 2009	43	2009
On the oriented chromatic number of grids G Fertin, A Raspaud, A Roychowdhury Information Processing Letters 85 (5), 261-266, 2003	42	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	41	2007
Genes order and phylogenetic reconstruction: Application to γ-proteobacteria G Blin, C Chauve, G Fertin RECOMB Workshop on Comparative Genomics, 11-20, 2005	41	2005
Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes S Angibaud, G Fertin, I Rusu, A Thévenin, S Vialette Journal of Computational Biology 15 (8), 1093-1115, 2008	37	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors