Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets - Florent Foucaud; Reza Naserasr; Aline Parreau (CoRR, 2010)

Extremal graphs for the identifying code problem. - Florent Foucaud; Eleonora Guerrini; Matjaz Kovse; Reza Naserasr; Aline Parreau; Petru Valicov (Eur. J. Comb., 2011)

Edge identifying codes. - Florent Foucaud; Sylvain Gravier; Reza Naserasr; Aline Parreau; Petru Valicov (Electron. Notes Discret. Math., 2011)

On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths. - Florent Foucaud; Matjaz Kovse (IWOCA, 2012)

Bounds for Identifying Codes in Terms of Degree Parameters. - Florent Foucaud; Guillem Perarnau (Electron. J. Comb., 2012)

On the size of identifying codes in triangle-free graphs. - Florent Foucaud; Ralf Klasing; Adrian Kosowski; André Raspaud (Discret. Appl. Math., 2012)

Locally identifying colourings for graphs with given maximum degree. - Florent Foucaud; Iiro S. Honkala; Tero Laihonen; Aline Parreau; Guillem Perarnau (Discret. Math., 2012)

Combinatorial and algorithmic aspects of identifying codes in graphs. (Aspects combinatoires et algorithmiques des codes identifiants dans les graphes). - Florent Foucaud (2012)

The Complexity of the Identifying Code Problem in Restricted Graph Classes. - Florent Foucaud (IWOCA, 2013)

Random subgraphs make identification affordable. - Florent Foucaud; Guillem Perarnau; Oriol Serra (CoRR, 2013)

Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets. - Florent Foucaud; Reza Naserasr; Aline Parreau (Graphs Comb., 2013)

Identifying path covers in graphs. - Florent Foucaud; Matjaz Kovse (J. Discrete Algorithms, 2013)

Identifying Codes in Line Graphs. - Florent Foucaud; Sylvain Gravier; Reza Naserasr; Aline Parreau; Petru Valicov (J. Graph Theory, 2013)

The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. - Florent Foucaud; Reza Naserasr (LATIN, 2014)

An improved lower bound for (1, ≤ 2)-identifying codes in the king grid. - Florent Foucaud; Tero Laihonen; Aline Parreau (Adv. Math. Commun., 2014)

Identification, location-domination and metric dimension on interval and permutation graphs. - Florent Foucaud; George B. Mertzios; Reza Naserasr; Aline Parreau; Petru Valicov (CoRR, 2014)

On the structure of arbitrarily partitionable graphs with given connectivity. - Olivier Baudon; Florent Foucaud; Jakub Przybylo; Mariusz Wozniak (Discret. Appl. Math., 2014)

Centroidal bases in graphs. - Florent Foucaud; Ralf Klasing; Peter J. Slater (Networks, 2014)

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. - Florent Foucaud; George B. Mertzios; Reza Naserasr; Aline Parreau; Petru Valicov (WG, 2015)

Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5. - Camino Balbuena; Florent Foucaud; Adriana Hansberg (Electron. J. Comb., 2015)

The complexity of signed graph and 2-edge-coloured graph homomorphisms. - Richard C. Brewster; Florent Foucaud; Pavol Hell; Reza Naserasr (CoRR, 2015)

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

Large Subgraphs without Short Cycles. - Florent Foucaud; Michael Krivelevich; Guillem Perarnau (SIAM J. Discret. Math., 2015)

On the Approximability of Partial VC Dimension. - Cristina Bazgan; Florent Foucaud; Florian Sikora (COCOA, 2016)

Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture. - Florent Foucaud; Michael A. Henning (Electron. J. Comb., 2016)

Locating-dominating sets in twin-free graphs. - Florent Foucaud; Michael A. Henning; Christian Löwenstein; Thomas Sasse (Discret. Appl. Math., 2016)

