Die Auflösung linearer Programme ohne Kenntnis einer zulässigen Ausgangslösung. - Walter Nef (Unternehmensforschung, 1964)

A recursive sweep-plane algorithm, determining all cells of a finite division of Rd. - Hanspeter Bieri; Walter Nef (Computing, 1982)

Algorithms for the euler characteristic and related additive functionals of digital objects. - Hanspeter Bieri; Walter Nef (Comput. Vis. Graph. Image Process., 1984)

A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form. - Hanspeter Bieri; Walter Nef (Computing, 1985)

Elementary Set Operations with d-Dimensional Polyhedra. - Hanspeter Bieri; Walter Nef (Workshop on Computational Geometry, 1988)

Computing a Sweeping-Plane in Regular ("General") Position: A Numerical and a Symbolic Solution. - Walter Nef; Peter-Michael Schmidt (J. Symb. Comput., 1990)