Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Daniel Lokshtanov' in GoogleThis author has not been identified. Look up 'Dániel Marx' in GoogleThis author has not been identified. Look up 'Saket Saurabh' in Google

runs on WebDSL