Masatsugu Urabe

According to our database1, Masatsugu Urabe authored at least 19 papers between 1986 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

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

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
Partitioning a Planar Point Set into Empty Convex Polygons.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
On the existence of a point subset with a specified number of interior points.
Discret. 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

1999
Partitioning point sets in space into disjoint convex polytopes.
Comput. Geom., 1999

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
On a partition of point sets into convex polygons.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

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

On circles containing the maximum number of points.
Discret. Math., 1996

on a Partition into Convex Polygons.
Discret. Appl. Math., 1996

1993
Some combinatorial problems.
Discret. Math., 1993

1992
On a Counterexample to a Conjecture of Mirzaian.
Comput. Geom., 1992

1986
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components.
Discret. Math., 1986


  Loading...