![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Shin-ichi Nakayama
Person information
Refine list
![note](https://dblp1.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
- 2022
- [j12]Shin-ichi Nakayama, Shigeru Masuyama:
A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Circular-Arc Graphs. IEICE Trans. Inf. Syst. 105-D(8): 1373-1382 (2022)
2010 – 2019
- 2019
- [j11]Shin-ichi Nakayama, Shigeru Masuyama:
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Series-Parallel Graphs. IEICE Trans. Inf. Syst. 102-D(4): 826-835 (2019) - 2018
- [j10]Shin-ichi Nakayama, Shigeru Masuyama:
A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Interval Graphs. IEICE Trans. Inf. Syst. 101-D(9): 2235-2246 (2018) - 2017
- [j9]Shin-ichi Nakayama, Shigeru Masuyama:
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Outerplanar Graphs. IEICE Trans. Inf. Syst. 100-D(3): 434-443 (2017) - 2016
- [j8]Shin-ichi Nakayama, Shigeru Masuyama:
A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Cographs. IEICE Trans. Inf. Syst. 99-D(10): 2574-2584 (2016) - 2013
- [c10]Kazuya Fujikawa, Hideo Joho, Shin-ichi Nakayama:
Tempo of Search Actions to Modeling Successful Sessions. ECIR 2013: 718-721 - [c9]Shizuka Yamazaki, Natsuo Onodera, Shin-ichi Nakayama:
Extraction of the Pharmacological Treatment Features in Literature-based Discovery by Applying Cluster Analysis. MedInfo 2013: 983 - 2012
- [c8]Tetsuya Maeshiro, Shin-ichi Nakayama, Yuri Ozawa:
Knowledge Infrastructure for Knowledge Sharing among Patients, Doctors and Researchers. AAAI Spring Symposium: Self-Tracking and Collective Intelligence for Personal Wellness 2012 - [c7]Kazuya Fujikawa, Hideo Joho, Shin-ichi Nakayama:
Constraint Can Affect Human Perception, Behaviour, and Performance of Search. ICADL 2012: 39-48 - 2011
- [c6]Marika Imazu, Shin-ichi Nakayama, Hideo Joho:
Effect of Explicit Roles on Collaborative Search in Travel Planning Task. AIRS 2011: 205-214 - [c5]Tetsuya Maeshiro, Shin-ichi Nakayama, Midori Maeshiro:
Representation of Decision Making Process in Music Composition Based on Hypernetwork Model. HCI (11) 2011: 109-117 - [c4]Saori Suzuki, Shin-ichi Nakayama, Hideo Joho:
Formulating effective questions for community-based question answering. SIGIR 2011: 1261-1262
2000 – 2009
- 2009
- [c3]Tetsuya Maeshiro, Midori Maeshiro, Katsunori Shimohara, Shin-ichi Nakayama:
Hypernetwork Model to Represent Similarity Details Applied to Musical Instrument Performance. HCI (1) 2009: 866-873 - 2007
- [j7]Shin-ichi Nakayama, Shigeru Masuyama:
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs. Inf. Process. Lett. 103(6): 216-221 (2007) - 2006
- [j6]Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao
:
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem. Discret. Appl. Math. 154(16): 2402-2410 (2006) - [j5]Shin-ichi Nakayama, Shigeru Masuyama:
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs. IEICE Trans. Inf. Syst. 89-D(8): 2357-2363 (2006) - 2003
- [j4]Shin-ichi Nakayama, Shigeru Masuyama:
An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1019-1026 (2003)
1990 – 1999
- 1997
- [j3]Shin-ichi Nakayama, Shigeru Masuyama:
A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs. Inf. Process. Lett. 62(6): 323-327 (1997) - 1994
- [c2]Andrew J. Graham, Richard Goldman, Wen-Tsuen Chen, Kerry Hanson, Nikolay G. Malishev, Shin-ichi Nakayama:
Technology Summit - A View from the Top (Panel). DAC 1994: 407 - 1990
- [j2]Shin-ichi Nakayama, Katsuko Sugai, Yuriko Hotate, Masayuki Yoshida:
Simple and fast search system for closely related proteins. J. Chem. Inf. Comput. Sci. 30(3): 269-271 (1990)
1980 – 1989
- 1989
- [c1]Hideo Mori, Masayuki Nakai, Hsiao-Jing Chen, Tohru Yuguchi, Shin-ichi Nakayama:
Steering Panning Coordination In Stereotyped Motion. IROS 1989: 155-162 - 1988
- [j1]Shin-ichi Nakayama, Satoko Shigezumi, Masayuki Yoshida:
Method for clustering proteins by use of all possible pairs of amino acids as structural descriptors. J. Chem. Inf. Comput. Sci. 28(2): 72-78 (1988)
Coauthor Index
![](https://dblp1.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-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint