FOUCAUD - Florent
Toutes les publications (63)
| Date/Type | Titre/URL/journal | Domaines | Notes SJR/Core | Cit. GScholar |
|---|---|---|---|---|
| 2024
COMM |
Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 2024) - 2024 |
Informatique/Algorithme et structure de données | ||
| 2024
ART |
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael Henning, Annegret Wagler
Progress towards the two-thirds conjecture on locating-total dominating sets Discrete Mathematics - 2024 |
Informatique/Mathématique discrète | ||
| 2024
COMM |
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and Complexity for Path Covers of Temporal DAGs Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) - 2024 |
Informatique/Algorithme et structure de données | ||
| 2024
ART |
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K Wagler
On three domination-based identification problems in block graphs Fundamenta Informaticae - 2024 |
Informatique/Mathématique discrète | ||
| 2024
COMM |
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover Proceedings of the 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2024) - 2024 |
Informatique/Algorithme et structure de données | ||
| 2024
ART |
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
On Graphs Coverable by k Shortest Paths SIAM Journal on Discrete Mathematics - 2024 |
Informatique/Algorithme et structure de données | ||
| 2024
ART |
Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
Extremal digraphs for open neighbourhood location-domination and identifying codes Discrete Applied Mathematics - 2024 |
Informatique/Mathématique discrète | ||
| 2024
ART |
Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly Discrete Mathematics and Theoretical Computer Science - 2024 |
Informatique/Mathématique discrète | ||
| 2024
UNDEFINED |
Florent Foucaud, Clara Marcille, Zin Mar Myint, R B Sandeep, Sagnik Sen, S Taruni
Bounds and extremal graphs for monitoring edge-geodetic sets in graphs |
Informatique/Mathématique discrète | ||
| 2024
COMM |
Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity 10th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2024) - 2024 |
Informatique/Algorithme et structure de données | ||
| 2024
UNDEFINED |
Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
Algorithms and complexity for path covers of temporal DAGs |
Informatique/Mathématique discrète | ||
| 2024
ART |
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D.K. Supraja
On locating and neighbor-locating colorings of sparse graphs Discrete Applied Mathematics - 2024 |
Informatique/Mathématique discrète | ||
| 2024
ART |
Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
Neighbourhood complexity of graphs of bounded twin-width European Journal of Combinatorics - 2024 |
Informatique/Mathématique discrète | ||
| 2023
COMM |
Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
Identifying codes in bipartite graphs of given maximum degree 12th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2023) - 2023 |
Informatique/Mathématique discrète | ||
| 2023
COMM |
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number 24th International Symposium on Fundamentals of Computation Theory (FCT 2023) - 2023 |
Informatique/Algorithme et structure de données | ||
| 2023
COMM |
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
Isometric Path Complexity of Graphs 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) - 2023 |
Informatique/Algorithme et structure de données | ||
| 2023
ART |
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The RED-BLUE SEPARATION problem on graphs Theoretical Computer Science - 2023 |
Informatique/Algorithme et structure de données | ||
| 2023
ART |
Florent Foucaud, Tuomo Lehtilä
Bounds and Extremal Graphs for Total Dominating Identifying Codes The Electronic Journal of Combinatorics - 2023 |
Informatique/Mathématique discrète | ||
| 2023
ART |
Florent Foucaud, Reza Naserasr, Rongxing Xu
Extended Double Covers and Homomorphism Bounds of Signed Graphs The Electronic Journal of Combinatorics - 2023 |
Informatique/Mathématique discrète | ||
| 2023
ART |
Sanjana Dey, Florent Foucaud, Subhas Nandy, Arunabha Sen
Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups Algorithmica - 2023 |
Informatique/Algorithme et structure de données | ||
| 2023
COMM |
Antoine Dailly, Florent Foucaud, Anni Hakanen
Algorithms and Hardness for Metric Dimension on Digraphs 49th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023) - 2023 |
Informatique/Algorithme et structure de données | ||
| 2023
COMM |
Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, K. N. Rajath Rao
Parameterizing Path Partitions 13th International Conference on Algorithms and Complexity (CIAC 2023) - 2023 |
Informatique/Algorithme et structure de données | ||
| 2023
COMM |
Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret Wagler
On Three Domination-Based Identification Problems in Block Graphs 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023 |
Informatique/Mathématique discrète | ||
| 2023
COMM |
Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023 |
Informatique/Mathématique discrète | ||
| 2023
COMM |
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D K Supraja
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023 |
Informatique/Mathématique discrète | ||
| 2023
COMM |
Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana
Monitoring edge-geodetic sets in graphs 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023) - 2023 |
Informatique/Mathématique discrète | ||
| 2022
COMM |
Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
On graphs coverable by k shortest paths 33rd International Symposium on Algorithms and Computation (ISAAC 2022) - 2022 |
Informatique/Algorithme et structure de données | ||
| 2022
COMM |
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond 33rd International Symposium on Algorithms and Computation (ISAAC 2022) - 2022 |
Informatique/Algorithme et structure de données | ||
| 2022
ART |
Florent Foucaud, Tuomo Lehtilä
Revisiting and Improving Upper Bounds for Identifying Codes SIAM Journal on Discrete Mathematics - 2022 |
Maths | ||
| 2022
UNDEFINED |
Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Galhawat, Dimitri Lajou
Algorithms and complexity for geodetic sets on interval and chordal graphs |
Informatique/Algorithme et structure de données | ||
| 2022
UNDEFINED |
Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
Complexity and algorithms for Isometric Path Cover on chordal graphs and beyond |
Informatique/Algorithme et structure de données | ||
| 2022
COMM |
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
The Red-Blue Separation Problem on Graphs IWOCA 2022 - 2022 |
Informatique/Algorithme et structure de données | ||
| 2022
ART |
Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity Algorithmica - 2022 |
Informatique/Algorithme et structure de données | ||
| 2022
ART |
Florent Foucaud
Problems Related to a Conjecture on Location-Domination in Twin-Free Graphs Indian Journal of Discrete Mathematics - 2022 |
Maths | ||
| 2022
ART |
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Smallest $C_{2l+1}$-critical graphs of odd-girth $2k+1$ Discrete Applied Mathematics - 2022 |
Maths | ||
| 2022
ART |
Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
Monitoring the edges of a graph using distances Discrete Applied Mathematics - 2022 |
Informatique/Algorithme et structure de données | ||
| 2021
ART |
Florent Foucaud, Hervé Hocquard, Dimitri Lajou
Complexity and algorithms for injective edge-coloring in graphs Information Processing Letters - 2021 |
Informatique/Algorithme et structure de données | ||
| 2021
ART |
Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
On the Complexity of Broadcast Domination and Multipacking in Digraphs Algorithmica - 2021 |
Informatique/Algorithme et structure de données | ||
| 2021
COMM |
Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov
Cliques in exact distance powers of graphs of given maximum degree LAGOS 2021 - 11th Latin and American Algorithms, Graphs and Optimisation Symposium - 2021 |
Maths | ||
| 2021
ART |
Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi, Pouyeh Sharifani
Characterizing extremal graphs for open neighbourhood location-domination Discrete Applied Mathematics - 2021 |
Maths | ||
| 2019
ART |
Antoine Dailly, Florent Foucaud, Adriana Hansberg
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs Discrete Mathematics - 2019 |
Informatique/Mathématique discrète | ||
| 2019
COMM |
Laurent Beaudou, Florent Foucaud, Florent Madelaine, Lhouari Nourine, Gaétan Richard
Complexity of Conjunctive Regular Path Query Homomorphisms Conference on Computability in Europe (CiE 2019) - 2019 |
Informatique/Logique en informatique | ||
| 2019
ART |
Laurent Beaudou, Richard C. Brewster, Florent Foucaud
Broadcast domination and multipacking: bounds and the integrality gap The Australasian Journal of Combinatorics - 2019 |
Maths | ||
| 2019
ART |
Cristina Bazgan, Florent Foucaud, Florian Sikora
Parameterized and approximation complexity of Partial VC Dimension Theoretical Computer Science - 2019 |
|||
| 2019
ART |
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs Discrete Applied Mathematics - 2019 |
Informatique/Mathématique discrète | ||
| 2018
ART |
Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael Antony Henning, Arnaud Mary, Aline Parreau
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension SIAM Journal on Discrete Mathematics - 2018 |
Maths | ||
| 2018
ART |
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy coloring and its variants Discrete Applied Mathematics - 2018 |
|||
| 2017
ART |
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. Discrete Applied Mathematics - 2017 |
Maths | ||
| 2017
ART |
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Homomorphism bounds and edge-colourings of K4-minor-free graphs Journal of Combinatorial Theory, Series B - 2017 |
Maths | ||
| 2017
ART |
Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
Structural properties of recursively partitionable graphs with connectivity 2 Discussiones Mathematicae Graph Theory - 2017 |
Informatique/Mathématique discrète | ||
| 2017
ART |
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds Theoretical Computer Science - 2017 |
Informatique/Mathématique discrète | ||
| 2017
ART |
Florent Foucaud, Michael Henning
Location-domination in line graphs Discrete Mathematics - 2017 |
Maths | ||
| 2017
ART |
Florent Foucaud, Guillem Perarnau, Oriol Serra
Random subgraphs make identification affordable Journal of Combinatorics - 2017 |
Maths | ||
| 2017
ART |
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity Algorithmica - 2017 |
Informatique/Mathématique discrète | ||
| 2017
ART |
Florent Foucaud, Ralf Klasing
Parameterized and approximation complexity of the detection pair problem in graphs Journal of Graph Algorithms and Applications - 2017 |
Informatique/Réseaux et télécommunications | ||
| 2016
COMM |
Cristina Bazgan, Florent Foucaud, Florian Sikora
On the Approximability of Partial VC Dimension 10th International Conference, COCOA 2016 - 2016 |
|||
| 2016
ART |
Florent Foucaud, Michael Henning
Location-domination and matching in cubic graphs Discrete Mathematics - 2016 |
Maths | ||
| 2016
ART |
Florent Foucaud, Michael Henning, Christian Löwenstein, Thomas Sasse
Locating–dominating sets in twin-free graphs Discrete Applied Mathematics - 2016 |
Maths | ||
| 2016
ART |
Florent Foucaud, Michael A. Henning
Locating-total dominating sets in twin-free graphs: a conjecture The Electronic Journal of Combinatorics - 2016 |
Maths | ||
| 2015
UNDEFINED |
Florent Foucaud, Reza Naserasr, Aline Parreau, Petru Valicov
On powers of interval graphs and their orders |
Informatique/Mathématique discrète | ||
| 2015
COMM |
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy Coloring and Its Variants 21st International Conference on Computing and Combinatorics, COCOON 2015 - 2015 |
|||
| 2015
COMM |
Florent Foucaud, George Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
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 - 2015 |
Maths | ||
| 2015
ART |
Camino Balbuena, Florent Foucaud, Adriana Hansberg
Locating-dominating sets and identifying codes in graphs of girth at least 5 The Electronic Journal of Combinatorics - 2015 |
Maths |