Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. - Hiroshi Imai (Inf. Process. Lett., 1982)

Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. - Hiroshi Imai; Takao Asano (J. Algorithms, 1983)

Dynamic Segment Intersection Search with Applications - Hiroshi Imai; Takao Asano (FOCS, 1984)

Visibility-Polygon Search and Euclidean Shortest Paths - Takao Asano; Tetsuo Asano; Leonidas J. Guibas; John Hershberger 001; Hiroshi Imai (FOCS, 1985)

On combinatorial structures of line drawings of polyhedra. - Hiroshi Imai (Discret. Appl. Math., 1985)

Voronoi Diagram in the Laguerre Geometry and its Applications. - Hiroshi Imai; Masao Iri; Kazuo Murota (SIAM J. Comput., 1985)

On Computing Simple Circuits on a Set of Line Segments. - David Rappaport; Hiroshi Imai; Godfried T. Toussaint (SCG, 1986)

Visibility of Disjoint Polygons. - Takao Asano; Tetsuo Asano; Leonidas J. Guibas; John Hershberger 001; Hiroshi Imai (Algorithmica, 1986)

A Multiplicative Barrier Function Method for Linear Programming. - Masao Iri; Hiroshi Imai (Algorithmica, 1986)

Computational-geometric methods for polygonal approximations of a curve. - Hiroshi Imai; Masao Iri (Comput. Vis. Graph. Image Process., 1986)

Partitioning a polygonal region into trapezoids. - Takao Asano; Tetsuo Asano; Hiroshi Imai (J. ACM, 1986)

Efficient Algorithms for Geometric Graph Search Problems. - Hiroshi Imai; Takao Asano (SIAM J. Comput., 1986)

Geometric Relations Among Voronoi Diagrams. - Franz Aurenhammer; Hiroshi Imai (STACS, 1987)

Shortest Path Between Two Simple Polygons. - Takao Asano; Tetsuo Asano; Hiroshi Imai (Inf. Process. Lett., 1987)

Dynamic Orthogonal Segment Intersection Search. - Hiroshi Imai; Takao Asano (J. Algorithms, 1987)

Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. - Peter Yamamoto; Kenji Kato; Keiko Imai; Hiroshi Imai (SCG, 1988)

On the convexity of the multiplicative version of Karmarkar's potential function. - Hiroshi Imai (Math. Program., 1988)

Computing the volume of the union of spheres. - David Avis; Binay K. Bhattacharya; Hiroshi Imai (Vis. Comput., 1988)

Fining k Points with Minimum Spanning Trees and Related Problems. - Alok Aggarwal; Hiroshi Imai; Naoki Katoh; Subhash Suri (SCG, 1989)

Minimax Geometric Fitting of Two Corresponding Sets of Points. - Keiko Imai; S. Sumino; Hiroshi Imai (SCG, 1989)

A Visual System of Placing Characters Appropriately in Multimedia Map Databases. - Hiromi Aonuma; Hiroshi Imai; Yahiko Kambayashi (VDB, 1989)

Weighted Orthogonal Linear L∞-Approximation and Applications. - Michael E. Houle; Hiroshi Imai; Keiko Imai; Jean-Marc Robert 001 (WADS, 1989)

A Linear-Time Algorithm for Linear L_1 Approximation of Points. - Hiroshi Imai; Kenji Kato; Peter Yamamoto (Algorithmica, 1989)

Notes on Oriented Depth-First Search and Longest Paths. - Hubert de Fraysseix; Hiroshi Imai (Inf. Process. Lett., 1989)

Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. - Hiromi Aonuma; Hiroshi Imai; Keiko Imai; Takeshi Tokuyama (SCG, 1990)

Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. - Hiroshi Imai; Kazuo Iwano (SIGAL International Symposium on Algorithms, 1990)

Computing Simple Circuits form a Set of Line Segments. - David Rappaport; Hiroshi Imai; Godfried T. Toussaint (Discret. Comput. Geom., 1990)

