280 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre National de la Recherche ScientifiqueFR106 papers
- Clermont UniversitéFR46 papers
- Institut PascalFR40 papers
- Sigma ClermontFR29 papers
- Université Clermont AuvergneFR26 papers
- Institut Universitaire de FranceFR20 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR18 papers
- Université Paris-SaclayFR14 papers
- Lyon 1 UniversitéFR12 papers
- Sorbonne UniversitéFR11 papers
- Stockholm UniversitySE10 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR9 papers
3 papers · 2 filters
Algorithms and hardness for Metric Dimension on digraphs
Antoine Dailly, Florent Foucaud, Anni Hakanen
In the Metric Dimension problem, one asks for a minimum-size set of vertices such that for any pair of vertices of the graph, there is a vertex from whose two distances to…
Extremal digraphs for open neighbourhood location-domination and identifying codes
Florent Foucaud, Narges Ghareghani, Pouyeh Sharifani
A set of vertices of a digraph is called an open neighbourhood locating-dominating set if every vertex in has an in-neighbour in , and for every pair of vertic…
On locating and neighbor-locating colorings of sparse graphs
Dipayan Chakraborty, Florent Foucaud, Soumen Nandi +2
A proper -coloring of a graph is a \emph{neighbor-locating -coloring} if for each pair of vertices in the same color class, the two sets of colors found in their respecti…