Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry1990Vol. 5(2), pp. 99–160
Citations Over TimeTop 1% of 1990 papers
Related Papers
- → Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs(2014)14 cited
- → Lower Bounds for Inverse Sum Indeg Index of Graphs(2020)17 cited
- → Domination number and neighbourhood conditions(1999)3 cited
- → Lower bounds for the isoperimetric numbers of random regular graphs(2013)
- → Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound(2021)