2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DM2024
On Iiro Honkala's contributions to identifying codes
Olivier Hudry, Ville Junnila, Antoine Lobstein
A set of vertices in a graph is an identifying code if it is dominating and any two vertices of are dominated by distinct sets of codewords. This paper presents a…
cs.CC2022
On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path
Olivier Hudry, Antoine Lobstein
The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formu…
cs.DM2010★ 2 cited
Watching Systems in graphs: an extension of Identifying Codes
David Auger, Irène Charon, Olivier Hudry +1
We introduce the notion of watching systems in graphs, which is a generalization of that of identifying codes. We give some basic properties of watching systems, an upper bound on…