Finding large independent sets of hypergraphs in parallel
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
On the domination number of a graph
Discrete Mathematics
Finding independent sets in a graph using continuous multivariable polynomial formulations
Journal of Global Optimization
On Dominating Sets and Independent Sets of Graphs
Combinatorics, Probability and Computing
Independence numbers of hypergraphs with sparse neighborhoods
European Journal of Combinatorics
On Two Conjectures on Packing of Graphs
Combinatorics, Probability and Computing
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
Linear kernelizations for restricted 3-Hitting Set problems
Information Processing Letters
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
Efficiently decodable non-adaptive group testing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
3-Hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
On approximation of the vertex cover problem in hypergraphs
Discrete Optimization
The potential of greed for independence
Journal of Graph Theory
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
Partitions of graphs into small and large sets
Discrete Applied Mathematics
| Hi-index | 0.00 |