default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyota Matsubara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Michitaka Furuya
, Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda, Shoichi Tsuchiya, Takamasa Yashima:
Degree sum condition for the existence of spanning k-trees in star-free graphs. Discuss. Math. Graph Theory 42(1): 5-13 (2022)- 2021
- [j13]Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda:
A Fan-type condition for graphs to be k-leaf-connected. Discret. Math. 344(4): 112260 (2021) - [j12]Kei Suzuki, Tipporn Laohakangvalvit, Ryota Matsubara, Midori Sugaya:
Constructing an Emotion Estimation Model Based on EEG/HRV Indexes Using Feature Extraction and Feature Selection Algorithms. Sensors 21(9): 2910 (2021) - [c3]Kei Suzuki, Ryota Matsubara, Tipporn Laohakangvalvit, Midori Sugaya:
Feature Comparison of Emotion Estimation by EEG and Heart Rate Variability Indices and Accuracy Evaluation by Machine Learning. AHFE (1) 2021: 222-230 - [c2]Yuto Saito, Muhammad Nur Adilin Mohd Anuardi, Ryota Matsubara, Midori Sugaya:
Preliminary Analysis of Human Error Prediction Model by Using Biological Information. HCI (6) 2021: 324-335 - 2020
- [c1]Ryota Matsubara, Andrew Bivard, Mark Parsons, Naotaka Sakashita:
Automatic whole brain vascular territory mapping. EMBC 2020: 1080-1083
2010 – 2019
- 2019
- [j11]Ryota Matsubara, Haruhide Matsuda, Nana Matsuo, Kenta Noguchi, Kenta Ozeki:
[a, b]-factors of graphs on surfaces. Discret. Math. 342(7): 1979-1988 (2019) - [j10]Shun-ichi Maezawa, Ryota Matsubara, Haruhide Matsuda:
Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves. Graphs Comb. 35(1): 231-238 (2019) - [j9]Ken'ichi Morooka, Ryota Matsubara, Shoko Miyauchi, Takaichi Fukuda, Takeshi Sugii, Ryo Kurazume:
Ancient pelvis reconstruction from collapsed component bones using statistical shape models. Mach. Vis. Appl. 30(1): 59-69 (2019) - 2018
- [j8]Ryota Matsubara, Haruhide Matsuda, Hajime Matsumura:
A spanning k-spider in a graph. Ars Comb. 136: 247-253 (2018) - 2017
- [j7]Ryota Matsubara, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions for path-factors with specified end vertices in bipartite graphs. Discret. Math. 340(2): 87-95 (2017) - 2014
- [j6]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
Closure and Spanning k-Trees. Graphs Comb. 30(4): 957-962 (2014) - 2010
- [j5]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
A neighborhood and degree condition for panconnectivity. Australas. J Comb. 47: 3-10 (2010) - [j4]Shuya Chiba, Ryota Matsubara, Masao Tsugaki:
Relationships between the length of a longest path and the relative length. Australas. J Comb. 47: 91-108 (2010) - [j3]Shuya Chiba, Ryota Matsubara, Kenta Ozeki, Masao Tsugaki:
A k-Tree Containing Specified Vertices. Graphs Comb. 26(2): 187-205 (2010)
2000 – 2009
- 2008
- [j2]Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita:
A neighborhood and degree condition for pancyclicity and vertex pancyclicity. Australas. J Comb. 40: 15-26 (2008) - [j1]Ryota Matsubara, Hajime Matsumura:
Partitions of a graph into cycles containing a specified linear forest. Discuss. Math. Graph Theory 28(1): 97-107 (2008)
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-04-24 23:10 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:
