Lokshtanov, Daniel, Dániel Marx, and Saket Saurabh, ‘Probably optimal’: ‘Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal’, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 23 January 2011, pp 777–789.
conference paper · https://doi.org/10.1137/1.9781611973082.61