
(8872) 
I. Kriz :
Ordinal types in Ramsey theory and wellpartialordering theory.

(8873) 
D. Volny :
Counterexamples to the central limit problem for stationary dependent random variables.

(8874) 
J. Matousek, J. Nesetril, R. Thomas :
On polynomialtime decidability of induced minorclosed classes.

(8875) 
J. Kratochvil, J. Nesetril :
Planar subgraphs of topological layouts.

(8876) 
J. Ulehla :
The description of the behaviour of the finite automaton in the Abelian group with two pebbles.

(8877) 
J. Rohn :
A short proof of finiteness of Murty's complementary pivot algorithm.

(8878) 
J. Ulehla :
Over the 28August87's draft of detecting regularities in computations by Oded Maler.

(8879) 
J. Rohn :
Nearness of matrices to singularity.

(8880) 
B. Gruber :
Reduced cells based on extremal principles (On a certain classification of Buerger cells).

(8881) 
S. Poljak, M. Schegel :
Computing Jordan canonical form of a matrix from its pattern.

(8882) 
P. Hell, J. Nesetril :
Universality of directed graphs of a given height.

(8883) 
J. Kratochvil :
String graphs I: The number of critical nonstring graphs is infinite.

(8884) 
O. Zyka :
Bipartite density for 3regular graphs with large girth.

(8885) 
V. Pus :
Chromatic number of product of graphs.

(8886) 
J. Kratochvil :
String graphs II: Recognizing string graphs is NPhard.

(8887) 
M. Loebl, S. Poljak :
On line balancing strongly unimodular matrices.

(8888) 
J. Kratochvil, S. Poljak :
Compatible twofactors.

(8889) 
A. Pultr :
Diameters in locales: How bad they can be.

(8890) 
J. Rohn :
An asymptotic result for linear interval systems.

(8891) 
J. Rohn :
A twosequence method for linear interval equations.

(8892) 
R. Thomas :
The treewidth compactness theorem for hypergraphs.

(8893) 
J. Ulehla :
Languages of moves.

(8894) 
P. Hell, J. Nesetril :
Images of rigid digraphs.

(8895) 
J. Nesetril, G. Sabidussi :
Minimal graphs without bilateral symmetry: The case of induced length 4.

(8896) 
J. Matousek, R. Thomas :
Algorithms finding treedecompositions of graphs.

(8897) 
B. Mohar, S. Poljak :
Eigenvalues and the maxcut problem.

(8898) 
A. Pultr, W. Tholen :
Localic enrichments of categories.

(8899) 
I. Kriz :
Wellquasiordering finite trees with gapcondition. Proof of Harvey Friedman's conjecture.

(88100) 
I. Kriz :
Proving a witness lemma in betterquasiordering theory: The method of ``extensions''.

(88101) 
J. Ulehla :
The twisted and the divisible mappings between the sets of all formal languages over given alphabets.

(88102) 
The Annual Report.

(88103) 
F. Mraz :
On local extremum of a quadratic function subject to linear constraints.

(88104) 
M. Krivanek, M. Loebl :
On the computational complexity of distance and median problems on partitions.

(88105) 
B. Banaschewski, A. Pultr :
Tarski's fixpoint lemma and combinatorial games.

(88106) 
M. Loebl :
On gadgets.

(88107) 
J. Kratochvil :
Perfect codes and twographs.

(88108) 
B. Banaschewski, A. Pultr :
Cauchy points of metric locales.

(88109) 
J. Ulehla :
The MAD project.

(88110) 
J. Nesetril :
Ramsey theory.

(88111) 
J. Ulehla :
Does this algorithm break the KuceraMicali code?.

(88112) 
J. Ulehla :
The moments of the distance of a randomly permutated random restricted KuceraMicali graph from restricted KuceraMicali graphs.

(88113) 
G. Brightwell, J. Nesetril :
Reorientation of covering graphs.

(88114) 
E. Hajicova, J. Panevova, P. Sgall :
Recent results of automation projects in Prague.

(88115) 
P. Alles, S. Poljak :
Long induced paths and cycles in Kneser graphs.

(88116) 
S. Poljak :
On generic dimension of controllable subspace.

(88117) 
S. Poljak, J. Rohn :
Radius of nonsingularity.

(88118) 
D. Matula, L. Kucera :
An ExposeandMerge algorithm and the chromatic number of a random graph.

(88119) 
L. Kucera :
Graphs with small chromatic numbers are easy to color.

(88120) 
J. Panevova, P. Sgall :
On the notion of Interlingua.

(88121) 
I. Kriz, R. Thomas :
On wellquasiordering finite structures with labels.

