Seiji Kataoka

	2010
7		Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe: Listing all the minimum spanning trees in an undirected graph. Int. J. Comput. Math. 87(14): 3175-3185 (2010)
	2009
6		Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka: A virtual pegging approach to the max-min optimization of the bi-criteria knapsack problem. Int. J. Comput. Math. 86(5): 779-793 (2009)
	2008
5		Fumiaki Taniguchi, Takeo Yamada, Seiji Kataoka: Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem. Computers & OR 35(6): 2034-2048 (2008)
	2005
4		Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe: Heuristic and exact algorithms for the spanning tree detection problem. Computers & OR 32: 239-255 (2005)
3		Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka: Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. J. Comput. Math. 82(1): 23-34 (2005)
	2000
2		Seiji Kataoka, Norio Araki, Takeo Yamada: Upper and lower bounding procedures for minimum rooted k-subtree problem. European Journal of Operational Research 122(3): 561-569 (2000)
	1994
1		Takeo Yamada, J. Yoruzuya, Seiji Kataoka: Enumerating extreme points of a highly degenerate polytope. Computers & OR 21(4): 397-410 (1994)

Coauthor Index

1	Norio Araki	[2]
2	Fumiaki Taniguchi	[5] [6]
3	Kohtaro Watanabe	[3] [4] [7]
4	Takeo Yamada	[1] [2] [3] [4] [5] [6] [7]
5	J. Yoruzuya	[1]

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page