Остановите войну!
for scientists:
default search action
Hisao Tamaki
- > Home > Persons > Hisao Tamaki
Publications
- 2007
- [c36]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Voronoi Diagram with Respect to Criteria on Vision Information. ISVD 2007: 25-32 - 2006
- [c35]Tetsuo Asano, Hisao Tamaki, Naoki Katoh, Takeshi Tokuyama:
Angular Voronoi Diagram with Applications. ISVD 2006: 18-24 - 2004
- [j18]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
The structure and number of global roundings of a graph. Theor. Comput. Sci. 325(3): 425-437 (2004) - [c32]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
On Geometric Structure of Global Roundings for Graphs and Range Spaces. SWAT 2004: 455-467 - 2003
- [c31]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
The Structure and Number of Global Roundings of a Graph. COCOON 2003: 130-138 - 2002
- [j16]Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications. Int. J. Comput. Geom. Appl. 12(5): 429-444 (2002) - 2000
- [j13]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. J. Algorithms 34(2): 203-221 (2000) - 1999
- [c28]Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications. SODA 1999: 517-526 - 1998
- [j11]Hisao Tamaki, Takeshi Tokuyama:
How to Cut Pseudoparabolas into Segments. Discret. Comput. Geom. 19(2): 265-290 (1998) - [j10]Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama:
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. Discret. Comput. Geom. 20(3): 307-331 (1998) - [c26]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Convertibility among Grid Filling Curves. ISAAC 1998: 307-316 - [c24]Hisao Tamaki, Takeshi Tokuyama:
Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. SODA 1998: 446-452 - 1997
- [c23]Tatsuya Akutsu, Hisao Tamaki, Takeshi Tokuyama:
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets. SCG 1997: 314-323 - [c21]Hisao Tamaki, Takeshi Tokuyama:
A Characterization of Planar Graphs by Pseudo-Line Arrangements. ISAAC 1997: 133-142 - [c20]Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k. STOC 1997: 275-283 - 1996
- [c17]Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama:
Greedily Finding a Dense Subgraph. SWAT 1996: 136-148 - 1995
- [c16]Hisao Tamaki, Takeshi Tokuyama:
How to Cut Pseudo-Parabolas into Segments. SCG 1995: 230-237
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-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint