Florent Foucaud

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 94

Top Venues

University of Bordeaux, France (PHD)

Education History

University of Bordeaux, France

PHD

Publications

Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. CoRR (2024)
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS (2024)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. 358 (2024)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP (2024)
Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
Extremal digraphs for open neighbourhood location-domination and identifying codes. Discret. Appl. Math. 347 (2024)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR (2024)
Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. CALDAM (2024)
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Katrin Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets. Discret. Math. 347 (12) (2024)
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler
On Three Domination-based Identification Problems in Block Graphs. Fundam. Informaticae 191 (3-4) (2024)
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
Neighbourhood complexity of graphs of bounded twin-width. Eur. J. Comb. 115 (2024)
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR (2024)
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR (2024)
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
Neighbourhood complexity of graphs of bounded twin-width. CoRR (2023)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. 970 (2023)
Florent Foucaud, Reza Naserasr, Rongxing Xu
Extended Double Covers and Homomorphism Bounds of Signed Graphs. Electron. J. Comb. 30 (3) (2023)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica 85 (7) (2023)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR (2023)
Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. CALDAM (2023)
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. FCT (2023)
Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
Identifying codes in bipartite graphs of given maximum degree. LAGOS (2023)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM (2023)
Antoine Dailly, Florent Foucaud, Anni Hakanen
Algorithms and Hardness for Metric Dimension on Digraphs. WG (2023)
Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. CoRR (2023)
Dibyayan Chakraborty, Florent Foucaud
Isometric path antichain covers: beyond hyperbolic graphs. CoRR (2023)
Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
Extremal digraphs for open neighbourhood location-domination and identifying codes. CoRR (2023)
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
New bounds and constructions for neighbor-locating colorings of graphs. CoRR (2023)
Florent Foucaud, Tuomo Lehtilä
Bounds and Extremal Graphs for Total Dominating Identifying Codes. Electron. J. Comb. 30 (3) (2023)
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Katrin Wagler
On Three Domination-Based Identification Problems in Block Graphs. CALDAM (2023)
Antoine Dailly, Florent Foucaud, Anni Hakanen
Algorithms and hardness for Metric Dimension on digraphs. CoRR (2023)
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
Isometric Path Complexity of Graphs. MFCS (2023)
Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana
Monitoring Edge-Geodetic Sets in Graphs. CALDAM (2023)
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
Parameterizing Path Partitions. CIAC (2023)
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
Complexity of conjunctive regular path query homomorphisms. CoRR (2023)
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
Monitoring the edges of a graph using distances. Discret. Appl. Math. 319 (2022)
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
On graphs coverable by k shortest paths. CoRR (2022)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The Red-Blue Separation Problem on Graphs. IWOCA (2022)
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR (2022)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. Discret. Appl. Math. 319 (2022)
Florent Foucaud, Tuomo Lehtilä
Revisiting and Improving Upper Bounds for Identifying Codes. SIAM J. Discret. Math. 36 (4) (2022)
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs. CoRR (2022)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica 84 (5) (2022)
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
On Graphs Coverable by k Shortest Paths. ISAAC (2022)
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC (2022)
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
Parameterizing Path Partitions. CoRR (2022)
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
Exact square coloring of subcubic planar graphs. Discret. Appl. Math. 293 (2021)
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR (2021)
Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi, Pouyeh Sharifani
Characterizing extremal graphs for open neighbourhood location-domination. Discret. Appl. Math. 302 (2021)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
Complexity and algorithms for injective edge-coloring in graphs. Inf. Process. Lett. 170 (2021)
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
On the Complexity of Broadcast Domination and Multipacking in Digraphs. Algorithmica 83 (9) (2021)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
Complexity and algorithms for injective edge-coloring in graphs. CoRR (2021)
Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov
Cliques in exact distance powers of graphs of given maximum degree. LAGOS (2021)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC (2020)
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
Exact square coloring of subcubic planar graphs. CoRR (2020)
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
Monitoring the edges of a graph using distances. CoRR (2020)
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
On the Complexity of Broadcast Domination and Multipacking in Digraphs. IWOCA (2020)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Discriminating Codes in Geometric Setups. CoRR (2020)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
-Critical Graphs of Odd-Girth 2k+1. CALDAM (2020)
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR (2020)
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
On the complexity of Broadcast Domination and Multipacking in digraphs. CoRR (2020)
Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth
IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS 132 (2020)
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM (2020)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284 (2020)
Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau
Domination and location in twin-free digraphs. Discret. Appl. Math. 284 (2020)
Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan
Monitoring the Edges of a Graph Using Distances. CALDAM (2020)
Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
Discriminating Codes in Geometric Setups. ISAAC (2020)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Discret. Appl. Math. 261 (2019)
Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
Hardness and approximation for the geodetic set problem in some graph classes. CoRR (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR (2019)
Cristina Bazgan, Florent Foucaud, Florian Sikora
Parameterized and approximation complexity of Partial VC Dimension. Theor. Comput. Sci. 766 (2019)
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
Complexity of Conjunctive Regular Path Query Homomorphisms. CiE (2019)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. CoRR (2019)
Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau
Domination and location in twin-free digraphs. CoRR (2019)
Antoine Dailly, Florent Foucaud, Adriana Hansberg
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. Discret. Math. 342 (11) (2019)
Laurent Beaudou, Richard C. Brewster, Florent Foucaud
Broadcast domination and multipacking: bounds and the integrality gap. Australas. J Comb. 74 (2019)
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC (2019)
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. Discret. Math. 32 (2) (2018)
Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy coloring and its variants. Discret. Appl. Math. 243 (2018)
Antoine Dailly, Florent Foucaud, Adriana Hansberg
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. CoRR (2018)
Florent Foucaud, Ralf Klasing
Parameterized and approximation complexity of the detection pair problem in graphs. J. Graph Algorithms Appl. 21 (6) (2017)
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 (2017)
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229 (2017)
Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340 (2) (2017)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
-minor-free graphs. J. Comb. Theory, Ser. B 124 (2017)
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) (2017)
Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37 (1) (2017)
Florent Foucaud, Michael A. Henning
Location-domination in line graphs. Discret. Math. 340 (1) (2017)
Florent Foucaud, Michael A. Henning
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture. Electron. J. Comb. 23 (3) (2016)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
-minor-free graphs. CoRR (2016)
Florent Foucaud, Michael A. Henning, Christian Löwenstein, Thomas Sasse
Locating-dominating sets in twin-free graphs. Discret. Appl. Math. 200 (2016)
Florent Foucaud, Ralf Klasing
Parameterized and approximation complexity of the detection pair problem in graphs. CoRR (2016)
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. CoRR (2016)
Cristina Bazgan, Florent Foucaud, Florian Sikora
On the Approximability of Partial VC Dimension. CoRR (2016)
Florent Foucaud, Michael A. Henning
Location-domination and matching in cubic graphs. Discret. Math. 339 (4) (2016)
Cristina Bazgan, Florent Foucaud, Florian Sikora
On the Approximability of Partial VC Dimension. COCOA (2016)
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)
Florent Foucaud, Michael Krivelevich, Guillem Perarnau
Large Subgraphs without Short Cycles. SIAM J. Discret. Math. 29 (1) (2015)
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 (2015)
Camino Balbuena, Florent Foucaud, Adriana Hansberg
Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5. Electron. J. Comb. 22 (2) (2015)
Florent Foucaud
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. J. Discrete Algorithms 31 (2015)
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy Coloring and Its Variants. COCOON (2015)

Florent Foucaud.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Florent Foucaud