output
20042011
most citedInverse problems for two by two reaction-diffusion system using a Carleman estimate with one observation

66 citations

researchers with a paper here
collaborating institutions
Showing cs.DMShow all

3 papers · 1 filter

cs.DM2010★ 40 cited

Extremal graphs for the identifying code problem

Florent Foucaud, Eleonora Guerrini, Matjaz Kovse +3

An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at mo…

cs.DM2009★ 8 cited

Coding cells of digital spaces: a framework to write generic digital topology algorithms

Jacques-Olivier Lachaud

This paper proposes a concise coding of the cells of n-dimensional finite regular grids. It induces a simple, generic and efficient framework for implementing classical digital top…

cs.DM2008★ 20 cited

Compound Node-Kayles on Paths

Adrien Guignard, Eric Sopena

In his celebrated book "On Number and Games" (Academic Press, New-York, 1976), J.H. Conway introduced twelve versions of compound games. We analyze these twelve versions for the No…