Keiko Imai - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

An approximation algorithm dependent on edge-coloring number for minimum maximal matching problemYusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai. ipl, 111(10):465-468, 2011. [doi]

On Totally Unimodularity of Edge-Edge Adjacency MatricesYusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai. cocoon 2011: 354-365 [doi]

2010

Distance ::::k::::-sectors existKeiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama. compgeom 2010: 210-215 [doi]

Distance k-sectors existKeiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama. comgeo, 43(9):713-720, 2010. [doi]

2009

Guaranteed-quality anisotropic mesh generation for domains with curved boundariesYusuke Yokosuka, Keiko Imai. cad, 41(5):385-393, 2009. [doi]

2008

Computational Geometry Analysis of Quantum State Space and Its ApplicationsKimikazu Kato, Mayumi Oto, Hiroshi Imai, Keiko Imai. In Marina L. Gavrilova, editor, Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence. Volume 158 of Studies in Computational Intelligence, pages 67-108, Springer, 2008. [doi]

2007

Special Section on Discrete Mathematics and Its ApplicationsKeiko Imai. ieicet, 90-A(5):887, 2007. [doi]

Error Analysis of a Numerical Calculation about One-qubit Quantum Channel CapacityKimikazu Kato, Hiroshi Imai, Keiko Imai. isvd 2007: 265-269 [doi]

Curved Voronoi Diagrams Consisting of Influence Areas with Differentiable BoundariesYusuke Matsumoto, Keiko Imai, Hisashi Suzuki. isvd 2007: 270-275 [doi]

2006

On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical ComputationKimikazu Kato, Mayumi Oto, Keiko Imai, Hiroshi Imai. isvd 2006: 48-53 [doi]

Label Size Maximization for Rectangular Node LabelsShigeki Toriumi, Hisao Endo, Keiko Imai. ieicet, 89-A(4):1035-1041, 2006. [doi]

2002

Enumerating Triangulations in General DimensionsHiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai. ijcga, 12(6):455-480, 2002. [doi]

An Improved Algorithm for the Minimum Manhattan Network ProblemRyo Kato, Keiko Imai, Takao Asano. isaac 2002: 344-356 [doi]

1998

Voronoi Diagrams by Divergences with Additive WeightsKunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai. compgeom 1998: 403-404 [doi]

1997

A Branch-and-Cut Approach for Minimum Weight TriangulationYoshiaki Kyoda, Keiko Imai, Fumihiko Takeuchi, Akira Tajima. isaac 1997: 384-393

1996

Enumeration of Regular TriangulationsTomonari Masada, Hiroshi Imai, Keiko Imai. compgeom 1996: 224-233 [doi]

A Package for TriangulationsTsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis. compgeom 1996: [doi]

1993

Probing a Set of Hyperplanes by Lines and Related ProblemsYasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport. wads 1993: 72-82

Orthogonal Weighted Linear ::::L::::::1:: and ::::L::::::infty:: Approximation and ApplicationsMichael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto. DAM, 43(3):217-232, 1993. [doi]

1990

Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi DiagramsHiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama. compgeom 1990: 225-234 [doi]

1989

Weighted Orthogonal Linear L:::/infty:::-Approximation and ApplicationsMichael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert. wads 1989: 183-193

Minimax Geometric Fitting of Two Corresponding Sets of PointsKeiko Imai, S. Sumino, Hiroshi Imai. compgeom 1989: 206-275 [doi]

1988

Algorithms for Vertical and Orthogonal L1 Linear Approximation of PointsPeter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai. compgeom 1988: 352-361 [doi]