Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Bart M. P. Jansen, Dániel Marx. Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 616-629, SIAM, 2015. [doi]

This author has not been identified. Look up 'Bart M. P. Jansen' in GoogleThis author has not been identified. Look up 'Dániel Marx' in Google

runs on WebDSL