48 citations · 165 across the 65 of their papers we have counts for
Showing 2010 · cs.DMShow all
2 papers · 2 filters
cs.DM2010★ 1 cited
Tight lower bounds for the size of epsilon-nets
János Pach, Gábor Tardos
According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an $\eps$-net of size $O\left(\frac{1}{\eps}\log\frac1{\eps}\right)$.…
cs.DM2010★ 3 cited
Small (2,s)-colorable graphs without 1-obstacle representations
János Pach, Deniz Sarioz
An obstacle representation of a graph G is a set of points on the plane together with a set of polygonal obstacles that determine a visibility graph isomorphic to G. The obstacle n…