Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Repeated angles in the plane and related problems
Journal of Combinatorial Theory Series A
The number of different distances determined by a set of points in the Euclidean plane
Discrete & Computational Geometry
Crossing Numbers of Graphs, Lower Bound Techniques
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Improving Bounds for the Crossing Numbers on Surfaces of Genus g
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Combinatorial Geometry
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
New bounds on crossing numbers
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the number of congruent simplices in a point
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On the distinct distances determined by a planar point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
The Clarkson-Shor technique revisited and extended
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Point-line incidences in space
Proceedings of the eighteenth annual symposium on Computational geometry
Incidences between points and circles in three and higher dimensions
Proceedings of the eighteenth annual symposium on Computational geometry
Discrete Mathematics - Kleitman and combinatorics: a celebration
Distinct distances in three and higher dimensions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Clarkson–Shor Technique Revisited and Extended
Combinatorics, Probability and Computing
On the Number of Incidences Between Points and Curves
Combinatorics, Probability and Computing
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM (JACM)
Distinct Distances in Three and Higher Dimensions
Combinatorics, Probability and Computing
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Point–Line Incidences in Space
Combinatorics, Probability and Computing
Acta Cybernetica
Forbidden patterns and unit distances
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Incidences of not-too-degenerate hyperplanes
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Proceedings of the twenty-second annual symposium on Computational geometry
Nearly equal distances and Szemerédi's regularity lemma
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition
On the diameter of separated point sets with many nearly equal distances
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
Similar simplices in a d-dimensional point set
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Extremal problems on triangle areas in two and three dimensions
Proceedings of the twenty-fourth annual symposium on Computational geometry
Improved upper bounds on the crossing number
Proceedings of the twenty-fourth annual symposium on Computational geometry
On a question of bourgain about geometric incidences
Combinatorics, Probability and Computing
Distinct Triangle Areas in a Planar Point Set
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Extremal problems on triangle areas in two and three dimensions
Journal of Combinatorial Theory Series A
Combinatorics, Probability and Computing
Nearly equal distances and Szemerédi's regularity lemma
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
A bipartite strengthening of the Crossing Lemma
Journal of Combinatorial Theory Series B
Bounds for convex crossing numbers
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
An improved algorithm for point set pattern matching under rigid motion
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Arrangements in geometry: recent advances and challenges
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A bipartite strengthening of the crossing lemma
GD'07 Proceedings of the 15th international conference on Graph drawing
Incidences in three dimensions and distinct distances in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
On nonlinear forbidden 0-1 matrices: a refutation of a Füredi-Hajnal conjecture
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-seventh annual symposium on Computational geometry
Progress on crossing number problems
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Improved bounds for incidences between points and circles
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We show that an old but not well-known lower bound for the crossing number of a graph yields short proofs for a number of bounds in discrete plane geometry which were considered hard before: the number of incidences among points and lines, the maximum number of unit distances among n points, the minimum number of distinct distances among n points.