| 1994 |
|---|
| 9 | EE | Vincent Granville,
Mirko Krivánek,
Jean-Paul Rasson:
Simulated Annealing: A Proof of Convergence.
IEEE Trans. Pattern Anal. Mach. Intell. 16(6): 652-656 (1994) |
| 1993 |
|---|
| 8 | | Jan Kratochvíl,
Mirko Krivánek:
Satisfiability of Co-Nested Formulas.
Acta Inf. 30(4): 397-403 (1993) |
| 1990 |
|---|
| 7 | | Mirko Krivánek:
The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering.
MFCS 1990: 392-398 |
| 1988 |
|---|
| 6 | | Mirko Krivánek:
A Note on the Computational Complexity of Bracketing and Related Problems.
IMYCS 1988: 136-145 |
| 5 | | Jan Kratochvíl,
Mirko Krivánek:
On the Computational Complexity of Codes in Graphs.
MFCS 1988: 396-404 |
| 1986 |
|---|
| 4 | | Mirko Krivánek,
Jaroslav Morávek:
NP -Hard Problems in Hierarchical-Tree Clustering.
Acta Inf. 23(3): 311-323 (1986) |
| 3 | | Mirko Krivánek:
Hexagonal Unit Network a Tool for Proving the NP-Completeness Results of Geometric Problems.
Inf. Process. Lett. 22(1): 37-41 (1986) |
| 1985 |
|---|
| 2 | | Mirko Krivánek,
Jaroslav Morávek:
Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.
FCT 1985: 234-241 |
| 1 | | Mirko Krivánek,
Jaroslav Morávek:
Linear comparison complexity of the n-cube membership problem.
FCT 1985: 242-248 |
