External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

An Upper Bound on the Number of Planar k-Sets

János Pach, William L. Steiger, Endre Szemerédi. An Upper Bound on the Number of Planar k-Sets. In 30th Annual Symposium on Foundations of Computer Science, 30 October-1 November 1989, Research Triangle Park, North Carolina, USA. pages 72-79, IEEE, 1989.

Abstract

Abstract is missing.

runs on