Joseph Zaks

621 total citations
56 papers, 371 citations indexed

About

Joseph Zaks is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Electrical and Electronic Engineering. According to data from OpenAlex, Joseph Zaks has authored 56 papers receiving a total of 371 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 21 papers in Geometry and Topology and 21 papers in Electrical and Electronic Engineering. Recurrent topics in Joseph Zaks's work include Computational Geometry and Mesh Generation (21 papers), graph theory and CDMA systems (21 papers) and Advanced Graph Theory Research (16 papers). Joseph Zaks is often cited by papers focused on Computational Geometry and Mesh Generation (21 papers), graph theory and CDMA systems (21 papers) and Advanced Graph Theory Research (16 papers). Joseph Zaks collaborates with scholars based in Israel, United States and Canada. Joseph Zaks's co-authors include Branko Grünbaum, T. Lewis, Meir Katchalski, Jorge Urrutia, Jurek Czyzowicz, J. M. Wills, Micha A. Perles, Nicola Santoro, Bruno Gaujal and Kurt Mehlhorn and has published in prestigious journals such as American Mathematical Monthly, Pacific Journal of Mathematics and Proceedings of the American Mathematical Society.

In The Last Decade

Joseph Zaks

48 papers receiving 302 citations

Peers

Joseph Zaks
János Pach Hungary
Robert A. Melter United States
Kim Whittlesey United States
David Gay United States
Joseph Zaks
Citations per year, relative to Joseph Zaks Joseph Zaks (= 1×) peers Heiko Harborth

Countries citing papers authored by Joseph Zaks

Since Specialization
Citations

This map shows the geographic impact of Joseph Zaks's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Joseph Zaks with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joseph Zaks more than expected).

Fields of papers citing papers by Joseph Zaks

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joseph Zaks. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Joseph Zaks. The network helps show where Joseph Zaks may publish in the future.

Co-authorship network of co-authors of Joseph Zaks

This figure shows the co-authorship network connecting the top 25 collaborators of Joseph Zaks. A scholar is included among the top collaborators of Joseph Zaks based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Joseph Zaks. Joseph Zaks is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Mehlhorn, Kurt, Jörg-Rüdiger Sack, & Joseph Zaks. (2009). Note on the paper “K-vertex guarding simple polygons” [Computational Geometry 42 (4) (May 2009) 352–361]. Computational Geometry. 42(6-7). 722–722. 2 indexed citations
2.
Bose, Prosenjit, et al.. (1994). K-Guarding Polygons on the Plane.. Canadian Conference on Computational Geometry. 381–386. 6 indexed citations
3.
Czyzowicz, Jurek, et al.. (1994). Guarding rectangular art galleries. Discrete Applied Mathematics. 50(2). 149–157. 11 indexed citations
4.
Zaks, Joseph. (1992). Uniform distances in rational unit-distance graphs. Discrete Mathematics. 109(1-3). 307–311. 1 indexed citations
5.
Zaks, Joseph. (1991). No nine neighborly tetrahedra exist. Memoirs of the American Mathematical Society. 91(447). 0–0. 3 indexed citations
6.
Zaks, Joseph. (1988). Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs. Journal of Combinatorial Theory Series A. 48(2). 147–155. 4 indexed citations
7.
Katchalski, Meir, T. Lewis, & Joseph Zaks. (1985). Geometric permutations for convex sets. Discrete Mathematics. 54(3). 271–284. 38 indexed citations
8.
Zaks, Joseph. (1983). Extending two theorems of A. Kotzig. Discrete Mathematics. 43(2-3). 309–315. 2 indexed citations
9.
Wills, J. M., Joseph Zaks, & Micha A. Perles. (1982). On lattice polytopes having interior lattice points.. 37. 44–45. 13 indexed citations
10.
Zaks, Joseph. (1982). Extending an extension of Grinberg's theorem. Journal of Combinatorial Theory Series B. 32(1). 95–98. 5 indexed citations
11.
Zaks, Joseph. (1980). Non-Hamiltonian simple 3-polytopes having just two types of faces. Discrete Mathematics. 29(1). 87–101. 20 indexed citations
12.
Zaks, Joseph. (1977). Non-Hamiltonian non-Grinbergian graphs. Discrete Mathematics. 17(3). 317–321. 13 indexed citations
13.
Zaks, Joseph. (1976). Pairs of Hamiltonian circuits in 5-connected planar graphs. Journal of Combinatorial Theory Series B. 21(2). 116–131. 8 indexed citations
14.
Gallivan, S & Joseph Zaks. (1975). Replacing convex sets by polytopes. Proceedings of the American Mathematical Society. 50(1). 351–351.
15.
Grünbaum, Branko & Joseph Zaks. (1974). The existence of certain planar maps. Discrete Mathematics. 10(1). 93–115. 27 indexed citations
16.
Zaks, Joseph. (1974). The Maximum Genus of Cartesian Products of Graphs. Canadian Journal of Mathematics. 26(5). 1025–1035. 9 indexed citations
17.
Zaks, Joseph. (1972). On a Conjecture of A. J. Hoffman. II. Proceedings of the American Mathematical Society. 34(1). 215–215. 1 indexed citations
18.
Zaks, Joseph. (1971). On a conjecture of A. J. Hoffman. Proceedings of the American Mathematical Society. 27(1). 122–125. 2 indexed citations
19.
Zaks, Joseph. (1971). On a Conjecture of A. J. Hoffman. Proceedings of the American Mathematical Society. 27(1). 122–122. 1 indexed citations
20.
Zaks, Joseph. (1969). On a Minimality Property of Complexes. Proceedings of the American Mathematical Society. 20(2). 439–439. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026