default search action
Akihisa Tamura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j33]Kazuo Murota
, Akihisa Tamura:
Shapley-Folkman-type theorem for integrally convex sets. Discret. Appl. Math. 360: 42-50 (2025) - 2024
- [j32]Hiromichi Goko, Ayumi Igarashi
A fair and truthful mechanism with limited subsidy. Games Econ. Behav. 144: 49-70 (2024) - [c10]Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo:
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. AAAI 2024: 9824-9831 - 2023
- [j31]Takamasa Suzuki, Akihisa Tamura, Kentaro Yahiro
Strategyproof Allocation Mechanisms with Endowments and M-convex Distributional Constraints. Artif. Intell. 315: 103825 (2023) - [i3]Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo:
Towards Optimal Subsidy Bounds for Envy-freeable Allocations. CoRR abs/2308.11230 (2023) - 2022
- [c9]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. AAMAS 2022: 534-542 - 2021
- [i2]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. CoRR abs/2105.01801 (2021) - 2020
- [j30]Satoko Moriguchi
Discrete Midpoint Convexity. Math. Oper. Res. 45(1): 99-128 (2020) - [j29]Kazuo Murota, Akihisa Tamura
Integrality of subgradients and biconjugates of integrally convex functions. Optim. Lett. 14(1): 195-208 (2020)
2010 – 2019
- 2019
- [j28]Satoko Moriguchi
Scaling, proximity, and optimization of integrally convex functions. Math. Program. 175(1-2): 119-154 (2019) - 2018
- [j27]Fuhito Kojima
Designing matching mechanisms under constraints: An approach from discrete convex analysis. J. Econ. Theory 176: 803-833 (2018) - [c8]Takamasa Suzuki, Akihisa Tamura, Makoto Yokoo:
Efficient Allocation Mechanism with Endowments and Distributional Constraints. AAMAS 2018: 50-58 - [c7]Tamás Fleiner, Zsuzsanna Jankó, Akihisa Tamura, Alexander Teytelboym:
Trading Networks with Bilateral Contracts. WINE 2018: 444 - 2016
- [j26]Tamás Fleiner, Zsuzsanna Jankó, Akihisa Tamura, Alexander Teytelboym:
Trading networks with bilateral contracts. EAI Endorsed Trans. Serious Games 3(11): e1 (2016) - [c6]Satoko Moriguchi, Kazuo Murota, Akihisa Tamura, Fabio Tardella:
Scaling and Proximity Properties of Integrally Convex Functions. ISAAC 2016: 57:1-57:13 - [r2]Akihisa Tamura:
Stable Marriage and Discrete Convex Analysis. Encyclopedia of Algorithms 2016: 2064-2068 - 2015
- [c5]Masahiro Goto, Fuhito Kojima
Designing Matching Mechanisms under General Distributional Constraints. EC 2015: 259-260 - [i1]Tamás Fleiner, Zsuzsanna Jankó, Akihisa Tamura, Alexander Teytelboym:
Trading Networks with Bilateral Contracts. CoRR abs/1510.01210 (2015) - 2012
- [j25]Takuya Iimura, Kazuo Murota, Akihisa Tamura:
Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope. Discret. Appl. Math. 160(4-5): 588-592 (2012) - 2011
- [j24]Yoshiko Ikebe, Akihisa Tamura:
Construction of Hamilton Path Tournament Designs. Graphs Comb. 27(5): 703-711 (2011)
2000 – 2009
- 2008
- [j23]Yoshiko Ikebe, Akihisa Tamura:
On the existence of sports schedules with multiple venues. Discret. Appl. Math. 156(10): 1694-1710 (2008) - [r1]Akihisa Tamura:
Stable Marriage and Discrete Convex Analysis. Encyclopedia of Algorithms 2008 - 2007
- [j22]Satoru Fujishige
A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis. Math. Oper. Res. 32(1): 136-155 (2007) - 2006
- [j21]Satoru Fujishige
A general two-sided matching market with discrete concave utility functions. Discret. Appl. Math. 154(6): 950-970 (2006) - 2005
- [j20]Tetsuya Fujie, Akihisa Tamura:
A Semidefinite Programming Relaxation for the Generalized Stable Set Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1122-1128 (2005) - [j19]Akihisa Tamura:
Coordinatewise domain scaling algorithm for M-convex function minimization. Math. Program. 102(2): 339-354 (2005) - 2004
- [j18]Kazuo Murota, Akihisa Tamura:
Proximity theorems of discrete convex functions. Math. Program. 99(3): 539-562 (2004) - 2003
- [j17]Kazuo Murota, Akihisa Tamura:
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. Discret. Appl. Math. 131(2): 495-512 (2003) - [j16]Yoshiko Ikebe, Akihisa Tamura:
Polyhedral Proof of a Characterization of Perfect Bidirected Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(5): 1000-1007 (2003) - [j15]Akihisa Tamura:
On convolution of L-convex functions. Optim. Methods Softw. 18(2): 231-245 (2003) - [c4]Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura:
A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model. ISAAC 2003: 495-504 - 2002
- [c3]Akihisa Tamura:
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization. IPCO 2002: 21-35 - 2001
- [j14]Kazuo Murota, Akihisa Tamura:
On Circuit Valuation of Matroids. Adv. Appl. Math. 26(3): 192-225 (2001) - [c2]Kazuo Murota, Akihisa Tamura:
Application of M-Convex Submodular Flow Problem to Mathematical Economics. ISAAC 2001: 14-25 - 2000
- [j13]Akihisa Tamura:
Perfect (0, ±1)-matrices and perfect bidirected graphs. Theor. Comput. Sci. 235(2): 339-356 (2000)
1990 – 1999
- 1998
- [j12]Komei Fukuda, Makoto Namiki, Akihisa Tamura:
EP Theorems and Linear Complementarity Problems. Discret. Appl. Math. 84(1-3): 107-119 (1998) - [c1]Daishin Nakamura, Akihisa Tamura:
The Generalized Stable Set Problem for Claw-Free Bidirected Graphs. IPCO 1998: 69-83 - 1997
- [j11]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
- [j10]Yoshiko Ikebe, Akihisa Tamura:
Ideal polytopes and face structures of some combinatorial optimization problems. Math. Program. 71: 1-15 (1995) - 1994
- [j9]Tomomi Matsui
Algorithms for finding a Kth best valued assignment. Discret. Appl. Math. 50(3): 283-296 (1994) - [j8]Yoshiko Ikebe, Micha A. Perles, Akihisa Tamura, Shinnichi Tokunaga:
The Rooted Tree Embedding Problem into Points in the Plane. Discret. Comput. Geom. 11: 51-63 (1994) - [j7]Naoki Makimoto, Ikuo Nakagawa, Akihisa Tamura:
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane. Oper. Res. Lett. 16(1): 33-40 (1994) - 1993
- [j6]Yoshiko Ikebe, Tomomi Matsui
Adjacency of the Best and Second Best Valued Solutions in Combinatorial Optimization Problems. Discret. Appl. Math. 47(3): 227-232 (1993) - [j5]Akihisa Tamura:
Transformation from Arbitrary Matchings to Stable Matchings. J. Comb. Theory A 62(2): 310-323 (1993) - 1992
- [j4]Akihisa Tamura, Yoshiko Tamura:
Degree Constrained Tree Embedding Into Points in the Plane. Inf. Process. Lett. 44(4): 211-214 (1992) - 1991
- [j3]Komei Fukuda, Shigemasa Saito, Akihisa Tamura:
Combinatorial face enumeration in arrangements and oriented matroids. Discret. Appl. Math. 31(2): 141-149 (1991) - [j2]Komei Fukuda, Shigemasa Saito, Akihisa Tamura, Takeshi Tokuyama
Bounding the number of k-faces in arrangements of hyperplanes. Discret. Appl. Math. 31(2): 151-165 (1991)
1980 – 1989
- 1989
- [j1]Komei Fukuda, Akihisa Tamura:
Characterizations of *-families. J. Comb. Theory B 47(1): 107-110 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: