Akihisa Tamura's publications
Last update: August 11, 2013
Research Papers
-
Fukuda, K. and Tamura, A.,
(1988),
``Local deformation and orientation transformation
in oriented matroids,''
ARS Combinatoria,
vol. 25-A, 243-258.
-
Tamura, A., Takehara, H., Fukuda, K., Fujishige, S. and Kojima, M.,
(1988),
``A dual interior primal simplex method for linear programming,''
Journal of the Operations Research Society of Japan,
vol. 31, 413-429.
-
Fukuda, K. and Tamura, A.,
(1989),
``Characterizations of *-families,''
Journal of Combinatorial Theory, Series B,
vol. 47, 107-110.
-
Fukuda, K. and Tamura, A.,
(1990),
``Dualities in signed vector systems,''
Portugaliae Mathematica,
vol. 47, 151-165.
-
Fukuda, K., Saito, S. and Tamura, A.,
(1991),
``Combinatorial face enumeration in arrangements and
oriented matroids,''
Discrete Applied Mathematics,
vol. 31, 141-149.
-
Fukuda, K., Saito, S., Tamura, A. and Tokuyama, T.,
(1991),
``Bounding the number of k-faces in arrangements of hyperplanes,''
Discrete Applied Mathematics,
vol. 31, 151-165.
-
Tamura, A. and Tamura, Y.,
(1992),
``Degree constrained embedding into points in the plane,''
Information Processing Letters,
vol. 44, 211-214.
-
Tamura, A.,
(1993),
``Transformation from arbitrary matchings to stable matchings,''
Journal of Combinatorial Theory, Series A,
vol. 62, 310-323.
-
Sekitani, K., Tamura, A. and Yamamoto, Y.,
(1993),
``A recursive algorithm for a class of convex min-max problems,''
Asia-Pacific Journal of Operational Research,
vol. 10, 93-108.
-
Fukuda, K., Tamura, A., and Tokuyama, T.,
(1993),
``A theorem on the average number of subfaces in arrangements and
oriented matroids,''
Geometriae Dedicata,
vol. 47, 129-142.
-
Ikebe, Y., Matsui, T., and Tamura, A.,
(1993),
``Adjacency of the best and second best valued solutions
in combinatorial optimization problems,''
Discrete Applied Mathematics,
vol. 47, 227-232.
-
Ikebe, Y., Perles, M.A., Tamura, A. and Tokunaga, S.,
(1994),
``The rooted tree embedding problem into points in the plane,''
Discrete and Computational Geometry,
vol. 11, 51-63.
-
Matsui, T., Tamura, A., and Ikebe, Y.,
(1994),
``Algorithms for finding a k th best valued assignment,''
Discrete Applied Mathematics,
vol. 50, 283-296.
-
Makimoto, N., Nakagawa, I. and Tamura, A.,
(1994),
``An efficient algorithm for finding the minimum norm point
in the convex hull of a finite point set in the plane,''
Operations Research Letters,
vol. 16, 33-40.
-
Shioura, A. and Tamura, A.,
(1995),
``Efficiently scanning all spanning trees of an undirected graph,''
Journal of the Operations Research Society of Japan,
vol. 38, 331-344.
-
Ikebe, Y.T. and Tamura, A.,
(1995),
``Ideal polytopes and face structures of some combinatorial optimization
problems,''
Mathematical Programming,
vol. 71, 1-15.
-
Shioura, A., Tamura, A. and Uno, T.,
(1997),
``An optimal algorithm for scanning all spanning trees of
undirected graphs,''
SIAM Journal on Computing,
vol. 26, 678-692.
-
Tamura, A.,
(1997),
``The generalized stable set problem for perfect bidirected graphs,''
Journal of the Operations Research Society of Japan,
vol. 40, 401-414.
-
Fukuda, K., Namiki, M. and Tamura, A.,
(1998),
``EP theorems and linear complementarity problems,''
Discrete Applied Mathematics,
vol. 84, 107-119.
-
Nakamura, D. and Tamura, A.,
(2000),
``A linear time algorithm for the generalized stable set problem
on triangulated bidirected graphs,''
Journal of the Operations Research Society of Japan,
vol. 43, 162-175.
-
Tamura, A.,
(2000),
``Perfect (0,+/-1)-matrices and perfect bidirected graphs,''
Theoretical Computer Science,
vol. 235, 339-356.
-
Murota, K. and Tamura, A.,
(2001),
``On circuit valuation of matroids,''
Advances in Applied Mathematics,
vol. 26, 192-225.
-
Nakamura, D. and Tamura, A.,
(2001),
``A revision of Minty's algorithm for finding a maximum
weight stable set of a claw-free graph,''
Journal of the Operations Research Society of Japan,
vol. 44, 194-204.
-
Fujie, T. and Tamura, A.,
(2002),
``On Grotschel-Lovasz-Schrijver's relaxation of
stable set polytopes,''
Journal of the Operations Research Society of Japan,
vol. 45, 285-292.
-
Tamura, A.,
(2003),
``On convolution of L-convex functions,''
Optimization Methods and Software,
vol. 18, 231-245.
-
Ikebe, T. Y. and Tamura, A.,
(2003),
``Polyhedral proof of a characterization of perfect bidirected graphs,''
IEICE Transactions on Fundamentals,
vol. E86-A, 1000-1007.
-
Murota, K. and Tamura, A.,
(2003),
``New characterizations of M-convex functions and
their applications to economic equilibrium models,''
Discrete Applied Mathematics,
vol. 131, 495-512.
-
Murota, K. and Tamura, A.,
(2003),
``Application of M-convex submodular flow problem
to mathematical economics,''
Japan Journal of Industrial and Applied Mathematics,
vol. 20, 257-277.
-
Farooq, R. and Tamura, A.,
(2004),
``A new characterization of M#-convex set functions
by substitutability,''
Journal of the Operations Research Society of Japan,
vol. 47, 18-24.
-
Murota, K. and Tamura, A.,
(2004),
``Proximity theorems of discrete convex functions,''
Mathematical Programming,
vol. 99, 539-562.
-
Tamura, A.,
(2005),
``Coordinatewise domain scaling algorithm
for M-convex function minimization,''
Mathematical Programming,
vol. 102, 339-354.
-
Fujie, T. and Tamura, A.,
(2005),
``A semidefinite programming relaxation
for the generalized stable set problem,''
IEICE Transactions on Fundamentals,
vol. E88-A, 1122-1128.
-
Iimura, T., Murota, K. and Tamura, A.,
(2005),
``Discrete fixed point theorem reconsidered,''
Journal of Mathematical Economics,
vol. 41, 1030-1036.
-
Fujishige, S. and Tamura, A.,
(2006),
``A general two-sided matching market with discrete concave
utility functions,''
Discrete Applied Mathematics,
vol. 154, 950-970.
-
Fujishige, S. and Tamura, A.,
(2007),
``A two-sided discrete-concave market with bounded side payments:
An approach by discrete convex analysis,''
Mathematics of Operations Research,
vol. 32, 136-155.
-
Farooq, R., Ikebe, Y.T. and Tamura, A.,
(2008),
``On labor allocation model with possibly bounded salaries,''
Journal of the Operations Research Society of Japan,
vol. 51, 136-154.
-
Ikebe, Y. T. and Tamura, A.,
(2008),
``On the existence of sports schedules with multiple venues,''
Discrete Applied Mathematics,
vol. 156, 1694-1710.
-
Ikebe, Y. T. and Tamura, A.,
(2011),
``Construction of Hamilton path tournament designs,"
Graphs and Combinatorics,
vol. 27, 703-711.
-
Iimura, T., Murota, K. and Tamura, A.,
(2012),
``Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope,''
Discrete Applied Mathematics,
vol. 160, 588--592.
-
Farooq, R., Fleiner, T. and Tamura, A.,
(2012),
``Matching with partially ordered contracts,"
Japan Journal of Industrial and Applied Mathematics,
vol. 29, 401--417.
Survey Papers
-
Tamura, A.,
(2000),
``The linear complementarity problem on oriented matroids,''
IEICE Transactions on Information and Systems,
vol. E83-D, 353-361.
-
Tamura, A.,
``Applications of discrete convex analysis to mathematical economics,''
Publications of RIMS, Kyoto University,
vol. 40, 1015-1037.
Books (Japanese)
-
田村明久, 村松正和, 最適化法, 共立出版, 2002.
-
田村明久, 離散凸解析とゲーム理論, 朝倉書店, 2009.
Proceedings (Lecture Notes)
-
Kijima, M. and Tamura, A.,
(1996),
``On the greedy algorithm for stochastic optimization problems,''
in: Christer, A.H., Osaki, S. and Thomas, L.C. (eds.)
Stochastic Modeling in Innovative Manufacturing,
Lecture Notes in Economics and Mathematical Systems 445, Springer,
19-29.
-
Nakamura, D. and Tamura, A.,
(1998),
``The generalized stable set problem for claw-free bidirected graphs,''
in: Bixby, R.E., Boyd, E.A. and Rios-Mercado, R.Z. (eds.)
Integer Programming and Combinatorial Optimization,
Lecture Notes in Computer Science 1412, Springer,
69-83.
-
Murota, K. and Tamura, A.,
(2001),
``Application of M-convex submodular flow problem
to mathematical economics,''
in: Eades, P. and Takaoka, T. (eds.)
Algorithms and Computation, ISAAC2001,
Lecture Notes in Computer Science 2223, Springer,
14-25.
-
Tamura, A.,
(2002),
``Coordinatewise domain scaling algorithm for
M-convex function minimization,''
in: Cook, W. J. and Schulz, A. S. (eds.)
Integer Programming and Combinatorial Optimization,
Lecture Notes in Computer Science 2337, Springer,
21-35.
-
Eguchi, A., Fujishige, S. and Tamura, A.,
(2003),
``A generalized Gale-Shapley algorithm for
a discrete-concave stable-marriage model,''
in: Ibaraki, T., Katoh, N. and Ono H. (eds.)
Algorithms and Computation, ISAAC2003,
Lecture Notes in Computer Science 2906, Springer,
495-504.