Takayuki Nagoya

Available identifiers

zbMath Open nagoya.takayukiMaRDI QIDQ976132

List of research outcomes

Publication	Date of Publication	Type
Polynomial time algorithms for variants of graph matching on partial \(k\)-trees	2018-01-26	Paper
New differential approximation algorithm for \(k\)-customer vehicle routing problem	2010-06-16	Paper
Computing graph automorphism from partial solutions	2009-08-06	Paper
Computational complexity of computing a partial solution for the graph automorphism problems	2009-05-28	Paper
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism	2008-09-17	Paper
Improved approximation algorithms for metric MaxTSP	2008-01-22	Paper
Algorithms – ESA 2005	2006-06-27	Paper
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs	2005-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4474083	2004-08-04	Paper

Research outcomes over time

This page was built for person: Takayuki Nagoya