Yaakov S. Kupitz

According to our database1, Yaakov S. Kupitz authored at least 18 papers between 1987 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Crossing matchings and circuits have maximal length.
J. Graph Theory, 2020

2018
Touching perfect matchings and halving lines.
Ars Math. Contemp., 2018

2017
Locally 3-Transitive Graphs of Girth 4.
J. Graph Theory, 2017

k-Bisectors of Finite Planar Sets.
Graphs Comb., 2017

2015
Minsum Location Extended to Gauges and to Convex Sets.
J. Optim. Theory Appl., 2015

2013
The Fermat-Torricelli Problem, Part I: A Discrete Gradient-Method Approach.
J. Optim. Theory Appl., 2013

Locally Symmetric Graphs of Girth 4.
J. Graph Theory, 2013

On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane.
Discret. Appl. Math., 2013

2009
A Jordan-Brouwer Separation Theorem for Polyhedral Pseudomanifolds.
Discret. Comput. Geom., 2009

2008
Geometric graphs which are 1-skeletons of unstacked triangulated polygons.
Discret. Math., 2008

2001
From Intersectors to Successors.
Graphs Comb., 2001

1996
Extremal Theory for Convex Matchings in Convex Geometric Graphs.
Discret. Comput. Geom., 1996

1994
Spanned K-Supporting Hyperplanes of Finite Sets in R<sup>d</sup>.
J. Comb. Theory A, 1994

1993
On convex segments in a triangulation.
Discret. Math., 1993

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

Separation of a finite set in R<sup>d</sup> by spanned hyperplanes.
Comb., 1993

1992
On a Generalization of the Gallai-Sylvester Theorem.
Discret. Comput. Geom., 1992

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


  Loading...