
(93233) 
J. Nesetril :
Graph homomorphisms and their structure.

(93234) 
P. Erdos, Zs. Tuza, P. Valtr :
Ramseyremainder.

(93235) 
M. Klazar :
Two results on a partial ordering of finite sequences.

(93236) 
F. Mraz :
On supremum of the solution function in LP's with interval coefficients.

(93237) 
P. Hell, J. Nesetril, X. Zhu :
Complexity of tree homomorphisms.

(93238) 
J. Rohn :
Cheap and tight bounds: The recent result by E. Hansen can be made more efficient.

(93239) 
F. Mraz :
The algorithm for solving interval linear programs and comparison with similar approaches.

(93240) 
M. Klazar :
On well quasiordering of finite languages.

(93241) 
J. Nesetril, V. Rodl :
More on complexity of diagrams.

(93242) 
P. Valtr :
On mutually avoiding sets.

(93243) 
P. Hell, J. Nesetril, X. Zhu :
Duality and polynomial testing of tree homomorphisms.

(93244) 
P. Hell, J. Nesetril, X. Zhu :
Duality of graph homomorphisms .

(93245) 
J. Matousek :
On enclosing $k$ points by a circle.

(93246) 
M. de Berg, J. Matousek, O. Schwarzkopf :
Piecewise linear paths among convex obstacles.

(93247) 
J. Matousek :
On Lipschitz mapping onto a square.

(93248) 
B. Aronov, J. Matousek :
On stabbing triangles by lines in 3space.

(93249) 
P. Greenberg, M. Loebl :
Strong connectivity on polyhedral complexes.

(93250) 
P. Erdos, M. Loebl, I. Ruzsa, V. T. Sos :
Discrepancy of trees.

(93251) 
M. Klazar :
Extremal functions for sequences.

(93253) 
J. Nesetril, P. Valtr :
A Ramseytype theorem in the plane.

(93254) 
Prague Midsummer Combinatorial Workshop.

(93255) 
J. Gimbel :
A note on sources and sinks in comparability graphs.

(93256) 
M. Klazar :
On a proof of Ramsey theorem and of ErdosRado theorem for pairs.

(93257) 
J. Matousek :
On geometric optimization with few violated constraints.

(93258) 
H. Bronnimann, B. Chazelle, J. Matousek :
Product range spaces, sensitive sampling and derandomization.

(93259) 
J. Matousek :
Derandomization in computational geometry.

