Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarFlorent Foucaud
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j27]Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. Discrete Applied Mathematics 243: 99-114 (2018)- [j26]Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau:
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. SIAM J. Discrete Math. 32(2): 902-918 (2018) - 2017
- [j25]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Algorithmica 78(3): 914-944 (2017) - [j24]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. Discrete Applied Mathematics 229: 64-81 (2017) - [j23]Florent Foucaud, Michael A. Henning:
Location-domination in line graphs. Discrete Mathematics 340(1): 3140-3153 (2017) - [j22]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and edge-coloured graph homomorphisms. Discrete Mathematics 340(2): 223-235 (2017) - [j21]Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak:
Structural properties of recursively partitionable graphs with connectivity 2. Discussiones Mathematicae Graph Theory 37(1): 89-115 (2017) - [j20]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. J. Comb. Theory, Ser. B 124: 128-164 (2017) - [j19]Florent Foucaud, Ralf Klasing:
Parameterized and approximation complexity of the detection pair problem in graphs. J. Graph Algorithms Appl. 21(6): 1039-1056 (2017) - [j18]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. 668: 43-58 (2017) - 2016
- [j17]Florent Foucaud, Michael A. Henning:
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture. Electr. J. Comb. 23(3): P3.9 (2016) - [j16]Florent Foucaud, Michael A. Henning, Christian Löwenstein, Thomas Sasse:
Locating-dominating sets in twin-free graphs. Discrete Applied Mathematics 200: 52-58 (2016) - [j15]Florent Foucaud, Michael A. Henning:
Location-domination and matching in cubic graphs. Discrete Mathematics 339(4): 1221-1231 (2016) - [c6]Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. COCOA 2016: 92-106 - [i17]Florent Foucaud, Ralf Klasing:
Parameterized and approximation complexity of the detection pair problem in graphs. CoRR abs/1601.05003 (2016) - [i16]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. CoRR abs/1607.04777 (2016) - [i15]Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. CoRR abs/1609.05110 (2016) - [i14]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. CoRR abs/1610.03999 (2016) - 2015
- [j14]Camino Balbuena, Florent Foucaud, Adriana Hansberg:
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5. Electr. J. Comb. 22(2): P2.15 (2015) - [j13]Florent Foucaud:
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. J. Discrete Algorithms 31: 48-68 (2015) - [j12]Florent Foucaud, Michael Krivelevich, Guillem Perarnau:
Large Subgraphs without Short Cycles. SIAM J. Discrete Math. 29(1): 65-78 (2015) - [c5]Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy Coloring and Its Variants. COCOON 2015: 109-120 - [c4]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. WG 2015: 456-471 - [i13]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. CoRR abs/1507.08164 (2015) - [i12]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR abs/1510.05502 (2015) - 2014
- [j11]Florent Foucaud, Tero Laihonen, Aline Parreau:
An improved lower bound for (1, ≤ 2)-identifying codes in the king grid. Adv. in Math. of Comm. 8(1): 35-52 (2014) - [j10]Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak:
On the structure of arbitrarily partitionable graphs with given connectivity. Discrete Applied Mathematics 162: 381-385 (2014) - [j9]Florent Foucaud, Ralf Klasing, Peter J. Slater:
Centroidal bases in graphs. Networks 64(2): 96-108 (2014) - [c3]Florent Foucaud, Reza Naserasr:
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. LATIN 2014: 526-537 - [i11]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. CoRR abs/1405.2424 (2014) - [i10]Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. CoRR abs/1407.5336 (2014) - [i9]Camino Balbuena, Florent Foucaud, Adriana Hansberg:
Locating-dominating sets and identifying codes in graphs of girth at least 5. CoRR abs/1407.7263 (2014) - 2013
- [j8]Florent Foucaud, Reza Naserasr, Aline Parreau:
Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets. Graphs and Combinatorics 29(3): 463-473 (2013) - [j7]Florent Foucaud, Matjaz Kovse:
Identifying path covers in graphs. J. Discrete Algorithms 23: 21-34 (2013) - [j6]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying Codes in Line Graphs. Journal of Graph Theory 73(4): 425-448 (2013) - [c2]Florent Foucaud:
The Complexity of the Identifying Code Problem in Restricted Graph Classes. IWOCA 2013: 150-163 - [i8]Florent Foucaud, Guillem Perarnau, Oriol Serra:
Random subgraphs make identification affordable. CoRR abs/1306.0819 (2013) - 2012
- [b1]Florent Foucaud:
Combinatorial and algorithmic aspects of identifying codes in graphs. (Aspects combinatoires et algorithmiques des codes identifiants dans les graphes). University of Bordeaux, France 2012 - [j5]Florent Foucaud, Guillem Perarnau:
Bounds for Identifying Codes in Terms of Degree Parameters. Electr. J. Comb. 19(1): P32 (2012) - [j4]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. Discrete Applied Mathematics 160(10-11): 1532-1546 (2012) - [j3]Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. Discrete Mathematics 312(10): 1832-1837 (2012) - [c1]Florent Foucaud, Matjaz Kovse:
On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths. IWOCA 2012: 32-45 - 2011
- [j2]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. Eur. J. Comb. 32(4): 628-638 (2011) - [j1]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Edge identifying codes. Electronic Notes in Discrete Mathematics 38: 343-348 (2011) - [i7]Florent Foucaud, Guillem Perarnau:
Bounds for identifying codes in terms of degree parameters. CoRR abs/1103.3756 (2011) - [i6]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying codes in line graphs. CoRR abs/1107.0207 (2011) - [i5]Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau:
Locally identifying colourings for graphs with given maximum degree. CoRR abs/1108.2769 (2011) - [i4]Florent Foucaud, Tero Laihonen, Aline Parreau:
An improved lower bound for (1,<=2)-identifying codes in the king grid. CoRR abs/1111.2477 (2011) - 2010
- [i3]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. CoRR abs/1004.5230 (2010) - [i2]Florent Foucaud, Reza Naserasr, Aline Parreau:
Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets. CoRR abs/1010.2985 (2010) - [i1]Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud:
On the size of identifying codes in triangle-free graphs. CoRR abs/1010.5975 (2010)
Coauthor Index
maintained by 
at 
at 
last updated on 2018-12-01 23:15 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint