Eyal Ackerman

Eyal Ackerman

University of Haifa

H-index: 16

Asia-Israel

About Eyal Ackerman

Eyal Ackerman, With an exceptional h-index of 16 and a recent h-index of 10 (since 2020), a distinguished researcher at University of Haifa, specializes in the field of Combinatorial Geometry, Computational Geometry.

His recent articles reflect a diverse array of research interests and contributions to the field:

On the number of tangencies among 1-intersecting x-monotone curves

On partitions of two-dimensional discrete boxes

On the number of tangencies among 1-intersecting curves

On tangencies among planar curves with an application to coloring L-shapes

The maximum size of adjacency-crossing graphs

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

Coloring Delaunay-edges and their generalizations

Quasi-planar graphs

Eyal Ackerman Information

University

Position

___

Citations(all)

876

Citations(since 2020)

384

Cited By

696

hIndex(all)

16

hIndex(since 2020)

10

i10Index(all)

18

i10Index(since 2020)

11

Email

University Profile Page

University of Haifa

Google Scholar

View Google Scholar Profile

Eyal Ackerman Skills & Research Interests

Combinatorial Geometry

Computational Geometry

Top articles of Eyal Ackerman

Title

Journal

Author(s)

Publication Date

On the number of tangencies among 1-intersecting x-monotone curves

European Journal of Combinatorics

Eyal Ackerman

Balázs Keszegh

2024/5/1

On partitions of two-dimensional discrete boxes

Discrete Mathematics

Eyal Ackerman

Rom Pinchasi

2024/4/1

On the number of tangencies among 1-intersecting curves

arXiv preprint arXiv:2305.13807

Eyal Ackerman

Balázs Keszegh

2023/5/23

On tangencies among planar curves with an application to coloring L-shapes

European Journal of Combinatorics

Eyal Ackerman

Balázs Keszegh

Dömötör Pálvölgyi

2023/9/23

The maximum size of adjacency-crossing graphs

arXiv preprint arXiv:2309.06507

Eyal Ackerman

Balázs Keszegh

2023/9/12

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

Discrete & Computational Geometry

Eyal Ackerman

Balázs Keszegh

Günter Rote

2022/12

Coloring Delaunay-edges and their generalizations

Computational Geometry

Eyal Ackerman

Balázs Keszegh

Dömötör Pálvölgyi

2021/6/1

Quasi-planar graphs

Beyond Planar Graphs: Communications of NII Shonan Meetings

Eyal Ackerman

2020

Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs

SIAM Journal on Discrete Mathematics

Eyal Ackerman

Balázs Keszegh

Dömötör Pálvölgyi

2020

See List of Professors in Eyal Ackerman University(University of Haifa)

Co-Authors

H-index: 38
Jacob Fox

Jacob Fox

Stanford University

H-index: 34
Ron Pinter

Ron Pinter

Technion - Israel Institute of Technology

H-index: 34
Kevin Buchin

Kevin Buchin

Technische Universiteit Eindhoven

H-index: 28
Christian Knauer

Christian Knauer

Universität Bayreuth

H-index: 27
Maarten Löffler

Maarten Löffler

Universiteit Utrecht

H-index: 27
Marcus Schaefer

Marcus Schaefer

DePaul University

academic-engine