Location-domination and matching in cubic graphs. - Florent Foucaud; Michael A. Henning (Discret. Math., 2016)

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. - Florent Foucaud; George B. Mertzios; Reza Naserasr; Aline Parreau; Petru Valicov (Algorithmica, 2017)

The complexity of tropical graph homomorphisms. - Florent Foucaud; Ararat Harutyunyan; Pavol Hell; Sylvain Legay; Yannis Manoussakis; Reza Naserasr (Discret. Appl. Math., 2017)

The complexity of signed graph and edge-coloured graph homomorphisms. - Richard C. Brewster; Florent Foucaud; Pavol Hell; Reza Naserasr (Discret. Math., 2017)

Location-domination in line graphs. - Florent Foucaud; Michael A. Henning (Discret. Math., 2017)

Structural properties of recursively partitionable graphs with connectivity 2. - Olivier Baudon; Julien Bensmail; Florent Foucaud; Monika Pilsniak (Discuss. Math. Graph Theory, 2017)

Homomorphism bounds and edge-colourings of K4-minor-free graphs. - Laurent Beaudou; Florent Foucaud; Reza Naserasr (J. Comb. Theory B, 2017)

Parameterized and approximation complexity of the detection pair problem in graphs. - Florent Foucaud; Ralf Klasing (J. Graph Algorithms Appl., 2017)

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. - Florent Foucaud; George B. Mertzios; Reza Naserasr; Aline Parreau; Petru Valicov (Theor. Comput. Sci., 2017)

Complexity of Grundy coloring and its variants. - Édouard Bonnet; Florent Foucaud; Eun Jung Kim 002; Florian Sikora (Discret. Appl. Math., 2018)

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. - Laurent Beaudou; Peter Dankelmann; Florent Foucaud; Michael A. Henning; Arnaud Mary; Aline Parreau (SIAM J. Discret. Math., 2018)

Complexity of Conjunctive Regular Path Query Homomorphisms. - Laurent Beaudou; Florent Foucaud; Florent R. Madelaine; Lhouari Nourine; Gaétan Richard (CiE, 2019)

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (IPEC, 2019)

Broadcast domination and multipacking: bounds and the integrality gap. - Laurent Beaudou; Richard C. Brewster; Florent Foucaud (Australas. J Comb., 2019)

Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. - Laurent Beaudou; Florent Foucaud; Reza Naserasr (Discret. Appl. Math., 2019)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. - Antoine Dailly; Florent Foucaud; Adriana Hansberg (Discret. Math., 2019)

Parameterized and approximation complexity of Partial VC Dimension. - Cristina Bazgan; Florent Foucaud; Florian Sikora (Theor. Comput. Sci., 2019)

Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1. - Laurent Beaudou; Florent Foucaud; Reza Naserasr (CALDAM, 2020)

Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. - Dibyayan Chakraborty; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh; Bodhayan Roy (CALDAM, 2020)

Monitoring the Edges of a Graph Using Distances. - Florent Foucaud; Ralf Klasing; Mirka Miller; Joe Ryan 001 (CALDAM, 2020)

Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. - Dibyayan Chakraborty; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Dimitri Lajou; Bodhayan Roy (ISAAC, 2020)

Discriminating Codes in Geometric Setups. - Sanjana Dey; Florent Foucaud; Subhas C. Nandy; Arunabha Sen (ISAAC, 2020)

Complexity of planar signed graph homomorphisms to cycles. - François Dross; Florent Foucaud; Valia Mitsou; Pascal Ochem; Théo Pierron (Discret. Appl. Math., 2020)

Domination and location in twin-free digraphs. - Florent Foucaud; Shahrzad Heydarshahi; Aline Parreau (Discret. Appl. Math., 2020)

IWOCA 2020 in Bordeaux (Oops! On-Line!). - Florent Foucaud; Leszek Gasieniec; Ralf Klasing; Tomasz Radzik; Bill Smyth (Bull. EATCS, 2020)

