The algorithmic aspects of uncrowded hypergraphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Finding large independent sets of hypergraphs in parallel
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Semantic api matching for automatic service composition
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
Semantic search of schema repositories
WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
An improved simulated annealing algorithm for the maximum independent set problem
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Energy and time efficient broadcasting in known topology radio networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.01 |