Some of the older papers by J. Matousek
This page contains some papers which might be difficult to access in libraries.
The files may contain errors which are corrected in the printed versions.
These are mostly compressed postscript files (use "gunzip "
before sending to a postscript printer). With the U.S. paper format, people
sometimes have problems printing some of the files. If this happens to
you, please send me an email, I'll reformat the relevant paper or send
you a TeX file.

Integer
points in rotating convex bodies
with Imre Barany (Discrete and Computational
Geometry  The GoodmanPolack Festschrift (B. Aronov, S.
Basu, J. Pach, M. Sharir, eds)
 Lowdistortion embeddings of trees with
Robert Babilon, Jana Maxova, and Pavel Valtr (Proc. Graph Drawing 2002)
 Lowdistortion embeddings
of finite metric spaces with Piotr Indyk, a chapter
for the new edition of the Handbook of Discrete and Computational Geometry
 Nonexistence of 2reptile simplices

Berge's theorem, fractional Helly, and art galleries
with Imre Barany, in a special volume dedicated to Claude Berge

Discrepancy of Point Sequences on Fractal Sets,
with H. Albrecher and R. Tichy, Publicationes Mathematicae Debrecen
(special volume dedicated to K. Gyori)

Mathematical snapshots from the computational geometry landscape (short survey;
in Proc. ICM 1998)

Geometric set systems  a survey (VCdimension etc.), in Proc. 2nd. European
Math. Congress

Derandomization in computational geometry  a survey,
Handbook of Computational Geometry (J. R. Sack ed.)

On enclosing k points by a circle
Information Processing Letters 53(1995) 217221.

Dynamic halfspace range reporting
and its applications with P.K. Agarwal (Algorithmica)

Reporting points in halfspaces

BiLipschitz embeddings into lowdimensional
Euclidean spaces

Hercules versus Hidden Hydra Helper (with M. Loebl)

Note on biLipschitz embeddings into normed spaces

Ramseylike properties for biLipschitz mappings
of finite metric spaces

Computing the center of planar point sets

Geometric range searching (the version printed
in ACM Comput. Surveys is rather distorted)

How to Net a Lot with Little: Small EpsilonNets
for Disks and Halfspaces with R. Seidel and E. Welzl  the published
version has a substantial gap in the proof, and here it is (hopefully)
corrected

On Lipschitz mappings onto a square

The complexity of the lower envelope of segments with
h endpoints (with Pavel Valtr)
Jiri Matousek's home page