Florent Foucaud

Publications

Article dans une revue (60)

Algorithms and hardness for Metric Dimension on digraphs Antoine Dailly,Florent Foucaud,Anni Hakanen Journal of Computer and System Sciences, 2026, 158, pp.103776. ⟨10.1016/j.jcss.2026.103776⟩ Article dans une revue hal-04996353v2
Identifying codes in graphs of given maximum degree: Characterizing trees Dipayan Chakraborty,Florent Foucaud,Michael Henning,Tuomo Lehtilä Discrete Mathematics, 2026, 349 (2), pp.114826. ⟨10.1016/j.disc.2025.114826⟩ Article dans une revue hal-04998828v1
Isometric path complexity of graphs Dibyayan Chakraborty,Jérémie Chalopin,Florent Foucaud,Yann Vaxès Discrete Mathematics, 2026, 349 (2), pp.114743. ⟨10.1016/j.disc.2025.114743⟩ Article dans une revue hal-04999380v1
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs Sandip Das,Florent Foucaud,Sk Samim Islam,Joydeep Mukherjee Discrete Applied Mathematics, 2026, 386, pp.184-194. ⟨10.1016/j.dam.2026.02.006⟩ Article dans une revue hal-04999387v1
A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set Dipayan Chakraborty,Florent Foucaud,Michael Antony Henning,Tero Laihonen The Electronic Journal of Combinatorics, 2026, 33 (1), ⟨10.37236/14049⟩ Article dans une revue hal-05022831v2
Locating-dominating partitions for some classes of graphs Florent Foucaud,Paras Vinubhai Maniya,Kaustav Paul,Dinabandhu Pradhan Discrete Mathematics, 2026, 349 (3), pp.114886. ⟨10.1016/j.disc.2025.114886⟩ Article dans une revue hal-05383647v1
Identifying open codes in trees and 4-cycle-free graphs of given maximum degree Dipayan Chakraborty,Florent Foucaud,Michael Henning Discrete Applied Mathematics, 2026, 386, pp.319-333. ⟨10.1016/j.dam.2026.02.032⟩ Article dans une revue hal-04998649v1
Parameterizing Path Partitions Henning Fernau,Florent Foucaud,Kevin Mann,Utkarsh Padariya,Rajath Rao K.N. Theoretical Computer Science, 2025, 1028, pp.115029. ⟨10.1016/j.tcs.2024.115029⟩ Article dans une revue hal-04852374v1
Monitoring arc-geodetic sets of oriented graphs Tapas Das,Florent Foucaud,Clara Marcille,P.D. Pavan,Sagnik Sen Theoretical Computer Science, 2025, 1031, pp.115079. ⟨10.1016/j.tcs.2025.115079⟩ Article dans une revue hal-04894551v2
Distance-based (and path-based) covering problems for graphs of given cyclomatic number Dibyayan Chakraborty,Florent Foucaud,Anni Hakanen Discrete Mathematics, 2025, 348 (11), pp.114595. ⟨10.1016/j.disc.2025.114595⟩ Article dans une revue hal-05081111v1
Monitoring edge-geodetic sets in graphs Subhadeep Dev,Sanjana Dey,Florent Foucaud,Krishna Narayanan,Lekshmi Ramasubramony Sulochana Discrete Applied Mathematics, In press, 377, pp.598-610. ⟨10.1016/j.dam.2025.08.041⟩ Article dans une revue hal-04999331v1
On three domination-based identification problems in block graphs Dipayan Chakraborty,Florent Foucaud,Aline Parreau,Annegret K Wagler Fundamenta Informaticae, 2024, 191 (3-4), pp.197-229. ⟨10.3233/FI-242179⟩ Article dans une revue hal-03809986v2
On locating and neighbor-locating colorings of sparse graphs Dipayan Chakraborty,Florent Foucaud,Soumen Nandi,Sagnik Sen,D.K. Supraja Discrete Applied Mathematics, 2024, 358, pp.366-381. ⟨10.1016/j.dam.2024.07.012⟩ Article dans une revue hal-04665507v1
On Graphs Coverable by k Shortest Paths Maël Dumas,Florent Foucaud,Anthony Perez,Ioan Todinca SIAM Journal on Discrete Mathematics, 2024, 38 (2), pp.1840-1862. ⟨10.1137/23M1564511⟩ Article dans une revue hal-04611604v1
Extremal digraphs for open neighbourhood location-domination and identifying codes Florent Foucaud,Narges Ghareghani,Pouyeh Sharifani Discrete Applied Mathematics, In press, 347, pp.62-74. ⟨10.1016/j.dam.2023.12.018⟩ Article dans une revue hal-04398730v1
Neighbourhood complexity of graphs of bounded twin-width Édouard Bonnet,Florent Foucaud,Tuomo Lehtilä,Aline Parreau European Journal of Combinatorics, 2024, 115, pp.103772. ⟨10.1016/j.ejc.2023.103772⟩ Article dans une revue hal-04177614v1
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 Lagoutteet al. Discrete Mathematics and Theoretical Computer Science, 2024, vol. 25:2 (Graph Theory), ⟨10.46298/dmtcs.8715⟩ Article dans une revue hal-03406709v1
Extended Double Covers and Homomorphism Bounds of Signed Graphs Florent Foucaud,Reza Naserasr,Rongxing Xu The Electronic Journal of Combinatorics, 2023, 30 (3), pp.P3.31. ⟨10.37236/10754⟩ Article dans une revue hal-03356591v2
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups Sanjana Dey,Florent Foucaud,Subhas Nandy,Arunabha Sen Algorithmica, 2023, 85 (7), pp.1850-1882. ⟨10.1007/s00453-022-01073-0⟩ Article dans une revue hal-04145915v1
The RED-BLUE SEPARATION problem on graphs Subhadeep Ranjan Dev,Sanjana Dey,Florent Foucaud,Ralf Klasing,Tuomo Lehtilä Theoretical Computer Science, 2023, 970, pp.114061. ⟨10.1016/j.tcs.2023.114061⟩ Article dans une revue hal-03854400v1
Bounds and Extremal Graphs for Total Dominating Identifying Codes Florent Foucaud,Tuomo Lehtilä The Electronic Journal of Combinatorics, 2023, 30 (3), ⟨10.37236/11342⟩ Article dans une revue hal-04173548v1
Smallest $C_{2l+1}$-critical graphs of odd-girth $2k+1$ Laurent Beaudou,Florent Foucaud,Reza Naserasr Discrete Applied Mathematics, 2022, 319, pp.564 - 575. ⟨10.1016/j.dam.2021.08.040⟩ Article dans une revue hal-03784719v1
Revisiting and Improving Upper Bounds for Identifying Codes Florent Foucaud,Tuomo Lehtilä SIAM Journal on Discrete Mathematics, 2022, 36 (4), pp.2619-2634. ⟨10.1137/22M148999X⟩ Article dans une revue hal-03849449v1
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, 84 (5), pp.1183-1212. ⟨10.1007/s00453-021-00918-4⟩ Article dans une revue hal-03658581v1
Monitoring the edges of a graph using distances Florent Foucaud,Shih-Shun Kao,Ralf Klasing,Mirka Miller,Joe Ryan Discrete Applied Mathematics, 2022, 319, pp.425-438 Article dans une revue hal-03043870v2
Problems Related to a Conjecture on Location-Domination in Twin-Free Graphs Florent Foucaud Indian Journal of Discrete Mathematics, 2022, 8 (1), pp.39-41 Article dans une revue hal-03784417v1
Exact square coloring of subcubic planar graphs Florent Foucaud,Hervé Hocquard,Suchismita Mishra,Narayanan Narayanan,Reza Naserasret al. Discrete Applied Mathematics, 2021, 293, pp.74-89. ⟨10.1016/j.dam.2021.01.007⟩ Article dans une revue hal-02925881v3
Complexity and algorithms for injective edge-coloring in graphs Florent Foucaud,Hervé Hocquard,Dimitri Lajou Information Processing Letters, 2021, 170, pp.106121. ⟨10.1016/j.ipl.2021.106121⟩ Article dans une revue hal-03201544v1
Characterizing extremal graphs for open neighbourhood location-domination Florent Foucaud,Narges Ghareghani,Aida Roshany-Tabrizi,Pouyeh Sharifani Discrete Applied Mathematics, 2021, 302, pp.76-79. ⟨10.1016/j.dam.2021.06.006⟩ Article dans une revue hal-03540625v1
Domination and location in twin-free digraphs Florent Foucaud,Shahrzad Heydarshahi,Aline Parreau Discrete Applied Mathematics, 2020, 284, pp.42-52. ⟨10.1016/j.dam.2020.03.025⟩ Article dans une revue hal-03041356v1
Complexity of planar signed graph homomorphisms to cycles François Dross,Florent Foucaud,Valia Mitsou,Pascal Ochem,Théo Pierron Discrete Applied Mathematics, 2020, 284, pp.166-178. ⟨10.1016/j.dam.2020.03.029⟩ Article dans une revue hal-02990576v1
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs Antoine Dailly,Florent Foucaud,Adriana Hansberg Discrete Mathematics, 2019, 342 (11), pp.3142-3159. ⟨10.1016/j.disc.2019.06.023⟩ Article dans une revue hal-01959683v1
Broadcast domination and multipacking: bounds and the integrality gap Laurent Beaudou,Richard C. Brewster,Florent Foucaud The Australasian Journal of Combinatorics, 2019, 74 (1), pp.86-97 Article dans une revue hal-03041313v1
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 Discrete Applied Mathematics, 2019, 261, pp.40-51. ⟨10.1016/j.dam.2018.09.004⟩ Article dans une revue hal-01915269v1
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 Antony Henning,Arnaud Maryet al. SIAM Journal on Discrete Mathematics, 2018, 32 (2), pp.902 - 918. ⟨10.1137/16M1097833⟩ Article dans une revue hal-01848648v1
Complexity of Grundy coloring and its variants Edouard Bonnet,Florent Foucaud,Eunjung Kim,Florian Sikora Discrete Applied Mathematics, 2018, 243, pp.99-114. ⟨10.1016/j.dam.2017.12.022⟩ Article dans une revue hal-01991659v1
Random subgraphs make identification affordable Florent Foucaud,Guillem Perarnau,Oriol Serra Journal of Combinatorics, 2017, 8 (1), pp.57-77. ⟨10.4310/JOC.2017.v8.n1.a3⟩ Article dans une revue hal-03041297v1
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds Florent Foucaud,George B. Mertzios,Reza Naserasr,Aline Parreau,Petru Valicov Theoretical Computer Science, 2017, 668, pp.43-58. ⟨10.1016/j.tcs.2017.01.006⟩ Article dans une revue hal-01198783v1
Structural properties of recursively partitionable graphs with connectivity 2 Olivier Baudon,Julien Bensmail,Florent Foucaud,Monika Pilsniak Discussiones Mathematicae Graph Theory, 2017, 37, pp.89-115. ⟨10.7151/dmgt.1925⟩ Article dans une revue hal-00672505v4
Parameterized and approximation complexity of the detection pair problem in graphs Florent Foucaud,Ralf Klasing Journal of Graph Algorithms and Applications, 2017, 21 (6), pp.1039 - 1056. ⟨10.7155/jgaa.00449⟩ Article dans une revue hal-01871140v1
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, 78 (3), pp.914-944. ⟨10.1007/s00453-016-0184-1⟩ Article dans une revue hal-01198784v1
Location-domination in line graphs Florent Foucaud,Michael Henning Discrete Mathematics, 2017, 340 (1), pp.3140-3153. ⟨10.1016/j.disc.2016.05.020⟩ Article dans une revue hal-03041286v1
Homomorphism bounds and edge-colourings of K4-minor-free graphs Laurent Beaudou,Florent Foucaud,Reza Naserasr Journal of Combinatorial Theory, Series B, 2017, 124, pp.128-164. ⟨10.1016/j.jctb.2017.01.001⟩ Article dans une revue hal-01520741v1
The complexity of tropical graph homomorphisms. Florent Foucaud,Ararat Harutyunyan,Pavol Hell,Sylvain Legay,Yannis Manoussakiset al. Discrete Applied Mathematics, 2017, 229, pp.64-81. ⟨10.1016/j.dam.2017.04.027⟩ Article dans une revue hal-01520739v1
Locating-total dominating sets in twin-free graphs: a conjecture Florent Foucaud,Michael A. Henning The Electronic Journal of Combinatorics, 2016, 23 (3), pp.P3.9 Article dans une revue hal-03041282v1
Location-domination and matching in cubic graphs Florent Foucaud,Michael Henning Discrete Mathematics, 2016, 339 (4), pp.1221-1231. ⟨10.1016/j.disc.2015.11.016⟩ Article dans une revue hal-03041274v1
Locating–dominating sets in twin-free graphs Florent Foucaud,Michael Henning,Christian Löwenstein,Thomas Sasse Discrete Applied Mathematics, 2016, 200, pp.52-58. ⟨10.1016/j.dam.2015.06.038⟩ Article dans une revue hal-03041273v1
Locating-dominating sets and identifying codes in graphs of girth at least 5 Camino Balbuena,Florent Foucaud,Adriana Hansberg The Electronic Journal of Combinatorics, 2015, 22 (2), pp.P2.15 Article dans une revue hal-03041268v1
Large Subgraphs without Short Cycles Florent Foucaud,M. Krivelevich,G. Perarnau SIAM Journal on Discrete Mathematics, 2015, 29 (1), pp.65-78. ⟨10.1137/140954416⟩ Article dans une revue hal-03041235v1
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes Florent Foucaud Journal of Discrete Algorithms, 2015, 31, pp.48-68 Article dans une revue hal-00923356v1
On the structure of arbitrarily partitionable graphs with given connectivity Olivier Baudon,Florent Foucaud,Jakub Przybylo,Mariusz Woźniak Discrete Applied Mathematics, 2014, 162, pp.381-385. ⟨10.1016/j.dam.2013.09.007⟩ Article dans une revue hal-00918947v1
Centroidal bases in graphs Florent Foucaud,Ralf Klasing,Peter J. Slater Networks, 2014, 64 (2), pp.96-108. ⟨10.1002/net.21560⟩ Article dans une revue hal-01428804v1
An improved lower bound for (1,&lt;=2)-identifying codes in the king grid Florent Foucaud,Tero Laihonen,Aline Parreau Advances in Mathematics of Communications, 2014, 8 (1), pp.35-52. ⟨10.3934/amc.2014.8.35⟩ Article dans une revue hal-00639998v1
Identifying path covers in graphs Florent Foucaud,Matjaz Kovse Journal of Discrete Algorithms, 2013, 23, pp.21-34. ⟨10.1016/j.jda.2013.07.006⟩ Article dans une revue hal-00957969v1
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets Florent Foucaud,Reza Naserasr,Aline Parreau Graphs and Combinatorics, 2013, 29 (3), pp.463-473. ⟨10.1007/s00373-012-1136-4⟩ Article dans une revue hal-00526446v3
Identifying codes in line graphs Florent Foucaud,Sylvain Gravier,Reza Naserasr,Aline Parreau,Petru Valicov Journal of Graph Theory, 2013, 73 (4), pp.425-448. ⟨10.1002/jgt.21686⟩ Article dans une revue hal-00605406v2
Bounds for identifying codes in terms of degree parameters Florent Foucaud,Guillem Perarnau The Electronic Journal of Combinatorics, 2012, 19, pp.P32 Article dans une revue hal-00578230v5
Locally identifying colourings for graphs with given maximum degree Florent Foucaud,Iiro Honkala,Tero Laihonen,Aline Parreau,Guillem Perarnau Discrete Mathematics, 2012, 312 (10), pp.1832--1837. ⟨10.1016/j.disc.2012.01.034⟩ Article dans une revue hal-00614513v2
On the size of identifying codes in triangle-free graphs Florent Foucaud,Ralf Klasing,Adrian Kosowski,André Raspaud Discrete Applied Mathematics, 2012, 160 (10-11), pp.1532-1546. ⟨10.1016/j.dam.2012.02.009⟩ Article dans une revue hal-00530172v3
Extremal graphs for the identifying code problem Florent Foucaud,Eleonora Guerrini,Matjaz Kovse,Reza Naserasr,Aline Parreauet al. European Journal of Combinatorics, 2011, 32 (4), pp.628-638. ⟨10.1016/j.ejc.2011.01.002⟩ Article dans une revue hal-00477467v4

