Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
- 21 October 2025
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 75 (2) , 320-342
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (CCF-20-07556)
- National Coordination Office (CCF-22-23870)
- National Coordination Office (IIS- 24-02823)
- United States - Israel Binational Science Foundation (2022131)
- United States - Israel Binational Science Foundation (2022131)
- Israel Science Foundation (800/22)
- Israel Science Foundation (495/23)
This publication has 47 references indexed in Scilit:
- Simplex Range Searching and Its Variants: A Review2017
- Computational Geometry2008
- Algorithms in Real Algebraic Geometry2006
- On the Complexity of Many Faces in Arrangements of Pseudo-Segments and Circles2003
- Almost optimal set covers in finite VC-dimensionDiscrete & Computational Geometry, 1995
- Clique Partitions, Graph Compression and Speeding-Up AlgorithmsJournal of Computer and System Sciences, 1995
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- On the decomposition of graphs into complete bipartite subgraphs1983