default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKiyoshi Hosono
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Kiyoshi Hosono, Masatsugu Urabe:
Specified holes with pairwise disjoint interiors in planar point sets. AKCE Int. J. Graphs Comb. 17(1): 7-15 (2020)
2010 – 2019
- 2015
- [j14]Kiyoshi Hosono:
On the minimum number of mutually disjoint holes in planar point sets. Comput. Geom. 48(9): 661-672 (2015) - 2011
- [j13]Kiyoshi Hosono:
On an empty triangle with the maximum area in planar point sets. Discret. Math. 311(17): 1886-1891 (2011)
2000 – 2009
- 2009
- [j12]Kiyoshi Hosono:
On convex decompositions of a planar point set. Discret. Math. 309(6): 1714-1717 (2009) - 2008
- [j11]Kiyoshi Hosono:
Cells in any simple polygon formed by a planar point set. Discret. Math. 308(20): 4696-4709 (2008) - 2007
- [c8]Kiyoshi Hosono, Masatsugu Urabe:
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets. KyotoCGGT 2007: 90-100 - 2005
- [j10]Kiyoshi Hosono:
On the existence of a convex point subset containing one triangle in the plane. Discret. Math. 305(1-3): 201-218 (2005) - 2004
- [j9]Tibor Bisztriczky, Kiyoshi Hosono, Gyula Károlyi, Masatsugu Urabe:
Constructions from empty polygons. Period. Math. Hung. 49(2): 1-8 (2004) - [c7]Kiyoshi Hosono, Masatsugu Urabe:
On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons. JCDCG 2004: 117-122 - 2003
- [c6]Kiyoshi Hosono, Ferran Hurtado, Masatsugu Urabe, Jorge Urrutia:
On a Triangle with the Maximum Area in a Planar Point Set. IJCCGGT 2003: 102-107 - 2002
- [j8]Kiyoshi Hosono, Katsumi Matsuda:
On the perfect matching of disjoint compact sets by noncrossing line segments in Rn. Discret. Appl. Math. 118(3): 223-238 (2002) - [c5]Ren Ding, Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu:
Partitioning a Planar Point Set into Empty Convex Polygons. JCDCG 2002: 129-134 - 2001
- [j7]Kiyoshi Hosono, Masatsugu Urabe:
On the number of disjoint convex quadrilaterals for a planar point set. Comput. Geom. 20(3): 97-104 (2001) - [j6]Kiyoshi Hosono, Henk Meijer, David Rappaport:
On the visibility graph of convex translates. Discret. Appl. Math. 113(2-3): 195-210 (2001) - [j5]Kiyoshi Hosono:
On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane. Discret. Appl. Math. 113(2-3): 291-298 (2001) - [j4]David Avis, Kiyoshi Hosono, Masatsugu Urabe:
On the existence of a point subset with a specified number of interior points. Discret. Math. 241(1-3): 33-40 (2001) - [j3]Kiyoshi Hosono, Hiroshi Maehara, Katsumi Matsuda:
A Pair in a Crowd of Unit Balls. Eur. J. Comb. 22(8): 1083-1092 (2001) - 2000
- [c4]Kiyoshi Hosono, David Rappaport, Masatsugu Urabe:
On Convex Decompositions of Points. JCDCG 2000: 149-155
1990 – 1999
- 1998
- [c3]Kiyoshi Hosono, Masatsugu Urabe:
On a disjoint quadrilateral partition for a given point se. CCCG 1998 - [c2]David Avis, Kiyoshi Hosono, Masatsugu Urabe:
On the Existence of a Point Subset with 4 or 5 Interior Points. JCDCG 1998: 57-64 - 1997
- [c1]Kiyoshi Hosono, Katsumi Matsuda:
Geometric matching problem of disjoint compact convex sets by line segments. CCCG 1997 - 1996
- [j2]Kiyoshi Hosono, Masatsugu Urabe, Mamoru Watanabe:
Topics on line segments and polygons. Discret. Math. 151(1-3): 99-104 (1996) - 1993
- [j1]Jin Akiyama, Kiyoshi Hosono, Masatsugu Urabe:
Some combinatorial problems. Discret. Math. 116(1-3): 291-298 (1993)
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 2024-07-03 20:44 CEST 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:
