 | 2011 |
|---|
| 9 |       | Takayuki Nagoya,
Hiroyuki Fujioka:
A Graph Theoretic Algorithm for Recovering Drawing Order of Multi-stroke Handwritten Images.
INCoS 2011: 569-574 |
| 2009 |
|---|
| 8 | | Takayuki Nagoya:
New differential approximation algorithm for k-customer vehicle routing problem.
Inf. Process. Lett. 109(8): 405-408 (2009) |
| 7 | | 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) |
| 6 | | Takayuki Nagoya:
Computing Graph Automorphism from Partial Solutions.
Theory Comput. Syst. 44(3): 356-368 (2009) |
| 2007 |
|---|
| 5 | | Takayuki Nagoya,
Seinosuke Toda:
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism.
MFCS 2007: 584-595 |
| 4 | | Zhi-Zhong Chen,
Takayuki Nagoya:
Improved approximation algorithms for metric MaxTSP.
J. Comb. Optim. 13(4): 321-336 (2007) |
| 2005 |
|---|
| 3 | | Zhi-Zhong Chen,
Takayuki Nagoya:
Improved Approximation Algorithms for Metric Max TSP.
ESA 2005: 179-190 |
| 2 | | Ryuhei Uehara,
Seinosuke Toda,
Takayuki Nagoya:
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.
Discrete Applied Mathematics 145(3): 479-482 (2005) |
| 2001 |
|---|
| 1 | | Takayuki Nagoya:
Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number.
ISAAC 2001: 136-147 |
Data released under the ODC-BY 1.0 license — See also our legal information page