Computation Geometry Research in Japan. - Hiroshi Imai (Bull. EATCS, 1990)

Locating a Robot with Angle Mathematics. - David Avis; Hiroshi Imai (J. Symb. Comput., 1990)

Performance Evaluation of Automatic Name Placement Functions for Geographical Database Systems. - Nobuhiko Kojiro; Ken'ichi Miura; Hiroshi Imai; Yahiko Kambayashi (DASFAA, 1991)

An Analysis of Randomized Shear Sort on the Mesh Computer. - Susumu Hasegawa; Hiroshi Imai; Koji Hakata (ISA, 1991)

Finding k Points with Minimum Diameter and Related Problems. - Alok Aggarwal; Hiroshi Imai; Naoki Katoh; Subhash Suri (J. Algorithms, 1991)

Notes on the PAC Learning of Geometric Concepts with Additional Information. - Ken-ichiro Kakihara; Hiroshi Imai (ALT, 1992)

The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. - Koji Hakata; Hiroshi Imai (ISAAC, 1992)

1-Segment Center Problems. - Hiroshi Imai; D. T. Lee; Chung-Do Yang (INFORMS J. Comput., 1992)

Epsilon-Approximations of k-label Spaces. - Susumu Hasegawa; Hiroshi Imai; Masaki Ishiguro (ALT, 1993)

How to Treat Delete Requests in Semi-Online Problems. - Yang Dai; Hiroshi Imai; Kazuo Iwano; Naoki Katoh (ISAAC, 1993)

Probing a Set of Hyperplanes by Lines and Related Problems. - Yasukazu Aoki; Hiroshi Imai; Keiko Imai; David Rappaport (WADS, 1993)

Orthogonal Weighted Linear L1 and L∞ Approximation and Applications. - Michael E. Houle; Hiroshi Imai; Keiko Imai; Jean-Marc Robert 001; Peter Yamamoto (Discret. Appl. Math., 1993)

Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). - Mary Inaba; Naoki Katoh; Hiroshi Imai (SCG, 1994)

A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. - Seiichiro Tani; Hiroshi Imai (ISAAC, 1994)

Search space reduction in high level synthesis by use of an initial circuit. - Atsushi Masuda; Hiroshi Imai; Jeffery P. Hansen; Masatoshi Sekine (ASP-DAC, 1995)

Computing the Tutte Polynomial of a Graph of Moderate Size. - Kyoko Sekine; Hiroshi Imai; Seiichiro Tani (ISAAC, 1995)

epsilon-Approximations of k-Label Spaces. - Susumu Hasegawa; Hiroshi Imai; Masaki Ishiguro (Theor. Comput. Sci., 1995)

Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. - Hiroshi Imai; Satoru Iwata 001; Kyoko Sekine; Kensyu Yoshida (COCOON, 1996)

Detour Queries in Geographical Databases for Navigation and Related Algorithm Animations. - Tetsuo Shibuya; Hiroshi Imai; Shigeki Nishimura; Hiroshi Shimoura; Kenji Tenmoku (CODAS, 1996)

Experimental Results of Randomized Clustering Algorithm. - Mary Inaba; Hiroshi Imai; Naoki Katoh (SCG, 1996)

Enumeration of Regular Triangulations. - Tomonari Masada; Hiroshi Imai; Keiko Imai (SCG, 1996)

A Package for Triangulations. - Tsuyoshi Ono; Yoshiaki Kyoda; Tomonari Masada; Kazuyoshi Hayase; Tetsuo Shibuya; Motoki Nakade; Mary Inaba; Hiroshi Imai; Keiko Imai; David Avis (SCG, 1996)

A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. - Yang Dai; Hiroshi Imai; Kazuo Iwano; Naoki Katoh; Keiji Ohtsuka; Nobuhiko Yoshimura (Discret. Appl. Math., 1996)

Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points. - Fumihiko Takeuchi; Hiroshi Imai (COCOON, 1997)

