A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximation algorithms for the achromatic number
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On approximating the achromatic number
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Note on the Approximation of a Minimum-Weight Maximal Independent Set
Computational Optimization and Applications
Minimum independent dominating sets of random cubic graphs
Random Structures & Algorithms
Polynomially bounded minimization problems that are hard to approximate
Nordic Journal of Computing
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
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The intractability of computing the Hamming distance
Theoretical Computer Science
On the Independent Domination Number of Random Regular Graphs
Combinatorics, Probability and Computing
Finding minimum hidden guard sets in polygons: tight approximability results
Computational Geometry: Theory and Applications
Approximating Alternative Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
Approximating minimum independent dominating sets in wireless networks
Information Processing Letters
Note: On the inapproximability of independent domination in 2P3-free perfect graphs
Theoretical Computer Science
Finding minimum hidden guard sets in polygons---tight approximability results
Computational Geometry: Theory and Applications
Complexity results on labeled shortest path problems from wireless routing metrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Journal of Combinatorial Optimization
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Exact algorithms for finding the minimum independent dominating set in graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Fast algorithms for min independent dominating set
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
DisC diversity: result diversification based on dissimilarity and coverage
Proceedings of the VLDB Endowment
Fast algorithms for min independent dominating set
Discrete Applied Mathematics
Hi-index | 0.89 |