
(92220) 
J. Kratochvil, J. Nesetril, O. Zyka :
On the computational complexity of Seidel's switching.

(92221) 
J. Nesetril :
On ordered graphs and graph orderings.

(92222) 
P. Valtr :
On the minimum number of empty polygons in planar point sets.

(92223) 
J. Nesetril, V. Rodl :
On Ramsey graphs without bipartite subgraphs.

(92224) 
H.D. O. F. Gronau, J. Nesetril :
On 2$(v,4,\lambda)$ designs without pair intersections.

(92225) 
J. Rohn :
On the common argument behind the finite pivoting rules by Bland and Murty.

(95226) 
A. S. Fraenkel, M. Loebl :
Complexity of circuit intersection in graphs.

(92227) 
M. Klazar, P. Valtr :
Linear sequences.

(92228) 
B. Banaschewski, A. Pultr :
Variants of openness.

(92229) 
P. Valtr :
Unit squares intersecting all secants of a square.

(92230) 
P. K. Agarwal, J. Matousek :
On range searching with semialgebraic sets.

(92231) 
J. Matousek, O. Schwarzkopf :
A deterministic algorithm for the threedimensional diameter problem.

(92232) 
P. Gvozdjak, J. Nesetril :
High girth and extendability.

