Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Masatsugu Urabe
2000 – 2009
- 2007
[c8]Kiyoshi Hosono, Masatsugu Urabe: A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets. KyotoCGGT 2007: 90-100- 2004
[j10]Tibor Bisztriczky, Kiyoshi Hosono, Gyula Károlyi, Masatsugu Urabe: Constructions from empty polygons. Periodica Mathematica Hungarica 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
[c5]Ren Ding, Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu: Partitioning a Planar Point Set into Empty Convex Polygons. JCDCG 2002: 129-134- 2001
[j9]Kiyoshi Hosono, Masatsugu Urabe: On the number of disjoint convex quadrilaterals for a planar point set. Comput. Geom. 20(3): 97-104 (2001)
[j8]David Avis, Kiyoshi Hosono, Masatsugu Urabe: On the existence of a point subset with a specified number of interior points. Discrete Mathematics 241(1-3): 33-40 (2001)
[e2]Jin Akiyama, Mikio Kano, Masatsugu Urabe (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers. Lecture Notes in Computer Science 2098, Springer 2001, ISBN 3-540-42306-0- 2000
[c4]Kiyoshi Hosono, David Rappaport, Masatsugu Urabe: On Convex Decompositions of Points. JCDCG 2000: 149-155
[e1]Jin Akiyama, Mikio Kano, Masatsugu Urabe (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers. Lecture Notes in Computer Science 1763, Springer 2000, ISBN 3-540-67181-1
1990 – 1999
- 1999
[j7]Masatsugu Urabe: Partitioning point sets in space into disjoint convex polytopes. Comput. Geom. 13(3): 173-178 (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]- 1996
[j6]Masatsugu Urabe: on a Partition into Convex Polygons. Discrete Applied Mathematics 64(2): 179-191 (1996)
[j5]Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia: On circles containing the maximum number of points. Discrete Mathematics 151(1-3): 15-18 (1996)
[j4]Kiyoshi Hosono, Masatsugu Urabe, Mamoru Watanabe: Topics on line segments and polygons. Discrete Mathematics 151(1-3): 99-104 (1996)- 1993
[j3]Jin Akiyama, Kiyoshi Hosono, Masatsugu Urabe: Some combinatorial problems. Discrete Mathematics 116(1-3): 291-298 (1993)- 1992
[j2]Masatsugu Urabe, Mamoru Watanabe: On a Counterexample to a Conjecture of Mirzaian. Comput. Geom. 2: 51-53 (1992)
1980 – 1989
- 1986
[j1]Yoshimi Egawa, Masatsugu Urabe, Toshihito Fukuda, Seiichiro Nagoya: A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components. Discrete Mathematics 58(1): 93-95 (1986)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-18 23:01 CET by the dblp team



