default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoko Nakajima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Yoko Nakajima, Michal Ptaszynski, Fumito Masui, Hirotoshi Honma:
Future prediction with automatically extracted morphosemantic patterns. Cogn. Syst. Res. 59: 37-62 (2020)- [j9]Hirotoshi Honma, Yoko Nakajima, Shigeru Masuyama:
An Algorithm for the Influential Hinge Vertex Problem on Interval Graphs. J. Inf. Process. 28: 1047-1051 (2020)
2010 – 2019
- 2017
- [j8]Michal Ptaszynski, Fumito Masui, Yoko Nakajima, Yasutomo Kimura, Rafal Rzepka
, Kenji Araki:
A Method for Detecting Harmful Entries on Informal School Websites Using Morphosemantic Patterns. J. Adv. Comput. Intell. Intell. Informatics 21(7): 1189-1201 (2017) - [j7]Hirotoshi Honma, Yoko Nakajima, Shigeru Masuyama:
An Algorithm for Hinge Vertex Problem on Circular Trapezoid Graphs. J. Inf. Process. 25: 945-948 (2017) - 2016
- [j6]Yoko Nakajima, Michal Ptaszynski, Hirotoshi Honma, Fumito Masui:
Automatic extraction of future references from news using morphosemantic patterns with application to future trend prediction. AI Matters 2(4): 13-15 (2016) - [j5]Yoko Nakajima, Michal Ptaszynski, Hirotoshi Honma, Fumito Masui:
A Method for Extraction of Future Reference Sentences Based on Semantic Role Labeling. IEICE Trans. Inf. Syst. 99-D(2): 514-524 (2016) - 2015
- [j4]Hirotoshi Honma, Yoko Nakajima, Yuta Igarashi, Shigeru Masuyama:
Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1161-1167 (2015) - [c3]Yoko Nakajima:
Automatic Extraction of References to Future Events from News Articles Using Semantic and Morphological Information. IJCAI 2015: 4385-4386 - 2014
- [j3]Hirotoshi Honma, Yoko Nakajima, Yuta Igarashi, Shigeru Masuyama:
Algorithm for Finding Maximum Detour Hinge Vertices of Interval Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1365-1369 (2014) - [c2]Yuuto Fukushima, Fumito Masui, Michal Ptaszynski, Yoko Nakajima, Keisuke Watanabe, Ryotaro Kawaishi, Taisei Nitta, Ryoya Sato:
Macroanalysis of Microblogs: An Empirical Study of Communication Strategies on Twitter During Disasters and Elections. AAAI Spring Symposia 2014 - [c1]Yoko Nakajima, Michal Ptaszynski, Hirotoshi Honma, Fumito Masui:
Investigation of Future Reference Expressions in Trend Information. AAAI Spring Symposia 2014 - 2013
- [j2]Hirotoshi Honma, Kodai Abe, Yoko Nakajima, Shigeru Masuyama:
Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs. IEICE Trans. Inf. Syst. 96-D(3): 419-425 (2013) - [j1]Hirotoshi Honma, Yoko Nakajima, Haruka Aoshima, Shigeru Masuyama:
A Linear-Time Algorithm for Constructing a Spanning Tree on Circular Trapezoid Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1051-1058 (2013)
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 2025-01-09 12:48 CET 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:
