Keiko Imai

According to our database, Keiko Imai authored at least 30 papers between 1988 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Extended formulations of lower-truncated transversal polymatroids.

Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi

Optim. Methods Softw., 2021

Minimum point-overlap labelling.

Yuya Higashikawa, Keiko Imai, Takeharu Shiraga, Noriyoshi Sukegawa, Yusuke Yokosuka

Optim. Methods Softw., 2021

Automatic Drawing of Complex Metro Maps.

Masahiro Onda, Masaki Moriguchi, Keiko Imai

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2017

Polynomial Time Algorithms for Label Size Maximization on Rotating Maps.

Yusuke Yokosuka, Keiko Imai

J. Inf. Process., 2017

Minimum Point-Overlap Labeling.

Yuya Higashikawa, Keiko Imai, Yusuke Matsumoto, Noriyoshi Sukegawa, Yusuke Yokosuka

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2013

On Total Unimodularity of Edge-Edge Adjacency Matrices.

Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai

Algorithmica, 2013

2011

An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem.

Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai

Inf. Process. Lett., 2011

On Totally Unimodularity of Edge-Edge Adjacency Matrices.

Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Distance k-sectors exist.

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama

Comput. Geom., 2010

Distance <i>k</i>-sectors exist.

Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

Guaranteed-quality anisotropic mesh generation for domains with curved boundaries.

Yusuke Yokosuka, Keiko Imai

Comput. Aided Des., 2009

2008

Computational Geometry Analysis of Quantum State Space and Its Applications.

Kimikazu Kato, Mayumi Oto, Hiroshi Imai, Keiko Imai

Proceedings of the Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence, 2008

2007

Special Section on Discrete Mathematics and Its Applications.

Keiko Imai

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

Curved Voronoi Diagrams Consisting of Influence Areas with Differentiable Boundaries.

Yusuke Matsumoto, Keiko Imai, Hisashi Suzuki

Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity.

Kimikazu Kato, Hiroshi Imai, Keiko Imai

Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

2006

Label Size Maximization for Rectangular Node Labels.

Shigeki Toriumi, Hisao Endo, Keiko Imai

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation.

Kimikazu Kato, Mayumi Oto, Keiko Imai, Hiroshi Imai

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

2003

Map Label Placement for Points and Curves.

Takayuki Kameda, Keiko Imai

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2002

Enumerating Triangulations in General Dimensions.

Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai

Int. J. Comput. Geom. Appl., 2002

An Improved Algorithm for the Minimum Manhattan Network Problem.

Ryo Kato, Keiko Imai, Takao Asano

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

1998

Voronoi Diagrams by Divergences with Additive Weights.

Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

A Branch-and-Cut Approach for Minimum Weight Triangulation.

Yoshiaki Kyoda, Keiko Imai, Fumihiko Takeuchi, Akira Tajima

Proceedings of the Algorithms and Computation, 8th International Symposium, 1997

1996

A Package for Triangulations.

Tsuyoshi Ono, Yoshiaki Kyoda, Tomonari Masada, Kazuyoshi Hayase, Tetsuo Shibuya, Motoki Nakade, Mary Inaba, Hiroshi Imai, Keiko Imai, David Avis

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Enumeration of Regular Triangulations.

Tomonari Masada, Hiroshi Imai, Keiko Imai

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1993

Orthogonal Weighted Linear <i>L</i>₁ and <i>L</i>_∞ Approximation and Applications.

Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert, Peter Yamamoto

Discret. Appl. Math., 1993

Probing a Set of Hyperplanes by Lines and Related Problems.

Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1990

Maximin Location of Convex Objects in a Polygon and Related Dynamic Voronoi Diagrams.

Hiromi Aonuma, Hiroshi Imai, Keiko Imai, Takeshi Tokuyama

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Weighted Orthogonal Linear L^∞-Approximation and Applications.

Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert

Proceedings of the Algorithms and Data Structures, 1989

Minimax Geometric Fitting of Two Corresponding Sets of Points.

Keiko Imai, S. Sumino, Hiroshi Imai

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points.

Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988