Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai. Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1557-1576, SIAM, 2013. [doi]
@inproceedings{ChalermsookLN13,
title = {Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More},
author = {Parinya Chalermsook and Bundit Laekhanukit and Danupon Nanongkai},
year = {2013},
url = {http://knowledgecenter.siam.org/0236-000061/},
researchr = {https://researchr.org/publication/ChalermsookLN13},
cites = {0},
citedby = {0},
pages = {1557-1576},
booktitle = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013},
editor = {Sanjeev Khanna},
publisher = {SIAM},
}