הפרדות של קבוצה סופית ב- RD על ידי על-מישורים נפרשים (Separation of a finite set in Rd by spanned hyperplanes.). - Yaakov S. Kupitz (1987)

On a Generalization of the Gallai-Sylvester Theorem. - Yaakov S. Kupitz (Discret. Comput. Geom., 1992)

Separation of a finite set in Rd by spanned hyperplanes. - Yaakov S. Kupitz (Comb., 1993)

On the existence of a combinatorial Schlegel diagram of a simplical unstacked 3-polytope with a prescribed set of vertices. - Yaakov S. Kupitz (Discret. Math., 1993)

On convex segments in a triangulation. - Yaakov S. Kupitz (Discret. Math., 1993)

Spanned K-Supporting Hyperplanes of Finite Sets in Rd. - Yaakov S. Kupitz (J. Comb. Theory A, 1994)

Extremal Theory for Convex Matchings in Convex Geometric Graphs. - Yaakov S. Kupitz; Micha A. Perles (Discret. Comput. Geom., 1996)

From Intersectors to Successors. - Yaakov S. Kupitz; Horst Martini (Graphs Comb., 2001)

Geometric graphs which are 1-skeletons of unstacked triangulated polygons. - Yaakov S. Kupitz; Horst Martini (Discret. Math., 2008)

A Jordan-Brouwer Separation Theorem for Polyhedral Pseudomanifolds. - Micha A. Perles; Horst Martini; Yaakov S. Kupitz (Discret. Comput. Geom., 2009)

On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane. - Micha A. Perles; Horst Martini; Yaakov S. Kupitz (Discret. Appl. Math., 2013)

Locally Symmetric Graphs of Girth 4. - Micha A. Perles; Horst Martini; Yaakov S. Kupitz (J. Graph Theory, 2013)

The Fermat-Torricelli Problem, Part I: A Discrete Gradient-Method Approach. - Yaakov S. Kupitz; Horst Martini; Margarita Spirova (J. Optim. Theory Appl., 2013)

Minsum Location Extended to Gauges and to Convex Sets. - Thomas Jahn; Yaakov S. Kupitz; Horst Martini; Christian Richter (J. Optim. Theory Appl., 2015)

k-Bisectors of Finite Planar Sets. - Yaakov S. Kupitz; Horst Martini; Micha A. Perles (Graphs Comb., 2017)

Locally 3-Transitive Graphs of Girth 4. - Micha A. Perles; Horst Martini; Yaakov S. Kupitz (J. Graph Theory, 2017)

Touching perfect matchings and halving lines. - Micha A. Perles; Horst Martini; Yaakov S. Kupitz (Ars Math. Contemp., 2018)

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