1997.4 -- 1998.3

1997.4 -- 1998.3

[Journal] [Conferance] [Technical Reports] [Back]
Journal papres :
  1. F. Bao, A. Mei, and Y. Igarashi, "Average competitive ratios of on-line spanning trees", Information Processing Letters, Vol. 62, No. 4, pp. 213--216, 1997.

  2. Hans L. Bodlaender, Dimitrios M. Thilikos, and Koichi Yamazaki, "It is hard to know when Greedy is good for finding independent sets", Information Processing Letters, Vol. 61, No. 2, pp. 101--106, 1997.

  3. K. Yamazaki, "A hierarchy the class of apex NLC graph languages by bounds on the number of nonterminal nodes in productions", Acta Infomatica, Vol. 34, Fasc. 5, pp. 325--335, 1997.
Conference papers :
  1. Y. Iwasaki, Y. Kajiwara, K. Obokata, and Y. Igarashi, "Independent spanning trees of chordal rings", 3rd Annual International Conference on Computing and Combinatorics, Shanghai, China, Lecture Notes in Computer Science, Vol. 1276, Springer-Verlag, pp. 431--440, August 1997.

  2. F. Bao, Y. Funyu, and Y. Igarashi, "Reliable and secure communications in distributed systems", 16th International Symposium on Mathematical Programming, Lausanne, Switzerland, p. 131, August 1997.

  3. F. Bao, R. H. Deng, X. Gao, and Y. Igarashi, "Modified finite automata public key cryptoosystem", 1st International Workshop on Information Security, Tatsunokuchi, Ishikawa, Japan, Lecture Notes in Computer Science, Vol. 1396, pp. 82--95, September 1997.

  4. F. Bao, Y. Funyu, Y. Hamada, and Y. Igarashi, "Reliable broadcasting and secure distributing in channel networks", 3rd International Symposium on Parallel Architectures, Algorithms and Networks, Taipei, Taiwan, IEEE Computer Society, pp. 472--478, December 1997.

  5. Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, and Dimitrios M. Thilikos, "Isomorphism on graphs of bounded distancewidth", Italian Conference on Algorithms and Complexity CIAC '97, Lecture Notes in Computer Science, Vol. 1203, pp.276--287, 1997.