Mirko Krivánek

According to our database1, Mirko Krivánek
  • authored at least 10 papers between 1985 and 1994.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1994
Simulated Annealing: A Proof of Convergence.
IEEE Trans. Pattern Anal. Mach. Intell., 1994

1993
Satisfiability of Co-Nested Formulas.
Acta Inf., 1993

1990
The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1988
On the Computational Complexity of Codes in Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

A Note on the Computational Complexity of Bracketing and Related Problems.
Proceedings of the Machines, 1988

1986
Hexagonal Unit Network a Tool for Proving the NP-Completeness Results of Geometric Problems.
Inf. Process. Lett., 1986

NP -Hard Problems in Hierarchical-Tree Clustering.
Acta Inf., 1986

1985
An application of limited branching in clustering.
Pattern Recognition Letters, 1985

Linear comparison complexity of the n-cube membership problem.
Proceedings of the Fundamentals of Computation Theory, 1985

Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.
Proceedings of the Fundamentals of Computation Theory, 1985


  Loading...