A Note on the Approximation of a Minimum-Weight Maximal Independent Set
Computational Optimization and Applications
Discrete Mathematics
Polynomially bounded minimization problems that are hard to approximate
Nordic Journal of Computing
Hardness of Approximating Independent Domination in Circle Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
The bottleneck independent domination on the classes of bipartite graphs and block graphs
Information Sciences—Informatics and Computer Science: An International Journal
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
Note: On the inapproximability of independent domination in 2P3-free perfect graphs
Theoretical Computer Science
Approximation for minimum total dominating set
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Discrete Applied Mathematics
Vertex domination in dynamic networks
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Independent domination on tree convex bipartite graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Hi-index | 0.89 |