Services déconcentrés d'appui à la recherche Val de Loire

output

20142025

most citedObject Level Visual Reasoning in Videos

86 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

D. Kozhemiachenko11 · h 5
Sabine Frittella2 profiles10 · h 5
F. Foucaud7 · h 19
M. Bílková6 · h 11
F. Giovannelli2 profiles5 · h 20
G. Nataf4 · h 16
I. Monot-Laffez2 profiles3 · h 16
Ondrej Majer3 · h 10
Anthony Perez2 · h 14
Christian Wolf2 · h 36
Fabien Baradel2 · h 15
F. Delorme2 · h 6

collaborating institutions

Institut National des Sciences Appliquées Centre Val de LoireFR39 papers
Université d'OrléansFR26 papers
Centre National de la Recherche ScientifiqueFR24 papers
Université de ToursFR12 papers
GREMAN, Matériaux, Microélectronique, Acoustique, NanotechnologiesFR9 papers
Czech Academy of SciencesCZ7 papers
Czech Academy of Sciences, Institute of Computer ScienceCZ7 papers
Institut Polytechnique de BordeauxFR5 papers
Laboratoire Bordelais de Recherche en InformatiqueFR5 papers
Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR5 papers
Université de BordeauxFR5 papers
Université Paris-SaclayFR5 papers

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2021★ 22 cited

Complexity and algorithms for injective edge-coloring in graphs

Florent Foucaud, Hervé Hocquard, Dimitri Lajou

An injective $k$ -edge-coloring of a graph $G$ is an assignment of colors, i.e. integers in ${1, \dots, k}$ , to the edges of $G$ such that any two edges each incident with one d…

cs.DS2020★ 42 cited

Monitoring the edges of a graph using distances

Florent Foucaud, Shih-Shun Kao, Ralf Klasing +2

We introduce a new graph-theoretic concept in the area of network monitoring. A set $M$ of vertices of a graph $G$ is a \emph{distance-edge-monitoring set} if for every edge $e$ of…