Application of an Effective Geometric Clustering Method to the Color Quantization Problem. - Mary Inaba; Hiroshi Imai; Motoki Nakade; Tatsurou Sekiguchi (SCG, 1997)

Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence. - Kensuke Onishi; Hiroshi Imai (SCG, 1997)

New Flexible Approaches for Multiple Sequence Alignment. - Tetsuo Shibuya; Hiroshi Imai (J. Comput. Biol., 1997)

Geometric clustering models for multimedia databases. - Mary Inaba; Hiroshi Imai (CCCG, 1998)

Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space. - Kensuke Onishi; Hiroshi Imai (CCCG, 1998)

Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria. - Akira Tajima; Hiroshi Imai (CCCG, 1998)

Voronoi Diagrams by Divergences with Additive Weights. - Kunihiko Sadakane; Hiroshi Imai; Kensuke Onishi; Mary Inaba; Fumihiko Takeuchi; Keiko Imai (SCG, 1998)

Geometric Clustering Models in Feature Space. - Mary Inaba; Hiroshi Imai (Discovery Science, 1998)

A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. - Kunihiko Sadakane; Hiroshi Imai (ER Workshops, 1998)

OBDDs of a Monotone Function and Its Prime Implicants. - Kazuyoshi Hayase; Hiroshi Imai (Theory Comput. Syst., 1998)

Text Retrieval by Using k-word Proximity Search. - Kunihiko Sadakane; Hiroshi Imai (DANTE, 1999)

Finding Meaningful Regions Containing Given Keywords from Large Text Collections. - Kunihiko Sadakane; Hiroshi Imai (Discovery Science, 1999)

Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k-Opt Approximate Alignments for Large Cases. - Takahiro Ikeda; Hiroshi Imai (Theor. Comput. Sci., 1999)

Finding k-Closest-Pairs Efficiently for High Dimensional Data. - Mary Inaba; Hiroshi Imai (CCCG, 2000)

Implementing the Context Tree Weighting Method for Text Compression. - Kunihiko Sadakane; Takumi Okazaki; Hiroshi Imai (Data Compression Conference, 2000)

Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. - Takayuki Osogami; Hiroshi Imai (ISAAC, 2000)

Power, Puzzles and Properties of Entanglement. - Jozef Gruska; Hiroshi Imai (MCU, 2001)

On the Newly Established Graduate School of Information Science and Technology of the University of Tokyo. - Hiroshi Imai (WISE (2), 2001)

Two-way Quantum One-counter Automata - Tomohiro Yamasaki; Hirotada Kobayashi; Hiroshi Imai (CoRR, 2001)

A DNA-based Computational Model Using a Specific Type of Restriction Enzyme. - Yasubumi Sakakibara; Hiroshi Imai (DNA, 2002)

Data Compression Method Combining Properties of PPM and CTW. - Takumi Okazaki; Kunihiko Sadakane; Hiroshi Imai (Progress in Discovery Science, 2002)

Power of Quantum Entanglement. - Jozef Gruska; Hiroshi Imai; Keiji Matsumoto (IFIP TCS, 2002)

Focusing on Sites in the Web. - Yasuhito Asano; Hiroshi Imai; Masashi Toyoda; Masaru Kitsuregawa (ISDB, 2002)

General-Purpose Parallel Simulator for Quantum Computing. - Jumpei Niwa; Keiji Matsumoto; Hiroshi Imai (UMC, 2002)

An Analysis of Absorbing Times of Quantum Walks. - Tomohiro Yamasaki; Hirotada Kobayashi; Hiroshi Imai (UMC, 2002)

Web-Linkage Viewer: Finding Graph Structures in the Web. - Yasuhito Asano; Hiroshi Imai; Masashi Toyoda; Masaru Kitsuregawa (WAIM, 2002)

