An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3

On the parallel complexity of computing a maximal independent set in a hypergraph

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Finding large independent sets of hypergraphs in parallel

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures

A global parallel algorithm for the hypergraph transversal problem

Information Processing Letters

On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs

Theoretical Computer Science

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

A new algorithm for the hypergraph transversal problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics