M. Krivánek

Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete

M. Krivánek, 1986 .

Hexagonal Unit Network a Tool for Proving the NP-Completeness Results of Geometric Problems

Mirko Krivánek, M. Krivánek, 1986, Inf. Process. Lett..

Simulated Annealing: A Proof of Convergence

Mirko Krivánek, Jean-Paul Rasson, Vincent Granville, 1994, IEEE Trans. Pattern Anal. Mach. Intell..

NP-hard problems in hierarchical-tree clustering

Mirko Krivánek, Jaroslav Morávek, J. Morávek, 1986, Acta Informatica.

The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering

Mirko Krivánek, M. Krivánek, 1990, MFCS.