Mirko Krivánek

According to our database, Mirko Krivánek authored at least 10 papers between 1985 and 1994.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1994

Simulated Annealing: A Proof of Convergence.

Vincent Granville, Mirko Krivánek, Jean-Paul Rasson

IEEE Trans. Pattern Anal. Mach. Intell., 1994

1993

Satisfiability of Co-Nested Formulas.

Jan Kratochvíl, Mirko Krivánek

Acta Informatica, 1993

1990

The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering.

Mirko Krivánek

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1988

On the Computational Complexity of Codes in Graphs.

Jan Kratochvíl, Mirko Krivánek

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

A Note on the Computational Complexity of Bracketing and Related Problems.

Mirko Krivánek

Proceedings of the Machines, 1988

1986

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

Mirko Krivánek

Inf. Process. Lett., 1986

<i> NP </i> -Hard Problems in Hierarchical-Tree Clustering.

Mirko Krivánek, Jaroslav Morávek

Acta Informatica, 1986

1985

An application of limited branching in clustering.

Mirko Krivánek

Pattern Recognit. Lett., 1985

Linear comparison complexity of the n-cube membership problem.

Mirko Krivánek, Jaroslav Morávek

Proceedings of the Fundamentals of Computation Theory, 1985

Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.

Mirko Krivánek, Jaroslav Morávek

Proceedings of the Fundamentals of Computation Theory, 1985