Jaroslav Morávek

According to our database1, Jaroslav Morávek
  • authored at least 6 papers between 1972 and 1986.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

1984
New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1973
Computational Optimality of a Dynamic Programming Method.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972
A localization problem in geometry and complexity of discrete programming.
Kybernetika, 1972


  Loading...