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: IEEE International Symposium on Circuits and Systems, ISCAS 2015 Proceedings - IEEE International Symposium on Circuits and Systems (2015-J) IEEE, New York, pp. 401-404. ISSN 0271-4310
Overview of CNN research: 25 years history and the current trends
In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp. 642-661.
An exact characterization of tractable demand patterns for maximum disjoint path problems