On Geometric Graphs with No Two Edges in Convex Position. - Meir Katchalski; Hagit Last (Discret. Comput. Geom., 1998)

On the Complexity of Arrangements of Circles in the Plane. - Noga Alon; Hagit Last; Rom Pinchasi; Micha Sharir (Discret. Comput. Geom., 2001)

At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane. - Hagit Last; Rom Pinchasi (Discret. Comput. Geom., 2007)

Crossing matchings and circuits have maximal length. - Yaakov S. Kupitz; Hagit Last; Horst Martini; Micha A. Perles; Rom Pinchasi (J. Graph Theory, 2020)