default search action
Shunsuke Nakamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Yoshimi Egawa, Shunsuke Nakamura
:
Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph. Discret. Appl. Math. 355: 142-158 (2024) - [j10]Li Tao
A large-scale television advertising dataset for detailed impression analysis. Multim. Tools Appl. 83(7): 18779-18802 (2024) - 2023
- [j9]Yoshimi Egawa, Shunsuke Nakamura
Contractible Edges and Longest Cycles in 3-Connected Graphs. Graphs Comb. 39(1): 14 (2023) - 2021
- [j8]Shunsuke Nakamura
Distribution of contractible edges and the structure of noncontracible edges having endvertices with large degree in a 4-connected graph. Discuss. Math. Graph Theory 41(4): 1051-1066 (2021) - [c9]Taichi Kobayashi, Shin-Ichiro Nishida, Shunsuke Nakamura, Shintaro Nakatani
Study of Image Processing Methods for Space Debris Capture. SII 2021: 304-309 - 2020
- [j7]Ryohei Miyadera, Shunsuke Nakamura, Yushi Nakaya:
Grundy Numbers of Impartial Chocolate Bar Games. Integers 20: G1 (2020) - [c8]Shunsuke Nakamura, Kento Kohase, Akio Fujiyoshi:
A Series of Simple Processing Tools for PDF Files for People with Print Disabilities. ICCHP (1) 2020: 314-320 - [c7]Kento Kohase, Shunsuke Nakamura, Akio Fujiyoshi:
Layout Analysis of PDF Documents by Two-Dimensional Grammars for the Production of Accessible Textbooks. ICCHP (1) 2020: 321-328
2010 – 2019
- 2018
- [j6]Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura
Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges. AKCE Int. J. Graphs Comb. 15(2): 202-210 (2018) - [j5]Shunsuke Nakamura, Yoshimi Egawa, Keiko Kotani:
Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph. Electron. Notes Discret. Math. 68: 23-28 (2018) - [j4]Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura
Lower Bound on the Number of Contractible Edges in a 4-Connected Graph with Edges Not Contained in Triangles. Graphs Comb. 34(5): 965-987 (2018) - [c6]Shunsuke Nakamura, Toshihiko Yamasaki, Kiyoharu Aizawa, Yusuke Ishikawa:
Prediction of the time to pregnancy by kernel density estimation on lifestyle questionnaire. ICCE 2018: 1-6 - 2017
- [j3]Shunsuke Nakamura:
The number of contractible edges in a 4-connected graph having a contractible edge not contained in triangles. Australas. J Comb. 68: 48-61 (2017) - 2015
- [j2]Shunsuke Nakamura, Ryohei Miyadera:
Impartial Chocolate Bar Games. Integers 15: G4 (2015) - 2014
- [c5]Shunsuke Nakamura, Qingkai Huo, Tetsuya Yuasa:
Reconstruction technique of fluorescent x-ray computed tomography using sheet beam. EUSIPCO 2014: 1975-1979 - 2012
- [c4]Shunsuke Nakamura, Yukio Kodono:
Fuzzy reasoning demand forecasting model by using meteorological factors - Case of apparel shop. SCIS&ISIS 2012: 1974-1977 - [c3]Masayuki Tanaka
Live image composing. SIGGRAPH ASIA Posters 2012: 14 - [c2]Shunsuke Nakamura, Kazuyuki Shudo:
MyCassandra: a cloud storage supporting both read heavy and write heavy workloads. SYSTOR 2012: 5
2000 – 2009
- 2008
- [j1]Hiroshi Watanabe, Shunsuke Nakamura, Takao Waho:
A Design of HEMT Comparators for Ultrahigh-Speed A/D Conversion. IEICE Trans. Electron. 91-C(5): 688-692 (2008) - 2007
- [c1]Shunsuke Nakamura, Uichiro Omae, Hiroshi Watanabe, Takao Waho:
A design of multi-GHz continuous-time bandpass filters using 0.1-μm HEMT technology. ECCTD 2007: 484-487
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-10-07 22:07 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: