Guillaume Fertin

Cited by

	All	Since 2020
Citations	3414	870
h-index	32	14
i10-index	60	23

240

120

180

20022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202510 17 32 55 72 134 103 153 149 169 200 213 234 180 217 166 195 189 164 177 163 154 176 34

Public access

View all

15 articles

10 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
Géraldine JeanAssociate Professor, Nantes Université, LS2NVerified email at univ-nantes.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
Zanoni DiasInstitute of Computing - University of CampinasVerified email at ic.unicamp.br
Riccardo DondiUniversità degli studi di BergamoVerified email at unibg.it
Ulisses DiasFaculdade de Tecnologia - UnicampVerified email at ft.unicamp.br
Romeo RizziProfessore Associato di Ricerca Operativa, Verona UniversityVerified email at univr.it
Andre Rodrigues OliveiraFaculdade de Computação e Informática - Universidade Presbiteriana MackenzieVerified email at mackenzie.br
Christian KomusiewiczFriedrich-Schiller-Universität JenaVerified email at uni-jena.de
Danny HermelinBen-Gurion University of the NegevVerified email at bgu.ac.il
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
Bruce ReedMcGill UniversityVerified email at cs.mcgill.ca
Klairton L. BritoInstitute of Computing, University of CampinasVerified email at ic.unicamp.br
Eric TannierInria, IXXI, ENS Lyon, Univ LyonVerified email at inria.fr
Zhongzhi Zhang (章忠志)Professor, School of Computer Science, Fudan UniversityVerified email at fudan.edu.cn
Florian SikoraLAMSADE, Université Paris-DauphineVerified email at dauphine.fr
Alexsandro Oliveira AlexandrinoUniversity of Campinas (Unicamp)Verified email at ic.unicamp.br

Guillaume Fertin

Nantes Université, 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 MIT press, 2009	466	2009
Sorting by transpositions is difficult L Bulteau, G Fertin, I Rusu SIAM Journal on Discrete Mathematics 26 (3), 1148-1180, 2012	193	2012
Star coloring of graphs G Fertin, A Raspaud, B Reed Journal of graph theory 47 (3), 163-182, 2004	193	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	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	102	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	85	2011
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	84	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	81	2009
A survey on Knödel graphs G Fertin, A Raspaud Discrete Applied Mathematics 137 (2), 173-195, 2004	77	2004
On star coloring of graphs G Fertin, A Raspaud, B Reed Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001	71	2001
The breakpoint distance for signed sequences G Blin, G Fertin, C Chauve 1st conference on algorithms and computational methods for biochemical and …, 2004	65	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	51	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	49	2009
On the oriented chromatic number of grids G Fertin, A Raspaud, A Roychowdhury Information Processing Letters 85 (5), 261-266, 2003	46	2003
Minimum feedback vertex set and acyclic coloring G Fertin, E Godard, A Raspaud Information Processing Letters 84 (3), 131-139, 2002	45	2002
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
Sorting by transpositions is difficult L Bulteau, G Fertin, I Rusu International Colloquium on Automata, Languages, and Programming, 654-665, 2011	41	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	41	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

Follow

Cited by

Co-authors