Cliques in exact distance powers of graphs of given maximum degree. - Florent Foucaud; Suchismita Mishra 001; Narayanan Narayanan; Reza Naserasr; Petru Valicov (LAGOS, 2021)

On the Complexity of Broadcast Domination and Multipacking in Digraphs. - Florent Foucaud; Benjamin Gras 002; Anthony Perez 001; Florian Sikora (Algorithmica, 2021)

Characterizing extremal graphs for open neighbourhood location-domination. - Florent Foucaud; Narges Ghareghani; Aida Roshany-Tabrizi; Pouyeh Sharifani (Discret. Appl. Math., 2021)

Exact square coloring of subcubic planar graphs. - Florent Foucaud; Hervé Hocquard; Suchismita Mishra 001; Narayanan Narayanan; Reza Naserasr; Éric Sopena; Petru Valicov (Discret. Appl. Math., 2021)

Complexity and algorithms for injective edge-coloring in graphs. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou (Inf. Process. Lett., 2021)

Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. - Dibyayan Chakraborty; Antoine Dailly; Sandip Das 001; Florent Foucaud; Harmender Gahlawat; Subir Kumar Ghosh (ISAAC, 2022)

On Graphs Coverable by k Shortest Paths. - Maël Dumas; Florent Foucaud; Anthony Perez 001; Ioan Todinca (ISAAC, 2022)

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. - Florent Foucaud; Hervé Hocquard; Dimitri Lajou; Valia Mitsou; Théo Pierron (Algorithmica, 2022)

Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. - Laurent Beaudou; Florent Foucaud; Reza Naserasr (Discret. Appl. Math., 2022)

Monitoring the edges of a graph using distances. - Florent Foucaud; Shih-Shun Kao; Ralf Klasing; Mirka Miller; Joe Ryan 001 (Discret. Appl. Math., 2022)

Revisiting and Improving Upper Bounds for Identifying Codes. - Florent Foucaud; Tuomo Lehtilä (SIAM J. Discret. Math., 2022)

New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. - Dipayan Chakraborty; Florent Foucaud; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (CALDAM, 2023)

Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. - Sandip Das 001; Florent Foucaud; Sk Samim Islam; Joydeep Mukherjee (CALDAM, 2023)

Monitoring Edge-Geodetic Sets in Graphs. - Florent Foucaud; Krishna Narayanan; Lekshmi Ramasubramony Sulochana (CALDAM, 2023)

Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. - Dibyayan Chakraborty; Florent Foucaud; Anni Hakanen (FCT, 2023)

Identifying codes in bipartite graphs of given maximum degree. - Dipayan Chakraborty; Florent Foucaud; Tuomo Lehtilä (LAGOS, 2023)

Isometric Path Complexity of Graphs. - Dibyayan Chakraborty; Jérémie Chalopin; Florent Foucaud; Yann Vaxès (MFCS, 2023)

Algorithms and Hardness for Metric Dimension on Digraphs. - Antoine Dailly; Florent Foucaud; Anni Hakanen (WG, 2023)

Bounds and Extremal Graphs for Total Dominating Identifying Codes. - Florent Foucaud; Tuomo Lehtilä (Electron. J. Comb., 2023)

Extended Double Covers and Homomorphism Bounds of Signed Graphs. - Florent Foucaud; Reza Naserasr; Rongxing Xu (Electron. J. Comb., 2023)

Isometric path antichain covers: beyond hyperbolic graphs. - Dibyayan Chakraborty; Florent Foucaud (CoRR, 2023)

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (CoRR, 2023)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. - Sandip Das 001; Florent Foucaud; Sk Samim Islam; Joydeep Mukherjee (CoRR, 2023)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. - Laurent Beaudou; Caroline Brosse; Oscar Defrain; Florent Foucaud; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor (Discret. Math. Theor. Comput. Sci., 2023)

Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. - Sanjana Dey; Florent Foucaud; Subhas C. Nandy; Arunabha Sen (Algorithmica, 2023)

