| Year |
Citation |
Score |
| 2019 |
Oliveira FS, Hiraishi H, Imai H. FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations Electronic Notes in Theoretical Computer Science. 346: 655-666. DOI: 10.1016/J.Entcs.2019.08.057 |
0.368 |
|
| 2018 |
Hiraishi H, Imai H, Iwata Y, Lin B. Parameterized Algorithms to Compute Ising Partition Function Ieice Transactions On Fundamentals of Electronics, Communications and Computer Sciences. 101: 1398-1403. DOI: 10.1587/Transfun.E101.A.1398 |
0.34 |
|
| 2016 |
Baffier J, Suppakitpaisarn V, Hiraishi H, Imai H. Parametric multiroute flow and its application to multilink-attack network Discrete Optimization. 22: 20-36. DOI: 10.1016/J.Disopt.2016.05.002 |
0.318 |
|
| 2015 |
Chalermsook P, Imai H, Suppakitpaisarn V. Two lower bounds for shortest double-base number system Ieice Transactions On Fundamentals of Electronics, Communications and Computer Sciences. 1310-1312. DOI: 10.1587/Transfun.E98.A.1310 |
0.305 |
|
| 2012 |
Matsumoto Y, Moriyama S, Imai H, Bremner D. Matroid Enumeration for Incidence Geometry Discrete and Computational Geometry. 47: 17-43. DOI: 10.1007/S00454-011-9388-Y |
0.349 |
|
| 2005 |
Ishizeki T, Nakayama H, Imai H. Numbers Of Primal And Dual Bases Of Network Flow And Unimodular Integer Programs Journal of the Operations Research Society of Japan. 48: 183-195. DOI: 10.15807/Jorsj.48.183 |
0.328 |
|
| 2003 |
Kobara K, Imai H. On the one-wayness against chosen-plaintext attacks of the Loidreau's modified McEliece PKC Ieee Transactions On Information Theory. 49: 3160-3168. DOI: 10.1109/Tit.2003.820016 |
0.314 |
|
| 2003 |
Yamasaki T, Kobayashi H, Imai H. Analysis of absorbing times of quantum walks Physical Review A. 68: 12302. DOI: 10.1103/Physreva.68.012302 |
0.304 |
|
| 2002 |
Shimoura H, Nishimura S, Tenmoku K, Iwamoto T, Ishizeki T, Kobayashi H, Imai H. Platoon Matching and Travel Time Estimation based on Vehicle Alignment Ieej Transactions On Industry Applications. 122: 359-365. DOI: 10.1541/Ieejias.122.359 |
0.302 |
|
| 2002 |
Imai H, Masada T, Takeuchi F, Imai K. Enumerating Triangulations In General Dimensions International Journal of Computational Geometry and Applications. 12: 455-480. DOI: 10.1142/S0218195902000980 |
0.363 |
|
| 2002 |
Niwa J, Matsumoto K, Imai H. General-purpose parallel simulator for quantum computing Physical Review A. 66: 62317. DOI: 10.1103/Physreva.66.062317 |
0.339 |
|
| 2002 |
Yamasaki T, Kobayashi H, Imai H. An Analysis of Absorbing Times of Quantum Walks Lecture Notes in Computer Science. 315-330. DOI: 10.1007/3-540-45833-6_26 |
0.333 |
|
| 2002 |
Niwa J, Matsumoto K, Imai H. General-Purpose Parallel Simulator for Quantum Computing Lecture Notes in Computer Science. 230-251. DOI: 10.1007/3-540-45833-6_20 |
0.339 |
|
| 2000 |
Asano Y, Imai H. Practical Efficiency Of The Linear-Time Algorithm For The Single Source Shortest Path Problem Journal of the Operations Research Society of Japan. 43: 431-447. DOI: 10.15807/Jorsj.43.431 |
0.356 |
|
| 2000 |
Park N, Okano H, Imai H. A Path-Exchange-Type Local Search Algorithm For Vehicle Routing And Its Efficient Search Strategy Journal of the Operations Research Society of Japan. 43: 197-208. DOI: 10.15807/Jorsj.43.197 |
0.308 |
|
| 2000 |
Matsumoto T, Sadakane K, Imai H. Biological sequence compression algorithms. Genome Informatics. 11: 43-52. DOI: 10.11234/Gi1990.11.43 |
0.314 |
|
| 1999 |
Imai K, Imai H, Tokuyama T. Maximin Location Of Convex Objects In A Polygon And Related Dynamic Voronoi Diagrams Journal of the Operations Research Society of Japan. 42: 45-58. DOI: 10.15807/Jorsj.42.45 |
0.551 |
|
| 1999 |
Doi K, Imai H. A Greedy Algorithm for Minimizing the Number of Primers in Multiple PCR Experiments. Genome Informatics. 10: 73-82. DOI: 10.11234/Gi1990.10.73 |
0.327 |
|
| 1999 |
Kobayashi H, Imai H. An EM-type Algorithm for Ordered Restriction Map Alignment Genome Informatics. 10: 62-72. DOI: 10.11234/Gi1990.10.62 |
0.325 |
|
| 1999 |
Ikeda T, Imai H. Enhanced A algorithms for multiple alignments: optimal alignments for several sequences and k -opt approximate alignments for large cases Theoretical Computer Science. 210: 341-374. DOI: 10.1016/S0304-3975(98)00093-0 |
0.395 |
|
| 1998 |
Kobayashi H, Imai H. Improvement of the A(*) Algorithm for Multiple Sequence Alignment. Genome Informatics. 9: 120-130. DOI: 10.11234/Gi1990.9.120 |
0.379 |
|
| 1998 |
Imai K, Imai H. Dynamic weighted Voronoi diagrams and weighted minimax matching of two corresponding point sets Optimization Methods & Software. 10: 261-274. DOI: 10.1080/10556789808805714 |
0.313 |
|
| 1998 |
Hakata K, Imai H. Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima Optimization Methods & Software. 10: 233-260. DOI: 10.1080/10556789808805713 |
0.385 |
|
| 1997 |
Shibuya T, Imai H. New flexible approaches for multiple sequence alignment. Journal of Computational Biology. 4: 385-413. PMID 9278067 DOI: 10.1089/Cmb.1997.4.385 |
0.347 |
|
| 1997 |
Doi K, Imai H. Greedy Algorithms for Finding a Small Set of Primers Satisfying Cover and Length Resolution Conditions in PCR Experiments. Genome Informatics. 8: 43-52. DOI: 10.11234/Gi1990.8.43 |
0.363 |
|
| 1996 |
Dai Y, Imai H, Iwano K, Katoh N, Ohtsuka K, Yoshimura N. A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms Discrete Applied Mathematics. 65: 167-190. DOI: 10.1016/0166-218X(95)00034-O |
0.396 |
|
| 1995 |
Imai H, Ikeda T. k-Group Multiple Alignment Based on A* Search Genome Informatics. 6: 9-18. DOI: 10.11234/Gi1990.6.9 |
0.32 |
|
| 1994 |
Ikeda T, Imai H. Fast A Algorithms for Multiple Sequence Alignment Genome Informatics. 5: 90-99. DOI: 10.11234/Gi1990.5.90 |
0.394 |
|
| 1993 |
Houle ME, Imai H, Imai K, Robert J, Yamamoto P. Orthogonal weighted linear L 1 and L ∞ approximation and applications Discrete Applied Mathematics. 43: 217-232. DOI: 10.1016/0166-218X(93)90113-3 |
0.323 |
|
| 1992 |
Imai H, Lee DT, Yang C. 1-Segment Center Problems Informs Journal On Computing. 4: 426-434. DOI: 10.1287/Ijoc.4.4.426 |
0.341 |
|
| 1992 |
Hakata K, Imai H. Algorithms for the Longest Common Subsequence Problem Genome Informatics. 3: 53-56. DOI: 10.11234/Gi1990.3.53 |
0.357 |
|
| 1991 |
Aggarwal A, Imai H, Katoh N, Suri S. Finding k points with minimum diameter and related problems Journal of Algorithms. 12: 38-56. DOI: 10.1016/0196-6774(91)90022-Q |
0.353 |
|
| 1991 |
Hasegawa S, Imai H, Hakata K. An Analysis of Randomized Shear Sort on the Mesh Computer Rundbrief Der Gi-Fachgruppe 5.10 Informationssystem-Architekturen. 219-228. DOI: 10.1007/3-540-54945-5_66 |
0.329 |
|
| 1990 |
Rappaport D, Imai H, Toussaint GT. Computing simple circuits from a set of line segments Discrete &Amp; Computational Geometry. 5: 289-304. DOI: 10.1007/Bf02187791 |
0.31 |
|
| 1989 |
Imai H, Kato K, Yamamoto P. A linear-time algorithm for linear L 1 approximation of points Algorithmica. 4: 77-96. DOI: 10.1007/Bf01553880 |
0.361 |
|
| 1988 |
Imai H, Iri M. Polygonal Approximations of a Curve — Formulations and Algorithms Machine Intelligence and Pattern Recognition. 6: 71-86. DOI: 10.1016/B978-0-444-70467-2.50011-4 |
0.387 |
|
| 1988 |
Avis D, Bhattacharya BK, Imai H. Computing the volume of the union of spheres The Visual Computer. 3: 323-328. DOI: 10.1007/Bf01901190 |
0.344 |
|
| 1987 |
Imai H. Extensions Of The Multiplicative Penalty Function Method For Linear Programming Journal of the Operations Research Society of Japan. 30: 160-180. DOI: 10.15807/Jorsj.30.160 |
0.379 |
|
| 1987 |
Imai H, Asano T. Dynamic orthogonal segment intersection search Journal of Algorithms. 8: 1-18. DOI: 10.1016/0196-6774(87)90024-1 |
0.387 |
|
| 1987 |
Asano T, Imai H. Shortest path between two simple polygons Information Processing Letters. 24: 285-288. DOI: 10.1016/0020-0190(87)90150-5 |
0.384 |
|
| 1986 |
Imai H. Worst-Case Analysis For Planar Matching And Tour Heuristics With Bucketing Techniques And Spacefilling Curves Journal of the Operations Research Society of Japan. 29: 43-68. DOI: 10.15807/Jorsj.29.43 |
0.322 |
|
| 1986 |
Asano T, Asano T, Imai H. Partitioning a polygonal region into trapezoids Journal of the Acm. 33: 290-312. DOI: 10.1145/5383.5387 |
0.366 |
|
| 1986 |
Imai H, Asano T. Efficient algorithms for geometric graph search problems Siam Journal On Computing. 15: 478-494. DOI: 10.1137/0215033 |
0.346 |
|
| 1986 |
Imai H, Iri M. Computational-geometric methods for polygonal approximations of a curve Graphical Models \/Graphical Models and Image Processing \/Computer Vision, Graphics, and Image Processing. 36: 31-41. DOI: 10.1016/S0734-189X(86)80027-5 |
0.403 |
|
| 1986 |
Iri M, Imai H. A multiplicative barrier function method for linear programming Algorithmica. 1: 455-482. DOI: 10.1007/Bf01840457 |
0.358 |
|
| 1985 |
Imai H, Iri M, Murota K. Voronoi Diagram In The Laguerre Geometry And Its Applications Siam Journal On Computing. 14: 93-105. DOI: 10.1137/0214006 |
0.369 |
|
| 1985 |
Asano T, Edahiro M, Imai H, Iri M, Murota K. Practical use of Bucketing Techniques in Computational Geometry Machine Intelligence and Pattern Recognition. 2: 153-195. DOI: 10.1016/B978-0-444-87806-9.50011-6 |
0.334 |
|
| 1984 |
Imai H, Iri M. Practical Efficiencies Of Existing Shortest-Path Algorithms And A New Bucket Algorithm Journal of the Operations Research Society of Japan. 27: 43-58. DOI: 10.15807/Jorsj.27.43 |
0.338 |
|
| 1983 |
Imai H. On The Practical Efficiency Of Various Maximum Flow Algorithms Journal of the Operations Research Society of Japan. 26: 61-83. DOI: 10.15807/Jorsj.26.61 |
0.313 |
|
| 1983 |
Imai H. Network-Flow Algorithms For Lower-Truncated Transversal Polymatroids Journal of the Operations Research Society of Japan. 26: 186-211. DOI: 10.15807/Jorsj.26.186 |
0.382 |
|
| 1983 |
Imai H, Asano T. Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane Journal of Algorithms. 4: 310-323. DOI: 10.1016/0196-6774(83)90012-3 |
0.367 |
|
| Show low-probability matches. |