Sciweavers

FOCS
2010
IEEE
13 years 8 months ago
A Non-linear Lower Bound for Planar Epsilon-Nets
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
Noga Alon
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 11 months ago
Extremal graphs for the identifying code problem
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 m...
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, ...