Kiyoshi Hosono

According to our database1, Kiyoshi Hosono authored at least 23 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Specified holes with pairwise disjoint interiors in planar point sets.
AKCE Int. J. Graphs Comb., 2020

2015
On the minimum number of mutually disjoint holes in planar point sets.
Comput. Geom., 2015

2011
On an empty triangle with the maximum area in planar point sets.
Discret. Math., 2011

2009
On convex decompositions of a planar point set.
Discret. Math., 2009

2008
Cells in any simple polygon formed by a planar point set.
Discret. Math., 2008

2007
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets.
Proceedings of the Computational Geometry and Graph Theory, 2007

2005
On the existence of a convex point subset containing one triangle in the plane.
Discret. Math., 2005

2004
Constructions from empty polygons.
Period. Math. Hung., 2004

On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

2003
On a Triangle with the Maximum Area in a Planar Point Set.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002
On the perfect matching of disjoint compact sets by noncrossing line segments in R<sup>n</sup>.
Discret. Appl. Math., 2002

Partitioning a Planar Point Set into Empty Convex Polygons.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
A Pair in a Crowd of Unit Balls.
Eur. J. Comb., 2001

On the existence of a point subset with a specified number of interior points.
Discret. Math., 2001

On the visibility graph of convex translates.
Discret. Appl. Math., 2001

On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane.
Discret. Appl. Math., 2001

On the number of disjoint convex quadrilaterals for a planar point set.
Comput. Geom., 2001

2000
On Convex Decompositions of Points.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998
On the Existence of a Point Subset with 4 or 5 Interior Points.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

On a disjoint quadrilateral partition for a given point se.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Geometric matching problem of disjoint compact convex sets by line segments.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
Topics on line segments and polygons.
Discret. Math., 1996

1993
Some combinatorial problems.
Discret. Math., 1993


  Loading...