Hiroshi Imai - RankMe

130 papers A* 2A 1B 20C 6Misc 9Journal 51Unranked 39

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Decomposition of Multi-Qubit Gates for Circuit Cutting. CoRR Ryota Tamura, Tomoya Kashimata, Yohei Hamakawa, Kosuke Tatsumura, Hiroshi Imai
2024	Misc	`conf`	Enhancing Convergence in Variational Quantum Eigensolver Using CoolMomentum. QCE Daisuke Tsukayama, Jun-ichi Shirakashi, Tetsuo Shibuya, Hiroshi Imai
2023	Misc	`conf`	Distributed Coordinate Descent Algorithm for Variational Quantum Classification. QCE Izuho Koyasu, Rudy Raymond, Hiroshi Imai
2023	Misc	`conf`	The Role of Entanglement in Quantum-Relaxation Based Optimization Algorithms. QCE Kosei Teramoto, Rudy Raymond, Hiroshi Imai
2022	J	`jnl`	Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices. IEEE J. Emerg. Sel. Topics Circuits Syst. Bo Yang, Rudy Raymond, Hiroshi Imai, Hyungseok Chang, Hidefumi Hiraishi
2021	J	`jnl`	Extended formulations of lower-truncated transversal polymatroids. Optim. Methods Softw. Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi
2019	C	`conf`	FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations. LAGOS Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai
2019	J	`jnl`	Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai
2018	B	`conf`	FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models. WALCOM Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai
2018	J	`jnl`	Parameterized Algorithms to Compute Ising Partition Function. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin
2016	J	`jnl`	Parametric multiroute flow and its application to multilink-attack network. Discret. Optim. Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai
2016	—	`conf`	Structural internal deterioration detection with motion vector field image analysis using monocular camera. 3D Image Processing, Measurement (3DIPM), and Applications Hiroshi Imai, Masahiko Ohta, Kazuhito Murata
2015	J	`jnl`	Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Hiroshi Imai, Vorapong Suppakitpaisarn
2015	J	`jnl`	Two Lower Bounds for Shortest Double-Base Number System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Parinya Chalermsook, Hiroshi Imai, Vorapong Suppakitpaisarn
2014	C	`conf`	BDD Operations for Quantum Graph States. RC Hidefumi Hiraishi, Hiroshi Imai
2014	C	`conf`	Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. ISCO Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai
2014	C	`conf`	Worst case computation time for minimal joint Hamming weight numeral system. ISITA Vorapong Suppakitpaisarn, Hiroshi Imai
2013	J	`jnl`	Editorial. Comput. Geom. David Bremner, Antoine Deza, Hiroshi Imai, Sonoko Moriyama
2013	J	`jnl`	Proximity and Motion Planning on ℓ1-Rigid Planar Periodic Graphs. Trans. Comput. Sci. Norie Fu, Akihiro Hashikura, Hiroshi Imai
2012	B	`conf`	Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers. WALCOM Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai
2012	Misc	`conf`	Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers. AISC Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai
2012	—	`conf`	Fastest multi-scalar multiplication based on optimal double-base chains. WorldCIS Vorapong Suppakitpaisarn, Hiroshi Imai, Masato Edahiro
2012	—	`conf`	Geometrical Treatment of Periodic Graphs with Coordinate System Using Axis-fiber and an Application to a Motion Planning. ISVD Norie Fu, Akihiro Hashikura, Hiroshi Imai
2012	J	`jnl`	Matroid Enumeration for Incidence Geometry. Discret. Comput. Geom. Yoshitake Matsumoto, Sonoko Moriyama, Hiroshi Imai, David Bremner
2011	J	`jnl`	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. J. Medical Syst. Isao Nakajima, Masakazu Tachibana, Noriyoshi Ohashi, Hiroshi Imai, Yasushi Asari, Shigenori Matsuyama
2011	J	`jnl`	Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains. IACR Cryptol. ePrint Arch. Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai
2011	—	`conf`	Proximity and Motion Planning on l_1-Embeddable Tilings. ISVD Norie Fu, Akihiro Hashikura, Hiroshi Imai
2011	J	`jnl`	Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints. Trans. Comput. Sci. Toshihiro Tanuma, Hiroshi Imai, Sonoko Moriyama
2010	J	`jnl`	Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers. IACR Cryptol. ePrint Arch. Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai
2010	—	`conf`	Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints. ISVD Toshihiro Tanuma, Hiroshi Imai, Sonoko Moriyama
2010	—	`conf`	Voronoi Diagrams on Periodic Graphs. ISVD Norie Fu, Hiroshi Imai, Sonoko Moriyama
2008	—	`ch.`	Computational Geometry Analysis of Quantum State Space and Its Applications. Generalized Voronoi Diagram Kimikazu Kato, Mayumi Oto, Hiroshi Imai, Keiko Imai
2008	J	`jnl`	Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. David Avis, Hiroshi Imai, Tsuyoshi Ito
2007	—	`conf`	Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity. ISVD Kimikazu Kato, Hiroshi Imai, Keiko Imai
2006	—	`conf`	On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation. ISVD Kimikazu Kato, Mayumi Oto, Keiko Imai, Hiroshi Imai
2005	J	`jnl`	Quantum versus deterministic counter automata. Theor. Comput. Sci. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
2005	J	`jnl`	Qubit channels which require four inputs to achieve capacity: implications for additivity conjectures. Quantum Inf. Comput. Masahito Hayashi, Hiroshi Imai, Keiji Matsumoto, Mary Beth Ruskai, Toshiyuki Shimono
2004	J	`jnl`	A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes. J. Autom. Lang. Comb. Yasubumi Sakakibara, Hiroshi Imai
2004	J	`jnl`	Finding Neighbor Communities in the Web Using an Inter-Site Graph. IEICE Trans. Inf. Syst. Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
2003	—	`conf`	Compact Encoding of the Web Graph Exploiting Various Power Laws: Statistical Reason Behind Link Database. WAIM Yasuhito Asano, Tsuyoshi Ito, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
2003	C	`conf`	Finding Neighbor Communities in the Web Using Inter-site Graph. DEXA Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
2003	J	`jnl`	Guest Editors' Foreword. Algorithmica Hon Wai Leong, Hiroshi Imai
2003	J	`jnl`	Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs. Optim. Methods Softw. Takayuki Ishizeki, Hiroshi Imai
2002	B	`conf`	A DNA-based Computational Model Using a Specific Type of Restriction Enzyme. DNA Yasubumi Sakakibara, Hiroshi Imai
2002	—	`conf`	An Analysis of Absorbing Times of Quantum Walks. UMC Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
2002	B	`conf`	Applying the Site Information to the Information Retrieval from the Web. WISE Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
2002	—	`conf`	Data Compression Method Combining Properties of PPM and CTW. Progress in Discovery Science Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai
2002	J	`jnl`	Enumerating Triangulations in General Dimensions. Int. J. Comput. Geom. Appl. Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai
2002	—	`conf`	Focusing on Sites in the Web. ISDB Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
2002	—	`conf`	General-Purpose Parallel Simulator for Quantum Computing. UMC Jumpei Niwa, Keiji Matsumoto, Hiroshi Imai
2002	J	`jnl`	One-way probabilistic reversible and quantum one-counter automata. Theor. Comput. Sci. Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
2002	—	`conf`	Power of Quantum Entanglement. IFIP TCS Jozef Gruska, Hiroshi Imai, Keiji Matsumoto
2002	Misc	`conf`	Quantum versus Deterministic Counter Automata. COCOON Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
2002	—	`conf`	Web-Linkage Viewer: Finding Graph Structures in the Web. WAIM Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa
2001	—	`conf`	On the Newly Established Graduate School of Information Science and Technology of the University of Tokyo. WISE (2) Hiroshi Imai
2001	C	`conf`	Power, Puzzles and Properties of Entanglement. MCU Jozef Gruska, Hiroshi Imai
2001	J	`jnl`	Two-way Quantum One-counter Automata CoRR Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
2000	B	`conf`	Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. ISAAC Takayuki Osogami, Hiroshi Imai
2000	—	`conf`	Finding k-Closest-Pairs Efficiently for High Dimensional Data. CCCG Mary Inaba, Hiroshi Imai
2000	B	`conf`	Implementing the Context Tree Weighting Method for Text Compression. Data Compression Conference Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai
2000	Misc	`conf`	One-Way Probabilistic Reversible and Quantum One-Counter Automata. COCOON Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai
1999	Misc	`ed.`	Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings COCOON Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama
1999	J	`jnl`	Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and Theor. Comput. Sci. Takahiro Ikeda, Hiroshi Imai
1999	B	`conf`	Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Discovery Science Kunihiko Sadakane, Hiroshi Imai
1999	—	`conf`	Text Retrieval by Using k-word Proximity Search. DANTE Kunihiko Sadakane, Hiroshi Imai
1998	—	`conf`	A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. ER Workshops Kunihiko Sadakane, Hiroshi Imai
1998	—	`conf`	Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria. CCCG Akira Tajima, Hiroshi Imai
1998	B	`conf`	Geometric Clustering Models in Feature Space. Discovery Science Mary Inaba, Hiroshi Imai
1998	—	`conf`	Geometric clustering models for multimedia databases. CCCG Mary Inaba, Hiroshi Imai
1998	J	`jnl`	OBDDs of a Monotone Function and Its Prime Implicants. Theory Comput. Syst. Kazuyoshi Hayase, Hiroshi Imai
1998	—	`conf`	Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space. CCCG Kensuke Onishi, Hiroshi Imai
1998	—	`conf`	Voronoi Diagrams by Divergences with Additive Weights. SCG Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai
1997	B	`ed.`	Algorithms and Computation, 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997, Proceedings ISAAC Hon Wai Leong, Hiroshi Imai, Sanjay Jain
1997	—	`conf`	Application of an Effective Geometric Clustering Method to the Color Quantization Problem. SCG Mary Inaba, Hiroshi Imai, Motoki Nakade, Tatsurou Sekiguchi
1997	Misc	`conf`	Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points. COCOON Fumihiko Takeuchi, Hiroshi Imai
1997	J	`jnl`	New Flexible Approaches for Multiple Sequence Alignment. J. Comput. Biol. Tetsuo Shibuya, Hiroshi Imai
1997	B	`conf`	New flexible approaches for multiple sequence alignment. RECOMB Tetsuo Shibuya, Hiroshi Imai
1997	—	`conf`	Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence. SCG Kensuke Onishi, Hiroshi Imai
1996	J	`jnl`	A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. Discret. Appl. Math. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura
1996	—	`conf`	A Package for Triangulations. SCG Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis
1996	Misc	`conf`	Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. COCOON Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida
1996	—	`conf`	Detour Queries in Geographical Databases for Navigation and Related Algorithm Animations. CODAS Tetsuo Shibuya, Hiroshi Imai, Shigeki Nishimura, Hiroshi Shimoura, Kenji Tenmoku
1996	—	`conf`	Enumeration of Regular Triangulations. SCG Tomonari Masada, Hiroshi Imai, Keiko Imai
1996	—	`conf`	Experimental Results of Randomized Clustering Algorithm. SCG Mary Inaba, Hiroshi Imai, Naoki Katoh
1996	B	`conf`	OBDDs of a Monotone Function and of Its Prime Implicants. ISAAC Kazuyoshi Hayase, Hiroshi Imai
1995	B	`conf`	Computing the Tutte Polynomial of a Graph of Moderate Size. ISAAC Kyoko Sekine, Hiroshi Imai, Seiichiro Tani
1995	—	`conf`	Search space reduction in high level synthesis by use of an initial circuit. ASP-DAC Atsushi Masuda, Hiroshi Imai, Jeffery P. Hansen, Masatoshi Sekine
1995	J	`jnl`	epsilon-Approximations of k-Label Spaces. Theor. Comput. Sci. Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro
1994	B	`conf`	A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. ISAAC Seiichiro Tani, Hiroshi Imai
1994	—	`conf`	Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based SCG Mary Inaba, Naoki Katoh, Hiroshi Imai
1993	B	`conf`	Epsilon-Approximations of ALT Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro
1993	B	`conf`	How to Treat Delete Requests in Semi-Online Problems. ISAAC Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh
1993	J	`jnl`	Orthogonal Weighted Linear Discret. Appl. Math. Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto
1993	B	`conf`	Probing a Set of Hyperplanes by Lines and Related Problems. WADS Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport
1992	J	`jnl`	1-Segment Center Problems. INFORMS J. Comput. Hiroshi Imai, D. T. Lee, Chung-Do Yang
1992	B	`conf`	Notes on the PAC Learning of Geometric Concepts with Additional Information. ALT Ken-ichiro Kakihara, Hiroshi Imai
1992	B	`conf`	The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. ISAAC Koji Hakata, Hiroshi Imai
1991	—	`conf`	An Analysis of Randomized Shear Sort on the Mesh Computer. ISA Susumu Hasegawa, Hiroshi Imai, Koji Hakata
1991	J	`jnl`	Finding k Points with Minimum Diameter and Related Problems. J. Algorithms Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
1991	B	`conf`	Performance Evaluation of Automatic Name Placement Functions for Geographical Database Systems. DASFAA Nobuhiko Kojiro, Ken'ichi Miura, Hiroshi Imai, Yahiko Kambayashi
1990	—	`ed.`	Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings SIGAL International Symposium on Algorithms Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
1990	J	`jnl`	Computation Geometry Research in Japan. Bull. EATCS Hiroshi Imai
1990	J	`jnl`	Computing Simple Circuits form a Set of Line Segments. Discret. Comput. Geom. David Rappaport, Hiroshi Imai, Godfried T. Toussaint
1990	—	`conf`	Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. SIGAL International Symposium on Algorithms Hiroshi Imai, Kazuo Iwano
1990	J	`jnl`	Locating a Robot with Angle Mathematics. J. Symb. Comput. David Avis, Hiroshi Imai
1990	—	`conf`	Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. SCG Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama
1989	J	`jnl`	A Linear-Time Algorithm for Linear L_1 Approximation of Points. Algorithmica Hiroshi Imai, Kenji Kato, Peter Yamamoto
1989	—	`conf`	A Visual System of Placing Characters Appropriately in Multimedia Map Databases. VDB Hiromi Aonuma, Hiroshi Imai, Yahiko Kambayashi
1989	—	`conf`	Fining SCG Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri
1989	—	`conf`	Minimax Geometric Fitting of Two Corresponding Sets of Points. SCG Keiko Imai, S. Sumino, Hiroshi Imai
1989	J	`jnl`	Notes on Oriented Depth-First Search and Longest Paths. Inf. Process. Lett. Hubert de Fraysseix, Hiroshi Imai
1989	B	`conf`	Weighted Orthogonal Linear L WADS Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert
1988	—	`conf`	Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. SCG Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai
1988	J	`jnl`	Computing the volume of the union of spheres. Vis. Comput. David Avis, Binay K. Bhattacharya, Hiroshi Imai
1988	J	`jnl`	On the convexity of the multiplicative version of Karmarkar's potential function. Math. Program. Hiroshi Imai
1987	J	`jnl`	Dynamic Orthogonal Segment Intersection Search. J. Algorithms Hiroshi Imai, Takao Asano
1987	A	`conf`	Geometric Relations Among Voronoi Diagrams. STACS Franz Aurenhammer, Hiroshi Imai
1987	J	`jnl`	Shortest Path Between Two Simple Polygons. Inf. Process. Lett. Takao Asano, Tetsuo Asano, Hiroshi Imai
1986	J	`jnl`	A Multiplicative Barrier Function Method for Linear Programming. Algorithmica Masao Iri, Hiroshi Imai
1986	J	`jnl`	Computational-geometric methods for polygonal approximations of a curve. Comput. Vis. Graph. Image Process. Hiroshi Imai, Masao Iri
1986	J	`jnl`	Efficient Algorithms for Geometric Graph Search Problems. SIAM J. Comput. Hiroshi Imai, Takao Asano
1986	—	`conf`	On Computing Simple Circuits on a Set of Line Segments. SCG David Rappaport, Hiroshi Imai, Godfried T. Toussaint
1986	J	`jnl`	Partitioning a polygonal region into trapezoids. J. ACM Takao Asano, Tetsuo Asano, Hiroshi Imai
1986	J	`jnl`	Visibility of Disjoint Polygons. Algorithmica Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
1985	J	`jnl`	On combinatorial structures of line drawings of polyhedra. Discret. Appl. Math. Hiroshi Imai
1985	A*	`conf`	Visibility-Polygon Search and Euclidean Shortest Paths FOCS Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai
1985	J	`jnl`	Voronoi Diagram in the Laguerre Geometry and its Applications. SIAM J. Comput. Hiroshi Imai, Masao Iri, Kazuo Murota
1984	A*	`conf`	Dynamic Segment Intersection Search with Applications FOCS Hiroshi Imai, Takao Asano
1983	J	`jnl`	Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. J. Algorithms Hiroshi Imai, Takao Asano
1982	J	`jnl`	Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. Inf. Process. Lett. Hiroshi Imai