default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Imai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c74]Izuho Koyasu, Rudy Raymond, Hiroshi Imai:
Distributed Coordinate Descent Algorithm for Variational Quantum Classification. QCE 2023: 457-467- [c73]Kosei Teramoto, Rudy Raymond, Hiroshi Imai:
The Role of Entanglement in Quantum-Relaxation Based Optimization Algorithms. QCE 2023: 543-553 - 2022
- [j47]Bo Yang
, Rudy Raymond, Hiroshi Imai, Hyungseok Chang, Hidefumi Hiraishi:
Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices. IEEE J. Emerg. Sel. Topics Circuits Syst. 12(3): 638-647 (2022) - 2021
- [j46]Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi:
Extended formulations of lower-truncated transversal polymatroids. Optim. Methods Softw. 36(2-3): 326-331 (2021)
2010 – 2019
- 2019
- [j45]Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai:
Revisiting the Top-Down Computation of BDD of Spanning Trees of a Graph and Its Tutte Polynomial. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1022-1027 (2019) - [c72]Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai:
FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations. LAGOS 2019: 655-666 - 2018
- [j44]Hidefumi Hiraishi, Hiroshi Imai, Yoichi Iwata, Bingkai Lin:
Parameterized Algorithms to Compute Ising Partition Function. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1398-1403 (2018) - [c71]Shinya Shiroshita, Tomoaki Ogasawara, Hidefumi Hiraishi, Hiroshi Imai:
FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models. WALCOM 2018: 216-227 - 2016
- [j43]Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric multiroute flow and its application to multilink-attack network. Discret. Optim. 22: 20-36 (2016) - [c70]Hiroshi Imai, Masahiko Ohta, Kazuhito Murata:
Structural internal deterioration detection with motion vector field image analysis using monocular camera. 3D Image Processing, Measurement (3DIPM), and Applications 2016: 1-6 - 2015
- [j42]Hiroshi Imai, Vorapong Suppakitpaisarn:
Improving Width-3 Joint Sparse Form to Attain Asymptotically Optimal Complexity on Average Case. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1216-1222 (2015) - [j41]Parinya Chalermsook, Hiroshi Imai, Vorapong Suppakitpaisarn:
Two Lower Bounds for Shortest Double-Base Number System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1310-1312 (2015) - 2014
- [c69]Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. ISCO 2014: 26-37 - [c68]Vorapong Suppakitpaisarn, Hiroshi Imai:
Worst case computation time for minimal joint Hamming weight numeral system. ISITA 2014: 138-142 - [c67]Hidefumi Hiraishi, Hiroshi Imai:
BDD Operations for Quantum Graph States. RC 2014: 216-229 - 2013
- [j40]David Bremner, Antoine Deza, Hiroshi Imai, Sonoko Moriyama:
Editorial. Comput. Geom. 46(5): 493 (2013) - [j39]Norie Fu, Akihiro Hashikura, Hiroshi Imai:
Proximity and Motion Planning on ℓ1-Rigid Planar Periodic Graphs. Trans. Comput. Sci. 20: 72-91 (2013) - 2012
- [j38]Yoshitake Matsumoto, Sonoko Moriyama, Hiroshi Imai, David Bremner:
Matroid Enumeration for Incidence Geometry. Discret. Comput. Geom. 47(1): 17-43 (2012) - [c66]Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Fast Elliptic Curve Cryptography Using Minimal Weight Conversion of d Integers. AISC 2012: 15-26 - [c65]Norie Fu, Akihiro Hashikura, Hiroshi Imai:
Geometrical Treatment of Periodic Graphs with Coordinate System Using Axis-fiber and an Application to a Motion Planning. ISVD 2012: 115-121 - [c64]Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers. WALCOM 2012: 229-240 - [c63]Vorapong Suppakitpaisarn, Hiroshi Imai, Masato Edahiro:
Fastest multi-scalar multiplication based on optimal double-base chains. WorldCIS 2012: 93-98 - 2011
- [j37]Isao Nakajima, Masakazu Tachibana, Noriyoshi Ohashi, Hiroshi Imai, Yasushi Asari, Shigenori Matsuyama:
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. 35(6): 1343-1347 (2011) - [j36]Toshihiro Tanuma, Hiroshi Imai, Sonoko Moriyama:
Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints. Trans. Comput. Sci. 14: 1-30 (2011) - [c62]Norie Fu, Akihiro Hashikura, Hiroshi Imai:
Proximity and Motion Planning on l_1-Embeddable Tilings. ISVD 2011: 150-159 - [i3]Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Fast Elliptic Curve Cryptography Using Optimal Double-Base Chains. IACR Cryptol. ePrint Arch. 2011: 30 (2011) - 2010
- [c61]Toshihiro Tanuma, Hiroshi Imai, Sonoko Moriyama:
Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints. ISVD 2010: 23-32 - [c60]Norie Fu, Hiroshi Imai, Sonoko Moriyama:
Voronoi Diagrams on Periodic Graphs. ISVD 2010: 189-198 - [i2]Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai:
Optimal Average Joint Hamming Weight and Minimal Weight Conversion of d Integers. IACR Cryptol. ePrint Arch. 2010: 300 (2010)
2000 – 2009
- 2008
- [j35]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) - [p1]Kimikazu Kato, Mayumi Oto, Hiroshi Imai, Keiko Imai:
Computational Geometry Analysis of Quantum State Space and Its Applications. Generalized Voronoi Diagram 2008: 67-108 - 2007
- [c59]Kimikazu Kato, Hiroshi Imai, Keiko Imai:
Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity. ISVD 2007: 265-269 - 2006
- [c58]Kimikazu Kato, Mayumi Oto, Keiko Imai, Hiroshi Imai:
On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation. ISVD 2006: 48-53 - 2005
- [j34]Masahito Hayashi, Hiroshi Imai, Keiji Matsumoto, Mary Beth Ruskai, Toshiyuki Shimono:
Qubit channels which require four inputs to achieve capacity: implications for additivity conjectures. Quantum Inf. Comput. 5(1): 13-31 (2005) - [j33]Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
Quantum versus deterministic counter automata. Theor. Comput. Sci. 334(1-3): 275-297 (2005) - 2004
- [j32]Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa:
Finding Neighbor Communities in the Web Using an Inter-Site Graph. IEICE Trans. Inf. Syst. 87-D(9): 2163-2170 (2004) - [j31]Yasubumi Sakakibara, Hiroshi Imai:
A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes. J. Autom. Lang. Comb. 9(1): 111-119 (2004) - 2003
- [j30]Hon Wai Leong, Hiroshi Imai:
Guest Editors' Foreword. Algorithmica 35(3): 193 (2003) - [j29]Takayuki Ishizeki, Hiroshi Imai:
Standard pairs for lawrence-type matrices and their applications to several lawrence-type integer programs. Optim. Methods Softw. 18(4): 417-426 (2003) - [c57]Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa:
Finding Neighbor Communities in the Web Using Inter-site Graph. DEXA 2003: 558-568 - [c56]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 - 2002
- [j28]Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai:
Enumerating Triangulations in General Dimensions. Int. J. Comput. Geom. Appl. 12(6): 455-480 (2002) - [j27]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) - [c55]Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
Quantum versus Deterministic Counter Automata. COCOON 2002: 584-594 - [c54]Yasubumi Sakakibara, Hiroshi Imai:
A DNA-based Computational Model Using a Specific Type of Restriction Enzyme. DNA 2002: 315-325 - [c53]Takumi Okazaki, Kunihiko Sadakane, Hiroshi Imai:
Data Compression Method Combining Properties of PPM and CTW. Progress in Discovery Science 2002: 268-283 - [c52]Jozef Gruska, Hiroshi Imai, Keiji Matsumoto:
Power of Quantum Entanglement. IFIP TCS 2002: 3-22 - [c51]Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa:
Focusing on Sites in the Web. ISDB 2002: 154-159 - [c50]Jumpei Niwa, Keiji Matsumoto, Hiroshi Imai:
General-Purpose Parallel Simulator for Quantum Computing. UMC 2002: 230-251 - [c49]Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
An Analysis of Absorbing Times of Quantum Walks. UMC 2002: 315-330 - [c48]Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa:
Web-Linkage Viewer: Finding Graph Structures in the Web. WAIM 2002: 441-442 - [c47]Yasuhito Asano, Hiroshi Imai, Masashi Toyoda, Masaru Kitsuregawa:
Applying the Site Information to the Information Retrieval from the Web. WISE 2002: 83-92 - 2001
- [c46]Jozef Gruska, Hiroshi Imai:
Power, Puzzles and Properties of Entanglement. MCU 2001: 25-68 - [c45]Hiroshi Imai:
On the Newly Established Graduate School of Information Science and Technology of the University of Tokyo. WISE (2) 2001: 223-227 - [i1]Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
Two-way Quantum One-counter Automata. CoRR cs.CC/0110005 (2001) - 2000
- [c44]Mary Inaba, Hiroshi Imai:
Finding k-Closest-Pairs Efficiently for High Dimensional Data. CCCG 2000 - [c43]Tomohiro Yamasaki, Hirotada Kobayashi, Yuuki Tokunaga, Hiroshi Imai:
One-Way Probabilistic Reversible and Quantum One-Counter Automata. COCOON 2000: 436-446 - [c42]Kunihiko Sadakane, Takumi Okazaki, Hiroshi Imai:
Implementing the Context Tree Weighting Method for Text Compression. Data Compression Conference 2000: 123-132 - [c41]Takayuki Osogami, Hiroshi Imai:
Classification of Various Neighborhood Operations for the Nurse Scheduling Problem. ISAAC 2000: 72-83
1990 – 1999
- 1999
- [j26]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) - [c40]Kunihiko Sadakane, Hiroshi Imai:
Text Retrieval by Using k-word Proximity Search. DANTE 1999: 183-188 - [c39]Kunihiko Sadakane, Hiroshi Imai:
Finding Meaningful Regions Containing Given Keywords from Large Text Collections. Discovery Science 1999: 353-354 - [e3]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. Lecture Notes in Computer Science 1627, Springer 1999, ISBN 3-540-66200-6 [contents] - 1998
- [j25]Kazuyoshi Hayase, Hiroshi Imai:
OBDDs of a Monotone Function and Its Prime Implicants. Theory Comput. Syst. 31(5): 570-591 (1998) - [c38]Mary Inaba, Hiroshi Imai:
Geometric clustering models for multimedia databases. CCCG 1998 - [c37]Kensuke Onishi, Hiroshi Imai:
Riemannian computational geometry: Voronoi diagram delaunay-type triangulation in dually flat space. CCCG 1998 - [c36]Akira Tajima, Hiroshi Imai:
Computational investigations of the optimality of two- and three-dimensional triangulations under several criteria. CCCG 1998 - [c35]Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai:
Voronoi Diagrams by Divergences with Additive Weights. SCG 1998: 403-404 - [c34]Mary Inaba, Hiroshi Imai:
Geometric Clustering Models in Feature Space. Discovery Science 1998: 421-422 - [c33]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 - 1997
- [j24]Tetsuo Shibuya, Hiroshi Imai:
New Flexible Approaches for Multiple Sequence Alignment. J. Comput. Biol. 4(3): 385-413 (1997) - [c32]Fumihiko Takeuchi, Hiroshi Imai:
Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points. COCOON 1997: 470-481 - [c31]Kensuke Onishi, Hiroshi Imai:
Voronoi Diagram in Statistical Parametric Space by Kullback-Leibler Divergence. SCG 1997: 463-465 - [c30]Mary Inaba, Hiroshi Imai, Motoki Nakade, Tatsurou Sekiguchi:
Application of an Effective Geometric Clustering Method to the Color Quantization Problem. SCG 1997: 477-478 - [c29]Tetsuo Shibuya, Hiroshi Imai:
New flexible approaches for multiple sequence alignment. RECOMB 1997: 267-276 - [e2]Hon Wai Leong, Hiroshi Imai, Sanjay Jain:
Algorithms and Computation, 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997, Proceedings. Lecture Notes in Computer Science 1350, Springer 1997, ISBN 3-540-63890-3 [contents] - 1996
- [j23]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. Discret. Appl. Math. 65(1-3): 167-190 (1996) - [c28]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 - [c27]Tetsuo Shibuya, Hiroshi Imai, Shigeki Nishimura, Hiroshi Shimoura, Kenji Tenmoku:
Detour Queries in Geographical Databases for Navigation and Related Algorithm Animations. CODAS 1996: 246- - [c26]Tomonari Masada, Hiroshi Imai, Keiko Imai:
Enumeration of Regular Triangulations. SCG 1996: 224-233 - [c25]Mary Inaba, Hiroshi Imai, Naoki Katoh:
Experimental Results of Randomized Clustering Algorithm. SCG 1996: C-1-C-2 - [c24]Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis:
A Package for Triangulations. SCG 1996: V-17-V-18 - [c23]Kazuyoshi Hayase, Hiroshi Imai:
OBDDs of a Monotone Function and of Its Prime Implicants. ISAAC 1996: 136-145 - 1995
- [j22]Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro:
epsilon-Approximations of k-Label Spaces. Theor. Comput. Sci. 137(1): 145-157 (1995) - [c22]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 - [c21]Kyoko Sekine, Hiroshi Imai, Seiichiro Tani:
Computing the Tutte Polynomial of a Graph of Moderate Size. ISAAC 1995: 224-233 - 1994
- [c20]Mary Inaba, Naoki Katoh, Hiroshi Imai:
Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract). SCG 1994: 332-339 - [c19]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 - 1993
- [j21]Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto:
Orthogonal Weighted Linear L1 and L∞ Approximation and Applications. Discret. Appl. Math. 43(3): 217-232 (1993) - [c18]Susumu Hasegawa, Hiroshi Imai, Masaki Ishiguro:
Epsilon-Approximations of k-label Spaces. ALT 1993: 288-299 - [c17]Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh:
How to Treat Delete Requests in Semi-Online Problems. ISAAC 1993: 48-57 - [c16]Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport:
Probing a Set of Hyperplanes by Lines and Related Problems. WADS 1993: 72-82 - 1992
- [j20]Hiroshi Imai, D. T. Lee, Chung-Do Yang:
1-Segment Center Problems. INFORMS J. Comput. 4(4): 426-434 (1992) - [c15]Ken-ichiro Kakihara, Hiroshi Imai:
Notes on the PAC Learning of Geometric Concepts with Additional Information. ALT 1992: 252-259 - [c14]Koji Hakata, Hiroshi Imai:
The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. ISAAC 1992: 469-478 - 1991
- [j19]Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Finding k Points with Minimum Diameter and Related Problems. J. Algorithms 12(1): 38-56 (1991) - [c13]Nobuhiko Kojiro, Ken'ichi Miura, Hiroshi Imai, Yahiko Kambayashi:
Performance Evaluation of Automatic Name Placement Functions for Geographical Database Systems. DASFAA 1991: 491-497 - [c12]Susumu Hasegawa, Hiroshi Imai, Koji Hakata:
An Analysis of Randomized Shear Sort on the Mesh Computer. ISA 1991: 219-228 - 1990
- [j18]David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
Computing Simple Circuits form a Set of Line Segments. Discret. Comput. Geom. 5: 289-304 (1990) - [j17]Hiroshi Imai:
Computation Geometry Research in Japan. Bull. EATCS 40: 164-167 (1990) - [j16]David Avis, Hiroshi Imai:
Locating a Robot with Angle Mathematics. J. Symb. Comput. 10(3/4): 311-326 (1990) - [c11]Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama:
Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams. SCG 1990: 225-234 - [c10]Hiroshi Imai, Kazuo Iwano:
Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. SIGAL International Symposium on Algorithms 1990: 21-30 - [e1]Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki:
Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings. Lecture Notes in Computer Science 450, Springer 1990, ISBN 3-540-52921-7 [contents]
1980 – 1989
- 1989
- [j15]Hiroshi Imai, Kenji Kato, Peter Yamamoto:
A Linear-Time Algorithm for Linear L_1 Approximation of Points. Algorithmica 4(1): 77-96 (1989) - [j14]Hubert de Fraysseix, Hiroshi Imai:
Notes on Oriented Depth-First Search and Longest Paths. Inf. Process. Lett. 31(1): 53-56 (1989) - [c9]Keiko Imai, S. Sumino, Hiroshi Imai:
Minimax Geometric Fitting of Two Corresponding Sets of Points. SCG 1989: 206-275 - [c8]Alok Aggarwal, Hiroshi Imai, Naoki Katoh, Subhash Suri:
Fining k Points with Minimum Spanning Trees and Related Problems. SCG 1989: 283-291 - [c7]Hiromi Aonuma, Hiroshi Imai, Yahiko Kambayashi:
A Visual System of Placing Characters Appropriately in Multimedia Map Databases. VDB 1989: 525-546 - [c6]Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert:
Weighted Orthogonal Linear L∞-Approximation and Applications. WADS 1989: 183-193 - 1988
- [j13]Hiroshi Imai:
On the convexity of the multiplicative version of Karmarkar's potential function. Math. Program. 40(1-3): 29-32 (1988) - [j12]David Avis, Binay K. Bhattacharya, Hiroshi Imai:
Computing the volume of the union of spheres. Vis. Comput. 3(6): 323-328 (1988) - [c5]Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai:
Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. SCG 1988: 352-361 - 1987
- [j11]Takao Asano, Tetsuo Asano, Hiroshi Imai:
Shortest Path Between Two Simple Polygons. Inf. Process. Lett. 24(5): 285-288 (1987) - [j10]Hiroshi Imai, Takao Asano:
Dynamic Orthogonal Segment Intersection Search. J. Algorithms 8(1): 1-18 (1987) - [c4]Franz Aurenhammer, Hiroshi Imai:
Geometric Relations Among Voronoi Diagrams. STACS 1987: 53-65 - 1986
- [j9]Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai:
Visibility of Disjoint Polygons. Algorithmica 1(1): 49-63 (1986) - [j8]Masao Iri, Hiroshi Imai:
A Multiplicative Barrier Function Method for Linear Programming. Algorithmica 1(4): 455-482 (1986) - [j7]Hiroshi Imai, Masao Iri:
Computational-geometric methods for polygonal approximations of a curve. Comput. Vis. Graph. Image Process. 36(1): 31-41 (1986) - [j6]Takao Asano, Tetsuo Asano, Hiroshi Imai:
Partitioning a polygonal region into trapezoids. J. ACM 33(2): 290-312 (1986) - [j5]Hiroshi Imai, Takao Asano:
Efficient Algorithms for Geometric Graph Search Problems. SIAM J. Comput. 15(2): 478-494 (1986) - [c3]David Rappaport, Hiroshi Imai, Godfried T. Toussaint:
On Computing Simple Circuits on a Set of Line Segments. SCG 1986: 52-60 - 1985
- [j4]Hiroshi Imai:
On combinatorial structures of line drawings of polyhedra. Discret. Appl. Math. 10(1): 79-92 (1985) - [j3]Hiroshi Imai, Masao Iri, Kazuo Murota:
Voronoi Diagram in the Laguerre Geometry and its Applications. SIAM J. Comput. 14(1): 93-105 (1985) - [c2]Takao Asano, Tetsuo Asano, Leonidas J. Guibas, John Hershberger, Hiroshi Imai:
Visibility-Polygon Search and Euclidean Shortest Paths. FOCS 1985: 155-164 - 1984
- [c1]Hiroshi Imai, Takao Asano:
Dynamic Segment Intersection Search with Applications. FOCS 1984: 393-402 - 1983
- [j2]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
- [j1]Hiroshi Imai:
Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. Inf. Process. Lett. 15(3): 125-128 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
