Characterizations of *-families. - Komei Fukuda; Akihisa Tamura (J. Comb. Theory B, 1989)

Combinatorial face enumeration in arrangements and oriented matroids. - Komei Fukuda; Shigemasa Saito; Akihisa Tamura (Discret. Appl. Math., 1991)

Bounding the number of k-faces in arrangements of hyperplanes. - Komei Fukuda; Shigemasa Saito; Akihisa Tamura; Takeshi Tokuyama (Discret. Appl. Math., 1991)

Degree Constrained Tree Embedding Into Points in the Plane. - Akihisa Tamura; Yoshiko Tamura (Inf. Process. Lett., 1992)

Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. - Yoshiko Ikebe; Tomomi Matsui; Akihisa Tamura (Discret. Appl. Math., 1993)

Transformation from Arbitrary Matchings to Stable Matchings. - Akihisa Tamura (J. Comb. Theory A, 1993)

Algorithms for finding a Kth best valued assignment. - Tomomi Matsui; Akihisa Tamura; Yoshiko Ikebe (Discret. Appl. Math., 1994)

The Rooted Tree Embedding Problem into Points in the Plane. - Yoshiko Ikebe; Micha A. Perles; Akihisa Tamura; Shinnichi Tokunaga (Discret. Comput. Geom., 1994)

An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane. - Naoki Makimoto; Ikuo Nakagawa; Akihisa Tamura (Oper. Res. Lett., 1994)

Ideal polytopes and face structures of some combinatorial optimization problems. - Yoshiko Ikebe; Akihisa Tamura (Math. Program., 1995)

An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. - Akiyoshi Shioura; Akihisa Tamura; Takeaki Uno (SIAM J. Comput., 1997)

The Generalized Stable Set Problem for Claw-Free Bidirected Graphs. - Daishin Nakamura; Akihisa Tamura (IPCO, 1998)

EP Theorems and Linear Complementarity Problems. - Komei Fukuda; Makoto Namiki; Akihisa Tamura (Discret. Appl. Math., 1998)

Perfect (0, ±1)-matrices and perfect bidirected graphs. - Akihisa Tamura (Theor. Comput. Sci., 2000)

Application of M-Convex Submodular Flow Problem to Mathematical Economics. - Kazuo Murota; Akihisa Tamura (ISAAC, 2001)

On Circuit Valuation of Matroids. - Kazuo Murota; Akihisa Tamura (Adv. Appl. Math., 2001)

A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. - Akinobu Eguchi; Satoru Fujishige; Akihisa Tamura (ISAAC, 2003)

New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. - Kazuo Murota; Akihisa Tamura (Discret. Appl. Math., 2003)

Polyhedral Proof of a Characterization of Perfect Bidirected Graphs. - Yoshiko Ikebe; Akihisa Tamura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

On convolution of L-convex functions. - Akihisa Tamura (Optim. Methods Softw., 2003)

Proximity theorems of discrete convex functions. - Kazuo Murota; Akihisa Tamura (Math. Program., 2004)

A Semidefinite Programming Relaxation for the Generalized Stable Set Problem. - Tetsuya Fujie; Akihisa Tamura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Coordinatewise domain scaling algorithm for M-convex function minimization. - Akihisa Tamura (Math. Program., 2005)

A general two-sided matching market with discrete concave utility functions. - Satoru Fujishige; Akihisa Tamura (Discret. Appl. Math., 2006)

A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis. - Satoru Fujishige; Akihisa Tamura (Math. Oper. Res., 2007)

On the existence of sports schedules with multiple venues. - Yoshiko Ikebe; Akihisa Tamura (Discret. Appl. Math., 2008)

Stable Marriage and Discrete Convex Analysis. - Akihisa Tamura (Encyclopedia of Algorithms, 2008)

Construction of Hamilton Path Tournament Designs. - Yoshiko Ikebe; Akihisa Tamura (Graphs Comb., 2011)

Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope. - Takuya Iimura; Kazuo Murota; Akihisa Tamura (Discret. Appl. Math., 2012)

Designing Matching Mechanisms under General Distributional Constraints. - Masahiro Goto; Fuhito Kojima; Ryoji Kurata; Akihisa Tamura; Makoto Yokoo (EC, 2015)

Scaling and Proximity Properties of Integrally Convex Functions. - Satoko Moriguchi; Kazuo Murota; Akihisa Tamura; Fabio Tardella (ISAAC, 2016)

Trading networks with bilateral contracts. - Tamás Fleiner; Zsuzsanna Jankó; Akihisa Tamura; Alexander Teytelboym (EAI Endorsed Trans. Serious Games, 2016)

Stable Marriage and Discrete Convex Analysis. - Akihisa Tamura (Encyclopedia of Algorithms, 2016)

Efficient Allocation Mechanism with Endowments and Distributional Constraints. - Takamasa Suzuki; Akihisa Tamura; Makoto Yokoo (AAMAS, 2018)

Designing matching mechanisms under constraints: An approach from discrete convex analysis. - Fuhito Kojima; Akihisa Tamura; Makoto Yokoo (J. Econ. Theory, 2018)

Scaling, proximity, and optimization of integrally convex functions. - Satoko Moriguchi; Kazuo Murota; Akihisa Tamura; Fabio Tardella (Math. Program., 2019)

Discrete Midpoint Convexity. - Satoko Moriguchi; Kazuo Murota; Akihisa Tamura; Fabio Tardella (Math. Oper. Res., 2020)

Integrality of subgradients and biconjugates of integrally convex functions. - Kazuo Murota; Akihisa Tamura (Optim. Lett., 2020)

Strategyproof Allocation Mechanisms with Endowments and M-convex Distributional Constraints. - Takamasa Suzuki; Akihisa Tamura; Kentaro Yahiro; Makoto Yokoo; Yuzhe Zhang 001 (Artif. Intell., 2023)

Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. - Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Makoto Yokoo (AAAI, 2024)

A fair and truthful mechanism with limited subsidy. - Hiromichi Goko; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Yu Yokoi; Makoto Yokoo (Games Econ. Behav., 2024)

Shapley-Folkman-type theorem for integrally convex sets. - Kazuo Murota; Akihisa Tamura (Discret. Appl. Math., 2025)