Interview with Micha Sharir
From MaRDI portal
Publication:6659997
DOI10.54550/eca2024v4s3i6MaRDI QIDQ6659997
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Erdős distinct distances problem in the plane
- Counting triangulations of planar point sets
- Extremal problems in discrete geometry
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Combinatorial complexity bounds for arrangements of curves and spheres
- Some dynamic computational geometry problems
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Generalized sandwich theorems
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Crossing-Free Subgraphs
- Distinct Distances in Three and Higher Dimensions
- A Combinatorial Problem Connected with Differential Equations
- Incidences in three dimensions and distinct distances in the plane
- A combinatorial problem connected with differential equations II
- On Sets of Distances of n Points
- Point sets with many \(k\)-sets
This page was built for publication: Interview with Micha Sharir
