default search action
Yaakov S. Kupitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j17]Yaakov S. Kupitz, Hagit Last, Horst Martini, Micha A. Perles, Rom Pinchasi:
Crossing matchings and circuits have maximal length. J. Graph Theory 94(1): 159-169 (2020)
2010 – 2019
- 2018
- [j16]Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
Touching perfect matchings and halving lines. Ars Math. Contemp. 15(2): 375-382 (2018) - 2017
- [j15]Yaakov S. Kupitz, Horst Martini, Micha A. Perles:
k-Bisectors of Finite Planar Sets. Graphs Comb. 33(4): 981-990 (2017) - [j14]Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
Locally 3-Transitive Graphs of Girth 4. J. Graph Theory 84(4): 512-520 (2017) - 2015
- [j13]Thomas Jahn, Yaakov S. Kupitz, Horst Martini, Christian Richter:
Minsum Location Extended to Gauges and to Convex Sets. J. Optim. Theory Appl. 166(3): 711-746 (2015) - 2013
- [j12]Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane. Discret. Appl. Math. 161(10-11): 1576-1585 (2013) - [j11]Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
Locally Symmetric Graphs of Girth 4. J. Graph Theory 73(1): 44-65 (2013) - [j10]Yaakov S. Kupitz, Horst Martini, Margarita Spirova:
The Fermat-Torricelli Problem, Part I: A Discrete Gradient-Method Approach. J. Optim. Theory Appl. 158(2): 305-327 (2013)
2000 – 2009
- 2009
- [j9]Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
A Jordan-Brouwer Separation Theorem for Polyhedral Pseudomanifolds. Discret. Comput. Geom. 42(2): 277-304 (2009) - 2008
- [j8]Yaakov S. Kupitz, Horst Martini:
Geometric graphs which are 1-skeletons of unstacked triangulated polygons. Discret. Math. 308(23): 5485-5498 (2008) - 2001
- [j7]Yaakov S. Kupitz, Horst Martini:
From Intersectors to Successors. Graphs Comb. 17(1): 99-111 (2001)
1990 – 1999
- 1996
- [j6]Yaakov S. Kupitz, Micha A. Perles:
Extremal Theory for Convex Matchings in Convex Geometric Graphs. Discret. Comput. Geom. 15(2): 195-220 (1996) - 1994
- [j5]Yaakov S. Kupitz:
Spanned K-Supporting Hyperplanes of Finite Sets in Rd. J. Comb. Theory A 65(1): 117-136 (1994) - 1993
- [j4]Yaakov S. Kupitz:
Separation of a finite set in Rd by spanned hyperplanes. Comb. 13(3): 249-258 (1993) - [j3]Yaakov S. Kupitz:
On the existence of a combinatorial Schlegel diagram of a simplical unstacked 3-polytope with a prescribed set of vertices. Discret. Math. 120(1-3): 121-134 (1993) - [j2]Yaakov S. Kupitz:
On convex segments in a triangulation. Discret. Math. 120(1-3): 277-285 (1993) - 1992
- [j1]Yaakov S. Kupitz:
On a Generalization of the Gallai-Sylvester Theorem. Discret. Comput. Geom. 7: 87-103 (1992)
1980 – 1989
- 1987
- [b1]Yaakov S. Kupitz:
הפרדות של קבוצה סופית ב- RD על ידי על-מישורים נפרשים (Separation of a finite set in Rd by spanned hyperplanes.). Hebrew University of Jerusalem, Israel, 1987
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint