default search action
Takayuki Nagoya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c8]Takayuki Nagoya:
Variants of Graph Matching for Tree-like Graphs. SmartCity 2015: 814-821 - 2013
- [c7]Takayuki Nagai, Toshiyuki Toyota, Takayuki Nagoya, Koki Nishizawa, Masakazu Imai:
Implementation of high-definition lecture recording system for daily use. EDUCON 2013: 520-525 - [c6]Takayuki Nagoya, Hiroyuki Fujioka:
Recovering Human-Like Drawing Order from Static Handwritten Images with Double-Traced Lines. ITCS 2013: 941-948 - 2012
- [j6]Takayuki Nagoya, Hiroyuki Fujioka:
Recovering Drawing Order of Single-Stroke Handwritten Images Using Probabilistic Tabu Search. J. Mobile Multimedia 8(2): 73-87 (2012) - [c5]Takayuki Nagoya, Hiroyuki Fujioka:
Recovering Dynamic Stroke Information of Multi-stroke Handwritten Characters with Complex Patterns. ICFHR 2012: 722-727 - 2011
- [c4]Takayuki Nagoya, Hiroyuki Fujioka:
A Graph Theoretic Algorithm for Recovering Drawing Order of Multi-stroke Handwritten Images. INCoS 2011: 569-574
2000 – 2009
- 2009
- [j5]Takayuki Nagoya:
New differential approximation algorithm for k-customer vehicle routing problem. Inf. Process. Lett. 109(8): 405-408 (2009) - [j4]Takayuki Nagoya:
Computing Graph Automorphism from Partial Solutions. Theory Comput. Syst. 44(3): 356-368 (2009) - [j3]Takayuki Nagoya, Seinosuke Toda:
Computational complexity of computing a partial solution for the Graph Automorphism problems. Theor. Comput. Sci. 410(21-23): 2064-2071 (2009) - 2007
- [j2]Zhi-Zhong Chen, Takayuki Nagoya:
Improved approximation algorithms for metric MaxTSP. J. Comb. Optim. 13(4): 321-336 (2007) - [c3]Takayuki Nagoya, Seinosuke Toda:
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. MFCS 2007: 584-595 - 2005
- [j1]Ryuhei Uehara
, Seinosuke Toda, Takayuki Nagoya:
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discret. Appl. Math. 145(3): 479-482 (2005) - [c2]Zhi-Zhong Chen, Takayuki Nagoya:
Improved Approximation Algorithms for Metric Max TSP. ESA 2005: 179-190 - 2001
- [c1]Takayuki Nagoya:
Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number. ISAAC 2001: 136-147
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 22:55 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: