SIAM Journal on Computing
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The maximal dispersion problem and the “first point outside the neighbourhood” heuristic
Computers and Operations Research
Finding k points with minimum diameter and related problems
Journal of Algorithms
Obnoxious facility location on graphs
SIAM Journal on Discrete Mathematics
New algorithms for minimum area k-gons
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algorithms for a core and k-tree core of a tree
Journal of Algorithms
Finding a minimum weight K-link path in graphs with Monge property and applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Guarantees for Minimum-Weight k-trees and Prize-collecting Salesmen
Improved Approximation Guarantees for Minimum-Weight k-trees and Prize-collecting Salesmen
The k-Median Problem for Directed Trees
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Generalized Maximum Independent Sets for Trees in Subquadratic Time
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Extracting redundancy-aware top-k patterns
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Max-Sum diversification, monotone submodular functions and dynamic updates
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
An O(pn2) algorithm for the p -median and related problems on tree graphs
Operations Research Letters
| Hi-index | 0.00 |