FF
Florent Foucaud
math.COcs.DMcs.DScs.CCcs.AIcs.CGcs.LG
On Valency
published · living versionsW_hqx4g89f·v1 · currentpublished
Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers
with Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing, Lucas Lorieau +1
1 version
Preprints & journals
77 papers in the corpus · 2010–2026Polynomial pathwidth for graphs vertex-coverable by few shortest paths and algorithms for quasi-shortest path covers2610.30458v1 · Li-Hsuan Chen, Florent Foucaud, Ling-Ju Hung et al.2026 · 0 citationsarXivon Valency
Parameterized Complexity of Isometric Path Cover: Treewidth and Diameter2610.22010v1 · Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud et al.2026 · 0 citationsarXiv
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set2610.03131v1 · Dipayan Chakraborty, Florent Foucaud, Michael A. Henning et al.2026 · 0 citationsThe Electronic Journal of Combinatorics 33(1): #P1.51 (2026)
Neighbourhood complexity and identification problems for graphs of bounded treewidth and pathwidth2607.16889v1 · Ga'etan Berthe, Florent Foucaud, Tuomo Lehtila et al.2026 · 0 citationsarXiv
Algorithms and complexity for geodetic sets on interval and chordal graphs2606.30882v1 · Dibyayan Chakraborty, Sandip Das, Florent Foucaud et al.2026 · 0 citationsInformation and Computation 311:105456, 2026
Structural parameterizations of Geodetic Set on directed (acyclic) graphs2606.26414v2 · Laurent Beaudou, Florent Foucaud, Lucas Lorieau et al.2026 · 0 citationsarXiv
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs2603.23193v3 · Florent Foucaud, Narges Ghareghani, Lucas Lorieau et al.2026 · 0 citationsarXiv
Locating-dominating coalitions in graphs2602.18760v2 · M. Chellali, A. A. Dobrynin, F. Foucaud et al.2026 · 0 citationsarXiv
Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth2511.07160v1 · Florent Foucaud, Atrayee Majumder, Tobias Momke et al.2025 · 0 citationsarXiv
The Parameterized Complexity of Computing the VC-Dimension2510.17451v2 · Florent Foucaud, Harmender Gahlawat, Fionn Mc Inerney et al.2025 · 0 citationsarXiv
Distance-based (and path-based) covering problems for graphs of given cyclomatic number2509.00383v1 · Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen2025 · 3 citationsDiscrete Mathematics 348(11):114595, 2025
Parameterized complexity of isometric path partition: treewidth and diameter2508.05448v2 · Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud et al.2025 · 0 citationsarXiv
Locating-dominating partitions for some classes of graphs2506.12933v2 · Florent Foucaud, Paras Vinubhai Maniya, Kaustav Paul et al.2025 · 0 citationsDiscrete Mathematics 349 (2026) 114886
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes2503.06086v1 · Florent Foucaud, Arti Pandey, Kaustav Paul2025 · 1 citationarXiv
Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations2501.10828v2 · Dibyayan Chakraborty, Florent Foucaud2025 · 0 citationsarXiv
Structural Parameterization of Locating-Dominating Set and Test Cover2411.17948v1 · Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar et al.2024 · 1 citationarXiv
Algorithms and complexity for monitoring edge-geodetic sets in graphs2409.19067v2 · Florent Foucaud, Clara Marcille, R. B. Sandeep et al.2024 · 4 citationsarXiv
Monitoring arc-geodetic sets of oriented graphs2409.00350v2 · Tapas Das, Florent Foucaud, Clara Marcille et al.2024 · 1 citationTheoretical Computer Science 1031:115079, 2025
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree2407.09692v2 · Dipayan Chakraborty, Florent Foucaud, Michael A. Henning2024 · 0 citationsDiscrete Applied Mathematics 386: 319-333 (2026)
Metric Dimension and Geodetic Set Parameterized by Vertex Cover2405.01344v2 · Florent Foucaud, Esther Galby, Liana Khazaliya et al.2024 · 2 citationsarXiv
Identifying codes in triangle-free graphs of bounded maximum degree2403.17877v4 · Dipayan Chakraborty, Florent Foucaud, Michael A. Henning et al.2024 · 0 citationsJournal of Graph Theory 112(3) 306-336 (2026)
Identifying codes in graphs of given maximum degree: Characterizing trees2403.13172v3 · Dipayan Chakraborty, Florent Foucaud, Michael A. Henning et al.2024 · 2 citationsDiscrete Mathematics, Volume 349, Issue 2, February 2026, 114826
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs2403.09122v2 · Florent Foucaud, Clara Marcille, Zin Mar Myint et al.2024 · 8 citationsDiscrete Applied Mathematics, 366:106-119 (2025)
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?2403.04589v1 · Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud et al.2024 · 0 citationsarXiv
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs2312.10485v2 · Sandip Das, Florent Foucaud, Sk Samim Islam et al.2023 · 0 citationsDiscrete Applied Mathematics 386:184-194, 2026
Algorithms and hardness for Metric Dimension on digraphs2307.09389v2 · Antoine Dailly, Florent Foucaud, Anni Hakanen2023 · 1 citationJournal of Computer and System Sciences, 158 (2026), 103776
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover2307.08149v5 · Florent Foucaud, Esther Galby, Liana Khazaliya et al.2023 · 5 citationsarXiv
Extremal digraphs for open neighbourhood location-domination and identifying codes2302.02152v2 · Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani2023 · 2 citationsDiscrete Applied Mathematics 347:62-74, 2024
On locating and neighbor-locating colorings of sparse graphs2301.13557v3 · Dipayan Chakraborty, Florent Foucaud, Soumen Nandi et al.2023 · 0 citationsDiscrete Applied Mathematics 358 (2024): 366-381
Neighbourhood complexity of graphs of bounded twin-width2301.04217v2 · 'Edouard Bonnet, Florent Foucaud, Tuomo Lehtila et al.2023 · 7 citationsEuropean Journal of Combinatorics 115:103772, 2024
Isometric path complexity of graphs2301.00278v5 · Dibyayan Chakraborty, J'er'emie Chalopin, Florent Foucaud et al.2022 · 1 citationDiscrete Mathematics 349(2):114743, 2026
Parameterizing Path Partitions2212.11653v3 · Henning Fernau, Florent Foucaud, Kevin Mann et al.2022 · 11 citationsTheoretical Computer Science 1028:115029, 2025
Progress towards the two-thirds conjecture on locating-total dominating sets2211.14178v2 · Dipayan Chakraborty, Florent Foucaud, Anni Hakanen et al.2022 · 0 citationsDiscrete Mathematics 347 (2024), 114176
The RED-BLUE SEPARATION problem on graphs2211.08283v1 · Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud et al.2022 · 3 citationsTheoretical Computer Science 970:114061, 2023
Monitoring edge-geodetic sets in graphs2210.03774v3 · Subhadeep R. Dev, Sanjana Dey, Florent Foucaud et al.2022 · 2 citationsDiscrete Applied Mathematics 377:598-610, 2025
On graphs coverable by k shortest paths2206.15088v2 · Mael Dumas, Florent Foucaud, Anthony Perez et al.2022 · 6 citationsSIAM Journal on Discrete Mathematics 38(2):1840-1862, 2024
Bounds and extremal graphs for total dominating identifying codes2206.09481v2 · Florent Foucaud, Tuomo Lehtila2022 · 3 citationsThe Electronic Journal of Combinatorics 30(3):P3.15, 2023
Revisiting and improving upper bounds for identifying codes2204.05250v2 · Florent Foucaud, Tuomo Lehtila2022 · 6 citationsSIAM Journal on Discrete Mathematics 36(4):2619-2634, 2022
Extended Double Covers and Homomorphism Bounds of Signed Graphs2110.14176v1 · Florent Foucaud, Reza Naserasr, Rongxing Xu2021 · 0 citationsThe Electronic Journal of Combinatorics 30(3):P3.31, 2023
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly2110.14003v5 · Laurent Beaudou, Caroline Brosse, Oscar Defrain et al.2021 · 0 citationsDiscrete Mathematics & Theoretical Computer Science, vol. 25:2, Graph Theory (April 2, 2024) dmtcs:8715
Complexity and algorithms for injective edge-coloring in graphs2104.08003v1 · Florent Foucaud, Herv'e Hocquard, Dimitri Lajou2021 · 23 citationsInformation Processing Letters 170:106121, 2021
Characterizing extremal graphs for open neighbourhood location-domination2101.05322v2 · Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi et al.2021 · 9 citationsDiscrete Applied Mathematics 302:76-79, 2021
Monitoring the edges of a graph using distances2011.00029v2 · Florent Foucaud, Shih-Shun Kao, Ralf Klasing et al.2020 · 41 citationsDiscrete Applied Mathematics 319:424-438, 2022
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups2009.10353v2 · Sanjana Dey, Florent Foucaud, Subhas C Nandy et al.2020 · 3 citationsAlgorithmica 85(7):1850-1882, 2023
Exact square coloring of subcubic planar graphs2009.00843v3 · Florent Foucaud, Herv'e Hocquard, Suchismita Mishra et al.2020 · 12 citationsDiscrete Applied Mathematics 293:74-89, 2021
On the complexity of Broadcast Domination and Multipacking in digraphs2003.10570v2 · Florent Foucaud, Benjamin Gras, Anthony Perez et al.2020 · 7 citationsAlgorithmica 83(9):2651-2677, 2021
Domination and location in twin-free digraphs1910.05311v2 · Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau2019 · 7 citationsDiscrete Applied Mathematics 284:42-52, 2020
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity1910.01099v2 · Florent Foucaud, Herv'e Hocquard, Dimitri Lajou et al.2019 · 0 citationsAlgorithmica 84:1183-1212, 2022
Hardness and approximation for the geodetic set problem in some graph classes1909.08795v1 · Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat et al.2019 · 11 citationsProceedings CALDAM 2020. Lecture Notes in Computer Science 12016:102-115, 2020
Complexity of planar signed graph homomorphisms to cycles1907.03266v2 · Francois Dross, Florent Foucaud, Valia Mitsou et al.2019 · 5 citationsDiscrete Applied Mathematics 284:166-178, 2020
Career total: 139 works. 77 are in this corpus.Showing the 50 most recent.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.