Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
Approximating Min-sum Set Cover
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Journal of Global Optimization
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)
Extraction and classification of dense communities in the web
Proceedings of the 16th international conference on World Wide Web
Ensemble Pruning Via Semi-definite Programming
The Journal of Machine Learning Research
Dynamical Systems for Discovering Protein Complexes and Functional Modules from Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximation algorithms for maximum cut with limited unbalance
Theoretical Computer Science
Finding a dense-core in Jellyfish graphs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Solving Generalized Maximum Dispersion with Linear Programming
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
On the maximum quadratic assignment problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Extraction and classification of dense implicit communities in the Web graph
ACM Transactions on the Web (TWEB)
Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Conflict Resolution in the Scheduling of Television Commercials
Operations Research
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
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)
Finding a dense-core in Jellyfish graphs
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
A Fourier space algorithm for solving quadratic assignment problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
PTAS for densest k-subgraph in interval graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
Approximating maximum cut with limited unbalance
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Discrete Applied Mathematics
On approximation of bookmark assignments
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Efficient algorithms for the max k-vertex cover problem
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics
Mathematics of Operations Research
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.01 |