Guillaume Fertin

Cited by

	All	Since 2017
Citations	2976	1016
h-index	29	15
i10-index	53	26

240

120

180

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202213 5 8 17 36 54 72 133 100 152 148 171 172 208 233 172 229 168 197 188 174 179 108

Public access

View all

15 articles

5 articles

available

not available

Based on funding mandates

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
Géraldine JeanAssociate Professor, Université of Nantes, LS2NVerified email at univ-nantes.fr
Riccardo DondiUniversità degli studi di BergamoVerified email at unibg.it
Eric TannierINRIA, Université de Lyon 1Verified email at inria.fr
Romeo RizziProfessore Associato di Ricerca Operativa, Verona UniversityVerified email at univr.it
Zanoni DiasInstitute of Computing - University of CampinasVerified email at ic.unicamp.br
Anthony LabarreAssociate Professor at Université Gustave EiffelVerified email at univ-mlv.fr
Christian KomusiewiczPhilipps-Universität MarburgVerified email at informatik.uni-marburg.de
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
Ulisses DiasFaculdade de Tecnologia - UnicampVerified email at ft.unicamp.br
Andre Rodrigues OliveiraInstitute of Computing - University of CampinasVerified email at ic.unicamp.br
Bruce ReedMcGill UniversityVerified email at cs.mcgill.ca
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Klairton L. BritoInstitute of Computing, University of CampinasVerified email at ic.unicamp.br
Zhongzhi Zhang (章忠志)Professor, School of Computer Science, Fudan UniversityVerified email at fudan.edu.cn
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 - Homepage

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	347	2009
Sorting by transpositions is difficult L Bulteau, G Fertin, I Rusu SIAM Journal on Discrete Mathematics 26 (3), 1148-1180, 2012	199	2012
Star coloring of graphs G Fertin, A Raspaud, B Reed Journal of graph theory 47 (3), 163-182, 2004	168	2004
Recursive graphs with small-world scale-free properties F Comellas, G Fertin, A Raspaud physical review E 69 (3), 037104, 2004	133	2004
High-dimensional Apollonian networks Z Zhang, F Comellas, G Fertin, L Rong Journal of Physics A: Mathematical and General 39 (8), 1811, 2006	120	2006
Acyclic and k-distance coloring of the grid G Fertin, E Godard, A Raspaud Information Processing Letters 87 (1), 51-58, 2003	92	2003
Pancake flipping is hard L Bulteau, G Fertin, I Rusu Journal of Computer and System Sciences 81 (8), 1556-1574, 2015	82	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	80	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	79	2011
On star coloring of graphs G Fertin, A Raspaud, B Reed International Workshop on Graph-Theoretic Concepts in Computer Science, 140-153, 2001	68	2001
A survey on Knödel graphs G Fertin, A Raspaud Discrete Applied Mathematics 137 (2), 173-195, 2004	66	2004
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	65	2009
The breakpoint distance for signed sequences G Blin, C Chauve, G Fertin Proc. 1st Algorithms and Computational Methods for Biochemical and …, 2004	60	2004
Combinatorics of genome rearrangements. Computational molecular biology G Fertin, A Labarre, I Rusu, É Tannier, S Vialette MIT Press, 2009	59	2009
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	50	2007
On the oriented chromatic number of grids G Fertin, A Raspaud, A Roychowdhury Information Processing Letters 85 (5), 261-266, 2003	46	2003
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	45	2009
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	43	2007
Acyclic coloring of graphs of maximum degree five: nine colors are enough G Fertin, A Raspaud Information Processing Letters 105 (2), 65-72, 2008	39	2008
Complexity issues in vertex-colored graph pattern matching R Dondi, G Fertin, S Vialette Journal of Discrete Algorithms 9 (1), 82-99, 2011	38	2011

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

Follow

Cited by

Co-authors