
(861) 
J. Nesetril, V. Rodl :
Complexity of diagrams.

(862) 
P. Sgall :
From expression through meaning to intension.

(863) 
I. Kriz :
A hypergraphless construction of highly chromatic graphs without short cycles.

(864) 
M. Loebl, S. Poljak :
On matroids induced by packing subgraphs.

(865) 
K. Zimmermann :
One optimization problem with maxmin operations.

(866) 
R. Svarc :
Some combinatorial results about the operators with jumping nonlinearities.

(867) 
J. Matousek :
Few colored cuts or cycles in edge colored graphs.

(868) 
E. Hajicova :
Machine translation research in Czechoslovakia.

(869) 
J. Nesetril, P. Pudlak :
A note on Boolean dimension of posets.

(8610) 
L. Kucera :
Greedy coloring is a bad probabilistic algorithm.

(8611) 
S. Poljak, M. Chrobak :
On common edges in optimal solutions to travelling salesman and other optimization problems.

(8612) 
R. Svarc :
The operators with jumping nonlinearities and combinatorics.

(8613) 
R. Thomas :
A counterexample to Wagner's conjecture for infinite graphs.

(8614) 
P. Sgall, J. Panevova :
Dependency syntax, its problems and advantages.

(8615) 
J. Kratochvil, D. Zeps :
On the minimum number of hamiltonian cycles in triangulations.

(8616) 
J. Nesetril :
For graphs there are only four types of hereditary Ramsey classes.

(8617) 
S. Poljak, Zs. Tuza :
Maximum bipartite subgraphs of Kneser graphs.

(8618) 
J. Nesetril, R. Thomas :
Well quasiorderings, long games and a combinatorial study of undecidability.

(8619) 
M. Loebl, J. Matousek :
On undecidability of the weakened Kruskal theorem.

(8620) 
M. Loebl, S. Poljak :
Remark on restricted and strongly unimodular matrices and a class between them.

(8621) 
E. Hajicova :
Focussing  a meeting point of linguistics and artificial intelligence.

(8622) 
P. Hell, J. Nesetril :
On the complexity of Hcoloring.

