
(90160) 
N. Alon, P. D. Seymour, R. Thomas :
A separator theorem for nonplanar graphs.

(90161) 
B. Banaschewski, A. Pultr :
Cauchy points of uniform and nearness locales.

(90162) 
J. Kratochvil, P. Savicky, Zs. Tuza :
One more occurence of variables makes satisfiability jump from trivial to NPcomplete.

(90163) 
S. Poljak :
Neural network analysis via linear programming and convexity.

(90164) 
J. Kratochvil, J. Nesetril :
Independent set and maximal clique problems in intersectiondefined classes of graphs.

(90165) 
S. Poljak, T. Nishizeki :
$K$connectivity and decomposition of graphs into forests.

(90166) 
Annual Report (with Prachatice meeting appendix).

(90167) 
P. Bugata :
On algorithmic solvability of TrakhtenbrotZykov problem.

(90168) 
D. Zeps :
The triconnectivity considered dynamically.

(90169) 
V. Nydl :
Finite undirected graphs which are not reconstructible from their large cardinality subgraphs.

(90170) 
S. Poljak :
Minimum spectral radius of a weighted graph.

(90171) 
Ch. Delorme, S. Poljak :
Laplacian eigenvalues and the maximum cut problem.

(90172) 
S. Poljak :
On controllability Kronecker indices of structured systems.

(90173) 
M. Deza, M. Laurent, S. Poljak :
The cut cone III: On the role of triangle facets.

(90174) 
J. Matousek :
Approximations and optimal geometric divideandconquer.

(90175) 
J. Matousek :
Efficient partition trees.

(90176) 
J. Matousek :
Cutting hyperplane arrangements.

(90177) 
S. Janson, J. Kratochvil :
Proportional graphs.

(90178) 
J. Matousek :
A simple proof of weak zone theorem.

(90179) 
P. Savicky :
Bent function and random Boolean formulae.

(90180) 
O. Zyka :
.. and some more descriptions of matroids.

(90181) 
P. Valtr :
Convex independent sets and 7holes in restricted planar point sets.

(90182) 
J. Matousek :
Randomized optimal algorithm for slope selection.

(90183) 
P. Valtr :
Sets in $R^d$ with no large empty convex subsets.

(90184) 
J. Matousek :
Computing dominances in $E^n$.

(90185) 
M. Loebl :
Greedy compression systems.

(90186) 
M. Loebl :
Postorder strategy for tree compressions (Extended abstract).

(90187) 
M. Loebl :
Postorder strategy for tree compressions.

(90188) 
P. Savicky :
On the bent Boolean functions which are symmetric.

(90189) 
M. Krivanek :
Connected admissible hierarchical clustering.

(90190) 
M. Krivanek :
Single linkage vs. complete linkage.

(90191) 
J. Matousek :
Epsilonnets and computational geometry.

(90192) 
M. Loebl, J. Nesetril :
Unprovability of set union problem strategies.

(90193) 
J. Matousek :
Reporting points in halfspaces.

(90194) 
W. Imrich, J. Nesetril :
Simple tournaments and sharply transitive graphs.

