Florent Foucaud

Cited by

	All	Since 2018
Citations	822	554
h-index	17	13
i10-index	27	21

160

120

201120122013201420152016201720182019202020212022202310 39 29 34 22 65 55 73 72 101 90 159 56

Public access

View all

24 articles

1 article

available

not available

Based on funding mandates

Co-authors

Michael A. HenningProfessor of Mathematics, University of JohannesburgVerified email at uj.ac.za
Matjaž KovšeIndian Institute of Technology Bhubaneswar (IIT Bhubaneswar)Verified email at iitbbs.ac.in
Guillem PerarnauUniversitat Politècnica de CatalunyaVerified email at upc.edu
George B. MertziosAssociate Professor, Durham UniversityVerified email at durham.ac.uk
Olivier BaudonUniversité de BordeauxVerified email at labri.fr
Florian SikoraLAMSADE, Université Paris-DauphineVerified email at dauphine.fr
Tero LaihonenProfessor of Mathematics, University of TurkuVerified email at utu.fi
André RaspaudProfessor emeritus, LaBRI, Bordeaux University, FranceVerified email at labri.fr
Hervé HocquardLaBRIVerified email at labri.fr
Adriana HansbergInstituto de Matemáticas, Universidad Nacional Autónoma de MéxicoVerified email at im.unam.mx
Adrian KosowskiHead of Product at PathwayVerified email at pathway.com
Harmender GahlawatBen-Gurion University of the NegevVerified email at bgu.ac.il
Dibyayan ChakrabortyENS LyonVerified email at ens-lyon.fr
BENSMAIL JulienUniversité Côte d'AzurVerified email at unice.fr
Valia MitsouResearch Institute on the Foundations of Computer Science (IRIF) and Paris Diderot UniversityVerified email at liris.cnrs.fr
Théo PierronUniversité de LyonVerified email at univ-lyon1.fr
Tuomo LehtiläPostdoc, University of TurkuVerified email at utu.fi
Édouard BonnetENS Lyon, LIP, FranceVerified email at ens-lyon.fr
Bodhayan RoyIndian Institute of Technology KharagpurVerified email at maths.iitkgp.ac.in
Sanjana DeyIndian Statistical Institute, KolkataVerified email at isical.ac.in

Florent Foucaud

LIMOS, Université Clermont Auvergne, France

Verified email at uca.fr - Homepage

Graph theory Algorithms Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity F Foucaud, GB Mertzios, R Naserasr, A Parreau, P Valicov Algorithmica 78 (3), 914-944, 2017	72*	2017
Extremal graphs for the identifying code problem F Foucaud, E Guerrini, M Kovse, R Naserasr, A Parreau, P Valicov European Journal of Combinatorics 32 (4), 628-638, 2011	55	2011
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes F Foucaud Journal of Discrete Algorithms 31, 48-68, 2015	50*	2015
Identifying codes in line graphs F Foucaud, S Gravier, R Naserasr, A Parreau, P Valicov Journal of Graph Theory 73 (4), 425-448, 2013	49	2013
Locating–dominating sets in twin-free graphs F Foucaud, MA Henning, C Löwenstein, T Sasse Discrete Applied Mathematics 200, 52-58, 2016	48	2016
Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds F Foucaud, GB Mertzios, R Naserasr, A Parreau, P Valicov Theoretical Computer Science 668, 43-58, 2017	45	2017
The complexity of signed and edge-coloured graph homomorphisms R Brewster, F Foucaud, P Hell, R Naserasr Discrete Mathematics 340 (2), 223-235, 2017	41	2017
On the size of identifying codes in triangle-free graphs F Foucaud, R Klasing, A Kosowski, A Raspaud Discrete Applied Mathematics 160 (9-10), 1532-1546, 2012	31	2012
Bounds for identifying codes in terms of degree parameters F Foucaud, G Perarnau The Electronic Journal of Combinatorics 19, P32, 2012	25	2012
Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy’s Theorem on Induced Subsets F Foucaud, R Naserasr, A Parreau Graphs and Combinatorics 29 (3), 463-473, 2013	23*	2013
Locally identifying colourings for graphs with given maximum degree F Foucaud, I Honkala, T Laihonen, A Parreau, G Perarnau Discrete Mathematics 312 (10), 1832-1837, 2012	23	2012
Large subgraphs without short cycles F Foucaud, M Krivelevich, G Perarnau SIAM Journal on Discrete Mathematics 29 (1), 65-78, 2015	20	2015
Combinatorial and algorithmic aspects of identifying codes in graphs F Foucaud Université de Bordeaux, 2012	20*	2012
Locating-dominating sets and identifying codes in graphs of girth at least 5 C Balbuena, F Foucaud, A Hansberg The Electronic Journal of Combinatorics 22 (2), P2.15, 2015	19	2015
The complexity of homomorphisms of signed graphs and signed constraint satisfaction F Foucaud, R Naserasr Latin American Symposium on Theoretical Informatics, 526-537, 2014	19	2014
Complexity of Grundy coloring and its variants É Bonnet, F Foucaud, EJ Kim, F Sikora Discrete Applied Mathematics 243, 99-114, 2018	18	2018
Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension L Beaudou, P Dankelmann, F Foucaud, MA Henning, A Mary, A Parreau SIAM Journal on Discrete Mathematics 32 (2), 902-918, 2018	17	2018
Homomorphism bounds and edge-colourings of K4-minor-free graphs. L Beaudou, F Foucaud, R Naserasr Journal of Combinatorial Theory, Series B 124, 128-164, 2017	17	2017
Location-domination and matching in cubic graphs F Foucaud, MA Henning Discrete Mathematics 339 (4), 1221-1231, 2016	16	2016
Identifying path covers in graphs F Foucaud, M Kovše Journal of Discrete Algorithms 23, 21-34, 2013	15*	2013

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