Daniel Lokshtanov, Dániel Marx, Saket Saurabh. Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 777-789, SIAM, 2011. [doi]
No references recorded for this publication.
No citations of this publication recorded.