Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On greedy construction heuristics for the MAX-CUT problem
International Journal of Computational Science and Engineering
On Metric Clustering to Minimize the Sum of Radii
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Foundations and Trends® in Theoretical Computer Science
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
A polynomial time approximation scheme for k-consensus clustering
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Min sum clustering with penalties
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |