default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMamoru Watanabe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j14]Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe, Tomoki Yamashita:
A note on two geometric paths with few crossings for points labeled by integers in the plane. Discret. Math. 341(4): 1109-1113 (2018)- 2017
- [j13]Atsushi Kaneko, Mikio Kano, Mamoru Watanabe:
Balancing Colored Points on a Line by Exchanging Intervals. J. Inf. Process. 25: 551-553 (2017) - 2011
- [c4]Yoshifumi Kuriyama, Ken'ichi Yano, Mamoru Watanabe:
Layout algorithm of searching point for a CFD optimization problem. CDC/ECC 2011: 6596-6601
2000 – 2009
- 2009
- [c3]Yoshifumi Kuriyama, Shuichiro Hayashi, Ken'ichi Yano, Mamoru Watanabe:
Solution search algorithm for a CFD optimization problem with multimodal solution space. CDC 2009: 5556-5561 - 2007
- [c2]Yoshiaki Oda, Mamoru Watanabe:
The Number of Flips Required to Obtain Non-crossing Convex Cycles. KyotoCGGT 2007: 155-165 - 2005
- [j12]Atsuhiro Nakamoto, Katsuhiro Ota, Mamoru Watanabe:
On 3-coloring of plane triangulations. Ars Comb. 75 (2005) - [j11]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto
, Yoshiaki Oda, Mamoru Watanabe:
Acute triangles in 4-connected maximal plane graphs. Discret. Math. 292(1-3): 95-106 (2005) - 2004
- [j10]Tomoki Nakamigawa, Mamoru Watanabe:
Separating pairs of points in the plane by monotone subsequences. Australas. J Comb. 30: 223-228 (2004) - 2002
- [j9]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota, Shinsei Tazawa, Mamoru Watanabe:
On separable self-complementary graphs. Discret. Math. 257(1): 165-168 (2002) - [j8]Atsuhiro Nakamoto, Katsuhiro Ota, Mamoru Watanabe:
On 3-coloring of plane triangulations. Electron. Notes Discret. Math. 11: 519-524 (2002) - 2000
- [j7]Penny A. Jennett, Margaret M. Watson, Mamoru Watanabe:
The Potential Effects of Telehealth on the Canadian Health Workforce: Where Is the Evidence? Cyberpsychology Behav. Soc. Netw. 3(6): 917-923 (2000) - [c1]Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe:
Geometric Transformations in Plane Triangulations. JCDCG 2000: 217-221
1990 – 1999
- 1999
- [j6]Atsushi Kaneko, Hiroshi Maehara, Mamoru Watanabe:
On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph. J. Comb. Theory B 75(1): 110-115 (1999) - 1998
- [j5]Atsushi Kaneko, Mamoru Watanabe:
String Decompositions of Graphs. Ars Comb. 49 (1998) - 1996
- [j4]Kiyoshi Hosono, Masatsugu Urabe, Mamoru Watanabe:
Topics on line segments and polygons. Discret. Math. 151(1-3): 99-104 (1996) - 1992
- [j3]Masatsugu Urabe, Mamoru Watanabe:
On a Counterexample to a Conjecture of Mirzaian. Comput. Geom. 2: 51-53 (1992)
1980 – 1989
- 1989
- [j2]Jin Akiyama, Hiroshi Era, Severino Villanueva Gervacio, Mamoru Watanabe:
Path chromatic numbers of graphs. J. Graph Theory 13(5): 571-573 (1989) - 1987
- [j1]Jin Akiyama, Mamoru Watanabe:
Maximum induced forests of planar graphs. Graphs Comb. 3(1): 201-202 (1987)
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-06-10 21:20 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:
