Seguir
Florent Foucaud
Florent Foucaud
LIMOS, Université Clermont Auvergne, France
Dirección de correo verificada de uca.fr - Página principal
Título
Citado por
Citado por
Año
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
84*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
59*2011
Locating–dominating sets in twin-free graphs
F Foucaud, MA Henning, C Löwenstein, T Sasse
Discrete Applied Mathematics 200, 52-58, 2016
542016
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
54*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
542013
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
492017
The complexity of signed and edge-coloured graph homomorphisms
R Brewster, F Foucaud, P Hell, R Naserasr
Discrete Mathematics 340 (2), 223-235, 2017
482017
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
362012
Bounds for identifying codes in terms of degree parameters
F Foucaud, G Perarnau
The Electronic Journal of Combinatorics 19, P32, 2012
292012
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
272012
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
25*2013
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
242018
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
242015
Monitoring the Edges of a Graph Using Distances
F Foucaud, SS Kao, R Klasing, M Miller, J Ryan
Discrete Applied Mathematics 319, 424-438, 2022
232022
Combinatorial and algorithmic aspects of identifying codes in graphs
F Foucaud
Université de Bordeaux, 2012
23*2012
Identifying path covers in graphs
F Foucaud, M Kovše
Journal of Discrete Algorithms 23, 21-34, 2013
22*2013
Large subgraphs without short cycles
F Foucaud, M Krivelevich, G Perarnau
SIAM Journal on Discrete Mathematics 29 (1), 65-78, 2015
212015
Complexity of Grundy coloring and its variants
É Bonnet, F Foucaud, EJ Kim, F Sikora
Discrete Applied Mathematics 243, 99-114, 2018
192018
Location-domination and matching in cubic graphs
F Foucaud, MA Henning
Discrete Mathematics 339 (4), 1221-1231, 2016
192016
The complexity of homomorphisms of signed graphs and signed constraint satisfaction
F Foucaud, R Naserasr
11th Latin American Symposium on Theoretical Informatics (LATIN 2014) 8392 …, 2014
192014
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20