![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Masatsugu Urabe
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j11]Kiyoshi Hosono, Masatsugu Urabe:
Specified holes with pairwise disjoint interiors in planar point sets. AKCE Int. J. Graphs Comb. 17(1): 7-15 (2020)
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. 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
- [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. Discret. Math. 241(1-3): 33-40 (2001) - [e2]Jin Akiyama, Mikio Kano, Masatsugu Urabe:
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 [contents] - 2000
- [c4]Kiyoshi Hosono, David Rappaport, Masatsugu Urabe:
On Convex Decompositions of Points. JCDCG 2000: 149-155 - [e1]Jin Akiyama, Mikio Kano, Masatsugu Urabe:
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 [contents]
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]Masatsugu Urabe:
On a partition of point sets into convex polygons. CCCG 1997 - 1996
- [j6]Masatsugu Urabe:
on a Partition into Convex Polygons. Discret. Appl. Math. 64(2): 179-191 (1996) - [j5]Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia:
On circles containing the maximum number of points. Discret. Math. 151(1-3): 15-18 (1996) - [j4]Kiyoshi Hosono, Masatsugu Urabe, Mamoru Watanabe:
Topics on line segments and polygons. Discret. Math. 151(1-3): 99-104 (1996) - 1993
- [j3]Jin Akiyama, Kiyoshi Hosono, Masatsugu Urabe:
Some combinatorial problems. Discret. Math. 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. Discret. Math. 58(1): 93-95 (1986)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 21:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint