| 2008 | ||
|---|---|---|
| 92 | Kimikazu Kato, Mayumi Oto, Hiroshi Imai, Keiko Imai: Computational Geometry Analysis of Quantum State Space and Its Applications. Generalized Voronoi Diagram 2008: 67-108 | |
| 91 | David Avis, Hiroshi Imai, Tsuyoshi Ito: Generating facets for the cut polytope of a graph by triangular elimination. Math. Program. 112(2): 303-325 (2008) | |
| 2007 | ||
| 90 | Kimikazu Kato, Hiroshi Imai, Keiko Imai: Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity. ISVD 2007: 265-269 | |
| 2005 | ||
| 89 | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai: Quantum versus deterministic counter automata. Theor. Comput. Sci. 334(1-3): 275-297 (2005) | |
| 2004 | ||
| 88 | Yasubumi Sakakibara, Hiroshi Imai: A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes. Journal of Automata, Languages and Combinatorics 9(1): 111-119 (2004) | |
| 2003 | ||
| 87 | Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa: Finding Neighbor Communities in the Web Using Inter-site Graph. DEXA 2003: 558-568 | |
| 86 | Yasuhito Asano, Tsuyoshi Ito, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa: Compact Encoding of the Web Graph Exploiting Various Power Laws: Statistical Reason Behind Link Database. WAIM 2003: 37-46 | |
| 85 | Hon Wai Leong, Hiroshi Imai: Guest Editors' Foreword. Algorithmica 35(3): 193-193 (2003) | |
| 2002 | ||
| 84 | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai: Quantum versus Deterministic Counter Automata. COCOON 2002: 584-594 | |
| 83 | Yasubumi Sakakibara, Hiroshi Imai: A DNA-based Computational Model Using a Specific Type of Restriction Enzyme. DNA 2002: 315-325 | |
| 82 | Jozef Gruska, Hiroshi Imai, Keiji Matsumoto: Power of Quantum Entanglement. IFIP TCS 2002: 3-22 | |
| 81 | Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa: Focusing on Sites in the Web. ISDB 2002: 154-159 | |
| 80 | Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai: Data Compression Method Combining Properties of PPM and CTW. Progress in Discovery Science 2002: 268-283 | |
| 79 | Jumpei Niwa, Keiji Matsumoto, Hiroshi Imai: General-Purpose Parallel Simulator for Quantum Computing. UMC 2002: 230-251 | |
| 78 | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai: An Analysis of Absorbing Times of Quantum Walks. UMC 2002: 315-330 | |
| 77 | Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa: Web-Linkage Viewer: Finding Graph Structures in the Web. WAIM 2002: 441-442 | |
| 76 | Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa: Applying the Site Information to the Information Retrieval from the Web. WISE 2002: 83-92 | |
| 75 | Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai: Enumerating Triangulations in General Dimensions. Int. J. Comput. Geometry Appl. 12(6): 455-480 (2002) | |
| 74 | Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai: One-way probabilistic reversible and quantum one-counter automata. Theor. Comput. Sci. 289(2): 963-976 (2002) | |
| 2001 | ||
| 73 | Jozef Gruska, Hiroshi Imai: Power, Puzzles and Properties of Entanglement. MCU 2001: 25-68 | |
| 72 | Hiroshi Imai: On the Newly Established Graduate School of Information Science and Technology of the University of Tokyo. WISE (2) 2001: 223-227 | |
| 71 | Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai: Two-way Quantum One-counter Automata CoRR cs.CC/0110005: (2001) | |
| 2000 | ||
| 70 | Mary Inaba, Hiroshi Imai: Finding k-Closest-Pairs Efficiently for High Dimensional Data. CCCG 2000 | |
| 69 | Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai: One-Way Probabilistic Reversible and Quantum One-Counter Automata. COCOON 2000: 436-446 | |
| 68 | Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai: Implementing the Context Tree Weighting Method for Text Compression. Data Compression Conference 2000: 123-132 | |
| 67 | Takayuki Osogami, Hiroshi Imai: Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. ISAAC 2000: 72-83 | |
| 1999 | ||
| 66 | Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings Springer 1999 | |
| 65 | Kunihiko Sadakane, Hiroshi Imai: Text Retrieval by Using k-word Proximity Search. DANTE 1999: 183-188 | |
| 64 | Kunihiko Sadakane, Hiroshi Imai: Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Discovery Science 1999: 353-354 | |
| 63 | Takahiro Ikeda, Hiroshi Imai: Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k-Opt Approximate Alignments for Large Cases. Theor. Comput. Sci. 210(2): 341-374 (1999) | |
| 1998 | ||
| 62 | Akira Tajima, Hiroshi Imai: Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria. CCCG 1998 | |
| 61 | Mary Inaba, Hiroshi Imai: Geometric clustering models for multimedia databases. CCCG 1998 | |
| 60 | Kensuke Onishi, Hiroshi Imai: Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space. CCCG 1998 | |
| 59 | Mary Inaba, Hiroshi Imai: Geometric Clustering Models in Feature Space. Discovery Science 1998: 421-422 | |
| 58 | Kunihiko Sadakane, Hiroshi Imai: A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation. ER Workshops 1998: 434-445 | |
| 57 | Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai: Voronoi Diagrams by Divergences with Additive Weights. Symposium on Computational Geometry 1998: 403-404 | |
| 56 | Kazuyoshi Hayase, Hiroshi Imai: OBDDs of a Monotone Function and Its Prime Implicants. Theory Comput. Syst. 31(5): 570-591 (1998) | |
| 1997 | ||
| 55 | Hon Wai Leong, Hiroshi Imai, Sanjay Jain: Algorithms and Computation, 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997, Proceedings Springer 1997 | |
| 54 | Fumihiko Takeuchi, Hiroshi Imai: Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points. COCOON 1997: 470-481 | |
| 53 | Tetsuo Shibuya, Hiroshi Imai: New flexible approaches for multiple sequence alignment. RECOMB 1997: 267-276 | |
| 52 | Kensuke Onishi, Hiroshi Imai: Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence. Symposium on Computational Geometry 1997: 463-465 | |
| 51 | Mary Inaba, Hiroshi Imai, Motoki Nakade, Tatsurou Sekiguchi: Application of an Effective Geometric Clustering Method to the Color Quantization Problem. Symposium on Computational Geometry 1997: 477-478 | |
| 50 | Tetsuo Shibuya, Hiroshi Imai: New Flexible Approaches for Multiple Sequence Alignment. Journal of Computational Biology 4(3): 385-414 (1997) | |
| 1996 | ||
| 49 | Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida: Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. COCOON 1996: 68-80 | |
| 48 | Tetsuo Shibuya, Hiroshi Imai, Shigeki Nishimura, Hiroshi Shimoura, Kenji Tenmoku: Detour Queries in Geographical Databases for Navigation and Related Algorithm Animations. CODAS 1996: 246- | |
| 47 | Kazuyoshi Hayase, Hiroshi Imai: OBDDs of a Monotone Function and of Its Prime Implicants. ISAAC 1996: 136-145 | |
| 46 | Tomonari Masada, Hiroshi Imai, Keiko Imai: Enumeration of Regular Triangulations. Symposium on Computational Geometry 1996: 224-233 | |
| 45 | Mary Inaba, Hiroshi Imai, Naoki Katoh: Experimental Results of Randomized Clustering Algorithm. Symposium on Computational Geometry 1996: C-1-C-2 | |
| 44 | Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis: A Package for Triangulations. Symposium on Computational Geometry 1996: V-17-V-18 | |
| 43 | Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura: A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. Discrete Applied Mathematics 65(1-3): 167-190 (1996) | |
| 1995 | ||
| 42 | Atsushi Masuda, Hiroshi Imai, Jeffery P. Hansen, Masatoshi Sekine: Search space reduction in high level synthesis by use of an initial circuit. ASP-DAC 1995 | |
| 41 | Kyoko Sekine, Hiroshi Imai, Seiichiro Tani: Computing the Tutte Polynomial of a Graph of Moderate Size. ISAAC 1995: 224-233 | |
| 40 | Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro: epsilon-Approximations of k-Label Spaces. Theor. Comput. Sci. 137(1): 145-157 (1995) | |
| 1994 | ||
| 39 | Seiichiro Tani, Hiroshi Imai: A Reordering Operation for an Ordered Binary Decision Diagram and an Extended Framework for Combinatorics of Graphs. ISAAC 1994: 575-583 | |
| 38 | Mary Inaba, Naoki Katoh, Hiroshi Imai: Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). Symposium on Computational Geometry 1994: 332-339 | |
| 1993 | ||
| 37 | Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro: Epsilon-Approximations of k-label Spaces. ALT 1993: 288-299 | |
| 36 | Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh: How to Treat Delete Requests in Semi-Online Problems. ISAAC 1993: 48-57 | |
| 35 | Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport: Probing a Set of Hyperplanes by Lines and Related Problems. WADS 1993: 72-82 | |
| 34 | Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto: Orthogonal Weighted Linear L1 and Linfty Approximation and Applications. Discrete Applied Mathematics 43(3): 217-232 (1993) | |
| 1992 | ||
| 33 | Ken-ichiro Kakihara, Hiroshi Imai: Notes on the PAC Learning of Geometric Concepts with Additional Information. ALT 1992: 252-259 | |
| 32 | Koji Hakata, Hiroshi Imai: The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. ISAAC 1992: 469-478 | |
| 31 | Hiroshi Imai, D. T. Lee, Chung-Do Yang: 1-Segment Center Problems. INFORMS Journal on Computing 4(4): 426-434 (1992) | |
| 1991 | ||
| 30 | Nobuhiko Kojiro, Ken'ichi Miura, Hiroshi Imai, Yahiko Kambayashi: Performance Evaluation of Automatic Name Placement Functions for Geographical Database Systems. DASFAA 1991: 491-497 | |
| 29 | Susumu Hasegawa, Hiroshi Imai, Koji Hakata: An Analysis of Randomized Shear Sort on the Mesh Computer. ISA 1991: 219-228 | |
| 28 | Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri: Finding k Points with Minimum Diameter and Related Problems. J. Algorithms 12(1): 38-56 (1991) | |
| 1990 | ||
| 27 | Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki: Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings Springer 1990 | |
| 26 | Hiroshi Imai, Kazuo Iwano: Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. SIGAL International Symposium on Algorithms 1990: 21-30 | |
| 25 | Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama: Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. Symposium on Computational Geometry 1990: 225-234 | |
| 24 | Hiroshi Imai: Computation Geometry Research in Japan. Bulletin of the EATCS 40: 164-167 (1990) | |
| 23 | David Rappaport, Hiroshi Imai, Godfried T. Toussaint: Computing Simple Circuits form a Set of Line Segments. Discrete & Computational Geometry 5: 289-304 (1990) | |
| 22 | David Avis, Hiroshi Imai: Locating a Robot with Angle Mathematics. J. Symb. Comput. 10(3/4): 311-326 (1990) | |
| 1989 | ||
| 21 | Keiko Imai, S. Sumino, Hiroshi Imai: Minimax Geometric Fitting of Two Corresponding Sets of Points. Symposium on Computational Geometry 1989: 206-275 | |
| 20 | Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri: Fining k Points with Minimum Spanning Trees and Related Problems. Symposium on Computational Geometry 1989: 283-291 | |
| 19 | Hiromi Aonuma, Hiroshi Imai, Yahiko Kambayashi: A Visual System of Placing Characters Appropriately in Multimedia Map Databases. VDB 1989: 525-546 | |
| 18 | Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert: Weighted Orthogonal Linear L\infty-Approximation and Applications. WADS 1989: 183-193 | |
| 17 | Hiroshi Imai, Kenji Kato, Peter Yamamoto: A Linear-Time Algorithm for Linear L_1 Approximation of Points. Algorithmica 4(1): 77-96 (1989) | |
| 1988 | ||
| 16 | Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai: Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. Symposium on Computational Geometry 1988: 352-361 | |
| 15 | David Avis, Binay K. Bhattacharya, Hiroshi Imai: Computing the volume of the union of spheres. The Visual Computer 3(6): 323-328 (1988) | |
| 1987 | ||
| 14 | Franz Aurenhammer, Hiroshi Imai: Geometric Relations Among Voronoi Diagrams. STACS 1987: 53-65 | |
| 13 | Takao Asano, Tetsuo Asano, Hiroshi Imai: Shortest Path Between Two Simple Polygons. Inf. Process. Lett. 24(5): 285-288 (1987) | |
| 12 | Hiroshi Imai, Takao Asano: Dynamic Orthogonal Segment Intersection Search. J. Algorithms 8(1): 1-18 (1987) | |
| 1986 | ||
| 11 | David Rappaport, Hiroshi Imai, Godfried T. Toussaint: On Computing Simple Circuits on a Set of Line Segments. Symposium on Computational Geometry 1986: 52-60 | |
| 10 | Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986) | |
| 9 | Masao Iri, Hiroshi Imai: A Multiplicative Barrier Function Method for Linear Programming. Algorithmica 1(4): 455-482 (1986) | |
| 8 | Hiroshi Imai, Masao Iri: Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics, and Image Processing 36(1): 31-41 (1986) | |
| 7 | Takao Asano, Tetsuo Asano, Hiroshi Imai: Partitioning a polygonal region into trapezoids. J. ACM 33(2): 290-312 (1986) | |
| 6 | Hiroshi Imai, Takao Asano: Efficient Algorithms for Geometric Graph Search Problems. SIAM J. Comput. 15(2): 478-494 (1986) | |
| 1985 | ||
| 5 | Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai: Visibility-Polygon Search and Euclidean Shortest Paths FOCS 1985: 155-164 | |
| 4 | Hiroshi Imai, Masao Iri, Kazuo Murota: Voronoi Diagram in the Laguerre Geometry and its Applications. SIAM J. Comput. 14(1): 93-105 (1985) | |
| 1984 | ||
| 3 | Hiroshi Imai, Takao Asano: Dynamic Segment Intersection Search with Applications FOCS 1984: 393-402 | |
| 1983 | ||
| 2 | Hiroshi Imai, Takao Asano: Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. J. Algorithms 4(4): 310-323 (1983) | |
| 1982 | ||
| 1 | Hiroshi Imai: Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. Inf. Process. Lett. 15(3): 125-128 (1982) | |