1992年度 研究報告
- H. Imai and D. T. Lee and C. D. Yang, 1-Segment Center Problems., ORSA Journal on Computing, 4, 4, 26-434, .
- K. Kakihara and H. Imai, Notes on the {PAC} Learning of Geometric Concepts with Additional Information, Proceedings of the 3rd Workshop on Algorithmic Learning Theory, 252-259, .
- Tsuyoshi Matsumoto, Competitive Analysis of the Round Robin Algorithms, Proceedings of the 3rd International Symposium on Algorithms and Computation, 650, 71-77, .
- K. Hakata and H. Imai, The Longest Common Subsequence Problem for Small Alphabet Size between Many Strings., Proceedings of the 3rd International Symposium on Algorithms and Computation, 650, 469-478, .
- H. Imai, Geometric Algorithms for Linear Programming, Proceedings of the 5th Karuizawa Workshop on Circuits and Systems, 173-178, .
- H. Imai, Geometric Algorithms for Linear Programming, IEICE Transactions on Fundamentals, E-76-A, 3, 259-264, .
- H. Imai and T. Oomae, Rounding a Real-Valued Vector to an Integral Vector in 0-1 Integer Programming, SIGAL 27-4, IPSJ SIG Notes, , .
- K. Imai and H. Imai, Higher-Order Dynamic Voronoi Diagrams and Their Applications, RIMS Kokyuroku, 790, 222-228, .
- K. Imai and H. Imai, On Weighted and Higher-Order Dynamic Voronoi Diagrams, SIGAL 29-4, IPSJ SIG Notes, , .
- Y. Dai and H. Imai and K. Iwano and N. Katoh, A New Approach to Semi-Online Problems, SIGAL 29-6, IPSJ SIG Notes, , .
- K. Hakata and H. Imai, Algorithms for the Longest Common Subsequence Problem, Genome Informatics Workshop III, 53-56, .