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.
Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
In: 14th IFIP Networking Conference Proceedings of 2015 14th IFIP Networking Conference, IFIP Networking 2015 Institute of Electrical and Electronics Engineers (IEEE), New York, pp. 7145330.