The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jaroslav Morávek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mirko Krivánek, Jaroslav Morávek
    Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:234-241 [Conf]
  2. Mirko Krivánek, Jaroslav Morávek
    Linear comparison complexity of the n-cube membership problem. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:242-248 [Conf]
  3. Jaroslav Morávek
    Computational Optimality of a Dynamic Programming Method. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:267-270 [Conf]
  4. Jaroslav Morávek, Pavel Pudlák
    New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:416-424 [Conf]
  5. Mirko Krivánek, Jaroslav Morávek
    NP -Hard Problems in Hierarchical-Tree Clustering. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:23, n:3, pp:311-323 [Journal]

Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002