next up previous
: Conference Proceedings : cv0210a : 研究業績

Papers

1
H. Imai: Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. Information Processing Letters, Vol.15, No.3 (October 1982), pp.125-128.

2
H. Imai: On the Practical Efficiency of Various Maximum Flow Algorithms. Journal of the Operations Research Society of Japan, Vol.26, No.1 (March 1983), pp.61-82.

3
H. Imai: Network-Flow Algorithms for Lower-Truncated Transversal Polymatroids. Journal of the Operations Research Society of Japan, Vol.26, No.3 (September 1983), pp.186-210.

4
H. Imai and T. Asano: Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. Journal of Algorithms, Vol.4 (1983), pp.310-323.

5
H. Imai and M. Iri: Practical Efficiencies of Existing Shortest-Path Algorithms and a New Bucket Algorithm. Journal of the Operations Research Society of Japan, Vol.27, No.1 (March 1984), pp.43-57.

6
H. Imai: On Combinatorial Structures of Line Drawings of Polyhedra. Discrete Applied Mathematics, Vol.10 (1985), pp.79-92.

7
H. Imai, M. Iri and K. Murota: Voronoi Diagram in the Laguerre Geometry and Its Applications. SIAM Journal on Computing, Vol.14, No.1 (February 1985), pp.93-105.

8
T. Asano, M. Edahiro, H. Imai, M. Iri and K. Murota: Practical Use of Bucketing Techniques in Computational Geometry. In ``Computational Geometry'' (G. T. Toussaint, ed.), North-Holland, 1985, pp.153-195.

9
T. Asano, T. Asano, L. J. Guibas, J. Hershberger and H. Imai: Visibility of Disjoint Polygons. Algorithmica, Vol.1, No.1 (1986), pp.49-63.
T. Asano, T. Asano, L. Guibas, J. Hershberger and H. Imai: Visibility-Polygon Search and Euclidean Shortest Paths. Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, Portland, Oregon, October 1985, pp.155-164.

10
H. Imai: Worst-Case Analysis for Planar Matching and Tour Heuristics with Bucketing Techniques and Spacefilling Curves. Journal of the Operations Research Society of Japan, Vol.29, No.1 (March 1986), pp.43-67.

11
T. Asano, T. Asano and H. Imai: Partitioning a Polygonal Region into Trapezoids. Journal of the Association for Computing Machinery, Vol.33, No.2 (April 1986), pp.290-312.

12
H. Imai and T. Asano: Efficient Algorithms for Geometric Graph Search Problems. SIAM Journal on Computing, Vol.15, No.2 (May 1986), pp.478-494.

13
H. Imai: Notes on the One-Dimensional Compaction Problem of LSI Layouts Viewed from Network Flow Theory and Algorithms. Transactions of the Institute of Electronics and Communication Engineers of Japan (E), Vol.E69, No.10 (October 1986), pp.1080-1083.

14
M. Iri and H. Imai: A Multiplicative Barrier Function Method for Linear Programming. Algorithmica, Vol.1 (1986), pp.455-482.

15
H. Imai and M. Iri: Computational-Geometric Methods for Polygonal Approximations of a Curve. Computer Vision, Graphics, and Image Processing, Vol.36 (1986), pp.31-41.

16
H. Imai and M. Iri: An Optimal Algorithm for Approximating a Piecewise Linear Function. Journal of Information Processing, Vol.9, No.3 (1986), pp.159-162.

17
H. Imai and T. Asano: Dynamic Orthogonal Segment Intersection Search. Journal of Algorithms. Vol.8, No.1 (1987), pp.1-18.
H. Imai and T. Asano: Dynamic Segment Intersection Search with Applications. Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, Singer Island, Florida, October 1984, pp.393-402.

18
H. Imai: Extensions of the Multiplicative Penalty Function Method for Linear Programming. Journal of the Operations Research Society of Japan, Vol.30, No.2 (June 1987), pp.160-179.

19
T. Asano, T. Asano and H. Imai: Shortest Path Between Two Simple Polygons. Information Processing Letters, Vol.24, No.5 (1987), pp.285-288.

20
H. Imai: On the Convexity of the Multiplicative Version of Karmarkar's Potential Function. Mathematical Programming, Vol.40, No.1 (1988), pp.29-32.