Communication dans un congrès (38)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs Florent Foucaud,Narges Ghareghani,Lucas Lorieau,Morteza Mohammad-Noori,Rasa Parvini Oskueiet al. 12th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2026), Feb 2026, Dharwad, Karnataka, India. pp.179-193, ⟨10.1007/978-3-032-17156-6_14⟩ Communication dans un congrès hal-05485784v1
A polynomial-time algorithm recognizing exact cubes of trees Laurent Beaudou,Henry Echeverría,Florent Foucaud,Andrea Jiménez,Nikita Manuylenkoet al. 13th Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 2025), Nov 2025, Buenos Aires, Argentina. pp.86-93, ⟨10.1016/j.procs.2025.10.284⟩ Communication dans un congrès hal-05383639v1
Metric Dimension and Geodetic Set Parameterized by Vertex Cover Florent Foucaud,Esther Galby,Liana Khazaliya,Shaohua Li,Fionn Mc Inerneyet al. 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Mar 2025, Jena, Germany. pp.33, ⟨10.4230/LIPIcs.STACS.2025.33⟩ Communication dans un congrès hal-04963873v1
Structural Parameterization of Locating-Dominating Set and Test Cover Dipayan Chakraborty,Florent Foucaud,Diptapriyo Majumdar,Prafullkumar Tale Proceedings of the 14th International Conference on Algorithms and Complexity (CIAC 2025), Jun 2025, Rome, Italy. pp.187-204, ⟨10.1007/978-3-031-92932-8_13⟩ Communication dans un congrès hal-05071838v1
Polynomial-time algorithms for Path Cover on trees and graphs of bounded treewidth Florent Foucaud,Atrayee Majumder,Tobias Mömke,Aida Roshany-Tabrizi 10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2025), Feb 2025, Coimbatore, India. pp.147-159, ⟨10.1007/978-3-031-83438-7_13⟩ Communication dans un congrès hal-04931788v1
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity Florent Foucaud,Clara Marcille,Zin Mar Myint,R. B. Sandeep,Sagnik Senet al. 10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2024), Feb 2024, Bhilai, India. pp.29-43, ⟨10.1007/978-3-031-52213-0_3⟩ Communication dans un congrès hal-04396469v2
Algorithms and Complexity for Path Covers of Temporal DAGs Dibyayan Chakraborty,Antoine Dailly,Florent Foucaud,Ralf Klasing Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), Aug 2024, Bratislava, Slovakia. pp.38:1-38:17, ⟨10.4230/LIPIcs.MFCS.2024.38⟩ Communication dans un congrès hal-04675995v1
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover Dipayan Chakraborty,Florent Foucaud,Diptapriyo Majumdar,Prafullkumar Tale Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 2024), Dec 2024, Sydney, Australia. pp.19:1-19:18, ⟨10.4230/LIPIcs.ISAAC.2024.19⟩ Communication dans un congrès hal-04820017v1
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 Inerneyet al. Proceedings of the 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2024), Jul 2024, Talinn, Estonia. pp.66:1-66:19, ⟨10.4230/LIPIcs.ICALP.2024.66⟩ Communication dans un congrès hal-04631780v1
Algorithms and Hardness for Metric Dimension on Digraphs Antoine Dailly,Florent Foucaud,Anni Hakanen 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023), Jun 2023, fribourg, Switzerland. pp.232-245, ⟨10.1007/978-3-031-43380-1_17⟩ Communication dans un congrès hal-04216265v2
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs Dipayan Chakraborty,Florent Foucaud,Soumen Nandi,Sagnik Sen,D K Supraja 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023), Feb 2023, Gandhinagar, India. pp.121-133, ⟨10.1007/978-3-031-25211-2_9⟩ Communication dans un congrès hal-03965313v1
Monitoring edge-geodetic sets in graphs Florent Foucaud,Krishna Narayanan,Lekshmi Ramasubramony Sulochana 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023), Feb 2023, Gandhinagar, India. pp.245-256, ⟨10.1007/978-3-031-25211-2_19⟩ Communication dans un congrès hal-03812622v1
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number Dibyayan Chakraborty,Florent Foucaud,Anni Hakanen 24th International Symposium on Fundamentals of Computation Theory (FCT 2023), Sep 2023, Trier, Germany. pp.132-146, ⟨10.1007/978-3-031-43587-4_10⟩ Communication dans un congrès hal-04214541v1
Identifying codes in bipartite graphs of given maximum degree Dipayan Chakraborty,Florent Foucaud,Tuomo Lehtilä 12th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023), Sep 2023, Huatulco, Oaxaca, México, Mexico. pp.157-165, ⟨10.1016/j.procs.2023.08.225⟩ Communication dans un congrès hal-04213143v1
Isometric Path Complexity of Graphs Dibyayan Chakraborty,Jérémie Chalopin,Florent Foucaud,Yann Vaxès 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Aug 2023, Bordeaux, France. pp.32:1-32:14, ⟨10.4230/LIPIcs.MFCS.2023.32⟩ Communication dans un congrès hal-04184516v1
Parameterizing Path Partitions Henning Fernau,Florent Foucaud,Kevin Mann,Utkarsh Padariya,K. N. Rajath Rao 13th International Conference on Algorithms and Complexity (CIAC 2023), Jun 2023, Larnaca, Cyprus. pp.187-201, ⟨10.1007/978-3-031-30448-4_14⟩ Communication dans un congrès hal-04085831v3
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs Sandip Das,Florent Foucaud,Sk Samim Islam,Joydeep Mukherjee 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023), Feb 2023, Gandhinagar, India. pp.297-308, ⟨10.1007/978-3-031-25211-2_23⟩ Communication dans un congrès hal-03974126v1
On Three Domination-Based Identification Problems in Block Graphs Dipayan Chakraborty,Florent Foucaud,Aline Parreau,Annegret Wagler 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023), Feb 2023, Gandhinagar, India. pp.271-283, ⟨10.1007/978-3-031-25211-2_21⟩ Communication dans un congrès hal-03974121v1
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond Dibyayan Chakraborty,Antoine Dailly,Sandip Das,Florent Foucaud,Harmender Gahlawatet al. 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, France. pp.12:1--12:17, ⟨10.4230/LIPIcs.ISAAC.2022.12⟩ Communication dans un congrès hal-03899912v1
On graphs coverable by k shortest paths Maël Dumas,Florent Foucaud,Anthony Perez,Ioan Todinca 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, South Korea. pp.40:1--40:15, ⟨10.4230/LIPIcs.ISAAC.2022.40⟩ Communication dans un congrès hal-03895886v1
The Red-Blue Separation Problem on Graphs Subhadeep Ranjan Dev,Sanjana Dey,Florent Foucaud,Ralf Klasing,Tuomo Lehtilä IWOCA 2022, Jun 2022, Trier, Germany. pp.285-298, ⟨10.1007/978-3-031-06678-8_21⟩ Communication dans un congrès hal-03711361v1
Cliques in exact distance powers of graphs of given maximum degree Florent Foucaud,Suchismita Mishra,Narayanan Narayanan,Reza Naserasr,Petru Valicov LAGOS 2021 - 11th Latin and American Algorithms, Graphs and Optimisation Symposium, May 2021, Sao Paulo, Brazil. pp.427-436, ⟨10.1016/j.procs.2021.11.052⟩ Communication dans un congrès hal-03540673v1
On the Complexity of Broadcast Domination and Multipacking in Digraphs Florent Foucaud,Benjamin Gras,Anthony Perez,Florian Sikora Combinatorial Algorithms - 31st International Workshop, Jun 2020, Bordeaux, France. pp.264-276, ⟨10.1007/978-3-030-48966-3_20⟩ Communication dans un congrès hal-02793880v1
Smallest $C_{2l+1}$-Critical Graphs of Odd-Girth $2k+1$ Laurent Beaudou,Florent Foucaud,Reza Naserasr 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.184-196, ⟨10.1007/978-3-030-39219-2_16⟩ Communication dans un congrès hal-03041342v1
Monitoring the edges of a graph using distances Florent Foucaud,Ralf Klasing,Mirka Miller,Joe Ryan Proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.28-40, ⟨10.1007/978-3-030-39219-2_3⟩ Communication dans un congrès hal-02500423v1
Discriminating Codes in Geometric Setups Sanjana Dey,Florent Foucaud,Subhas C Nandy,Arunabha Sen 31st International Symposium on Algorithms and Computation (ISAAC 2020), Dec 2020, Hong-Kong, Hong Kong SAR China. pp.24:1-16, ⟨10.4230/LIPIcs.ISAAC.2020.24⟩ Communication dans un congrès hal-03041359v1
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes Dibyayan Chakraborty,Florent Foucaud,Harmender Gahlawat,Subir Kumar Ghosh,Bodhayan Roy 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.102-115, ⟨10.1007/978-3-030-39219-2_9⟩ Communication dans un congrès hal-03041353v1
Algorithms and complexity for geodetic sets on planar and chordal graphs Dibyayan Chakraborty,Sandip Das,Florent Foucaud,Harmender Gahlawat,Dimitri Lajouet al. 31st International Symposium on Algorithms and Computation (ISAAC 2020), Dec 2020, Hong-Kong, Hong Kong SAR China. pp.7:1-15, ⟨10.4230/LIPIcs.ISAAC.2020.7⟩ Communication dans un congrès hal-03041361v1
Complexity of Conjunctive Regular Path Query Homomorphisms Laurent Beaudou,Florent Foucaud,Florent Madelaine,Lhouari Nourine,Gaétan Richard Conference on Computability in Europe (CiE 2019), Jul 2019, Durham, United Kingdom. pp.108-119, ⟨10.1007/978-3-030-22996-2_10⟩ Communication dans un congrès hal-02288666v1
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems Florent Foucaud,Hervé Hocquard,Dimitri Lajou,Valia Mitsou,Theo Pierron IPEC 2019, Sep 2019, Munich, Germany. pp.15:1-16, ⟨10.4230/LIPIcs.IPEC.2019.15⟩ Communication dans un congrès hal-02491871v1
On the Approximability of Partial VC Dimension Cristina Bazgan,Florent Foucaud,Florian Sikora 10th International Conference, COCOA 2016, Dec 2016, Hong Kong, China. pp.92-106, ⟨10.1007/978-3-319-48749-6_7⟩ Communication dans un congrès hal-01431728v1
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs Florent Foucaud,George Mertzios,Reza Naserasr,Aline Parreau,Petru Valicov International Workshop on Graph-Theoretic Concepts in Computer Science WG 2015, Jun 2015, Munich, Germany. pp.175 - 471, ⟨10.1007/978-3-662-53174-7_32⟩ Communication dans un congrès hal-01518713v1
Complexity of Grundy Coloring and Its Variants Edouard Bonnet,Florent Foucaud,Eun Jung Kim,Florian Sikora 21st International Conference on Computing and Combinatorics, COCOON 2015, Aug 2015, Beijing, China. pp.109-120, ⟨10.1007/978-3-319-21398-9_9⟩ Communication dans un congrès hal-01370531v1
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction Florent Foucaud,Reza Naserasr Proceedings of the 11th Latin American Symposium on Theoretical Informatics (LATIN 2014), Mar 2014, Montevideo, Uruguay. pp.526-537, ⟨10.1007/978-3-642-54423-1_46⟩ Communication dans un congrès hal-04858270v1
The complexity of the identifying code problem in restricted graph classes Florent Foucaud International Workshop on Combinatorial Algorithms (IWOCA), Jul 2013, Rouen, France. pp.150-163, ⟨10.1007/978-3-642-45278-9_14⟩ Communication dans un congrès istex hal-00960564v1
Random subgraphs make identification affordable Florent Foucaud,Guillem Perarnau,Oriol Serra 7th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB 2013), Sep 2013, Pisa, Italy. pp.415-420, ⟨10.1007/978-88-7642-475-5_66⟩ Communication dans un congrès hal-03041296v1
On graph identification problems and the special case of identifying vertices using paths Florent Foucaud,Matjaž Kovše International Workshop on Combinatorial Algorithms (IWOCA), Jul 2012, Krishnankoil, India. pp.32-45, ⟨10.1007/978-3-642-35926-2_4⟩ Communication dans un congrès hal-00960561v1
Edge identifying codes Florent Foucaud,Sylvain Gravier,Reza Naserasr,Aline Parreau,Petru Valicov European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), Aug 2011, Budapest, Hungary. pp.343-348, ⟨10.1016/j.endm.2011.09.056⟩ Communication dans un congrès istex hal-00960555v1

