Tamura Akihisa

Akihisa Tamura

Information about the author Akihisa Tamura will soon be added to the site.
Found 12 papers in total
A two-sided discrete-concave market with possibly bounded side payments: An approach by discrete convex analysis
A two-sided discrete-concave market with possibly bounded side payments: An approach by discrete convex analysis
2007
The marriage model due to Gale and Shapley (1962) and the assignment model due to...
A new characterization of M#-convex set functions by substitutability
A new characterization of M#-convex set functions by substitutability
2004
The concepts of M-convex functions and M-convex functions play central roles in the...
On Grötschel–Lovász–Shrijver's relaxation of stable set polytopes
On Grötschel–Lovász–Shrijver's relaxation of stable set polytopes
2002
Grötschel, Lovász and Schrijver introduced a convex set containing the...
A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph
A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph
2001
Minty, Sbihi, and Lovász and Plummer have proposed polynomial time algorithms...
A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs
A linear time algorithm for the generalized stable set problem on triangulated bidirected graphs
2000
The generalized stable set problem is an extension of the maximum weight stable set...
The generalized stable set problem for perfect bidirected graphs
The generalized stable set problem for perfect bidirected graphs
1997
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we...
Ideal polytopes and face structures of some combinatorial optimization problems
Ideal polytopes and face structures of some combinatorial optimization problems
1995
Given a finite set X and a family of ‘feasible’ subsets ℱ of X, the...
Efficiently scanning all spanning trees of an undirected graph
Efficiently scanning all spanning trees of an undirected graph
1995
Let G be an undirected graph with V vertices and E edges. The authors consider the...
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
1994
The minimum norm point problem is to find the minimum norm point in the convex hull of...
Adjacency of the best and second best valued solutions in combinatorial optimization problems
Adjacency of the best and second best valued solutions in combinatorial optimization problems
1993
The authors say that a polytope satisfies the strong adjacency property if every best...
Bounding the number of k-faces in arrangement of hyperplanes
Bounding the number of k-faces in arrangement of hyperplanes
1991
The authors study certain structural problems of arrangements of hyperplanes in d...
Combinatorial face enumeration in arrangements and oriented matroids
Combinatorial face enumeration in arrangements and oriented matroids
1991
Let denote the number of k- dimensional faces of a d -dimensional arrangement of...
Papers per page: