Almost Tight Bounds for e-Nets. G. Woeginger; J. Komlós; J Pach — 1992 Discrete & computational geometry
An Upper Bound on the Number of Planar K-Sets. J. Pach; E. Szemeredi; W. Steiger — 1992 Discrete & computational geometry
How Hard Is Half-Space Range Searching? J. Pach; B. Chazelle; H. Brönnimann — 1993 Discrete & computational geometry
A Left-First Search Algorithm for Planar Graphs. J. Pach; H. de Fraysseix; P.O. de Mendez — 1995 Discrete & computational geometry
On flatness and some ergodic properties of Banach spaces Pach, A. J. — 1981 Abstracta. 9th Winter School on Abstract Analysis