Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="K{\v{r}}iv{\'a}nek, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The use of graphs of elliptical influence in visual hierarchical clustering
M. Kȓivánek
Lecture Notes in Computer Science
452
, 1990, pp. 392-398
On the computational complexity of codes in graphs
J. Kratochvíl
,
M. Kȓivánek
Lecture Notes in Computer Science
324
, 1988, pp. 396-404
The complexity of ultrametric partitions on graphs
M. Kȓivánek
Information Processing Letters
27
(5), 1988, April, pp. 265-270
NP-hard problems in hierarchical-tree clustering
M. Kȓivánek
,
J. Morávek
Acta Informatica
23
(3), 1986, pp. 311-323
Hexagonal unit network - a tool for proving the
NP
-completeness results of geometric problems
M. Kȓivánek
Information Processing Letters
22
(1), 1986, January, pp. 37-41
Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete
M. Kȓivánek
,
J. Morávek
Lecture Notes in Computer Science
199
, 1985, pp. 234-241
Linear comparison complexity of the n-cube membership problem
M. Kȓivánek
,
J. Morávek
Lecture Notes in Computer Science
199
, 1985, pp. 242-248