>> Japanese

Reserch Topics (Interests)

Graph algorithms, Combinatorial Optimization, Hamiltonian Cycles, Finite Fields

Preprints

  1. Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita, The parity Hamiltonian cycle problem, arXiv:1501.06323, 2015.

Proceedings

  1. Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita, The parity Hamiltonian cycle problem in directed graphs, in Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO 2016), 50--58. Lecture Notes in Computer Science, 9849 (2016), 92--106.

Presentations

  1. "The odd depth tree problem," *Hiroshi Nishiyama, the Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3), Tokyo University of Science, Tokyo, Japan, Aug 29-Sep.1, 2017 (Sep 1).
  2. "The parity Hamiltonian cycle problem in directed graphs," *Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita, 4th International Symposium on Combinatorial Optimization (ISCO 2016), Lloyd's Baia Hotel, Vietri sul Mare, Italy, May 16-18, 2016 (May 17).
  3. "The parity Hamiltonian cycle problem in directed graphs," *Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita, the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan, June 2-5, 2015, (June 3).
  4. "Parity longest cycle problem," *Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita, The 16th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2013), Kyonggi University, Suwon, Korea, July 12-13, 2013 (July 12).