Akihisa Tamura

Discret. Appl. Math., 2025

2024

A fair and truthful mechanism with limited subsidy.

[BibT_eX]

[DOI]

Games Econ. Behav., 2024

Towards Optimal Subsidy Bounds for Envy-Freeable Allocations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Strategyproof Allocation Mechanisms with Endowments and M-convex Distributional Constraints.

[BibT_eX]

[DOI]

Artif. Intell., 2023

2020

Integrality of subgradients and biconjugates of integrally convex functions.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Discrete Midpoint Convexity.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

2019

Scaling, proximity, and optimization of integrally convex functions.

[BibT_eX]

[DOI]

Math. Program., 2019

2018

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

[BibT_eX]

[DOI]

Fuhito Kojima

Makoto Yokoo

J. Econ. Theory, 2018

Efficient Allocation Mechanism with Endowments and Distributional Constraints.

[BibT_eX]

[DOI]

Takamasa Suzuki

Makoto Yokoo

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

2016

Stable Marriage and Discrete Convex Analysis.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Trading networks with bilateral contracts.

[BibT_eX]

[DOI]

EAI Endorsed Trans. Serious Games, 2016

Scaling and Proximity Properties of Integrally Convex Functions.

[BibT_eX]

[DOI]

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

2015

Designing Matching Mechanisms under General Distributional Constraints.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Takuya Iimura

Discret. Appl. Math., 2012

2011

Construction of Hamilton Path Tournament Designs.

[BibT_eX]

[DOI]

Graphs Comb., 2011

2008

Stable Marriage and Discrete Convex Analysis.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On the existence of sports schedules with multiple venues.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

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

[BibT_eX]

[DOI]

Satoru Fujishige

Math. Oper. Res., 2007

2006

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

[BibT_eX]

[DOI]

Satoru Fujishige

Discret. Appl. Math., 2006

2005

Coordinatewise domain scaling algorithm for M-convex function minimization.

[BibT_eX]

[DOI]

Math. Program., 2005

A Semidefinite Programming Relaxation for the Generalized Stable Set Problem.

[BibT_eX]

[DOI]

Tetsuya Fujie

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

2004

Proximity theorems of discrete convex functions.

[BibT_eX]

[DOI]

Math. Program., 2004

2003

On convolution of <i>L</i>-convex functions.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2003

Polyhedral Proof of a Characterization of Perfect Bidirected Graphs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

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

[BibT_eX]

[DOI]

Akinobu Eguchi

Satoru Fujishige

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

2001

On Circuit Valuation of Matroids.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2001

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

[BibT_eX]

[DOI]

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

2000

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1998

EP Theorems and Linear Complementarity Problems.

[BibT_eX]

[DOI]

Komei Fukuda

Makoto Namiki

Discret. Appl. Math., 1998

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

[BibT_eX]

[DOI]

Daishin Nakamura

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

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

[BibT_eX]

[DOI]

Akiyoshi Shioura

Takeaki Uno

SIAM J. Comput., 1997

1995

Ideal polytopes and face structures of some combinatorial optimization problems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Naoki Makimoto

Ikuo Nakagawa

Oper. Res. Lett., 1994

The Rooted Tree Embedding Problem into Points in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1994

Algorithms for finding a Kth best valued assignment.

[BibT_eX]

[DOI]

Tomomi Matsui

Discret. Appl. Math., 1994

1993

Transformation from Arbitrary Matchings to Stable Matchings.

[BibT_eX]

J. Comb. Theory A, 1993

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

[BibT_eX]

[DOI]

Tomomi Matsui

Discret. Appl. Math., 1993

1992

Degree Constrained Tree Embedding Into Points in the Plane.

[BibT_eX]

[DOI]

Yoshiko Tamura

Inf. Process. Lett., 1992

1991

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Combinatorial face enumeration in arrangements and oriented matroids.

[BibT_eX]

[DOI]

Komei Fukuda

Shigemasa Saito

Discret. Appl. Math., 1991

1989

Characterizations of *-families.

[BibT_eX]

[DOI]

Komei Fukuda