The SCEAS System
| |||||||

## Search the dblp DataBase
Keiko Imai:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama
**Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1990, pp:225-234 [Conf] - Keiko Imai, S. Sumino, Hiroshi Imai
**Minimax Geometric Fitting of Two Corresponding Sets of Points.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:206-275 [Conf] - Tomonari Masada, Hiroshi Imai, Keiko Imai
**Enumeration of Regular Triangulations.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1996, pp:224-233 [Conf] - Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis
**A Package for Triangulations.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1996, pp:0-17 [Conf] - Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai
**Voronoi Diagrams by Divergences with Additive Weights.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1998, pp:403-404 [Conf] - Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai
**Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1988, pp:352-361 [Conf] - Ryo Kato, Keiko Imai, Takao Asano
**An Improved Algorithm for the Minimum Manhattan Network Problem.**[Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:344-356 [Conf] - Yoshiaki Kyoda, Keiko Imai, Fumihiko Takeuchi, Akira Tajima
**A Branch-and-Cut Approach for Minimum Weight Triangulation.**[Citation Graph (0, 0)][DBLP] ISAAC, 1997, pp:384-393 [Conf] - Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport
**Probing a Set of Hyperplanes by Lines and Related Problems.**[Citation Graph (0, 0)][DBLP] WADS, 1993, pp:72-82 [Conf] - Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert
**Weighted Orthogonal Linear L**[Citation Graph (0, 0)][DBLP]^{\infty}-Approximation and Applications. WADS, 1989, pp:183-193 [Conf] - Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto
**Orthogonal Weighted Linear**[Citation Graph (0, 0)][DBLP]*L*_{1}and*L*_{infty}Approximation and Applications. Discrete Applied Mathematics, 1993, v:43, n:3, pp:217-232 [Journal] - Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai
**Enumerating Triangulations in General Dimensions.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2002, v:12, n:6, pp:455-480 [Journal] - Kimikazu Kato, Hiroshi Imai, Keiko Imai
**Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity.**[Citation Graph (0, 0)][DBLP] ISVD, 2007, pp:265-269 [Conf] - Yusuke Matsumoto, Keiko Imai, Hisashi Suzuki
**Curved Voronoi Diagrams Consisting of Influence Areas with Differentiable Boundaries.**[Citation Graph (0, 0)][DBLP] ISVD, 2007, pp:270-275 [Conf] **Distance**[Citation Graph (, )][DBLP]*k*-sectors exist.**On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation.**[Citation Graph (, )][DBLP]**Guaranteed-quality anisotropic mesh generation for domains with curved boundaries.**[Citation Graph (, )][DBLP]**Distance k-sectors exist.**[Citation Graph (, )][DBLP]**Distance k-Sectors Exist**[Citation Graph (, )][DBLP]
Search in 0.167secs, Finished in 0.168secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |