Ackerman, Eyal

1. On topological graphs with at most four crossings per edge
   2015/09/07 by Ackerman, Eyal · 7 citations
   #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics
2. Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
   2019/02/22 by Ackerman, Eyal, Keszegh, Balázs, Pálvölgyi, Dömötör · 2 citations
   #Combinatorics (math.CO) #FOS: Mathematics
3. Coloring points with respect to squares
   2015/12/07 by Ackerman, Eyal, Keszegh, Balázs, Vizer, Máté · 1 citation
   #52C15 (05C15) #Combinatorics (math.CO) #FOS: Mathematics
4. Coloring Delaunay-Edges and their Generalizations
   2018/06/11 by Ackerman, Eyal, Keszegh, Balázs, Pálvölgyi, Dömötör · 1 citation
   #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics