The following pages link to Eyal Ackerman (Q359747):
Displaying 50 items.
- On inducing polygons and related problems (Q359751) (← links)
- A note on light geometric graphs (Q389475) (← links)
- Covering a chessboard with staircase walks (Q393918) (← links)
- A note on 1-planar graphs (Q401145) (← links)
- A note on coloring line arrangements (Q405217) (← links)
- On the light side of geometric graphs (Q409464) (← links)
- Combinatorial model and bounds for target set selection (Q410735) (← links)
- The maximum number of edges in geometric graphs with pairwise virtually avoiding edges (Q742617) (← links)
- The number of guillotine partitions in \(d\) dimensions (Q844186) (← links)
- On the maximum number of edges in quasi-planar graphs (Q878960) (← links)
- Improved upper bounds on the reflexivity of point sets (Q1000926) (← links)
- On the maximum number of edges in topological graphs with no four pairwise crossing edges (Q1014335) (← links)
- On sets of points that determine only acute angles (Q1024284) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- Ice-creams and wedge graphs (Q1931263) (← links)
- On coloring points with respect to rectangles (Q1946737) (← links)
- On the degenerate crossing number (Q1953051) (← links)
- Coloring Delaunay-edges and their generalizations (Q1984605) (← links)
- An almost optimal bound on the number of intersections of two simple polygons (Q2105320) (← links)
- On topological graphs with at most four crossings per edge (Q2175439) (← links)
- On grids in topological graphs (Q2249043) (← links)
- There are not too many magic configurations (Q2482202) (← links)
- A bijection between permutations and floorplans, and its applications (Q2499588) (← links)
- On the number of rectangulations of a planar point set (Q2500619) (← links)
- The Maximum Number of Tangencies Among Convex Regions with a Triangle-Free Intersection Graph (Q2849796) (← links)
- Graphs That Admit Polyline Drawings with Few Crossing Angles (Q2902903) (← links)
- A Crossing Lemma for the Pair-Crossing Number (Q2936928) (← links)
- On the Size of Planarly Connected Crossing Graphs (Q2961524) (← links)
- The Flip Diameter of Rectangulations and Convex Subdivisions (Q2965976) (← links)
- On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles (Q3073653) (← links)
- Acyclic Orientation of Drawings (Q3075613) (← links)
- Every Simple Arrangement of <em>n</em> Lines Contains an Inducing Simple <em>n</em>-gon (Q3081502) (← links)
- Coloring Points with Respect to Squares (Q3132836) (← links)
- (Q3601547) (← links)
- (Q3602870) (← links)
- (Q3619929) (← links)
- On Inducing Polygons and Related Problems (Q3639234) (← links)
- On the size of planarly connected crossing graphs (Q4600734) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs (Q5138972) (← links)
- On grids in topological graphs (Q5370741) (← links)
- (Q5501333) (← links)
- Computing and Combinatorics (Q5716975) (← links)
- Acyclic Orientation of Drawings (Q5757888) (← links)
- An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. (Q6059944) (← links)
- On partitions of two-dimensional discrete boxes (Q6197713) (← links)
- On the number of tangencies among 1-intersecting \(x\)-monotone curves (Q6201909) (← links)
- On tangencies among planar curves with an application to coloring L-shapes (Q6604683) (← links)
- On tangencies among planar curves with an application to coloring L-shapes (Q6612513) (← links)
- Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs (Q6621147) (← links)
