The SCEAS System
| |||||||

## Search the dblp DataBase
Akihisa Tamura:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Daishin Nakamura, Akihisa Tamura
**The Generalized Stable Set Problem for Claw-Free Bidirected Graphs.**[Citation Graph (0, 0)][DBLP] IPCO, 1998, pp:69-83 [Conf] - Akihisa Tamura
**A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization.**[Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:21-35 [Conf] - Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura
**A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:495-504 [Conf] - Kazuo Murota, Akihisa Tamura
**Application of M-Convex Submodular Flow Problem to Mathematical Economics.**[Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:14-25 [Conf] - Satoru Fujishige, Akihisa Tamura
**A general two-sided matching market with discrete concave utility functions.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:6, pp:950-970 [Journal] - Komei Fukuda, Makoto Namiki, Akihisa Tamura
**EP Theorems and Linear Complementarity Problems.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:107-119 [Journal] - Yoshiko Ikebe, Tomomi Matsui, Akihisa Tamura
**Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:47, n:3, pp:227-232 [Journal] - Tomomi Matsui, Akihisa Tamura, Yoshiko Ikebe
**Algorithms for finding a Kth best valued assignment.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:50, n:3, pp:283-296 [Journal] - Kazuo Murota, Akihisa Tamura
**New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:2, pp:495-512 [Journal] - Yoshiko Ikebe, Micha A. Perles, Akihisa Tamura, Shinnichi Tokunaga
**The Rooted Tree Embedding Problem into Points in the Plane.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1994, v:11, n:, pp:51-63 [Journal] - Akihisa Tamura, Yoshiko Tamura
**Degree Constrained Tree Embedding Into Points in the Plane.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:4, pp:211-214 [Journal] - Komei Fukuda, Akihisa Tamura
**Characterizations of *-families.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:107-110 [Journal] - Akihisa Tamura
**Transformation from Arbitrary Matchings to Stable Matchings.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1993, v:62, n:2, pp:310-323 [Journal] - Yoshiko Ikebe, Akihisa Tamura
**Ideal polytopes and face structures of some combinatorial optimization problems.**[Citation Graph (0, 0)][DBLP] Math. Program., 1995, v:71, n:, pp:1-15 [Journal] - Kazuo Murota, Akihisa Tamura
**Proximity theorems of discrete convex functions.**[Citation Graph (0, 0)][DBLP] Math. Program., 2004, v:99, n:3, pp:539-562 [Journal] - Akihisa Tamura
**Coordinatewise domain scaling algorithm for M-convex function minimization.**[Citation Graph (0, 0)][DBLP] Math. Program., 2005, v:102, n:2, pp:339-354 [Journal] - Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno
**An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:3, pp:678-692 [Journal] - Akihisa Tamura
**Perfect (0, ±1)-matrices and perfect bidirected graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:235, n:2, pp:339-356 [Journal] **On the existence of sports schedules with multiple venues.**[Citation Graph (, )][DBLP]**Combinatorial face enumeration in arrangements and oriented matroids.**[Citation Graph (, )][DBLP]**Bounding the number of k-faces in arrangements of hyperplanes.**[Citation Graph (, )][DBLP]
Search in 0.042secs, Finished in 0.044secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |