Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More

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]

Authors

Parinya Chalermsook

This author has not been identified. Look up 'Parinya Chalermsook' in Google

Bundit Laekhanukit

This author has not been identified. Look up 'Bundit Laekhanukit' in Google

Danupon Nanongkai

This author has not been identified. Look up 'Danupon Nanongkai' in Google