Jansen, BMP and Marx, Dániel (2015) Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (8845). Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp. 616-629. ISBN 978-1-61197-374-7

Preview	Text Jansen_616_2983454_ny.pdf Download (515kB) | Preview
	Text Jansen_616_2983454_z.pdf Restricted to Registered users only Download (473kB) | Request a copy

Update Item