21
D. Avis, B. K. Bhattacharya and H. Imai: Computing the Volume of the Union of Spheres. The Visual Computer, Vol.3, No.6 (May 1988), pp.323-328.
D. Avis, B. K. Bhattacharya and H. Imai: Computing the Volume of the Union of Spheres. 13th IFIP Conference on System Modelling and Optimization, Tokyo, August 1987.

22
H. Imai, S. Sumino, K. Imai: On the Complexity of Minimax Facility Location Problem on a Sphere (in Japanese). Transactions of the IEICE, Vol.J71-D, No.6 (June 1988), pp.1155-1158.
今井浩,炭野重雄,今井桂子:球面上のミニマックス施設配置問題の計算複雑 度.電子情報通信学会論文誌D分冊, Vol. J71-D, No.6 (August 1988), pp.1155-1158.

23
F. Aurenhammer and H. Imai: Geometric Relations among Voronoi Diagrams. Geometriae Dedicta, Vol.27 (1988), pp.65-75.
F. Aurenhammer and H. Imai: Geometric Relations among Voronoi Diagrams. STACS 87, Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Lecture Notes in Computer Science, Vol.247, Springer-Verlag, Heidelberg, 1987, pp.53-65.

24
H. Imai and M. Iri: Polygonal Approximations of a Curve -- Formulations and Algorithms. In ``Computational Morphology'' (G. T. Toussaint, ed.), North-Holland, 1988, pp.71-86.

25
H. Imai, K. Kato and P. Yamamoto: A Linear-Time Algorithm for Linear $L_1$ Approximation of Points. Algorithmica, Vol.4, No.1 (1989), pp.77-96.
P. Yamamoto, K. Kato, K. Imai and H. Imai: Algorithms for Vertical and Orthogonal $L_1$ Linear Approximation of Points. Proceedings of the 4th ACM Symposium on Computational Geometry, Urbana-Champaign, Illinois, 1988, pp.352-361.

26
K. Imai and H. Imai: An Algorithm for Weighted Minimax Linear Approximation of Points (in Japanese). Transactions of the Information Processing Society of Japan, Vol.30, No.4 (1989), pp.544-546.
今井桂子,今井浩:点集合の重み付きミニマックス線形近似問題. 情報処理学会論文誌,Vol.30, No.4 (1989), pp.544-546.

27
H. Imai and H. de Fraysseix: Notes on Oriented Depth First Search and Longest Paths. Information Processing Letters, Vol.31 (1989), pp.53-56.

28
H. Aonuma, H. Imai and Y. Kambayashi: Placing Characters Appropriately in Multimedia Map Databases. In ``Visual Data Base Systems'' (Proceedings of the IFIP TC2/WG2.6 Working Conference on Visual Database Systems, April 1989), North-Holland, Amsterdam, 1989, pp.525-546.

29
K. Imai, S. Sumino and H. Imai: Minimax Geometric Fitting of Two Corresponding Sets of Points. Proceedings of the 5th ACM Symposium on Computational Geometry, Saarbrucken, June 1989, pp.266-275.

30
H. Imai and K. Iwano: Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. Proceedings of the SIGAL International Symposium on Algorithms, Lecture Notes in Computer Science, Vol.450, Springer-Verlag, Heidelberg, 1990, pp.21-30.

31
D. Rappaport, H. Imai and G. T. Toussaint: On Computing Simple Polygons on a Set of Line Segments. Discrete and Computational Geometry, Vol.5 (1990), pp.289-304.
D. Rappaport, H. Imai and G. T. Toussaint: On Computing Simple Circuits on a Set of Line Segments. Proceedings of the 2nd ACM Symposium on Computational Geometry, Yorktown Heights, New York, June 1986, pp.52-60.

32
D. Avis and H. Imai: Locating a Robot with Angle Measurements. Journal of Symbolic Computation, Vol.10 (1990), pp.311-326.

33
H. Aonuma, H. Imai, K. Imai and T. Tokuyama: Maximin Location of Convex Objects in a Polygon and Related Voronoi Diagrams. Proceedings of the 6th ACM Symposium on Computational Geometry, Berkeley, June 1990, pp.225-234.

34
T. Asano, M. E. Houle, H. Imai and K. Imai: A Unified Linear-Space Approach to Geometric Minimax Problems. Proceedings of the 2nd Canadian Conference in Computational Geometry, Ottawa, August, 1990, pp.20-23.

