Takayuki Nagoya

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Polynomial time algorithms for variants of graph matching on partial k-trees Foundations of Computing and Decision Sciences	2018-01-26	Paper
New differential approximation algorithm for \(k\)-customer vehicle routing problem Information Processing Letters	2010-06-16	Paper
Computing graph automorphism from partial solutions Theory of Computing Systems	2009-08-06	Paper
Computational complexity of computing a partial solution for the graph automorphism problems Theoretical Computer Science	2009-05-28	Paper
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism Mathematical Foundations of Computer Science 2007	2008-09-17	Paper
Improved approximation algorithms for metric MaxTSP Journal of Combinatorial Optimization	2008-01-22	Paper
Algorithms – ESA 2005 Lecture Notes in Computer Science	2006-06-27	Paper
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs Discrete Applied Mathematics	2005-02-23	Paper
scientific article; zbMATH DE number 2080986 (Why is no real title available?)	2004-08-04	Paper

Research outcomes over time

This page was built for person: Takayuki Nagoya