Joseph Zaks

发表

K-Guarding Polygons on the Plane

Prosenjit Bose, Jorge Urrutia, Jurek Czyzowicz, 1994, CCCG.

On illuminating line segments in the plane

Jorge Urrutia, Jurek Czyzowicz, Joseph Zaks, 1995, Discret. Math..

Extending two theorems of A. Kotzig

Joseph Zaks, 1983, Discret. Math..

On the connectedness of some geometric graphs

Joseph Zaks, 1990, J. Comb. Theory, Ser. B.

The Beckman-Quarles theorem for rational spaces

Joseph Zaks, 2003, Discret. Math..

Separating convex sets in the plane

Jorge Urrutia, Jurek Czyzowicz, Joseph Zaks, 1992, Discret. Comput. Geom..

Geometric permutations for convex sets

Ted Lewis, Joseph Zaks, Meir Katchalski, 1985, Discret. Math..

Monohedrally knotted tilings of the 3-space

Joseph Zaks, 1997, Discret. Math..

Guarding rectangular art galleries

Jorge Urrutia, Jurek Czyzowicz, Joseph Zaks, 1994, Discret. Appl. Math..

Parsons graphs of matrices

Joseph Zaks, 1989, Discret. Math..

Non-Hamiltonian simple 3-polytopes having just two types of faces

Joseph Zaks, 1980, Discret. Math..

Convexification of polygons by flips and by flipturns

Branko Grünbaum, Joseph Zaks, 2001, Discret. Math..

The existence of certain planar maps

Branko Grünbaum, Joseph Zaks, 1974, Discret. Math..

Tight Bounds for the Rectangualr Art Gallery Problem

Jorge Urrutia, Jurek Czyzowicz, Joseph Zaks, 1991, WG.

Erratum to "The Beckman-Quarles theorem for rational spaces": [Discrete Mathematics 365 (2003) 311-320]

Joseph Zaks, 2003, Discret. Math..

Extending an extension of Grinberg's theorem

Joseph Zaks, 1982, J. Comb. Theory, Ser. B.

Non-Hamiltonian non-Grinbergian graphs

Joseph Zaks, 1977, Discret. Math..

Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs

Joseph Zaks, 1988, J. Comb. Theory, Ser. A.

Protecting convex sets

Jorge Urrutia, Jurek Czyzowicz, Joseph Zaks, 1994, Graphs Comb..

Pairs of Hamiltonian circuits in 5-connected planar graphs

Joseph Zaks, J. Zaks, 1976, J. Comb. Theory, Ser. B.

Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]

Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks, 2009, Comput. Geom..

Uniform distances in rational unit-distance graphs

Joseph Zaks, 1992, Discret. Math..

The Maximum Genus of Cartesian Products of Graphs

Joseph Zaks, J. Zaks, 1974, Canadian Journal of Mathematics.

The analogue of eberhard’s theorem for 4-valent graphs on the torus

Joseph Zaks, J. Zaks, 1971 .

On the number of k-simplexes in the m-th barycentric subdivision of an r-simplex

Joseph Zaks, J. Zaks, 1969 .

How Does a Complete Graph Split into Bipartite Graphs and How Are Neighborly Cubes Arranged

Joseph Zaks, J. Zaks, 1985 .

Bounds of neighborly families of convex polytopes

Joseph Zaks, 1979 .

On four-colourings of the rational four-space

Joseph Zaks, 1989 .

Extending Kotzig’s theorem

Joseph Zaks, 1983 .

Non-Hamiltonian Simple Planar Graphs

Joseph Zaks, J. Zaks, 1982 .

On the 1-factors of n-connected graphs

Joseph Zaks, 1971 .

No nine neighborly tetrahedra exist

Joseph Zaks, 1991 .

Neighborly families of 2dd-simplices in Ed

Joseph Zaks, 1981 .

6-Valent analogues of Eberhard’s theorem

Joseph Zaks, J. Zaks, 1974 .

Non-Hamiltonian Cubic Planar Graphs Having Just Two Types of Faces

Joseph Zaks, 1980 .

Shortness coefficient of cyclically 5-connected cubic planar graphs

Joseph Zaks, 1982 .

Illuminating high-dimensional convex sets

Jorge Urrutia, Bruno Gaujal, Jurek Czyzowicz, 1995 .