Florent Foucaud
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
28
Venues
13
Active years
2012–2026
Best venue rank
A*
Where they publish
Papers
28 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | COCOON | Algorithms and Bounds for Path Covers of Tree-Structured Graphs. | Madhura Dutta, Florent Foucaud, Subhas C. Nandy |
| 2026 | MFCS | Structural Parameterizations of Geodetic Set on Directed (Acyclic) Graphs. | Laurent Beaudou, Florent Foucaud, Lucas Lorieau, Prafullkumar Tale |
| 2026 | WG | Parameterized Complexity of Isometric Path Partition: Treewidth and Diameter. | Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale |
| 2025 | CIAC | Structural Parameterization of Locating-Dominating Set and Test Cover. | Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale |
| 2025 | LAGOS | A polynomial-time algorithm recognizing exact cubes of trees. | Laurent Beaudou, Henry Echeverra, Florent Foucaud, Andrea Jimnez, Nikita Manuylenko, Anirudh Rachuri |
| 2025 | STACS | Metric Dimension and Geodetic Set Parameterized by Vertex Cover. | Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2024 | ICALP | Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. | Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2024 | ISAAC | Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. | Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale |
| 2024 | MFCS | Algorithms and Complexity for Path Covers of Temporal DAGs. | Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing |
| 2023 | CIAC | Parameterizing Path Partitions. | Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N |
| 2023 | FCT | Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. | Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen |
| 2023 | LAGOS | Identifying codes in bipartite graphs of given maximum degree. | Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtil |
| 2023 | MFCS | Isometric Path Complexity of Graphs. | Dibyayan Chakraborty, Jrmie Chalopin, Florent Foucaud, Yann Vaxs |
| 2023 | WG | Algorithms and Hardness for Metric Dimension on Digraphs. | Antoine Dailly, Florent Foucaud, Anni Hakanen |
| 2022 | ISAAC | Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. | Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh |
| 2022 | ISAAC | On Graphs Coverable by k Shortest Paths. | Mal Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca |
| 2022 | IWOCA | The Red-Blue Separation Problem on Graphs. | Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtil |
| 2021 | LAGOS | Cliques in exact distance powers of graphs of given maximum degree. | Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov |
| 2020 | ISAAC | Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. | Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy |
| 2020 | ISAAC | Discriminating Codes in Geometric Setups. | Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen |
| 2020 | IWOCA | On the Complexity of Broadcast Domination and Multipacking in Digraphs. | Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora |
| 2019 | CiE | Complexity of Conjunctive Regular Path Query Homomorphisms. | Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gatan Richard |
| 2016 | COCOA | On the Approximability of Partial VC Dimension. | Cristina Bazgan, Florent Foucaud, Florian Sikora |
| 2015 | COCOON | Complexity of Grundy Coloring and Its Variants. | Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora |
| 2015 | WG | 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 |
| 2014 | LATIN | The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. | Florent Foucaud, Reza Naserasr |
| 2013 | IWOCA | The Complexity of the Identifying Code Problem in Restricted Graph Classes. | Florent Foucaud |
| 2012 | IWOCA | On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths. | Florent Foucaud, Matjaz Kovse |