
Florent Foucaud
108
Documents
Publications
Publications
|
Metric Dimension and Geodetic Set Parameterized by Vertex Cover42nd 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-04963873
v1
|
Structural Parameterization of Locating-Dominating Set and Test CoverProceedings 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-05071838
v1
|
|
|
Polynomial-time algorithms for Path Cover on trees and graphs of bounded treewidth10th 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-04931788
v1
|
|
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test CoverProceedings 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-04820017
v1
|
|
Algorithms and Complexity for Path Covers of Temporal DAGsProceedings 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-04675995
v1
|
Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex coverProceedings 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-04631780
v1
|
|
|
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity10th 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-04396469
v1
|
|
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⟩
Communication dans un congrès
hal-04216265
v2
|
|
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⟩
Communication dans un congrès
hal-03965313
v1
|
|
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⟩
Communication dans un congrès
hal-03812622
v1
|
|
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⟩
Communication dans un congrès
hal-04213143
v1
|
|
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⟩
Communication dans un congrès
hal-04214541
v1
|
|
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⟩
Communication dans un congrès
hal-04085831
v3
|
|
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⟩
Communication dans un congrès
hal-03974121
v1
|
|
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⟩
Communication dans un congrès
hal-03974126
v1
|
|
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⟩
Communication dans un congrès
hal-04184516
v1
|
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⟩
Communication dans un congrès
hal-03895886
v1
|
|
|
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⟩
Communication dans un congrès
hal-03899912
v1
|
|
The Red-Blue Separation Problem on GraphsIWOCA 2022, Jun 2022, Trier, Germany. pp.285-298, ⟨10.1007/978-3-031-06678-8_21⟩
Communication dans un congrès
hal-03711361
v1
|
|
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⟩
Communication dans un congrès
hal-03540673
v1
|
|
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⟩
Communication dans un congrès
hal-03041342
v1
|
|
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⟩
Communication dans un congrès
hal-02793880
v1
|
|
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⟩
Communication dans un congrès
hal-02500423
v1
|
|
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⟩
Communication dans un congrès
hal-03041359
v1
|
|
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⟩
Communication dans un congrès
hal-03041353
v1
|
|
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⟩
Communication dans un congrès
hal-03041361
v1
|
|
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⟩
Communication dans un congrès
hal-02288666
v1
|
|
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⟩
Communication dans un congrès
hal-02491871
v1
|
|
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⟩
Communication dans un congrès
hal-01431728
v1
|
|
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⟩
Communication dans un congrès
hal-01518713
v1
|
|
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⟩
Communication dans un congrès
hal-01370531
v1
|
|
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint SatisfactionProceedings 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-04858270
v1
|
|
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⟩
Communication dans un congrès
istex
hal-00960564
v1
|
|
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⟩
Communication dans un congrès
hal-03041296
v1
|
|
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⟩
Communication dans un congrès
hal-00960561
v1
|
|
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⟩
Communication dans un congrès
istex
hal-00960555
v1
|
|
Combinatorial and algorithmic aspects of identifying codes in graphsData Structures and Algorithms [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2012. English. ⟨NNT : ⟩
Thèse
tel-00766138
v1
|
Chargement...
Chargement...