| 2008 |
|---|
| 23 | EE | Akihisa Tamura:
Stable Marriage and Discrete Convex Analysis.
Encyclopedia of Algorithms 2008 |
| 22 | EE | Yoshiko Ikebe,
Akihisa Tamura:
On the existence of sports schedules with multiple venues.
Discrete Applied Mathematics 156(10): 1694-1710 (2008) |
| 2006 |
|---|
| 21 | EE | Satoru Fujishige,
Akihisa Tamura:
A general two-sided matching market with discrete concave utility functions.
Discrete Applied Mathematics 154(6): 950-970 (2006) |
| 2005 |
|---|
| 20 | EE | Tetsuya Fujie,
Akihisa Tamura:
A Semidefinite Programming Relaxation for the Generalized Stable Set Problem.
IEICE Transactions 88-A(5): 1122-1128 (2005) |
| 19 | EE | Akihisa Tamura:
Coordinatewise domain scaling algorithm for M-convex function minimization.
Math. Program. 102(2): 339-354 (2005) |
| 2004 |
|---|
| 18 | EE | Kazuo Murota,
Akihisa Tamura:
Proximity theorems of discrete convex functions.
Math. Program. 99(3): 539-562 (2004) |
| 2003 |
|---|
| 17 | EE | Akinobu Eguchi,
Satoru Fujishige,
Akihisa Tamura:
A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model.
ISAAC 2003: 495-504 |
| 16 | EE | Kazuo Murota,
Akihisa Tamura:
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
Discrete Applied Mathematics 131(2): 495-512 (2003) |
| 2002 |
|---|
| 15 | EE | Akihisa Tamura:
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization.
IPCO 2002: 21-35 |
| 2001 |
|---|
| 14 | EE | Kazuo Murota,
Akihisa Tamura:
Application of M-Convex Submodular Flow Problem to Mathematical Economics.
ISAAC 2001: 14-25 |
| 2000 |
|---|
| 13 | EE | Akihisa Tamura:
Perfect (0, ±1)-matrices and perfect bidirected graphs.
Theor. Comput. Sci. 235(2): 339-356 (2000) |
| 1998 |
|---|
| 12 | EE | Daishin Nakamura,
Akihisa Tamura:
The Generalized Stable Set Problem for Claw-Free Bidirected Graphs.
IPCO 1998: 69-83 |
| 11 | EE | Komei Fukuda,
Makoto Namiki,
Akihisa Tamura:
EP Theorems and Linear Complementarity Problems.
Discrete Applied Mathematics 84(1-3): 107-119 (1998) |
| 1997 |
|---|
| 10 | | Akiyoshi Shioura,
Akihisa Tamura,
Takeaki Uno:
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.
SIAM J. Comput. 26(3): 678-692 (1997) |
| 1995 |
|---|
| 9 | | Yoshiko Ikebe,
Akihisa Tamura:
Ideal polytopes and face structures of some combinatorial optimization problems.
Math. Program. 71: 1-15 (1995) |
| 1994 |
|---|
| 8 | | Yoshiko Ikebe,
Micha A. Perles,
Akihisa Tamura,
Shinnichi Tokunaga:
The Rooted Tree Embedding Problem into Points in the Plane.
Discrete & Computational Geometry 11: 51-63 (1994) |
| 7 | | Tomomi Matsui,
Akihisa Tamura,
Yoshiko Ikebe:
Algorithms for finding a Kth best valued assignment.
Discrete Applied Mathematics 50(3): 283-296 (1994) |
| 1993 |
|---|
| 6 | EE | Yoshiko Ikebe,
Tomomi Matsui,
Akihisa Tamura:
Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems.
Discrete Applied Mathematics 47(3): 227-232 (1993) |
| 5 | | Akihisa Tamura:
Transformation from Arbitrary Matchings to Stable Matchings.
J. Comb. Theory, Ser. A 62(2): 310-323 (1993) |
| 1992 |
|---|
| 4 | | Akihisa Tamura,
Yoshiko Tamura:
Degree Constrained Tree Embedding Into Points in the Plane.
Inf. Process. Lett. 44(4): 211-214 (1992) |
| 1991 |
|---|
| 3 | EE | Komei Fukuda,
Shigemasa Saito,
Akihisa Tamura:
Combinatorial face enumeration in arrangements and oriented matroids.
Discrete Applied Mathematics 31(2): 141-149 (1991) |
| 2 | EE | Komei Fukuda,
Shigemasa Saito,
Akihisa Tamura,
Takeshi Tokuyama:
Bounding the number of k-faces in arrangements of hyperplanes.
Discrete Applied Mathematics 31(2): 151-165 (1991) |
| 1989 |
|---|
| 1 | EE | Komei Fukuda,
Akihisa Tamura:
Characterizations of *-families.
J. Comb. Theory, Ser. B 47(1): 107-110 (1989) |
