1. Bounds on the number of vertices of perturbed polyhedra;Armand;Ann. Oper. Res.,1993
2. D. Avis, A C implementation of the reverse search vertex enumeration algorithm, Technical Report, School of Computer Science, McGill University of Technology, Montreal, Canada, June 1993. (The code available at ftp://mutt.cs.mcgill.ca/pub/C/lrs.html.)
3. How good are convex hull algorithms?;Avis;Comput. Geom. Theor. Appl.,1997
4. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra;Avis;Discrete Comput. Geom.,1992
5. C. Filippi, A reverse search algorithm for the neighborhood problem, Technical Report 6/97, Dipartimento di Matematica, Università di Padova, Padova, Italy, May 1997. (Available in ps format at http://www.math.unipd.it/∼carlo/ri0697.html.)