研究業績

各項目は，新しいものが上になるように並んでいます．

査読付論文

  1. Kyohei Kozawa, Yota Otachi, and Koichi Yamazaki,
    On spanning tree congestion of graphs,
    Discrete Mathematics, 309 (2009) 4215-4224.
  2. Kyohei Kozawa, Yota Otachi, and Koichi Yamazaki,
    Security number of grid-like graphs,
    Discrete Applied Mathematics, 157 (2009) 2555-2561.
  3. Tetsuya Ishizeki, Yota Otachi, and Koichi Yamazaki,
    An improved algorithm for longest induced path problem on k-chordal graphs,
    Discrete Applied Mathematics, 156 (2008) 3057-3059.
  4. Yota Otachi and Koichi Yamazaki,
    A lower bound for the vertex boundary-width of complete k-ary trees,
    Discrete Mathematics, 308 (2008) 2389-2395.
  5. Yota Otachi, Yoshio Okamoto, and Koichi Yamazaki,
    Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs,
    Discrete Applied Mathematics, 155 (2007) 2383-2390.

国際会議

  1. Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, and Ryuhei Uehara,
    Random generation and enumeration of bipartite permutation graphs,
    20th International Symposium on Algorithms and Computation (ISAAC 2009),
    December 16-18, 2009 in Hawaii, USA.
    Lecture Notes in Computer Science, 5878 (2009) 1104-1113.
  2. Masanobu Furuse, Yota Otachi, and Koichi Yamazaki,
    Reformulation of the scheme for computing tree-width and minimum fill-in,
    7th Japan Conference on Computational Geometry and Graphs (JCCGG 2009),
    November 11-13, 2009 in Kanazawa, Japan.
    Proc. of JCCGG 2009, pp. 91-92.
  3. Kyohei Kozawa, Yota Otachi, and Koichi Yamazaki,
    A lower bound for tree-width of Cartesian product graphs,
    6th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications,
    May 16-19, 2009 in Budapest, Hungary.
    Proc. of JH 2009, pp. 280-288.
  4. Katsuhisa Yamanaka, Yota Otachi, and Shin-ichi Nakano,
    Efficient enumeration of ordered trees with k leaves,
    3rd Annual Workshop on Algorithms and Computation (WALCOM 2009),
    February 18-20, 2009 in Kolkata, India.
    Lecture Notes in Computer Science, 5431 (2009) 141-150.