| 2024 | QCE | Enhancing Convergence in Variational Quantum Eigensolver Using CoolMomentum. | Daisuke Tsukayama, Jun-ichi Shirakashi, Tetsuo Shibuya, Hiroshi Imai |
| 2023 | QCE | Distributed Coordinate Descent Algorithm for Variational Quantum Classification. | Izuho Koyasu, Rudy Raymond, Hiroshi Imai |
| 2023 | QCE | The Role of Entanglement in Quantum-Relaxation Based Optimization Algorithms. | Kosei Teramoto, Rudy Raymond, Hiroshi Imai |
| 2018 | WALCOM | FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models. | Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai |
| 2014 | ISITA | Worst case computation time for minimal joint Hamming weight numeral system. | Vorapong Suppakitpaisarn, Hiroshi Imai |
| 2014 | RC | BDD Operations for Quantum Graph States. | Hidefumi Hiraishi, Hiroshi Imai |
| 2012 | WALCOM | Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers. | Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai |
| 2003 | DEXA | Finding Neighbor Communities in the Web Using Inter-site Graph. | Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa |
| 2002 | COCOON | Quantum versus Deterministic Counter Automata. | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai |
| 2002 | DNA | A DNA-based Computational Model Using a Specific Type of Restriction Enzyme. | Yasubumi Sakakibara, Hiroshi Imai |
| 2002 | WISE | Applying the Site Information to the Information Retrieval from the Web. | Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa |
| 2001 | MCU | Power, Puzzles and Properties of Entanglement. | Jozef Gruska, Hiroshi Imai |
| 2001 | WISE | On the Newly Established Graduate School of Information Science and Technology of the University of Tokyo. | Hiroshi Imai |
| 2000 | COCOON | One-Way Probabilistic Reversible and Quantum One-Counter Automata. | Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai |
| 2000 | DCC | Implementing the Context Tree Weighting Method for Text Compression. | Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai |
| 2000 | ISAAC | Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. | Takayuki Osogami, Hiroshi Imai |
| 1999 | DIS | Finding Meaningful Regions Containing Given Keywords from Large Text Collections. | Kunihiko Sadakane, Hiroshi Imai |
| 1998 | DIS | Geometric Clustering Models in Feature Space. | Mary Inaba, Hiroshi Imai |
| 1998 | ER | A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. | Kunihiko Sadakane, Hiroshi Imai |
| 1997 | COCOON | Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points. | Fumihiko Takeuchi, Hiroshi Imai |
| 1997 | RECOMB | New flexible approaches for multiple sequence alignment. | Tetsuo Shibuya, Hiroshi Imai |
| 1996 | COCOON | Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. | Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida |
| 1996 | ISAAC | OBDDs of a Monotone Function and of Its Prime Implicants. | Kazuyoshi Hayase, Hiroshi Imai |
| 1995 | ASPDAC | Search space reduction in high level synthesis by use of an initial circuit. | Atsushi Masuda, Hiroshi Imai, Jeffery P. Hansen, Masatoshi Sekine |
| 1995 | ISAAC | Computing the Tutte Polynomial of a Graph of Moderate Size. | Kyoko Sekine, Hiroshi Imai, Seiichiro Tani |
| 1994 | ISAAC | A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. | Seiichiro Tani, Hiroshi Imai |
| 1993 | ALT | Epsilon-Approximations of | Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro |
| 1993 | ISAAC | How to Treat Delete Requests in Semi-Online Problems. | Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh |
| 1993 | WADS | Probing a Set of Hyperplanes by Lines and Related Problems. | Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport |
| 1992 | ALT | Notes on the PAC Learning of Geometric Concepts with Additional Information. | Ken-ichiro Kakihara, Hiroshi Imai |
| 1992 | ISAAC | The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. | Koji Hakata, Hiroshi Imai |
| 1991 | DASFAA | Performance Evaluation of Automatic Name Placement Functions for Geographical Database Systems. | Nobuhiko Kojiro, Ken'ichi Miura, Hiroshi Imai, Yahiko Kambayashi |
| 1989 | WADS | Weighted Orthogonal Linear L | Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert |
| 1987 | STACS | Geometric Relations Among Voronoi Diagrams. | Franz Aurenhammer, Hiroshi Imai |
| 1985 | FOCS | Visibility-Polygon Search and Euclidean Shortest Paths | Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai |
| 1984 | FOCS | Dynamic Segment Intersection Search with Applications | Hiroshi Imai, Takao Asano |