Florent Foucaud
79
Documents
Publications
|
Identifying codes in bipartite graphs of given maximum degree12th 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⟩
Conference papers
hal-04213143v1
|
|
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs9th 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⟩
Conference papers
hal-03965313v1
|
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number24th International Symposium on Fundamentals of Computation Theory (FCT 2023), Sep 2023, Trier, Germany. pp.132-146, ⟨10.1007/978-3-031-43587-4_10⟩
Conference papers
hal-04214541v1
|
|
|
Isometric Path Complexity of Graphs48th 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⟩
Conference papers
hal-04184516v1
|
|
On Three Domination-Based Identification Problems in Block Graphs9th 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⟩
Conference papers
hal-03974121v1
|
|
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs9th 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⟩
Conference papers
hal-03974126v1
|
|
Parameterizing Path Partitions13th International Conference on Algorithms and Complexity (CIAC 2023), Jun 2023, Larnaca, Cyprus. pp.187-201, ⟨10.1007/978-3-031-30448-4_14⟩
Conference papers
hal-04085831v3
|
|
Monitoring edge-geodetic sets in graphs9th 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⟩
Conference papers
hal-03812622v1
|
|
Algorithms and Hardness for Metric Dimension on Digraphs49th 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⟩
Conference papers
hal-04216265v1
|
|
The Red-Blue Separation Problem on GraphsIWOCA 2022, Jun 2022, Trier, Germany. pp.285-298, ⟨10.1007/978-3-031-06678-8_21⟩
Conference papers
hal-03711361v1
|
|
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, France. pp.12:1--12:17, ⟨10.4230/LIPIcs.ISAAC.2022.12⟩
Conference papers
hal-03899912v1
|
On graphs coverable by k shortest paths33rd International Symposium on Algorithms and Computation (ISAAC 2022), Dec 2022, Seoul, South Korea. pp.40:1--40:15, ⟨10.4230/LIPIcs.ISAAC.2022.40⟩
Conference papers
hal-03895886v1
|
|
|
Cliques in exact distance powers of graphs of given maximum degreeLAGOS 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⟩
Conference papers
hal-03540673v1
|
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes6th 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⟩
Conference papers
hal-03041353v1
|
|
Smallest $C_{2l+1}$-Critical Graphs of Odd-Girth $2k+1$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⟩
Conference papers
hal-03041342v1
|
|
On the Complexity of Broadcast Domination and Multipacking in DigraphsCombinatorial Algorithms - 31st International Workshop, Jun 2020, Bordeaux, France. pp.264-276, ⟨10.1007/978-3-030-48966-3_20⟩
Conference papers
hal-02793880v1
|
|
Discriminating Codes in Geometric Setups31st 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⟩
Conference papers
hal-03041359v1
|
|
|
Monitoring the edges of a graph using distancesProceedings 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⟩
Conference papers
hal-02500423v1
|
Algorithms and complexity for geodetic sets on planar and chordal graphs31st 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⟩
Conference papers
hal-03041361v1
|
|
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism ProblemsIPEC 2019, Sep 2019, Munich, Germany. pp.15:1-16, ⟨10.4230/LIPIcs.IPEC.2019.15⟩
Conference papers
hal-02491871v1
|
|
|
Complexity of Conjunctive Regular Path Query HomomorphismsConference on Computability in Europe (CiE 2019), Jul 2019, Durham, United Kingdom. pp.108-119, ⟨10.1007/978-3-030-22996-2_10⟩
Conference papers
hal-02288666v1
|
On the Approximability of Partial VC Dimension10th International Conference, COCOA 2016, Dec 2016, Hong Kong, China. pp.92-106, ⟨10.1007/978-3-319-48749-6_7⟩
Conference papers
hal-01431728v1
|
|
Complexity of Grundy Coloring and Its Variants21st International Conference on Computing and Combinatorics, COCOON 2015, Aug 2015, Beijing, China. pp.109-120, ⟨10.1007/978-3-319-21398-9_9⟩
Conference papers
hal-01370531v1
|
|
|
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs 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⟩
Conference papers
hal-01518713v1
|
Random subgraphs make identification affordable7th 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⟩
Conference papers
hal-03041296v1
|
|
The complexity of the identifying code problem in restricted graph classesInternational Workshop on Combinatorial Algorithms (IWOCA), Jul 2013, Rouen, France. pp.150-163, ⟨10.1007/978-3-642-45278-9_14⟩
Conference papers
hal-00960564v1
|
|
On graph identification problems and the special case of identifying vertices using pathsInternational Workshop on Combinatorial Algorithms (IWOCA), Jul 2012, Krishnankoil, India. pp.32-45, ⟨10.1007/978-3-642-35926-2_4⟩
Conference papers
hal-00960561v1
|
|
Edge identifying codesEuropean Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), Aug 2011, Budapest, Hungary. pp.343-348, ⟨10.1016/j.endm.2011.09.056⟩
Conference papers
hal-00960555v1
|
|
On three domination-based identification problems in block graphs2022
Preprints, Working Papers, ...
hal-03809986v1
|
|
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond2022
Preprints, Working Papers, ...
hal-03710812v2
|
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly2021
Preprints, Working Papers, ...
hal-03406709v1
|
|
On powers of interval graphs and their orders2015
Preprints, Working Papers, ...
hal-01198830v1
|
|
|
On the structure of arbitrarily partitionable graphs with given connectivity2012
Preprints, Working Papers, ...
hal-00690253v9
|
|
Combinatorial and algorithmic aspects of identifying codes in graphsData Structures and Algorithms [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2012. English. ⟨NNT : ⟩
Theses
tel-00766138v1
|