# Akihisa Tamura

According to our database

Collaborative distances:

^{1}, Akihisa Tamura authored at least 36 papers between 1989 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Integrality of subgradients and biconjugates of integrally convex functions.

Optimization Letters, 2020

2019

Scaling, proximity, and optimization of integrally convex functions.

Math. Program., 2019

2018

Designing matching mechanisms under constraints: An approach from discrete convex analysis.

J. Economic Theory, 2018

Efficient Allocation Mechanism with Endowments and Distributional Constraints.

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2016

Stable Marriage and Discrete Convex Analysis.

Encyclopedia of Algorithms, 2016

Trading networks with bilateral contracts.

EAI Endorsed Trans. Serious Games, 2016

Scaling and Proximity Properties of Integrally Convex Functions.

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Designing Matching Mechanisms under General Distributional Constraints.

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2012

Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope.

Discrete Applied Mathematics, 2012

2011

Construction of Hamilton Path Tournament Designs.

Graphs and Combinatorics, 2011

2008

Stable Marriage and Discrete Convex Analysis.

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the existence of sports schedules with multiple venues.

Discrete Applied Mathematics, 2008

2007

A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis.

Math. Oper. Res., 2007

2006

A general two-sided matching market with discrete concave utility functions.

Discrete Applied Mathematics, 2006

2005

Coordinatewise domain scaling algorithm for M-convex function minimization.

Math. Program., 2005

A Semidefinite Programming Relaxation for the Generalized Stable Set Problem.

IEICE Transactions, 2005

2004

Proximity theorems of discrete convex functions.

Math. Program., 2004

2003

On convolution of

*L*-convex functions.
Optimization Methods and Software, 2003

New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.

Discrete Applied Mathematics, 2003

A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model.

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001

On Circuit Valuation of Matroids.

Adv. Appl. Math., 2001

Application of M-Convex Submodular Flow Problem to Mathematical Economics.

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000

Perfect (0, ±1)-matrices and perfect bidirected graphs.

Theor. Comput. Sci., 2000

1998

EP Theorems and Linear Complementarity Problems.

Discrete Applied Mathematics, 1998

The Generalized Stable Set Problem for Claw-Free Bidirected Graphs.

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs.

SIAM J. Comput., 1997

1995

Ideal polytopes and face structures of some combinatorial optimization problems.

Math. Program., 1995

1994

An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane.

Oper. Res. Lett., 1994

The Rooted Tree Embedding Problem into Points in the Plane.

Discrete & Computational Geometry, 1994

Algorithms for finding a Kth best valued assignment.

Discrete Applied Mathematics, 1994

1993

Transformation from Arbitrary Matchings to Stable Matchings.

J. Comb. Theory, Ser. A, 1993

Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems.

Discrete Applied Mathematics, 1993

1992

Degree Constrained Tree Embedding Into Points in the Plane.

Inf. Process. Lett., 1992

1991

Bounding the number of k-faces in arrangements of hyperplanes.

Discrete Applied Mathematics, 1991

Combinatorial face enumeration in arrangements and oriented matroids.

Discrete Applied Mathematics, 1991

1989

Characterizations of *-families.

J. Comb. Theory, Ser. B, 1989