4 citations · 7 across the 2 of their papers we have counts for
2 papers
math.CO2010★ 3 cited
Drawing planar graphs of bounded degree with few slopes
Balázs Keszegh, János Pach, Dömötör Pálvölgyi
We settle a problem of Dujmović, Eppstein, Suderman, and Wood by showing that there exists a function with the property that every planar graph with maximum degree admi…
math.CO2010★ 4 cited
Overlap properties of geometric expanders
Jacob Fox, Mikhail Gromov, Vincent Lafforgue +2
The {\em overlap number} of a finite -uniform hypergraph is defined as the largest constant such that no matter how we map the vertices of into $\R^d…