Florent Foucaud

According to our database1, Florent Foucaud authored at least 51 papers between 2010 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Domination and location in twin-free digraphs.
Discret. Appl. Math., 2020

Complexity of planar signed graph homomorphisms to cycles.
Discret. Appl. Math., 2020

Discriminating Codes in Geometric Setups.
CoRR, 2020

Exact square coloring of subcubic planar graphs.
CoRR, 2020

Algorithms and complexity for geodetic sets on planar and chordal graphs.
CoRR, 2020

On the Complexity of Broadcast Domination and Multipacking in Digraphs.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Monitoring the Edges of a Graph Using Distances.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

Smallest C<sub>2l+1</sub>-Critical Graphs of Odd-Girth 2k+1.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

Parameterized and approximation complexity of Partial VC Dimension.
Theor. Comput. Sci., 2019

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs.
Discret. Math., 2019

Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs.
Discret. Appl. Math., 2019

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

Complexity of Conjunctive Regular Path Query Homomorphisms.
Proceedings of the Computing with Foresight and Industry, 2019

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension.
SIAM J. Discret. Math., 2018

Complexity of Grundy coloring and its variants.
Discret. Appl. Math., 2018

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.
Theor. Comput. Sci., 2017

Parameterized and approximation complexity of the detection pair problem in graphs.
J. Graph Algorithms Appl., 2017

Homomorphism bounds and edge-colourings of K<sub>4</sub>-minor-free graphs.
J. Comb. Theory, Ser. B, 2017

Structural properties of recursively partitionable graphs with connectivity 2.
Discuss. Math. Graph Theory, 2017

Location-domination in line graphs.
Discret. Math., 2017

The complexity of signed graph and edge-coloured graph homomorphisms.
Discret. Math., 2017

The complexity of tropical graph homomorphisms.
Discret. Appl. Math., 2017

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity.
Algorithmica, 2017

Location-domination and matching in cubic graphs.
Discret. Math., 2016

Locating-dominating sets in twin-free graphs.
Discret. Appl. Math., 2016

Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture.
Electron. J. Comb., 2016

On the Approximability of Partial VC Dimension.
Proceedings of the Combinatorial Optimization and Applications, 2016

Large Subgraphs without Short Cycles.
SIAM J. Discret. Math., 2015

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes.
J. Discrete Algorithms, 2015

The complexity of signed graph and 2-edge-coloured graph homomorphisms.
CoRR, 2015

Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5.
Electron. J. Comb., 2015

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Centroidal bases in graphs.
Networks, 2014

On the structure of arbitrarily partitionable graphs with given connectivity.
Discret. Appl. Math., 2014

Identification, location-domination and metric dimension on interval and permutation graphs.
CoRR, 2014

An improved lower bound for (1, ≤ 2)-identifying codes in the king grid.
Adv. Math. Commun., 2014

The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Identifying Codes in Line Graphs.
J. Graph Theory, 2013

Identifying path covers in graphs.
J. Discrete Algorithms, 2013

Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets.
Graphs Comb., 2013

Random subgraphs make identification affordable.
CoRR, 2013

The Complexity of the Identifying Code Problem in Restricted Graph Classes.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Combinatorial and algorithmic aspects of identifying codes in graphs. (Aspects combinatoires et algorithmiques des codes identifiants dans les graphes).
PhD thesis, 2012

Locally identifying colourings for graphs with given maximum degree.
Discret. Math., 2012

On the size of identifying codes in triangle-free graphs.
Discret. Appl. Math., 2012

Bounds for Identifying Codes in Terms of Degree Parameters.
Electron. J. Comb., 2012

On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Edge identifying codes.
Electron. Notes Discret. Math., 2011

Extremal graphs for the identifying code problem.
Eur. J. Comb., 2011

Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets
CoRR, 2010