Last Modified : 2003-05-27

- Y. Asano: Investigation and Implementation of a Linear-time Algorithm for the Single Source Shortest Path Problem, Senior thesis, Department of Information Science, University of Tokyo, Mar. 1998.
- Koichiro Doi: Complexity Analyses and Experiments about Minimizing Number of Primers in PCR Experiments, Master thesis, Department of Information Science, University of Tokyo, Mar. 1998. Abstract Paper(ps)
- M. Endo: Analysis of Algorithm for Nearest Neighbor Search in High Dimensions, Senior thesis, Department of Information Science, University of Tokyo, Mar. 1998.
- K. Hayase: On the Complexity of Constructing OBDDs of a Monotone Function and of the Set of Its Prime Implicants, Master thesis, Department of Information Science, University of Tokyo, Mar. 1996. Abstract Paper(ps)
- K. Hayase, K. Sadakane, and S. Tani: Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem, in
*Proceedings of the 1st Annual International Computing and Combinatorics Conference (COCOON'95)*, Lecture Notes in Computer Science, Vol. 959, pp. 229`-`234, 1995. Abstract Paper(ps) - H. Hikada: The Neighborhood Structure and Tabu Construciton on Tabu Search for Traveling Salesman Problem with Time Windows, Senior thesis, Department of Information Science, University of Tokyo, Mar. 1998.
- T. Ikeda: Applications of the A Algorithm to Better Routes Finding and Multiple Sequence Alignment, Master thesis, Department of Information Science, University of Tokyo, Feb. 1995. Abstract Paper(ps)
- H. Imai: Lower-Truncated Transversal Polymatroids and Related Problems, Paper of Technical Group on Circuit and Systems CAS83-125, Institute of Electronics and Communication Engineers of Japan, Sept. 1983. Abstract
- H. Imai: Matroidal and Non-Matroidal Aspects of Line Drawings of Polyhedra, Paper of Technical Group on Circuit and Systems CAS84-62, Institute of Electronics and Communication Engineers of Japan, Aug. 1984. Abstract
- H. Imai and T. Asano: An O(n log n) Greedy Heuristic for the Minimum Chord-Length Rectangular Partition, Paper of Technical Group on Circuit and Systems CAS84-115, Institute of Electronics and Communication Engineers of Japan, Nov. 1984. Abstract
- 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, pp. 43`-`67, Mar. 1986. Abstract - H. Imai: On the Multiplicative Penalty Function Method --- Its Recent Research Trends,
*Communications of the Operations Research Society of Japan*, Vol. 34, No. 3, pp. 119`-`122, Mar. 1989, (In Japanese). Abstract - H. Imai and S. Tani: Binary Decision Diagrams, Gaussian Elimination and Graph Theory, IPSJ SIG Notes 94-AL-41, IPSJ, 1994.
- H. Iriyama: Investigation and Improvements of Searching Methods Using Meta Strategies for Quadratic Assignment Problem, Mar. 1997. Abstract Paper(ps)
- Y. Kyoda: A Study of Generating Minimum Weight Trianguration within Practical Time, Master thesis, Department of Information Science, University of Tokyo, Feb. 1996. Paper(ps)
- T. Masada: An Algorithm for the Enumeration of Regular Triangulations, Master thesis, Department of Information Science, University of Tokyo, Feb. 1995. Abstract Paper(ps)
- M. Nakade: Experimental Analyses of Tabu-Search-Based Approximate Algorithms for Vehicle Routing Problem, Master thesis, Department of Information Science, University of Tokyo, Mar. 1997.
- J. Niwa: Constructing a Binary Decision Diagram of a Threshold Function, Senior thesis, Department of Information Science, University of Tokyo, Feb. 1995. Abstract Paper(ps)
- T. Saito: An Algorithm for Automatic Generation of The Slither Link Problems, Senior thesis, Department of Information Science, University of Tokyo, Mar. 1998.
- K. Sadakane: A BDD of Maximal Independent Sets and Its Applications, in
*ISM Reports on Statistical Computing, ``Optimization: Modeling and Algorithms 7''*, Vol. 77, pp. 223`-`235, 1995, Institute of Statistical Mathematics. Abstract Paper(ps) - K. Sadakane: Improvements of Speed and Performance of Data Compression Based on Dictionary and Context Similarity, Master thesis, Department of Information Science, University of Tokyo, 1997. Abstract Paper(ps)
- Kyoko Sekine: Algorithm for Computing the Tutte Polynomial and Its Applications, Ph.D. dissertation, Department of Information Science, University of Tokyo, Mar. 1997.
- T. Shibuya: New Approaches To Flexible Alignment Of Multiple Biological Sequences, Master thesis, Department of Information Science, University of Tokyo, Mar. 1997.
- Fumihiko Takeuchi: Enumerating Triangulations in General Dimension, Master thesis, Department of Information Science, University of Tokyo, Mar. 1998. Abstract Paper(ps)
- K. Takahashi: Implementation and Investigation of The Multiple Polynomial General Number Field Sieve, Senior thesis, Department of Information Science, University of Tokyo, Mar. 1998.
- S. Tani: An Extended Framework of Ordered Binary Decision Diagrams for Combinatorial Graph Problems, Master thesis, Department of Information Science, University of Tokyo, Feb. 1995. Abstract Paper(ps)
- Y. Yoshida: Analysis of Clustering Images with Color Information, Senior thesis, Department of Information Science, University of Tokyo, Mar. 1998.
- 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, pp. 167`-`190, 1996. - H. Imai: Minisymposium on ``Progress in Computational Geometry'', in
*ICIAM 95, Book of Abstracts of The Third International Congress on Industrial and Applied Mathematics*, pp. 124`-`125, 1995. - K. Hayase: On Breadth First Construction of OBDDs Representing Maximal Independent Sets, in
*RIMS Kokyuroku*, No. 906, pp. 204`-`211, 1995, Kyoto University. - K. Asai, H. Masuhara, and A. Yonezawa: Issues in Partial Evaluation of Functional Programs with Side-effects, IPSJ SIG Notes 95-PRO-4, IPSJ, 1995, (in Japanese).
- K. Sekine, H. Imai, and S. Tani: Computation of the Tutte Polynomial and BDD, IEICE Technical Report COMP95-40, IEICE, 1995.
- H. Imai, S. Tani, and K. Sekine: Ordered Binary Decision Diagrams, Graph Theory and Computational Geometry, Technical Report 95-05, Department of Information Science, University of Tokyo, 1995.
- J. Niwa and H. Imai: Parallel Construction of a BDD Representing a Threshold Function, IPSJ SIG Notes 95-HPC-57-13, IPSJ, 1995, (in Japanese).
- K. Sekine and H. Imai: Computing the Tutte Polynomial of a Graph and the All-Terminal Network Reliability, in
*Abstracts of the 1995 Fall National Conference of ORSJ*, pp. 122`-`123, 1995. - H. Imai: K-Opt Algorithm for Multiple Alignment, IPSJ SIG Notes 95-AL-48-12, IPSJ, 1995, Advances in Computing Techniques: Algorithms, Databases and Parallel Processing.
- K. Onishi: Voronoi Diagrams in the Upper Half Plane Space and Their Applications, in
*RIMS Kokyuroku : Geometry of Toric Varieties and Convex Polytopes*, No. 934, pp. 111`-`123, 1995, (in Japanese). - Y. Masunaga, Y. Kambayashi, Y. Kanamori, H. Kitagawa, H. Imai, T. Furukawa, H. Xu, and K. Kato: Towards the Research on Cooperative Active Database System Technology, IPSJ SIG Notes 96-DB-106-23, IPSJ, 1996, (in Japanese).
- K. Sekine: Decomposition of the Flow Polynomial, Technical Report 95-08, Department of Information Science, University of Tokyo, 1995.
- K. Asai, H. Masuhara, S. Matsuoka, and A. Yonezawa: Partial Evaluator as a Compiler for Reflective Languages, No. 95-10, Department of Information Science, University of Tokyo, 1995.