On dense bipartite graphs of girth eight and upper bounds for certain configurations in planar point-line systems

Paul Erdös (1913-996): his influence on the theory of computing

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Research problems

Discrete Mathematics - Kleitman and combinatorics: a celebration

The size of bipartite graphs with a given girth

Journal of Combinatorial Theory Series B

Triangles in arrangements of points and lines in the plane

Journal of Combinatorial Theory Series A