Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
Maximum dispersion and geometric maximum weight cliques
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
DS '99 Proceedings of the Second International Conference on Discovery Science
Discrete location problems with push-pull objectives
Discrete Applied Mathematics
Journal of Global Optimization
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
The complexity of detecting fixed-density clusters
Discrete Applied Mathematics
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Variable neighborhood search for the heaviest k-subgraph
Computers and Operations Research
Upper bounds and exact algorithms for p-dispersion problems
Computers and Operations Research
The complexity of detecting fixed-density clusters
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation algorithms for maximum graph partitioning problems extended abstract
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics
Mathematics of Operations Research
Truncated power method for sparse eigenvalue problems
The Journal of Machine Learning Research
Approximation with a fixed number of solutions of some multiobjective maximization problems
Journal of Discrete Algorithms
| Hi-index | 0.00 |