Cycle detection using a stack. - Gabriel Nivasch (Inf. Process. Lett., 2004)

The Sprague-Grundy function of the game Euclid. - Gabriel Nivasch (Discret. Math., 2006)

Weak ε-nets and interval chains. - Noga Alon; Haim Kaplan; Gabriel Nivasch; Micha Sharir; Shakhar Smorodinsky (J. ACM, 2008)

Lower bounds for weak epsilon-nets and stair-convexity. - Boris Bukh; Jirí Matousek 001; Gabriel Nivasch (SCG, 2009)

Eppstein's bound on intersecting triangles revisited. - Gabriel Nivasch; Micha Sharir (J. Comb. Theory A, 2009)

Weak epsilon-nets, Davenport-Schinzel sequences, and related problems - Gabriel Nivasch (2009)

Stabbing Simplices by Points and Flats. - Boris Bukh; Jirí Matousek 001; Gabriel Nivasch (Discret. Comput. Geom., 2010)

Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. - Gabriel Nivasch (J. ACM, 2010)

Upper bounds for centerlines. - Boris Bukh; Gabriel Nivasch (J. Comput. Geom., 2012)

The number of distinct distances from a vertex of a convex polygon. - Gabriel Nivasch; János Pach; Rom Pinchasi; Shira Zerbib (J. Comput. Geom., 2013)

The visible perimeter of an arrangement of disks. - Gabriel Nivasch; János Pach; Gábor Tardos (Comput. Geom., 2014)

A Variant of the Hadwiger-Debrunner (p, q)-Problem in the Plane. - Sathish Govindarajan; Gabriel Nivasch (Discret. Comput. Geom., 2015)

On the zone of a circle in an arrangement of lines. - Gabriel Nivasch (Electron. Notes Discret. Math., 2015)

Rainbow matchings and algebras of sets. - Gabriel Nivasch; Eran Omri (Electron. Notes Discret. Math., 2015)

One-sided epsilon-approximants. - Boris Bukh; Gabriel Nivasch (CoRR, 2016)

Classifying unavoidable Tverberg partitions. - Boris Bukh; Po-Shen Loh; Gabriel Nivasch (J. Comput. Geom., 2017)

Learning convex polytopes with margin. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich; Gabriel Nivasch (NeurIPS, 2018)

Some i-Mark games. - Oren Friman; Gabriel Nivasch (CoRR, 2020)

Grid Peeling and the Affine Curve-Shortening Flow. - David Eppstein; Sariel Har-Peled; Gabriel Nivasch (Exp. Math., 2020)

Nested Barycentric Coordinate System as an Explicit Feature Map. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich; Gabriel Nivasch; Ofir Pele (AISTATS, 2021)

Upper bounds for stabbing simplices by a line. - Inbar Daum-Sadon; Gabriel Nivasch (Discret. Appl. Math., 2021)

Homotopic curve shortening and the affine curve-shortening flow. - Sergey Avvakumov; Gabriel Nivasch (J. Comput. Geom., 2021)

Some i-Mark games. - Oren Friman; Gabriel Nivasch (Theor. Comput. Sci., 2021)

Fusible numbers and Peano Arithmetic. - Jeff Erickson 001; Gabriel Nivasch; Junyan Xu (Log. Methods Comput. Sci., 2022)

Learning Convex Polyhedra With Margin. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich; Gabriel Nivasch (IEEE Trans. Inf. Theory, 2022)

Ordinals and recursive algorithms. - Lior Shiboli; Gabriel Nivasch (CoRR, 2023)

Generalized fusible numbers and their ordinals. - Alexander I. Bufetov; Gabriel Nivasch; Fedor Pakhomov (Ann. Pure Appl. Log., 2024)

Nested barycentric coordinate system as an explicit feature map for polyhedra approximation and learning tasks. - Lee-Ad Gottlieb; Eran Kaufman; Aryeh Kontorovich; Gabriel Nivasch; Ofir Pele (Mach. Learn., 2024)

A convergence technique for the game i-Mark. - Gabriel Nivasch; Oz Rubinstein (CoRR, 2025)