Pré-publication, Document de travail (14)

Parameterized complexity of isometric path partition: treewidth and diameter Dibyayan Chakraborty,Oscar Defrain,Florent Foucaud,Mathieu Mari,Prafullkumar Tale 2025 Pré-publication, Document de travail hal-05534703v1
The Parameterized Complexity of Computing the VC-Dimension Florent Foucaud,Harmender Gahlawat,Fionn Mc Inerney,Prafullkumar Tale 2025 Pré-publication, Document de travail hal-05326107v1
Algorithms and complexity for monitoring edge-geodetic sets in graphs Florent Foucaud,Clara Marcille,R. Sandeep,Sagnik Sen,S Taruni 2024 Pré-publication, Document de travail hal-04999433v1
Metric Dimension and Geodetic Set Parameterized by Vertex Cover Florent Foucaud,Esther Galby,Liana Khazaliya,Shaohua Li,Fionn Mc Inerneyet al. 2024 Pré-publication, Document de travail hal-04999439v1
Identifying codes in triangle-free graphs of bounded maximum degree Dipayan Chakraborty,Florent Foucaud,Michael Henning,Tuomo Lehtilä 2024 Pré-publication, Document de travail hal-04998814v1
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover Dipayan Chakraborty,Florent Foucaud,Diptapriyo Majumdar,Prafullkumar Tale 2024 Pré-publication, Document de travail hal-04999415v1
Structural Parameterization of Locating-Dominating Set and Test Cover Dipayan Chakraborty,Florent Foucaud,Diptapriyo Majumdar,Prafullkumar Tale 2024 Pré-publication, Document de travail hal-04999447v1
Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? Dibyayan Chakraborty,Antoine Dailly,Florent Foucaud,Ralf Klasing 2024 Pré-publication, Document de travail hal-04493029v1
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 Inerneyet al. 2023 Pré-publication, Document de travail hal-04999406v1
Complexity of conjunctive regular path query homomorphisms Laurent Beaudou,Florent Foucaud,Florent Madelaine,Lhouari Nourine,Gaétan Richad 2023 Pré-publication, Document de travail hal-04999117v1
Algorithms and complexity for geodetic sets on interval and chordal graphs Dibyayan Chakraborty,Sandip Das,Florent Foucaud,Harmender Galhawat,Dimitri Lajou 2022 Pré-publication, Document de travail hal-04230514v1
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond Dibyayan Chakraborty,Antoine Dailly,Sandip Das,Florent Foucaud,Harmender Gahlawatet al. 2022 Pré-publication, Document de travail hal-03710812v2
On powers of interval graphs and their orders Florent Foucaud,Reza Naserasr,Aline Parreau,Petru Valicov 2015 Pré-publication, Document de travail hal-01198830v1
On the structure of arbitrarily partitionable graphs with given connectivity Olivier Baudon,Florent Foucaud,Jakub Przybylo,Mariusz Woźniak 2012 Pré-publication, Document de travail hal-00690253v9

Rapport (1)

A note on online and recursively arbitrarily vertex-partitionable balloons Olivier Baudon,Florent Foucaud,Monika Pilsniak 2012 Rapport hal-00656232v1

Thèse (1)

Combinatorial and algorithmic aspects of identifying codes in graphs Florent Foucaud Data Structures and Algorithms [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2012. English. ⟨NNT : ⟩ Thèse tel-00766138v1