35
N. Kojiro, K. Miura, H. Imai and Y. Kambayashi: Performance Evaluation of Automatic Name Placement Functions for Geographical Database Systems. Proceedings of the 2nd International Symposium on Database Systems for Advanced Applications (DASFAA), Tokyo, April 1991, pp.491-497.

36
T. Akutsu, Y. Aoki, S. Hasegawa, H. Imai and T. Tokuyama: The Sum of Smaller Endpoint Degree over Edges of Graphs and Its Applications to Geometric Problems. Proceedings of the 3rd Canadian Conference on Computational Geometry, Vancouver, August 1991, pp.145-148.

37
T. Asano, H. Imai and A. Mukaiyama: Finding a Maximum Weight Independent Set of a Circle Graph. IEICE Transactions, Vol.E74, No.4 (1991), pp.681-683.

38
A. Aggarwal, H. Imai, N. Katoh and S. Suri: Finding $k$ Points with Minimum Diameter and Related Problems. Journal of Algorithms, Vol.12 (1991), pp.38-56.
A. Aggarwal, H. Imai, N. Katoh and S. Suri: Finding $k$ Points with Minimum Diameter and Related Problems. Proceedings of the 5th ACM Symposium on Computational Geometry, Saarbrucken, June 1989, pp.283-291.

39
H. Imai: A Geometric Fitting Problem of Two Corresponding Sets of Points on a Line. IEICE Transactions, Vol.E74, No.4 (1991), pp.665-668.

40
H. Imai: On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids. IEICE Transactions, Vol.E74, No.4 (1991), pp.669-671.

41
S. Hasegawa, H. Imai and K. Hakata: An Analysis of Randomized Shear Sort on the Mesh Computer. Proceedings of the 2nd International Symposium on Algorithms, Taipei, Lecture Notes in Computer Science, Vol.557, December 1991, pp.219-228.

42
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, October 1992, pp.252-259; republished in Lecture Notes in Artificial Intelligence, Vol.743, 1993, pp.252-259.

43
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, Nagoya, Lecture Notes in Computer Science, Vol.650, December 1992, pp.469-478.

44
H. Imai, D. T. Lee and C. D. Yang: 1-Segment Center Problems. ORSA Journal on Computing, Vol. 4, No. 4, Fall 1992, pp.426-434.

