default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph Zaks
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j20]Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks:
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. Comput. Geom. 42(6-7): 722 (2009)- 2003
- [j19]Joseph Zaks:
The Beckman-Quarles theorem for rational spaces. Discret. Math. 265(1-3): 311-320 (2003) - [j18]Joseph Zaks:
Erratum to "The Beckman-Quarles theorem for rational spaces": [Discrete Mathematics 365 (2003) 311-320]. Discret. Math. 265(1-3): 321- (2003) - 2001
- [j17]Branko Grünbaum, Joseph Zaks:
Convexification of polygons by flips and by flipturns. Discret. Math. 241(1-3): 333-342 (2001)
1990 – 1999
- 1997
- [j16]Joseph Zaks:
Monohedrally knotted tilings of the 3-space. Discret. Math. 174(1-3): 383-386 (1997) - 1995
- [j15]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
On illuminating line segments in the plane. Discret. Math. 137(1-3): 147-153 (1995) - 1994
- [j14]Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro
, Jorge Urrutia, Joseph Zaks:
Guarding rectangular art galleries. Discret. Appl. Math. 50(2): 149-157 (1994) - [j13]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
Protecting convex sets. Graphs Comb. 10(2-4): 311-321 (1994) - [c2]Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks:
K-Guarding Polygons on the Plane. CCCG 1994: 381-386 - 1992
- [j12]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
Separating Convex Sets in the Plane. Discret. Comput. Geom. 7: 189-195 (1992) - [j11]Joseph Zaks:
Uniform distances in rational unit-distance graphs. Discret. Math. 109(1-3): 307-311 (1992) - 1991
- [c1]Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks:
Tight Bounds for the Rectangualr Art Gallery Problem. WG 1991: 105-112 - 1990
- [j10]Joseph Zaks:
On the connectedness of some geometric graphs. J. Comb. Theory B 49(2): 143-150 (1990)
1980 – 1989
- 1989
- [j9]Joseph Zaks:
Parsons graphs of matrices. Discret. Math. 78(1-2): 187-193 (1989) - 1988
- [j8]Joseph Zaks:
Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs. J. Comb. Theory A 48(2): 147-155 (1988) - 1985
- [j7]Meir Katchalski, Ted Lewis, Joseph Zaks:
Geometric permutations for convex sets. Discret. Math. 54(3): 271-284 (1985) - 1983
- [j6]Joseph Zaks:
Extending two theorems of A. Kotzig. Discret. Math. 43(2-3): 309-315 (1983) - 1982
- [j5]Joseph Zaks:
Extending an extension of Grinberg's theorem. J. Comb. Theory B 32(1): 95-98 (1982) - 1980
- [j4]Joseph Zaks:
Non-Hamiltonian simple 3-polytopes having just two types of faces. Discret. Math. 29(1): 87-101 (1980)
1970 – 1979
- 1977
- [j3]Joseph Zaks:
Non-Hamiltonian non-Grinbergian graphs. Discret. Math. 17(3): 317-321 (1977) - 1976
- [j2]Joseph Zaks:
Pairs of Hamiltonian circuits in 5-connected planar graphs. J. Comb. Theory B 21(2): 116-131 (1976) - 1974
- [j1]Branko Grünbaum, Joseph Zaks:
The existence of certain planar maps. Discret. Math. 10(1): 93-115 (1974)
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 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
