Florent Foucaud

160 papers A* 1A 1B 12C 10Misc 1Journal 123Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Note on Partitioning the Vertex Set of a Graph into a Dominating Set and a Locating Dominating Set. Electron. J. Comb. Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tero Laihonen
2026	—	`conf`	Algorithms and Hardness for Geodetic Set on Tree-Like Digraphs. CALDAM Florent Foucaud, Narges Ghareghani, Lucas Lorieau, Morteza Mohammad Noori, Rasa Parvini Oskuei, Prafullkumar Tale
2026	J	`jnl`	Algorithms and Hardness for Geodetic Set on Tree-like Digraphs. CoRR Florent Foucaud, Narges Ghareghani, Lucas Lorieau, Morteza Mohammad Noori, Rasa Parvini Oskuei, Prafullkumar Tale
2026	J	`jnl`	Algorithms and hardness for Metric Dimension on digraphs. J. Comput. Syst. Sci. Antoine Dailly, Florent Foucaud, Anni Hakanen
2026	J	`jnl`	Characterizing optimal monitoring edge-geodetic sets for some structured graph classes. Discret. Appl. Math. Florent Foucaud, Arti Pandey, Kaustav Paul
2026	J	`jnl`	Identifying codes in graphs of given maximum degree: Characterizing trees. Discret. Math. Dipayan Chakraborty, Florent Foucaud, Michael A. Henning, Tuomo Lehtilä
2026	J	`jnl`	Identifying open codes in trees and 4-cycle-free graphs of given maximum degree. Discret. Appl. Math. Dipayan Chakraborty, Florent Foucaud, Michael A. Henning
2026	J	`jnl`	Isometric path complexity of graphs. Discret. Math. Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
2026	J	`jnl`	Locating-dominating partitions for some classes of graphs. Discret. Math. Florent Foucaud, Paras Maniya, Kaustav Paul, Dinabandhu Pradhan
2026	J	`jnl`	Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. Discret. Appl. Math. Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
2025	C	`conf`	A polynomial-time algorithm recognizing exact cubes of trees. LAGOS Laurent Beaudou, Henry Echeverría, Florent Foucaud, Andrea Jiménez, Nikita Manuylenko, Anirudh Rachuri
2025	J	`jnl`	Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. Discret. Appl. Math. Florent Foucaud, Clara Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
2025	J	`jnl`	Characterizing optimal monitoring edge-geodetic sets for some structured graph classes. CoRR Florent Foucaud, Arti Pandey, Kaustav Paul
2025	J	`jnl`	Distance-based (and path-based) covering problems for graphs of given cyclomatic number. CoRR Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
2025	J	`jnl`	Distance-based (and path-based) covering problems for graphs of given cyclomatic number. Discret. Math. Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
2025	J	`jnl`	Locating-dominating partitions for some classes of graphs. CoRR Florent Foucaud, Paras Maniya, Kaustav Paul, Dinabandhu Pradhan
2025	A	`conf`	Metric Dimension and Geodetic Set Parameterized by Vertex Cover. STACS Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2025	J	`jnl`	Monitoring arc-geodetic sets of oriented graphs. Theor. Comput. Sci. Tapas Das, Florent Foucaud, Clara Marcille, Pavan P. D, Sagnik Sen
2025	J	`jnl`	Monitoring edge-geodetic sets in graphs. Discret. Appl. Math. Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana
2025	J	`jnl`	Parameterized complexity of isometric path partition: treewidth and diameter. CoRR Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale
2025	J	`jnl`	Parameterizing path partitions. Theor. Comput. Sci. Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
2025	—	`conf`	Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth. CALDAM Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi
2025	J	`jnl`	Polynomial-time algorithms for PATH COVER and PATH PARTITION on trees and graphs of bounded treewidth. CoRR Florent Foucaud, Atrayee Majumder, Tobias Mömke, Aida Roshany-Tabrizi
2025	J	`jnl`	Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs. CoRR Laurent Beaudou, Jan Bok, Florent Foucaud, Daniel A. Quiroz, Jean-Florent Raymond
2025	J	`jnl`	Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations. CoRR Dibyayan Chakraborty, Florent Foucaud
2025	—	`conf`	Structural Parameterization of Locating-Dominating Set and Test Cover. CIAC (1) Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2025	J	`jnl`	The Parameterized Complexity of Computing the VC-Dimension. CoRR Florent Foucaud, Harmender Gahlawat, Fionn Mc Inerney, Prafullkumar Tale
2024	B	`conf`	Algorithms and Complexity for Path Covers of Temporal DAGs. MFCS Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
2024	J	`jnl`	Algorithms and complexity for monitoring edge-geodetic sets in graphs. CoRR Florent Foucaud, Clara Marcille, R. B. Sandeep, Sagnik Sen, S. Taruni
2024	J	`jnl`	Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? CoRR Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, Ralf Klasing
2024	J	`jnl`	Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. CoRR Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
2024	J	`jnl`	Extremal digraphs for open neighbourhood location-domination and identifying codes. Discret. Appl. Math. Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
2024	J	`jnl`	Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024	—	`conf`	Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity. CALDAM Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen, S. Taruni
2024	J	`jnl`	Monitoring arc-geodetic sets of oriented graphs. CoRR Tapas Das, Florent Foucaud, Clara Marcille, Pavan P. D, Sagnik Sen
2024	J	`jnl`	Neighbourhood complexity of graphs of bounded twin-width. Eur. J. Comb. Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
2024	J	`jnl`	On Graphs Coverable by SIAM J. Discret. Math. Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
2024	J	`jnl`	On Three Domination-based Identification Problems in Block Graphs. Fundam. Informaticae Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K. Wagler
2024	J	`jnl`	On locating and neighbor-locating colorings of sparse graphs. Discret. Appl. Math. Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
2024	A*	`conf`	Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2024	J	`jnl`	Progress towards the two-thirds conjecture on locating-total dominating sets. Discret. Math. Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret K. Wagler
2024	J	`jnl`	Structural Parameterization of Locating-Dominating Set and Test Cover. CoRR Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024	B	`conf`	Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. ISAAC Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2024	J	`jnl`	Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover. CoRR Dipayan Chakraborty, Florent Foucaud, Diptapriyo Majumdar, Prafullkumar Tale
2023	B	`conf`	Algorithms and Hardness for Metric Dimension on Digraphs. WG Antoine Dailly, Florent Foucaud, Anni Hakanen
2023	J	`jnl`	Algorithms and hardness for Metric Dimension on digraphs. CoRR Antoine Dailly, Florent Foucaud, Anni Hakanen
2023	J	`jnl`	Bounds and Extremal Graphs for Total Dominating Identifying Codes. Electron. J. Comb. Florent Foucaud, Tuomo Lehtilä
2023	J	`jnl`	Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups. Algorithmica Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
2023	J	`jnl`	Complexity of conjunctive regular path query homomorphisms. CoRR Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
2023	J	`jnl`	Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. Discret. Math. Theor. Comput. Sci. Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2023	B	`conf`	Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. FCT Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
2023	J	`jnl`	Extended Double Covers and Homomorphism Bounds of Signed Graphs. Electron. J. Comb. Florent Foucaud, Reza Naserasr, Rongxing Xu
2023	J	`jnl`	Extremal digraphs for open neighbourhood location-domination and identifying codes. CoRR Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
2023	C	`conf`	Identifying codes in bipartite graphs of given maximum degree. LAGOS Dipayan Chakraborty, Florent Foucaud, Tuomo Lehtilä
2023	B	`conf`	Isometric Path Complexity of Graphs. MFCS Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
2023	J	`jnl`	Isometric path antichain covers: beyond hyperbolic graphs. CoRR Dibyayan Chakraborty, Florent Foucaud
2023	—	`conf`	Monitoring Edge-Geodetic Sets in Graphs. CALDAM Florent Foucaud, Krishna Narayanan, Lekshmi Ramasubramony Sulochana
2023	J	`jnl`	Neighbourhood complexity of graphs of bounded twin-width. CoRR Édouard Bonnet, Florent Foucaud, Tuomo Lehtilä, Aline Parreau
2023	—	`conf`	New Bounds and Constructions for Neighbor-Locating Colorings of Graphs. CALDAM Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
2023	J	`jnl`	New bounds and constructions for neighbor-locating colorings of graphs. CoRR Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja
2023	—	`conf`	On Three Domination-Based Identification Problems in Block Graphs. CALDAM Dipayan Chakraborty, Florent Foucaud, Aline Parreau, Annegret K. Wagler
2023	C	`conf`	Parameterizing Path Partitions. CIAC Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
2023	—	`conf`	Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs. CALDAM Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
2023	J	`jnl`	Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs. CoRR Sandip Das, Florent Foucaud, Sk Samim Islam, Joydeep Mukherjee
2023	J	`jnl`	The RED-BLUE SEPARATION problem on graphs. Theor. Comput. Sci. Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2023	J	`jnl`	Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
2022	B	`conf`	Complexity and Algorithms for ISOMETRIC PATH COVER on Chordal Graphs and Beyond. ISAAC Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh
2022	J	`jnl`	Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity. Algorithmica Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2022	J	`jnl`	Monitoring the edges of a graph using distances. Discret. Appl. Math. Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
2022	B	`conf`	On Graphs Coverable by k Shortest Paths. ISAAC Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
2022	J	`jnl`	On graphs coverable by k shortest paths. CoRR Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca
2022	J	`jnl`	Parameterizing Path Partitions. CoRR Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N
2022	J	`jnl`	Progress towards the two-thirds conjecture on locating-total dominating sets. CoRR Dipayan Chakraborty, Florent Foucaud, Anni Hakanen, Michael A. Henning, Annegret K. Wagler
2022	J	`jnl`	Revisiting and Improving Upper Bounds for Identifying Codes. SIAM J. Discret. Math. Florent Foucaud, Tuomo Lehtilä
2022	J	`jnl`	Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. Discret. Appl. Math. Laurent Beaudou, Florent Foucaud, Reza Naserasr
2022	J	`jnl`	The RED-BLUE SEPARATION problem on graphs. CoRR Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2022	C	`conf`	The Red-Blue Separation Problem on Graphs. IWOCA Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Ralf Klasing, Tuomo Lehtilä
2021	J	`jnl`	Characterizing extremal graphs for open neighbourhood location-domination. Discret. Appl. Math. Florent Foucaud, Narges Ghareghani, Aida Roshany-Tabrizi, Pouyeh Sharifani
2021	C	`conf`	Cliques in exact distance powers of graphs of given maximum degree. LAGOS Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov
2021	J	`jnl`	Complexity and algorithms for injective edge-coloring in graphs. CoRR Florent Foucaud, Hervé Hocquard, Dimitri Lajou
2021	J	`jnl`	Complexity and algorithms for injective edge-coloring in graphs. Inf. Process. Lett. Florent Foucaud, Hervé Hocquard, Dimitri Lajou
2021	J	`jnl`	Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2021	J	`jnl`	Exact square coloring of subcubic planar graphs. Discret. Appl. Math. Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
2021	J	`jnl`	On the Complexity of Broadcast Domination and Multipacking in Digraphs. Algorithmica Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
2020	B	`conf`	Algorithms and Complexity for Geodetic Sets on Planar and Chordal Graphs. ISAAC Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
2020	J	`jnl`	Algorithms and complexity for geodetic sets on planar and chordal graphs. CoRR Dibyayan Chakraborty, Sandip Das, Florent Foucaud, Harmender Gahlawat, Dimitri Lajou, Bodhayan Roy
2020	J	`jnl`	Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
2020	B	`conf`	Discriminating Codes in Geometric Setups. ISAAC Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
2020	J	`jnl`	Discriminating Codes in Geometric Setups. CoRR Sanjana Dey, Florent Foucaud, Subhas C. Nandy, Arunabha Sen
2020	J	`jnl`	Domination and location in twin-free digraphs. Discret. Appl. Math. Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau
2020	J	`jnl`	Exact square coloring of subcubic planar graphs. CoRR Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
2020	—	`conf`	Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes. CALDAM Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
2020	J	`jnl`	IWOCA 2020 in Bordeaux (Oops! On-Line!). Bull. EATCS Florent Foucaud, Leszek Gasieniec, Ralf Klasing, Tomasz Radzik, Bill Smyth
2020	—	`conf`	Monitoring the Edges of a Graph Using Distances. CALDAM Florent Foucaud, Ralf Klasing, Mirka Miller, Joe Ryan
2020	J	`jnl`	Monitoring the edges of a graph using distances. CoRR Florent Foucaud, Shih-Shun Kao, Ralf Klasing, Mirka Miller, Joe Ryan
2020	C	`conf`	On the Complexity of Broadcast Domination and Multipacking in Digraphs. IWOCA Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
2020	J	`jnl`	On the complexity of Broadcast Domination and Multipacking in digraphs. CoRR Florent Foucaud, Benjamin Gras, Anthony Perez, Florian Sikora
2020	—	`conf`	Smallest C CALDAM Laurent Beaudou, Florent Foucaud, Reza Naserasr
2019	J	`jnl`	Broadcast domination and multipacking: bounds and the integrality gap. Australas. J Comb. Laurent Beaudou, Richard C. Brewster, Florent Foucaud
2019	C	`conf`	Complexity of Conjunctive Regular Path Query Homomorphisms. CiE Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
2019	J	`jnl`	Complexity of planar signed graph homomorphisms to cycles. CoRR François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
2019	J	`jnl`	Domination and location in twin-free digraphs. CoRR Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau
2019	J	`jnl`	Hardness and approximation for the geodetic set problem in some graph classes. CoRR Dibyayan Chakraborty, Florent Foucaud, Harmender Gahlawat, Subir Kumar Ghosh, Bodhayan Roy
2019	J	`jnl`	Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Discret. Appl. Math. Laurent Beaudou, Florent Foucaud, Reza Naserasr
2019	B	`conf`	Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems. IPEC Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2019	J	`jnl`	Parameterized and approximation complexity of Partial VC Dimension. Theor. Comput. Sci. Cristina Bazgan, Florent Foucaud, Florian Sikora
2019	J	`jnl`	Parameterized complexity of edge-coloured and signed graph homomorphism problems. CoRR Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, Théo Pierron
2019	J	`jnl`	Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. Discret. Math. Antoine Dailly, Florent Foucaud, Adriana Hansberg
2018	J	`jnl`	Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. SIAM J. Discret. Math. Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau
2018	J	`jnl`	Complexity of Grundy coloring and its variants. Discret. Appl. Math. Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2018	J	`jnl`	Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. CoRR Antoine Dailly, Florent Foucaud, Adriana Hansberg
2017	J	`jnl`	Homomorphism bounds and edge-colourings of K J. Comb. Theory B Laurent Beaudou, Florent Foucaud, Reza Naserasr
2017	J	`jnl`	Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Algorithmica Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2017	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2017	J	`jnl`	Location-domination in line graphs. Discret. Math. Florent Foucaud, Michael A. Henning
2017	J	`jnl`	Parameterized and approximation complexity of the detection pair problem in graphs. J. Graph Algorithms Appl. Florent Foucaud, Ralf Klasing
2017	J	`jnl`	Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
2017	J	`jnl`	The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
2017	J	`jnl`	The complexity of tropical graph homomorphisms. Discret. Appl. Math. Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2016	J	`jnl`	Homomorphism bounds and edge-colourings of K CoRR Laurent Beaudou, Florent Foucaud, Reza Naserasr
2016	J	`jnl`	Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture. Electron. J. Comb. Florent Foucaud, Michael A. Henning
2016	J	`jnl`	Locating-dominating sets in twin-free graphs. Discret. Appl. Math. Florent Foucaud, Michael A. Henning, Christian Löwenstein, Thomas Sasse
2016	J	`jnl`	Location-domination and matching in cubic graphs. Discret. Math. Florent Foucaud, Michael A. Henning
2016	C	`conf`	On the Approximability of Partial VC Dimension. COCOA Cristina Bazgan, Florent Foucaud, Florian Sikora
2016	J	`jnl`	On the Approximability of Partial VC Dimension. CoRR Cristina Bazgan, Florent Foucaud, Florian Sikora
2016	J	`jnl`	Parameterized and approximation complexity of the detection pair problem in graphs. CoRR Florent Foucaud, Ralf Klasing
2016	J	`jnl`	The complexity of tropical graph homomorphisms. CoRR Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2015	B	`conf`	Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. WG Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2015	Misc	`conf`	Complexity of Grundy Coloring and Its Variants. COCOON Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2015	J	`jnl`	Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. J. Discrete Algorithms Florent Foucaud
2015	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. CoRR Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2015	J	`jnl`	Large Subgraphs without Short Cycles. SIAM J. Discret. Math. Florent Foucaud, Michael Krivelevich, Guillem Perarnau
2015	J	`jnl`	Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5. Electron. J. Comb. Camino Balbuena, Florent Foucaud, Adriana Hansberg
2015	J	`jnl`	The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
2014	J	`jnl`	An improved lower bound for (1, ≤ 2)-identifying codes in the king grid. Adv. Math. Commun. Florent Foucaud, Tero Laihonen, Aline Parreau
2014	J	`jnl`	Centroidal bases in graphs. Networks Florent Foucaud, Ralf Klasing, Peter J. Slater
2014	J	`jnl`	Complexity of Grundy coloring and its variants. CoRR Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
2014	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. CoRR Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2014	J	`jnl`	Locating-dominating sets and identifying codes in graphs of girth at least 5. CoRR Camino Balbuena, Florent Foucaud, Adriana Hansberg
2014	J	`jnl`	On the structure of arbitrarily partitionable graphs with given connectivity. Discret. Appl. Math. Olivier Baudon, Florent Foucaud, Jakub Przybylo, Mariusz Wozniak
2014	B	`conf`	The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. LATIN Florent Foucaud, Reza Naserasr
2013	J	`jnl`	Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets. Graphs Comb. Florent Foucaud, Reza Naserasr, Aline Parreau
2013	J	`jnl`	Identifying Codes in Line Graphs. J. Graph Theory Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2013	J	`jnl`	Identifying path covers in graphs. J. Discrete Algorithms Florent Foucaud, Matjaz Kovse
2013	J	`jnl`	Random subgraphs make identification affordable. CoRR Florent Foucaud, Guillem Perarnau, Oriol Serra
2013	C	`conf`	The Complexity of the Identifying Code Problem in Restricted Graph Classes. IWOCA Florent Foucaud
2012	J	`jnl`	Bounds for Identifying Codes in Terms of Degree Parameters. Electron. J. Comb. Florent Foucaud, Guillem Perarnau
2012	—	`—`	Combinatorial and algorithmic aspects of identifying codes in graphs. (Aspects combinatoires et algorithmiques des codes identifiants dans les graphes). Florent Foucaud
2012	J	`jnl`	Locally identifying colourings for graphs with given maximum degree. Discret. Math. Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
2012	C	`conf`	On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths. IWOCA Florent Foucaud, Matjaz Kovse
2012	J	`jnl`	On the size of identifying codes in triangle-free graphs. Discret. Appl. Math. Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud
2011	J	`jnl`	An improved lower bound for (1,<=2)-identifying codes in the king grid CoRR Florent Foucaud, Tero Laihonen, Aline Parreau
2011	J	`jnl`	Bounds for identifying codes in terms of degree parameters CoRR Florent Foucaud, Guillem Perarnau
2011	J	`jnl`	Edge identifying codes. Electron. Notes Discret. Math. Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2011	J	`jnl`	Extremal graphs for the identifying code problem. Eur. J. Comb. Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
2011	J	`jnl`	Identifying codes in line graphs CoRR Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2011	J	`jnl`	Locally identifying colourings for graphs with given maximum degree CoRR Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
2010	J	`jnl`	Extremal graphs for the identifying code problem CoRR Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
2010	J	`jnl`	Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets CoRR Florent Foucaud, Reza Naserasr, Aline Parreau
2010	J	`jnl`	On the size of identifying codes in triangle-free graphs CoRR Florent Foucaud, Ralf Klasing, Adrian Kosowski, André Raspaud