20 citations · 63 across the 14 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2011
Complexity of Interlocking Polyominoes
Sidharth Dhawan, Zachary Abel
Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons i…
math.CO2009★ 12 cited
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
Zachary Abel, Brad Ballinger, Prosenjit Bose +7
We prove the following generalised empty pentagon theorem: for every integer , every sufficiently large set of points in the plane contains collinear points or…