Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete. - Mirko Krivánek; Jaroslav Morávek (FCT, 1985)

Linear comparison complexity of the n-cube membership problem. - Mirko Krivánek; Jaroslav Morávek (FCT, 1985)

An application of limited branching in clustering. - Mirko Krivánek (Pattern Recognit. Lett., 1985)

NP -Hard Problems in Hierarchical-Tree Clustering. - Mirko Krivánek; Jaroslav Morávek (Acta Informatica, 1986)

Hexagonal Unit Network a Tool for Proving the NP-Completeness Results of Geometric Problems. - Mirko Krivánek (Inf. Process. Lett., 1986)

A Note on the Computational Complexity of Bracketing and Related Problems. - Mirko Krivánek (IMYCS, 1988)

On the Computational Complexity of Codes in Graphs. - Jan Kratochvíl; Mirko Krivánek (MFCS, 1988)

The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering. - Mirko Krivánek (MFCS, 1990)

Satisfiability of Co-Nested Formulas. - Jan Kratochvíl; Mirko Krivánek (Acta Informatica, 1993)

Simulated Annealing: A Proof of Convergence. - Vincent Granville; Mirko Krivánek; Jean-Paul Rasson (IEEE Trans. Pattern Anal. Mach. Intell., 1994)