Applying the Site Information to the Information Retrieval from the Web. - Yasuhito Asano; Hiroshi Imai; Masashi Toyoda; Masaru Kitsuregawa (WISE, 2002)

Enumerating Triangulations in General Dimensions. - Hiroshi Imai; Tomonari Masada; Fumihiko Takeuchi; Keiko Imai (Int. J. Comput. Geom. Appl., 2002)

One-way probabilistic reversible and quantum one-counter automata. - Tomohiro Yamasaki; Hirotada Kobayashi; Yuuki Tokunaga; Hiroshi Imai (Theor. Comput. Sci., 2002)

Finding Neighbor Communities in the Web Using Inter-site Graph. - Yasuhito Asano; Hiroshi Imai; Masashi Toyoda; Masaru Kitsuregawa (DEXA, 2003)

Compact Encoding of the Web Graph Exploiting Various Power Laws: Statistical Reason Behind Link Database. - Yasuhito Asano; Tsuyoshi Ito; Hiroshi Imai; Masashi Toyoda; Masaru Kitsuregawa (WAIM, 2003)

Guest Editors' Foreword. - Hon Wai Leong; Hiroshi Imai (Algorithmica, 2003)

Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs. - Takayuki Ishizeki; Hiroshi Imai (Optim. Methods Softw., 2003)

Finding Neighbor Communities in the Web Using an Inter-Site Graph. - Yasuhito Asano; Hiroshi Imai; Masashi Toyoda; Masaru Kitsuregawa (IEICE Trans. Inf. Syst., 2004)

A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes. - Yasubumi Sakakibara; Hiroshi Imai (J. Autom. Lang. Comb., 2004)

Qubit channels which require four inputs to achieve capacity: implications for additivity conjectures. - Masahito Hayashi; Hiroshi Imai; Keiji Matsumoto; Mary Beth Ruskai; Toshiyuki Shimono (Quantum Inf. Comput., 2005)

Quantum versus deterministic counter automata. - Tomohiro Yamasaki; Hirotada Kobayashi; Hiroshi Imai (Theor. Comput. Sci., 2005)

On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation. - Kimikazu Kato; Mayumi Oto; Keiko Imai; Hiroshi Imai (ISVD, 2006)

Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity. - Kimikazu Kato; Hiroshi Imai; Keiko Imai (ISVD, 2007)

Generating facets for the cut polytope of a graph by triangular elimination. - David Avis; Hiroshi Imai; Tsuyoshi Ito (Math. Program., 2008)

Computational Geometry Analysis of Quantum State Space and Its Applications. - Kimikazu Kato; Mayumi Oto; Hiroshi Imai; Keiko Imai (Generalized Voronoi Diagram, 2008)

Voronoi Diagrams on Periodic Graphs. - Norie Fu; Hiroshi Imai; Sonoko Moriyama (ISVD, 2010)

Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints. - Toshihiro Tanuma; Hiroshi Imai; Sonoko Moriyama (ISVD, 2010)

Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers. - Vorapong Suppakitpaisarn; Masato Edahiro; Hiroshi Imai (IACR Cryptol. ePrint Arch., 2010)

Proximity and Motion Planning on l_1-Embeddable Tilings. - Norie Fu; Akihiro Hashikura; Hiroshi Imai (ISVD, 2011)

Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains. - Vorapong Suppakitpaisarn; Masato Edahiro; Hiroshi Imai (IACR Cryptol. ePrint Arch., 2011)

Emergency Medical Support System for Extravehicular Activity Training Held at Weightless Environment Test Building (WETS) of the Japan Aerospace Exploration Agency (JAXA) - Future Prospects and A Look Back Over the Past Decade. - Isao Nakajima; Masakazu Tachibana; Noriyoshi Ohashi; Hiroshi Imai; Yasushi Asari; Shigenori Matsuyama (J. Medical Syst., 2011)

Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints. - Toshihiro Tanuma; Hiroshi Imai; Sonoko Moriyama (Trans. Comput. Sci., 2011)

Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers. - Vorapong Suppakitpaisarn; Masato Edahiro; Hiroshi Imai (AISC, 2012)

