Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Finding $k$ Cuts within Twice the Optimal
SIAM Journal on Computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On cutting a few vertices from a graph
Discrete Applied Mathematics
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Triangle listing in massive networks and its applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Triangle listing in massive networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
| Hi-index | 0.00 |