Chalermsook, P., Laekhanukit, B., & Nanongkai, D. (2013). Graph Products Revisited:
Tight Approximation Hardness of Induced Matching, Poset Dimension and More. In Proceedings of the
Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1557-1576). New York, NY: ACM.