1. Geometrical realization of set systems and probabilistic communication complexity;Alon;Symp. Found. Comput. Sci.,1985
2. N. Alon, J.H. Spencer, With an appendix on the life and work of Paul Erdős, The Probabilistic Method, second ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience [John Wiley & Sons], New York, 2000.
3. Unit disk graph recognition is NP-hard;Breu;Comput. Geom.,1998
4. Line graphs, root systems, and elliptic geometry;Cameron;J. Algebra,1976
5. Applications of cut polyhedra. I, II;Deza;J. Comput. Appl. Math.,1994