Florent Foucaud
Florent Foucaud
LIMOS, Université Clermont Auvergne, France
Verified email at uca.fr - Homepage
Cited by
Cited by
Identifying codes in line graphs
F Foucaud, S Gravier, R Naserasr, A Parreau, P Valicov
Journal of Graph Theory 73 (4), 425-448, 2013
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
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
Locating–dominating sets in twin-free graphs
F Foucaud, MA Henning, C Löwenstein, T Sasse
Discrete Applied Mathematics 200, 52-58, 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
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
The complexity of signed and edge-coloured graph homomorphisms
R Brewster, F Foucaud, P Hell, R Naserasr
Discrete Mathematics 340 (2), 223-235, 2017
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
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
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
Combinatorial and algorithmic aspects of identifying codes in graphs
F Foucaud
Université de Bordeaux, 2012
Algorithms and Complexity for Metric Dimension and Location-Domination on Interval and Permutation Graphs⋆
F Foucaud, G Mertzios, R Naserasr, A Parreau, P Valicov
WG 2015, 2015
Bounds for identifying codes in terms of degree parameters
F Foucaud, G Perarnau
The Electronic Journal of Combinatorics 19, P32, 2012
Complexity of Grundy coloring and its variants
É Bonnet, F Foucaud, EJ Kim, F Sikora
Discrete Applied Mathematics 243, 99-114, 2018
Large subgraphs without short cycles
F Foucaud, M Krivelevich, G Perarnau
SIAM Journal on Discrete Mathematics 29 (1), 65-78, 2015
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
The complexity of homomorphisms of signed graphs and signed constraint satisfaction
F Foucaud, R Naserasr
Latin American Symposium on Theoretical Informatics, 526-537, 2014
The complexity of the identifying code problem in restricted graph classes
F Foucaud
Combinatorial Algorithms - IWOCA 2013 Proceedings, 150-163, 2013
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
Parameterized and approximation complexity of Partial VC Dimension
C Bazgan, F Foucaud, F Sikora
Theoretical Computer Science 766, 1-15, 2019
The system can't perform the operation now. Try again later.
Articles 1–20