- T. Shibuya and T. Ikeda and H. Imai and S. Nishimura and 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)*, ,**4**, 2037-2044.

- S. Albers and H. Koga, Page Migration with Limited Local Memory,
*Proceedings of the 4th International Workshop on Algorithms and Data Structure (WADS'95)*,**955**, 1995, 147--158.

.

- S. Hasegawa and H. Imai and M. Ishiguro, $\epsilon$-Approximations of $k$-Label Spaces,
*Theoretical Computer Science*,**137**, 1995, 145--157.

- K. Sekine and 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)*,**1004**, , 224-233.

- H. Imai, Minisymposium on ``Progress in Computational Geometry'',
*ICIAM 95 Congress on Industrial and Applied Mathematics*, , 124--125.

- T. Masada and K. Imai and H. Imai, An Output Size Sensitive Algorithm for the Enumeration of Regular Triangulation,
*ICIAM 95 Congress on Industrial and Applied Mathematics*, , 124.

- H. Imai and M. Inaba, Geometric Clustering with Applications,
*ICIAM 95 Congress on Industrial and Applied Mathematics*, , 124.

- H. Imai and S. Tani and K. Sekine, Ordered Binary Decision Diagrams, Graph Theory and Computational Geometry,
*Advances in Computing Techniques and Parallel Processing*, 1995, 69--84.

- K. Sekine, {Tutte} Polynomial, Flow Polynomial and Their Computation,
*ISM Reports on Statistical Computing Modeling and Algorithms 7''*,**77**, 1995, 1--13.

- T. Ikeda and H. Imai, Fast {A}${}^*$ Algorithm for Multiple Alignment Problem and Its Computational Efficiency in Practice,
*ISM Reports on Statistical Computing Modeling and Algorithms 7''*,**77**, 1995, 14--25.

- T. Shibuya, Finding the $k$ shortest paths by {AI} search techniques,
*ISM Reports on Statistical Computing Modeling and Algorithms 7''*,**77**, 212-222, .

- K. Sadakane, A {BDD} of Maximal Independent Sets and Its Applications,
*ISM Reports on Statistical Computing Modeling and Algorithms 7''*,**77**, 1995, 223--235.

- K. Hayase, On Breadth First Construction of {OBDDs} Representing Maximal Independent Sets,
*Kokyuroku*,**906**, 204--211, .

.

- K. Sekine and H. Imai and S. Tani, Computation of the {Tutte} Polynomial and {BDD},
**COMP 95-40**, , .

- J. Niwa and H. Imai, Parallel Construction of a {BDD} Representing a Threshold Function,
*IPSJ SIG Notes*,**HPC 57-13**, , .

- K. Sekine and H. Imai, Computing the {Tutte} Polynomial of a Graph and the All-Terminal Network Reliability,
*Abstracts of the 1995 Fall National Conference of*, 1995, 122--123.

- H. Imai and S. Tani and K. Sekine, Ordered Binary Decision Diagrams, Graph Theory and Computational Geometry,
**95-05**, , .

- K. Sekine and H. Imai and S. Tani, Computing the {Tutte} Polynomial of a Graph and the {Jones} Polynomial of an Alternating Link of Moderate Size,
**95-06**, , .

- K. Sekine, Decomposition of the Flow Polynomial,
**95-08**, , .

- K. Sekine and H. Imai, A Unified Approach via {BDD} to the Network Reliability and Path Numbers,
**95-09**, , .

- H. Imai and K. Imai, Algorithms in Combinatorial Geometry, 1995, .

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

- K. Sekine and H. Imai, Computation of the {Tutte} Polynomial and Network Reliability,
*IPSJ SIG Notes*,**AL-47-6**, 1995, .

- K. Sadakane and K. Hayase and H. Imai, A Parallel Top-down Algorithm to Construct Binary Decision Diagrams,
*IPSJ SIG Notes*,**AL-48-11**, , .

- H. Imai, {$K$}-Opt Algorithm for Multiple Alignment,
*IPSJ SIG Note*,**AL-48-12**, 1995, 81--86.

Advances in Computing Techniques: Algorithms, Databases and Parallel Processing, 1995, .

- H. Imai and K. Sekine, Computing the Network Reliability of a Directed Graph via {BDDs},
**CAS 95-85**, 1995, .

.

- K. Onishi, Voronoi Diagrams in the Upper Half Plane Space and Their Applications,
*Kokyuroku Polytopes''*,**934**, 111--123, .

- H. Imai and K. Imai, Triangulations and Polytopes,
*Kokyuroku Polytopes''*,**934**, 149--166, .

- Y. Masunaga and Y. Kambayashi and Y. Kanamori and H. Kitagawa and H. Imai and T. Furukawa and H. Xu and K. Kato, Towards the Research on Cooperative Active Database System Technology,
*IPSJ SIG Notes*,**DB-106-23**, 1996, .

- K. Imai and H. Imai, Enumeration of Regular Triangulation and Some Structures of Secondary Polytopes,
*IPSJ SIG Notes*,**AL-49-2**, 1996, .

- H. Imai and S. Iwata and K. Sekine and K. Yoshida, Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements and Partial Orders,
*IPSJ SIG Notes*,**AL-50-7**, 1996, .

- Y. Dai and H. Imai and K. Iwano and N. Katoh and K. Ohtsuka and N. Yoshimura, A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms,
*Discrete Applied Mathematics*,**1--3**, 1996, 167--190.