default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeiko Imai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Masahiro Onda, Masaki Moriguchi, Keiko Imai:
Automatic Drawing of Complex Metro Maps. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(9): 1150-1155 (2021)- [j12]Yuya Higashikawa, Keiko Imai, Takeharu Shiraga, Noriyoshi Sukegawa
, Yusuke Yokosuka:
Minimum point-overlap labelling. Optim. Methods Softw. 36(2-3): 316-325 (2021) - [j11]Hiroshi Imai, Keiko Imai, Hidefumi Hiraishi:
Extended formulations of lower-truncated transversal polymatroids. Optim. Methods Softw. 36(2-3): 326-331 (2021)
2010 – 2019
- 2017
- [j10]Yusuke Yokosuka, Keiko Imai:
Polynomial Time Algorithms for Label Size Maximization on Rotating Maps. J. Inf. Process. 25: 572-579 (2017) - [c17]Yuya Higashikawa, Keiko Imai, Yusuke Matsumoto, Noriyoshi Sukegawa, Yusuke Yokosuka:
Minimum Point-Overlap Labeling. CIAC 2017: 334-344 - 2013
- [j9]Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
On Total Unimodularity of Edge-Edge Adjacency Matrices. Algorithmica 67(2): 277-292 (2013) - [c16]Yusuke Yokosuka, Keiko Imai:
Polynomial Time Algorithms for Label Size Maximization on Rotating Maps. CCCG 2013 - 2011
- [j8]Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem. Inf. Process. Lett. 111(10): 465-468 (2011) - [c15]Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai:
On Totally Unimodularity of Edge-Edge Adjacency Matrices. COCOON 2011: 354-365 - 2010
- [j7]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. Comput. Geom. 43(9): 713-720 (2010) - [c14]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-sectors exist. SCG 2010: 210-215
2000 – 2009
- 2009
- [j6]Yusuke Yokosuka, Keiko Imai:
Guaranteed-quality anisotropic mesh generation for domains with curved boundaries. Comput. Aided Des. 41(5): 385-393 (2009) - [i1]Keiko Imai, Akitoshi Kawamura, Jirí Matousek, Daniel Reem, Takeshi Tokuyama:
Distance k-Sectors Exist. CoRR abs/0912.4164 (2009) - 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
- [j5]Keiko Imai:
Special Section on Discrete Mathematics and Its Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(5): 887 (2007) - [c13]Kimikazu Kato, Hiroshi Imai, Keiko Imai:
Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity. ISVD 2007: 265-269 - [c12]Yusuke Matsumoto, Keiko Imai, Hisashi Suzuki:
Curved Voronoi Diagrams Consisting of Influence Areas with Differentiable Boundaries. ISVD 2007: 270-275 - 2006
- [j4]Shigeki Toriumi, Hisao Endo, Keiko Imai:
Label Size Maximization for Rectangular Node Labels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(4): 1035-1041 (2006) - [c11]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 - 2003
- [j3]Takayuki Kameda, Keiko Imai:
Map Label Placement for Points and Curves. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(4): 835-840 (2003) - 2002
- [j2]Hiroshi Imai, Tomonari Masada, Fumihiko Takeuchi, Keiko Imai:
Enumerating Triangulations in General Dimensions. Int. J. Comput. Geom. Appl. 12(6): 455-480 (2002) - [c10]Ryo Kato, Keiko Imai, Takao Asano:
An Improved Algorithm for the Minimum Manhattan Network Problem. ISAAC 2002: 344-356
1990 – 1999
- 1998
- [c9]Kunihiko Sadakane, Hiroshi Imai, Kensuke Onishi, Mary Inaba, Fumihiko Takeuchi, Keiko Imai:
Voronoi Diagrams by Divergences with Additive Weights. SCG 1998: 403-404 - 1997
- [c8]Yoshiaki Kyoda, Keiko Imai, Fumihiko Takeuchi, Akira Tajima:
A Branch-and-Cut Approach for Minimum Weight Triangulation. ISAAC 1997: 384-393 - 1996
- [c7]Tomonari Masada, Hiroshi Imai, Keiko Imai:
Enumeration of Regular Triangulations. SCG 1996: 224-233 - [c6]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 - 1993
- [j1]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) - [c5]Yasukazu Aoki, Hiroshi Imai, Keiko Imai, David Rappaport:
Probing a Set of Hyperplanes by Lines and Related Problems. WADS 1993: 72-82 - 1990
- [c4]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
1980 – 1989
- 1989
- [c3]Keiko Imai, S. Sumino, Hiroshi Imai:
Minimax Geometric Fitting of Two Corresponding Sets of Points. SCG 1989: 206-275 - [c2]Michael E. Houle, Hiroshi Imai, Keiko Imai, Jean-Marc Robert:
Weighted Orthogonal Linear L∞-Approximation and Applications. WADS 1989: 183-193 - 1988
- [c1]Peter Yamamoto, Kenji Kato, Keiko Imai, Hiroshi Imai:
Algorithms for Vertical and Orthogonal L1 Linear Approximation of Points. SCG 1988: 352-361
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 2025-01-09 13:20 CET 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:
