Florent Foucaud

From MaRDI portal
Person:311494

Available identifiers

zbMath Open foucaud.florentMaRDI QIDQ311494

List of research outcomes

PublicationDate of PublicationType
Extremal Digraphs for open neighbourhood location-domination and identifying codes2024-02-27Paper
Extended double covers and homomorphism bounds of signed graphs2024-02-23Paper
https://portal.mardi4nfdi.de/entity/Q60653962023-11-14Paper
https://portal.mardi4nfdi.de/entity/Q60654232023-11-14Paper
Neighbourhood complexity of graphs of bounded twin-width2023-10-25Paper
Parameterizing path partitions2023-10-04Paper
Bounds and extremal graphs for total dominating identifying codes2023-08-18Paper
New bounds and constructions for neighbor-locating colorings of graphs2023-08-17Paper
Monitoring edge-geodetic sets in graphs2023-08-17Paper
On three domination-based identification problems in block graphs2023-08-17Paper
Relation between broadcast domination and multipacking numbers on chordal graphs2023-08-17Paper
The \textsc{Red-Blue Separation} problem on graphs2023-08-08Paper
Complexity and approximation for discriminating and identifying code problems in geometric setups2023-06-28Paper
https://portal.mardi4nfdi.de/entity/Q58755472023-02-03Paper
Revisiting and Improving Upper Bounds for Identifying Codes2022-11-15Paper
On the Complexity of Broadcast Domination and Multipacking in Digraphs2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q51042542022-09-09Paper
The \textsc{red-blue separation} problem on graphs2022-08-30Paper
Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)2022-08-04Paper
Monitoring the edges of a graph using distances2022-08-04Paper
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity2022-05-03Paper
On the complexity of broadcast domination and multipacking In digraphs2021-09-02Paper
Characterizing extremal graphs for open neighbourhood location-domination2021-08-02Paper
Complexity and algorithms for injective edge-coloring in graphs2021-06-16Paper
Exact square coloring of subcubic planar graphs2021-03-25Paper
Hardness and approximation for the geodetic set problem in some graph classes2020-07-21Paper
Smallest \(C_{2l+1}\)-critical graphs of odd-girth \(2k+1\)2020-07-21Paper
Monitoring the edges of a graph using distances2020-07-21Paper
Domination and location in twin-free digraphs2020-07-07Paper
Complexity of planar signed graph homomorphisms to cycles2020-07-07Paper
Complexity of conjunctive regular path query homomorphisms2020-05-12Paper
Broadcast domination and multipacking: bounds and the integrality gap2019-09-19Paper
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs2019-09-11Paper
Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs2019-05-17Paper
Parameterized and approximation complexity of \textsc{Partial VC Dimension}2019-03-14Paper
Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs2018-10-29Paper
Complexity of Grundy coloring and its variants2018-05-24Paper
Centroidal bases in graphs2018-05-23Paper
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension2018-04-20Paper
Parameterized and approximation complexity of the detection pair problem in graphs2017-10-24Paper
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity2017-10-09Paper
The complexity of tropical graph homomorphisms2017-07-27Paper
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.2017-02-27Paper
Parameterized and approximation complexity of \textsc{Partial VC Dimension}2017-02-01Paper
Structural properties of recursively partitionable graphs with connectivity 22017-01-23Paper
Random subgraphs make identification affordable2017-01-10Paper
The complexity of signed graph and edge-coloured graph homomorphisms2016-12-14Paper
Location-domination in line graphs2016-10-21Paper
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs2016-10-21Paper
Locating-total dominating sets in twin-free graphs: a conjecture2016-09-13Paper
Locating-dominating sets in twin-free graphs2016-01-21Paper
Location-domination and matching in cubic graphs2016-01-21Paper
Large Subgraphs without Short Cycles2015-11-27Paper
Complexity of Grundy coloring and its variants2015-10-29Paper
Locating-dominating sets and identifying codes in graphs of girth at least 52015-05-18Paper
On powers of interval graphs and their orders2015-05-13Paper
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes2015-03-24Paper
On the structure of arbitrarily partitionable graphs with given connectivity2014-09-12Paper
On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths2014-08-19Paper
Identifying path covers in graphs2014-08-13Paper
Random subgraphs make identification affordable2014-06-11Paper
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction2014-03-31Paper
An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid2014-03-10Paper
The Complexity of the Identifying Code Problem in Restricted Graph Classes2014-01-17Paper
https://portal.mardi4nfdi.de/entity/Q28573692013-11-01Paper
Identifying Codes in Line Graphs2013-07-31Paper
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets2013-06-26Paper
On the size of identifying codes in triangle-free graphs2012-06-18Paper
Bounds for identifying codes in terms of degree parameters2012-06-12Paper
Locally identifying colourings for graphs with given maximum degree2012-05-30Paper
Extremal graphs for the identifying code problem2011-04-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Florent Foucaud