Interview with Micha Sharir
From MaRDI portal
Publication:6659997
DOI10.54550/ECA2024V4S3I6MaRDI QIDQ6659997FDOQ6659997
Authors: Toufik Mansour 
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- On the Erdős distinct distances problem in the plane
- On Sets of Distances of n Points
- Extremal problems in discrete geometry
- Combinatorial complexity bounds for arrangements of curves and spheres
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Crossing-Free Subgraphs
- Counting triangulations of planar point sets
- Some dynamic computational geometry problems
- The Erdős distance problem
- An improved, simple construction of many halving edges
- Generalized sandwich theorems
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Title not available (Why is that?)
- A Combinatorial Problem Connected with Differential Equations
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Point sets with many \(k\)-sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distinct Distances in Three and Higher Dimensions
- Incidences in three dimensions and distinct distances in the plane
- A combinatorial problem connected with differential equations II
This page was built for publication: Interview with Micha Sharir
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659997)
