第12回 International Conference and Workshops on Algorithms and Computation (WALCOM 2018) において以下の研究成果の公表を行いました．

• Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, and Tom C. van der Zanden. Complexity of the maximum k-path vertex cover problem. Proc. 12th Annual Workshop on Algorithms and Computation (WALCOM 2018), LNCS10755, pp.240-251, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), ECE building, West Palasi, Dhaka, Bangladesh (March 3-5, 2018). DOI:10.1007/978-3-319-75172-6