The value of strong inapproximability results for clique
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
eMediator: a next generation electronic commerce server
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of clique and related maximization problems
Journal of Computer and System Sciences
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
On the complexity of approximating k-set packing
Computational Complexity
Understanding the power of distributed coordination for dynamic spectrum management
Mobile Networks and Applications
On Lagrangian Relaxation and Subset Selection Problems
Approximation and Online Algorithms
Approximation algorithms for the weighted independent set problem in sparse graphs
Discrete Applied Mathematics
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
An algorithm for optimal winner determination in combinatorial auctions
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
GreedyMAX-type algorithms for the maximum independent set problem
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Coalition formation for task allocation: theory and algorithms
Autonomous Agents and Multi-Agent Systems
Practical computation of optimal schedules in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
Approximation algorithms for the weighted independent set problem
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
SDP-based algorithms for maximum independent set problems on hypergraphs
Theoretical Computer Science
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Complexity results for rainbow matchings
Theoretical Computer Science
| Hi-index | 0.00 |