◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Eyal Ackerman

17 papers hereh-index 14879 citations55 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author15

Across the 16 of 17 papers where every author was matched, so the position is known.

fields
  • math.CO13
  • cs.CG3
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedIce-Creams and Wedge Graphs

3 citations · 6 across the 10 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

math.CO2020

An almost optimal bound on the number of intersections of two simple polygons

Eyal Ackerman, Balázs Keszegh, Günter Rote

What is the maximum number of intersections of the boundaries of a simple m-gon and a simple n-gon, assuming general position? This is a basic question in combinatorial geometr…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.