| |
| * | 2009 | |
|---|---|---|
| 7 | EE | Takayuki Nagoya: New differential approximation algorithm for k-customer vehicle routing problem. Inf. Process. Lett. 109(8): 405-408 (2009) |
| 6 | EE | 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 | ||
| 5 | EE | Takayuki Nagoya, Seinosuke Toda: Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. MFCS 2007: 584-595 |
| 4 | EE | Zhi-Zhong Chen, Takayuki Nagoya: Improved approximation algorithms for metric MaxTSP. J. Comb. Optim. 13(4): 321-336 (2007) |
| 2005 | ||
| 3 | EE | Zhi-Zhong Chen, Takayuki Nagoya: Improved Approximation Algorithms for Metric Max TSP. ESA 2005: 179-190 |
| 2 | EE | 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 | EE | Takayuki Nagoya: Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number. ISAAC 2001: 136-147 |
| 1 | Zhi-Zhong Chen | [3] [4] |
| 2 | Seinosuke Toda | [2] [5] [6] |
| 3 | Ryuhei Uehara | [2] |