, Volume 2, Issue 11, pp 97–101 | Cite as

An improved bound onk-sets

  • Abhi Dattasharma
Research News


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Suggested Reading

  1. Ajtai M, Chvatal V, Newborn M and Szemeredi. Crossing-free Subgraphs.Ann. Discrete Math. 12. pp9–12, 1982.Google Scholar
  2. Alon N and Györi E. The Number of Small Semispaces of A Finite Set of Points in the Plane.J. Combin. Theory Ser. A41. pp.154–157, 1986.CrossRefGoogle Scholar
  3. Edelsbrunner H.Algorithms in Combinatorial Geometry. Springer-Verlag. Heidelberg. Germany, 1987.Google Scholar
  4. Tamal K Dey. Improved Bounds on Planar k- sets and k-levels. to appear in theProc. 38th Annual Symposium on Foundations of Computer Science. 1997. Miami, Florida; also to appear in Discrete and Computational Geometry.Google Scholar

Copyright information

© Indian Academy of Sciences 1997

Authors and Affiliations

  1. 1.Satyam Computer Services Pvt. Ltd.BangaloreIndia

Personalised recommendations