Geometrical Treatment of Periodic Graphs with Coordinate System Using Axis-fiber and an Application to a Motion Planning. - Norie Fu; Akihiro Hashikura; Hiroshi Imai (ISVD, 2012)

Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers. - Vorapong Suppakitpaisarn; Masato Edahiro; Hiroshi Imai (WALCOM, 2012)

Fastest multi-scalar multiplication based on optimal double-base chains. - Vorapong Suppakitpaisarn; Hiroshi Imai; Masato Edahiro (WorldCIS, 2012)

Matroid Enumeration for Incidence Geometry. - Yoshitake Matsumoto; Sonoko Moriyama; Hiroshi Imai; David Bremner (Discret. Comput. Geom., 2012)

Editorial. - David Bremner; Antoine Deza; Hiroshi Imai; Sonoko Moriyama (Comput. Geom., 2013)

Proximity and Motion Planning on ℓ1-Rigid Planar Periodic Graphs. - Norie Fu; Akihiro Hashikura; Hiroshi Imai (Trans. Comput. Sci., 2013)

Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. - Jean-François Baffier; Vorapong Suppakitpaisarn; Hidefumi Hiraishi; Hiroshi Imai (ISCO, 2014)

Worst case computation time for minimal joint Hamming weight numeral system. - Vorapong Suppakitpaisarn; Hiroshi Imai (ISITA, 2014)

BDD Operations for Quantum Graph States. - Hidefumi Hiraishi; Hiroshi Imai (RC, 2014)

Two Lower Bounds for Shortest Double-Base Number System. - Parinya Chalermsook; Hiroshi Imai; Vorapong Suppakitpaisarn (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case. - Hiroshi Imai; Vorapong Suppakitpaisarn (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

Structural internal deterioration detection with motion vector field image analysis using monocular camera. - Hiroshi Imai; Masahiko Ohta; Kazuhito Murata (3D Image Processing, Measurement (3DIPM), and Applications, 2016)

Parametric multiroute flow and its application to multilink-attack network. - Jean-François Baffier; Vorapong Suppakitpaisarn; Hidefumi Hiraishi; Hiroshi Imai (Discret. Optim., 2016)

FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models. - Shinya Shiroshita; Tomoaki Ogasawara; Hidefumi Hiraishi; Hiroshi Imai (WALCOM, 2018)

Parameterized Algorithms to Compute Ising Partition Function. - Hidefumi Hiraishi; Hiroshi Imai; Yoichi Iwata; Bingkai Lin (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations. - Farley Soares Oliveira; Hidefumi Hiraishi; Hiroshi Imai (LAGOS, 2019)

Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial. - Farley Soares Oliveira; Hidefumi Hiraishi; Hiroshi Imai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Extended formulations of lower-truncated transversal polymatroids. - Hiroshi Imai; Keiko Imai; Hidefumi Hiraishi (Optim. Methods Softw., 2021)

Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices. - Bo Yang; Rudy Raymond; Hiroshi Imai; Hyungseok Chang; Hidefumi Hiraishi (IEEE J. Emerg. Sel. Topics Circuits Syst., 2022)

Distributed Coordinate Descent Algorithm for Variational Quantum Classification. - Izuho Koyasu; Rudy Raymond; Hiroshi Imai (QCE, 2023)

The Role of Entanglement in Quantum-Relaxation Based Optimization Algorithms. - Kosei Teramoto; Rudy Raymond; Hiroshi Imai (QCE, 2023)

Enhancing Convergence in Variational Quantum Eigensolver Using CoolMomentum. - Daisuke Tsukayama; Jun-ichi Shirakashi; Tetsuo Shibuya; Hiroshi Imai (QCE, 2024)