The RED-BLUE SEPARATION problem on graphs. - Subhadeep Ranjan Dev; Sanjana Dey; Florent Foucaud; Ralf Klasing; Tuomo Lehtilä (Theor. Comput. Sci., 2023)

Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. - Florent Foucaud; Pierre-Marie Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CALDAM, 2024)

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (ICALP, 2024)

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. - Dipayan Chakraborty; Florent Foucaud; Diptapriyo Majumdar; Prafullkumar Tale (ISAAC, 2024)

Algorithms and Complexity for Path Covers of Temporal DAGs. - Dibyayan Chakraborty; Antoine Dailly; Florent Foucaud; Ralf Klasing (MFCS, 2024)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? - Dibyayan Chakraborty; Antoine Dailly; Florent Foucaud; Ralf Klasing (CoRR, 2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Pierre-Marie Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CoRR, 2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Clara Marcille; R. B. Sandeep; Sagnik Sen 001; S. Taruni (CoRR, 2024)

On locating and neighbor-locating colorings of sparse graphs. - Dipayan Chakraborty; Florent Foucaud; Soumen Nandi; Sagnik Sen 001; D. K. Supraja (Discret. Appl. Math., 2024)

Extremal digraphs for open neighbourhood location-domination and identifying codes. - Florent Foucaud; Narges Ghareghani; Pouyeh Sharifani (Discret. Appl. Math., 2024)

Progress towards the two-thirds conjecture on locating-total dominating sets. - Dipayan Chakraborty; Florent Foucaud; Anni Hakanen; Michael A. Henning; Annegret Katrin Wagler (Discret. Math., 2024)

On Three Domination-based Identification Problems in Block Graphs. - Dipayan Chakraborty; Florent Foucaud; Aline Parreau; Annegret Wagler (Fundam. Informaticae, 2024)

On Graphs Coverable by k Shortest Paths. - Maël Dumas; Florent Foucaud; Anthony Perez 001; Ioan Todinca (SIAM J. Discret. Math., 2024)

Neighbourhood complexity of graphs of bounded twin-width. - Édouard Bonnet; Florent Foucaud; Tuomo Lehtilä; Aline Parreau (Eur. J. Comb., 2024)

Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth. - Florent Foucaud; Atrayee Majumder; Tobias Mömke; Aida Roshany-Tabrizi (CALDAM, 2025)

Structural Parameterization of Locating-Dominating Set and Test Cover. - Dipayan Chakraborty; Florent Foucaud; Diptapriyo Majumdar; Prafullkumar Tale (CIAC (1), 2025)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (STACS, 2025)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. - Florent Foucaud; Clara Marcille; Zin Mar Myint; R. B. Sandeep; Sagnik Sen 001; S. Taruni (Discret. Appl. Math., 2025)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number. - Dibyayan Chakraborty; Florent Foucaud; Anni Hakanen (Discret. Math., 2025)

Monitoring arc-geodetic sets of oriented graphs. - Tapas Das; Florent Foucaud; Clara Marcille; Pavan P. D; Sagnik Sen 001 (Theor. Comput. Sci., 2025)

Parameterizing path partitions. - Henning Fernau; Florent Foucaud; Kevin Mann; Utkarsh Padariya; Rajath Rao K. N (Theor. Comput. Sci., 2025)

Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs. - Laurent Beaudou; Jan Bok; Florent Foucaud; Daniel A. Quiroz; Jean-Florent Raymond (CoRR, 2025)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations. - Dibyayan Chakraborty; Florent Foucaud (CoRR, 2025)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes. - Florent Foucaud; Arti Pandey; Kaustav Paul (CoRR, 2025)

Locating-dominating partitions for some classes of graphs. - Florent Foucaud; Paras Maniya; Kaustav Paul; Dinabandhu Pradhan (CoRR, 2025)