Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Nagoya, Takayuki"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computational complexity of computing a partial solution for the Graph Automorphism problems
Takayuki Nagoya
,
Seinosuke Toda
Theoretical Computer Science
410
(21-23), 2009, pp. 2064-2071
New differential approximation algorithm for
k
-customer vehicle routing problem
Takayuki Nagoya
Information Processing Letters
109
(8), 2009, pp. 405-408
Computing graph automorphism from partial solutions
Takayuki Nagoya
Theory of Computing Systems
44
(3), 2009, pp. 356-368
Relating complete and partial solution for problems similar to graph automorphism
Takayuki Nagoya
,
Seinosuke Toda
Lecture Notes in Computer Science
4708
, 2007, pp. 584-595
Improved approximation algorithms for metric Max TSP
Zhi-Zhong Chen
,
Takayuki Nagoya
Lecture Notes in Computer Science
3669
, 2005, pp. 179-190
Counting graph isomorphisms among chordal graphs with restricted clique number
Takayuki Nagoya
Lecture Notes in Computer Science
2223
, 2001, pp. 136-147