Meir Katchalski
Identifiers
- name variant Meir Katchalski 0.60 · backfill
Papers (3)
- Upper bounds for the piercing number of families of pairwise intersecting convex polygons math.MG · 2011 · author #1
- No O(N) queries for checking if N intervals cover everything or for piercing N pairs of intervals. An O(N log N)-steps algorithm for piercing math.CO · 2011 · author #1
- The existence of thick triangulations -- an "elementary" proof math.GT · 2008 · author #2
Mentions
Frequent Coauthors
- David Nashtir 1 shared papers
- Eliahu Levy 1 shared papers
- Emil Saucan 1 shared papers