A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points

Daniel Král', Lukás Mach, Jean-Sébastien Sereni. A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points. Discrete & Computational Geometry, 48(2):487-498, 2012. [doi]

@article{KralMS12,
  title = {A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points},
  author = {Daniel Král' and Lukás Mach and Jean-Sébastien Sereni},
  year = {2012},
  doi = {10.1007/s00454-012-9419-3},
  url = {http://dx.doi.org/10.1007/s00454-012-9419-3},
  researchr = {https://researchr.org/publication/KralMS12},
  cites = {0},
  citedby = {0},
  journal = {Discrete & Computational Geometry},
  volume = {48},
  number = {2},
  pages = {487-498},
}