Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Bibliography next up previous
Next: About this document ... Up: A POINT SET WHOSE Previous: A POINT SET WHOSE

Bibliography

1
A. BJÖRNER, Topological methods, in: Handbook of Combinatorics, Elsevier, Amsterdam, 1995.

2
G. EWALD, Combinatorial convexity and algebraic geometry, Springer-Verlag, 1996.

3
J.A. DE LOERA, F. SANTOS AND J. URRUTIA, The number of geometric bistellar neighbors of a triangulation, Discrete Comput. Geom., 21 (1999) 1, 131-142.

4
C.W. LEE, Subdivisions and triangulations of polytopes, in Handbook of Discrete and Computational Geometry (J.E. Goodman and J. O'Rourke eds.), 290-271, CRC Press, New York, 1997.

5
V. REINER, The generalized Baues problem, manuscript 1998.

6
F. SANTOS, Triangulations with very few geometric bistellar neighbors, Discrete Comput. Geom., to appear. Preprint available at http://matsun1.matesco.unican.es/~santos/Articulos/fewflips.ps.gz

7
G. ZIEGLER, Lectures on Polytopes, Springer-Verlag, New York, 1994.

8
G. ZIEGLER, Recent progress on polytopes, in ``Advances in Discrete and Computational Geometry" (B. Chazelle, J.E. Goodman, R. Pollack, eds.), Contemporary Mathematics 223 (1998), Amer. Math. Soc., Providence, 395-406.


Tanja Krenn
1999-07-19