48 citations · 165 across the 65 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2012★ 1 cited
How Many Potatoes are in a Mesh?
Marc van Kreveld, Maarten Löffler, János Pach
We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there…
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…