45
M. Houle, H. Imai, K. Imai, J.-M. Robert and P. Yamamoto: Orthogonal Weighted $L_1$ and $L_\infty$ Approximation and Applications. Discrete Applied Mathematics, Vol.43 (1993), pp.217-232.
M. E. Houle, H. Imai, K. Imai and J.-M. Robert: Weighted Orthogonal $L_\infty$-Approximation and Applications. Proceedings of the Workshop on Algorithms and Data Structures (WADS '89), Ottawa, Lecture Notes in Computer Science, Vol.382, Springer-Verlag, Heidelberg, 1989, pp.183-191.

46
Y. Aoki, H. Imai, K. Imai and D. Rappaport: Probing a Set of Hyperplanes by Lines and Related Problems. Proceedings of the 3rd Workshop on Algorithms and Data Structures (WADS '93), Montreal, Lecture Notes in Computer Science, Vol.709, 1993, pp.72-82.

47
S. Hasegawa, H. Imai, M. Inaba, N. Katoh and J. Nakano: Efficient Algorithms for Variance-Based $k$-Clustering. Proceedings of the 1st Pacific Conference on Computer Graphics and Applications (Pacific Graphics '93), Seoul, 1993, pp.75-89

48
H. Imai: Geometric Algorithms for Linear Programming. IEICE Trans. Fundamentals, Vol.E76-A, No.3 (1993), pp.259-264.

49
今井桂子,今井浩:高次の動的Voronoi図とその応用.情報処理学会 論文誌,Vol.34, No.12 (1993), pp.2458-2463.
K. Imai and H. Imai: Higher-order Dynamic Voronoi Diagram and Its Applications (in Japanese). Transactions of the Information Processing Society of Japan, Vol.34, No.12 (1993), pp.2458-2463.

50
Y. Dai, H. Imai, K. Iwano and N. Katoh: How to Treat Delete Requests in Semi-Online Problems. Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC '93), Lecture Notes in Computer Science, Vol.762, December 1993, pp.48-57.

51
N. Ukiyama and H. Imai: Parallel Multiple Alignments and Their Implementation on CM5. Proceedings of Genome Informatics Workshop IV, Universal Academy Press, Tokyo, December 1993, pp.103-108.

52
G. Shibayama and H. Imai: Finding $K$-best Alignments of Multiple Sequences. Proceedings of Genome Informatics Workshop IV, Universal Academy Press, Tokyo, December 1993, pp.120-129.

53
S. Hasegawa, H. Imai and M. Ishiguro: $\epsilon$-Approximations of $k$-Label Spaces. Theoretical Computer Science, Vol.137 (1995), pp.145-175.
S. Hasegawa, H. Imai and M. Ishiguro: $\epsilon$-Approximations of $k$-Label Spaces. Proceedings of the 4th International Workshop on Algorithmic Learning Theory (ALT '93), Lecture Notes in Artificial Intelligence, Vol. 744, November 1993, pp.288-299.

54
M. Inaba, N. Katoh and H. Imai: Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based $k$-Clustering. Proceedings of the 10th ACM Symposium on Computational Geometry, 1994, pp.332-339.

55
S. Tani and H. Imai: A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. Proceedings of the 5th International Symposium on Algorithms and Computation (ISAAC '94), Lecture Notes in Computer Science, Vol.834 (1994), pp.575-583.

56
T. Ikeda, M.-Y. Hsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku and K. Mitoh: A Fast Algorithm for Finding Better Routes by AI Search Techniques. Proceedings of the International Conference on Vehicle Navigation & Information Systems (VNIS '94), 1994, pp.291-296.

57
T. Ikeda and H. Imai: Fast ${\rm A}^*$ Algorithms for Multiple Sequence Alignment. Proceedings of Genome Informatics Workshop 1994, Yokohama, 1994, pp.90-99.

58
T. Shibuya, T. Ikeda, H. Imai, S. Nishimura, H. Shimoura and K. Tenmoku: Finding a Realistic Detour by AI Search Techniques. Proceedings of the 2nd World Congress on Intelligent Transport Systems (ITS '95), Yokohama, Vol.4, 1995, pp.2037-2044.

59
K. Sekine, H. Imai and S. Tani: Computing the Tutte Polynomial of a Graph of Moderate Size. Proceedings of the 6th International Symposium on Algorithms and Computation (ISAAC '95), Lecture Notes in Computer Science, Vol.1004 (1995), pp.224-233.

60
H. Imai and T. Ikeda: $k$-Group Multiple Alignment Based on A${}^*$ Search. Proceedings of Genome Informatics Workshop 1995, Yokohama, 1995, pp.9-18.

61
Y. Dai, H. Imai, K. Iwano, N. Katoh, K. Ohtsuka and N. Yoshimura: A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. Discrete Applied Mathematics, Vol.65, No.1-3 (1996), pp.167-190.

62
H. Imai, K. Sekine and K. Yoshida: Binary Decision Diagrams and Generating Functions of Sets Related to Graphs and Codes. Proceedings of the 9th IEICE Karuizawa Workshop on Circuits and Systems, April 1996, pp.91-96.

63
T. Masada, H. Imai and K. Imai: Enumeration of Regular Triangulations. Proceedings of the 12th Annual ACM Symposium on Computational Geometry, 1996, pp.224-233.

64
M. Inaba, H. Imai and N. Katoh: Experimental Results of Randomized Clustering Algorithm. Proceedings of the 12th Annual ACM Symposium on Computational Geometry, 1996, pp.C1-C2.

65
T. Ono, Y. Kyoda, T. Masada, K. Hayase, T. Shibuya, M. Nakade, M. Inaba, H. Imai, K. Imai and D. Avis: A Package for Triangulations. Proceedings of the 12th Annual ACM Symposium on Computational Geometry, 1996, pp.V17-V18.

66
H. Imai, S. Iwata, K. Sekine and K. Yoshida: Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements and Partial Orders. Proceedings of the 2nd Annual International Computing and Combinatorics Conference (COCOON '96), Hong Kong, Lecture Notes in Computer Science, Vol.1090, Springer-Verlag, 1996, pp.68-80.

67
丹羽純平, 定兼邦彦, 早瀬千善, 今井浩: 単調関数のOBDDのトップダウン構成の並列実装. 並列処理シンポジウム論文集 (JSPP '96), IPSJ, 1966, pp.161-168.

68
T. Shibuya and H. Imai: Parametric Alignment of Multiple Biological Sequences. Proceedings of Genome Informatics Workshop 1996, 1996, pp.41-50.

69
H. Imai and M. Inaba: Geometric Clustering with Applications. Zeitschrift fur Angewandte Mathematik und Mechanik (ZAMM), Vol.76, Suppl. (1996), pp.183-186.

70
T. Masada, K. Imai and H. Imai: Enumeration of Regular Triangulations with Computational Results. Zeitschrift fur Angewandte Mathematik und Mechanik (ZAMM), Vol.76, Suppl. (1996), pp.187-190.

71
T. Shibuya, H. Imai, S. Nishimura, H. Shimoura and K. Tenmoku: Detour Queries in Geographical Databases for Navigation and Related Algorithm Animations. Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, December 5-7, 1996, Kyoto, World Scientific, 1997, pp.246-253.

72
T. Shibuya and H. Imai: Enumerating Suboptimal Alignments of Multiple Biological Sequences Efficiently. Proceedings of the Pacific Symposium on Biocomputing, 1997, pp.409-420.

73
K. Sekine and H. Imai: Counting the Number of Paths in a Graph via BDDs. IEICE Transactions on Fundamentals, Vol.E80-A, No.4 (1997), pp.682-688.
K. Sekine and H. Imai: Counting the Number of Paths in a Graph via BDD. Proceedings of the Korea-Japan Joint Workshop on Algorithms and Computation, 1996, pp.27-35.

74
M. Inaba, H. Imai, M. Nakade, and T. Sekiguchi: Application of an Effective Geometric Clustering Method to the Color Quantization Problem. Proceedings of the 13th ACM Symposium on Computational Geometry, 1997, pp.477-478.

75
K. Onishi and H. Imai: Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence. Proceedings of the 13th ACM Symposium on Computational Geometry, 1997, pp.463-465.

76
K. Onishi and H. Imai: Voronoi Diagrams for an Exponential Family of Probability Distributions in Information Geometry. Japan-Korea Joint Workshop on Algorithms and Computation, Fukuoka, 1997, pp.1-8.

77
F. Takeuchi and H. Imai: Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points. Proceedings of the 3rd International Computing and Combinatorics Computing Conference (COCOON '97), Lecture Notes in Computer Science, Vol.1276, 1997, pp.470-481.

78
H. Imai, K. Sekine and K. Imai: Network Reliability Computation -- Theory and Practice. Proceedings of the IPSJ International Symposium on Information Systems and Technologies for Network Society, World Scientific, 1997, pp.41-48.

79
T. Shibuya and H. Imai: New Flexible Approaches for Multiple Sequence Alignment. Journal of Computational Biology, Vol.4, No.3, 1997, pp.385-413.
T. Shibuya and H. Imai: New Flexible Approaches for Multiple Sequence Alignment. Proceedings of the 1st ACM Annual International Conference on Computational Molecular Biology, 1997, pp.267-276.

80
K. Doi and H. Imai: Greedy Algorithms for Finding a Small Set of Primers Satisfying Cover Length Resolution Conditions in PCR Experiments. Proceedings of the 8th Workshop on Genome Informatics, 1997, pp.43-52.

81
K. Hayase and H. Imai: OBDDs of a Monotone Function and of Its Prime Implicants. Theory of Computing Systems, Vol.31 (1998), pp.579-591.
K. Hayase and H. Imai: OBDDs of a Monotone Function and of Its Prime Implicants. ISAAC '96, Lecture Notes in Computer Science, Vol.1178, 1996, pp.136-145.

82
関根京子,今井浩,今井桂子:Jones多項式の計算. 日本応用数理学会論文誌, Vol.8, No.3 (1998), pp.341-354.

83
K. Imai, S. Sumino and H. Imai: Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams. IEICE Transactions on Information and Systems, Vol.E81-D, No.11 (November 1998), pp.1162-1171.

84
K. Hakata and H. Imai: Algorithms for the Longest Common Subsequence Problem for Multiple Strings Based on Geometric Maxima. Optimization Methods and Software, Vol.10 (1998), pp.233-260.

85
K. Imai and H. Imai: Dynamic Weighted Voronoi Diagrams and Weighted Minimax Matching of Two Corresponding Point Sets. Optimization Methods and Software,Vol.10 (1998), pp.261-274.

86
M. Inaba and H. Imai: Geometry Helps Clustering Objects in Text and Image Databases -- Utilizing Geometry of the Vector Space Model for Texts and the Feature Space Model for Images. In ``Advanced Database Systems for Integration of Media and User Environments '98'', World Scientific, 1998, pp.15-20.

87
K. Sadakane, H. Imai, K. Onishi, M. Inaba, F. Takeuchi and K. Imai: Voronoi Diagrams by Divergences with Additive Weights. Proceedings of the 14th Annual ACM Symposium on Computational Geometry, 1998, pp.403-404.

88
M. Inaba and H. Imai: Geometric Clustering Models for Multimedia Databases. Proceedings of the 10th Canadian Conference on Computational Geometry, 1998, pp. 110-111.

89
A. Tajima and H. Imai: Computational Investigations of the Optimality of Two- and Three-Dimensional Triangulations under Several Criteria. Proceedings of the 10th Canadian Conference on Computational Geometry, 1998, pp.44-45.

90
H. Kobayashi and H. Imai: Improvement of the A* Algorithm for Multiple Sequence Alignment. In ``Genome Informatics 1998'' (S. Miyano and T. Takagi, eds.), Universal Academy Press, 1998, pp.120-130.

91
M. Inaba and H. Imai: Geometric Clustering in Feature Space. Lecture Notes in Artificial Intelligence, Vol.1532, December 1998, pp.421-422.

92
T. Ikeda and H. Imai: Enhanced A${}^*$ Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and $k$-Opt Approximate Alignments for Large Cases. Theoretical Computer Science, Vol.210, No.2 (1999), pp.341-374.

93
T. Shibuya, H. Imai, S. Nishimura, H. Shimoura and K. Tenmoku: Finding Useful Detours in Geographical Databases. IEICE Transactions on Information and Systems, Vol.E82-D, No.1 (January 1999), pp.282-290.

94
K. Imai, H. Imai and T. Tokuyama: Maximin Location of Convex Objects in a Polygon and Related Voronoi Diagrams. Journal of the Operations Research Society of Japan, Vol.42, No.1 (March 1999), pp.45-58.

95
H. Imai, K. Sekine and K. Imai: Computational Investigations of All-Terminal Network Reliability via BDDs. IEICE Trans. Fundamentals, Vol.E82-A, No.5 (May 1999), pp.714-721.

96
K. Sadakane and H. Imai: A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. In ``Advances in Database Technologies'', Lecture Notes in Computer Science, Springer-Verlag, Vol.1552, 1999, pp.434-445.

97
M. Inaba and H. Imai: The Number of Partitions of $n$ Points Induced by the Voronoi Diagram via the Conjugacy Generated by $k$ Points. Proceedings of the 1st Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Kyoto, March 1999, pp.83-90.

98
A. Nagai and H. Imai: Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees. Proceedings of the Korea-Japan Joint Workshop on Algorithms and Computation, 1999, pp.163-170.

99
田島玲, 今井浩: 三角形分割の最適性と整数計画による定式化. 情報処理学会論文誌, Vol.40, No.7 (1999), pp.2861-2871.

100
定兼邦彦, 今井浩: 転置ファイルおよび接尾辞配列の効率的圧縮法. 情報処理学会論文誌: データベース, Vol.40, No.SIG 8 (TOD 4), (November 1999), pp.85-94.

101
A. Tajima and H. Imai: Cutting Planes for IP-based Optimization of Geometric Triangulation. Proceedings of Japan Conference on Discrete and Computational Geometry '99, Tokai University, November 1999, pp.58-60.

102
H. Kobayashi and H. Imai: An EM-type Algorithm for Ordered Restriction Map Alignment. In ``Genome Informatics 1999'' (K. Asai, S. Miyano and T. Takagi, eds.), Universal Academy Press, 1999, pp.62-72.
H. Kobayashi and H. Imai: An EM-type Algorithm for Ordered Restriction Map Alignment. Proceedings of the Korea-Japan Joint Workshop on Algorithms and Computation, 1999, pp.84-91.

103
K. Doi and H. Imai: A Greedy Algorithm for Minimizing the Number of Primers in Multiple PCR Experiments. In ``Genome Informatics 1999'' (K. Asai, S. Miyano and T. Takagi, eds.), Universal Academy Press, 1999, pp.73-82.

104
K. Sadakane and H. Imai: Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Lecture Notes in Artificial Intelligence, Vol.1721, Springer-Verlag, 1999, pp.353-354.

105
K. Sadakane and H. Imai: Text Retrieval by Using $k$-Word Proximity Search. In ``Database Applications in Non-Traditional Environments'', IEEE Computer Society Press, 2000, pp.183-188.

106
H. Imai and M. Inaba: Geometric Clustering by Divergence and Its Underlying Discrete Proximity Structures. IEICE Trans. Information and Systems, Vol.E83-D, No.1 (2000), pp.27-35.

107
N. Park, H. Okano and H. Imai: A Path-Exchange-Type Local Search Algorithm for Vehicle Routing and Its Efficient Search Strategy. Journal of the Operations Research Society of Japan, Vol.43, No.1 (March 2000), pp.197-208.

108
H. Imai: Computing the Invariant Polynomials of Graphs, Networks and Matroids. IEICE Transactions on Information and Systems, Vol.E83-D, No.3 (2000), pp.330-343.

109
K. Sadakane, T. Okazaki and H. Imai: Implementing the Context Tree Weighting Method for Text Compression. Proceedings of IEEE Data Compression Conference (DCC '00), March 2000, pp.123-132.

110
M. Inaba, N. Katoh and H. Imai: Variance-Based $k$-Clustering Algorithms by Voronoi Diagrams and Randomization. IEICE Transactions on Information and Systems, Vol.E83-D, No.6 (2000), pp.1199-1206.

111
K. Doi and H. Imai: Complexity Properties of the Primer Selection Problem for PCR Experiments. Proceedings of the 5th Japan-Korea Joint Workshop on Algorithms and Computation, 2000, pp.152-159.

112
M. Inaba and H. Imai: Geometric Clustering for Multiplicative Mixtures of Distributions in Exponential Families. Proceedings of the 12th Annual Canadian Conference on Computational Geometry, 2000, pp.195-196.

113
T. Yamasaki, H. Kobayashi, Y. Tokuanga and H. Imai: Two-Way Quantum One-Counter Automata. 新しい計算パラダイムシンポジウム2000論文集, IPSJ, December 2000, pp.11-18.

114
T. Matsumoto, K. Sadakane and H. Imai: Biological Sequence Compression Algorithms. In ``Genome Informatics 2000'' (A. K. Dunker, A. Konagaya, S. Miyano and T. Takagi, eds.), Universal Academy Press, 2000, pp.43-52.

115
K. Doi and H. Imai: Sequencing by Hybridization in the Presence of Hybridization Errors. In ``Genome Informatics 2000'' (A. K. Dunker, A. Konagaya, S. Miyano and T. Takagi, eds.), Universal Academy Press, 2000, pp.53-62.

116
Y. Asano and H. Imai: Practical Efficiency of the Linear-Time Algorithm for the Single Source Shortest path Problem. Journal of the Operations Society of Japan, Vol.43, No.4 (December 2000), pp.431-447.

117
T. Osogami and H. Imai: Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. Proceedings of the 11th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol.1969, December 2000, pp.72-83.

118
K. Sadakane and H. Imai: Improving the Speed of LZ77 Compression by Hashing and Suffix Sorting. IEICE Trans. Fundamentals, Vol.E83-A, No.12 (December 2000), pp.2689-2698.

119
T. Ishizeki and H. Imai: Grobner Bases of Acyclic Directed Graphs and Minimum Cost Flow Problems. Proceedings of the 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, April 2001, pp.82-91.

120
H. Imai, M. Hachimori, M. Hamada, H. Kobayashi and K. Matsumoto: Optimization in Quantum Computation and Information. Proceedings of the 2nd Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, April 2001, pp.60-69.

121
J. Gruska and H. Imai: Power, Puzzles and Properties of Entanglement. Proceedings of the 3rd International Conference on Machines, Computations and Universality (MCU 2001), Lecture Notes in Computer Science, Vol.2055, 2001, pp.25-68.

122
T. Yamasaki, H. Kobayashi and H. Imai: Two-way quantum one-counter automata. Proceedings of the 6th Korea-Japan Joint Workshop on Algorithms and Computation, June 2001, pp.107-114.

123
K. Sadakane and H. Imai: Fast Algorithms for $k$-Word Proximity Search. IEICE Trans. Fundamentals, Vol.E84-A, No.9 (2001), pp.2311-2318.

124
長井歩, 今井浩: 詰将棋における変別チェックと余詰探索を同時に行える新し いアルゴリズムの提案. 第6回ゲームプログラミングワークショップ (GPW 2001), IPSJ, 2001, pp.9-16.
A. Nagai and H. Imai: A New Algorithm to Remove Henbetu and to Find Yodume of Tsume-Shogi (in Japanese). The 6th Game Programming Workshop (GPW 2001), IPSJ, October 2001, pp.9-16.

125
T. Okazaki, K. Sadakane and H. Imai: Data Compression Method Combining Properties of PPM and CTW. In ``Progress in Discovery Science 2001'' (S. Arikawa and A. Shinohara, eds.), Lecture Notes in Artificial Intelligence, Vol.2281, 2002, pp.268-283.

126
長井歩, 今井浩: df-pnアルゴリズムの詰将棋を解くプログラムへの応用. 情報処理学会論文誌, Vol.43, No.6 (2002), pp.1769-1777.
A. Nagai and H. Imia: Application of df-pn Algorithm to a Program to Solve Tsume-shogi Problems (in Japanese). Journal of the IPSJ, Vol.43, No.6 (2002), pp.1769-1777.

127
H. Fan, G. Weihs, K. Matsumoto and H. Imai: Cloning of Symmetric $d$-Level Photonic States in Physical Systems. Phys. Rev. A 66, 024307 (2002).

128
H. Fan, K. Matsumoto, X.-B. Wang and H. Imai: Phase-Covariant Quantum Cloning. J. Phys. A: Math. Gen. 35 (30 August 2002) 7415-7423.

129
Y. Asano, H. Imai, M. Toyoda and M. Kitsuregawa: Web-linkage Viewer: Finding Graph Structures in the Web. Demo Session, Proceedings of the 3rd International Conference on Web-Age Information Management (WAIM 2002), Beijing, Lecture Notes in Computer Science, Vol.2419, August 2002, pp.441-442.

130
T. Yamasaki, H. Kobayashi and H. Imai: Quantum versus Deterministic Counter Automata. Proceedings of the 8th Annual International Computing and Combinatorics Conference (COCOON 2002), Vol.2387, Lecture Notes in Computer Science, August 2002, pp.584-594.

131
S. Moriyama, A. Nagai and H. Imai: Fast and Space-Efficient Algorithms for Deciding Shellability of Simplicial Complexes of Large Size Using $h$-Assignments. In ``Mathematical Software'' (Proceedings of the 1st International Congress of Mathematical Software (ICMS 2002), Beijing, August 2002; A. M. Cohen, X.-S. Gao and N. Takayama, eds.), World Scientific, 2002, pp.82-92.

132
Y. Asano, H. Imai, M. Toyoda and. Kitsuregawa: Focusing the Sites on the Web. Proceedings of the IASTED International Conference Information Systems and Databases (ISDB 2002), Tokyo, September 2002, pp.154-159.

133
A. Nagai and H. Imai: Proof for the Equivalence Between Some Best-First Algorithms and Depth-First Algorithms for AND/OR Trees. IEICE Trans. Inform. & Systems, Vol.E85-D, No.10 (2002), pp.1645-1653.

134
J. Niwa, K. Matsumoto and H. Imai: General-Purpose Parallel Simulator for Quantum Computing. Proceedings of the 3rd International Conference on Unconventional Models of Computation (UMC'02), Kobe, Lecture Notes in Computer Science, Vol.2509, October 2002, pp.230-251.

135
T. Yamasaki, H. Kobayashi and H. Imai: Analysis of Absorbing Times of Quantum Walks. Proceedings of the 3rd International Conference on Unconventional Models of Computation (UMC'02), Kobe, Lecture Notes in Computer Science, Vol.2509, October 2002, pp.315-329.

136
T. Yamasaki, H. Kobayashi, Y. Tokunaga and H. Imai: One-Way Probabilistic Reversible and Quantum One-Counter Automata. Theoretical Computer Science, Vol.289, No.2 (2002), pp.963-976.
T. Yamasaki, H. Kobayashi, Y. Tokunaga and H. Imai: One-Way Probabilistic Reversible and Quantum One-Counter Automata. Proceedings of the 6th Computing and Combinatorics Conference, Lecture Notes in Computer Science, Vol.1858, 2000, pp.436-446.

137
Y. Asano, H. Imai, M. Toyoda and M. Kitsuregawa: Applying the Site Information to the Information Retrieval from the Web. 3rd International Conference on Web Information Systems Engineering (WISE 2002), IEEE CS Press, December 2002, to appear.





IMAI Hiroshi 平成14年10月17日