Enumerative approaches to combinatorial optimization T Ibaraki Annals of Operations Research 10, 1-602, 1987 | 222 | 1987 |

An optimal algorithm for scanning all spanning trees of undirected graphs A Shioura, A Tamura, T Uno SIAM Journal on Computing 26 (3), 678-692, 1997 | 137 | 1997 |

A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph D Nakamura, A Tamura Journal of the Operations Research Society of Japan 44 (2), 194-204, 2001 | 122 | 2001 |

応用数理計画ハンドブック 久保幹雄， 田村明久， 松井知己 Asakura Shoten, 2012 | 71 | 2012 |

The rooted tree embedding problem into points in the plane Y Ikebe, MA Perles, A Tamura, S Tokunaga Discrete & Computational Geometry 11 (1), 51-63, 1994 | 68 | 1994 |

New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities K Murota, A Tamura Discrete Applied Mathematics 131 (2), 495-512, 2003 | 65 | 2003 |

Designing matching mechanisms under general distributional constraints M Goto, F Kojima, R Kurata, A Tamura, M Yokoo American Economic Journal: Microeconomics 9 (2), 226-62, 2017 | 59 | 2017 |

A two-sided discrete-concave market with possibly bounded side payments: An approach by discrete convex analysis S Fujishige, A Tamura Mathematics of Operations Research 32 (1), 136-155, 2007 | 59 | 2007 |

A two-sided discrete-concave market with possibly bounded side payments: An approach by discrete convex analysis S Fujishige, A Tamura Mathematics of Operations Research 32 (1), 136-155, 2007 | 59 | 2007 |

Discrete fixed point theorem reconsidered T Iimura, K Murota, A Tamura Journal of Mathematical Economics 41 (8), 1030-1036, 2005 | 56 | 2005 |

Gross substitutes condition and discrete concavity for multi-unit valuations: a survey A Shioura, A Tamura Journal of the Operations Research Society of Japan 58 (1), 61-103, 2015 | 46 | 2015 |

Designing matching mechanisms under constraints: An approach from discrete convex analysis F Kojima, A Tamura, M Yokoo Journal of Economic Theory 176, 803-833, 2018 | 42 | 2018 |

Efficiently scanning all spanning trees of an undirected graph A Shioura, A Tamura Journal of the Operations Research Society of Japan 38 (3), 331-344, 1995 | 41 | 1995 |

最適化法 田村明久， 村松正和 工学系数学講座 17, 1-6, 2002 | 40 | 2002 |

A general two-sided matching market with discrete concave utility functions S Fujishige, A Tamura Discrete Applied Mathematics 154 (6), 950-970, 2006 | 39 | 2006 |

Application of M-convex submodular flow problem to mathematical economics K Murota, A Tamura Japan Journal of Industrial and Applied Mathematics 20 (3), 257-277, 2003 | 35 | 2003 |

Combinatorial face enumeration in arrangements and oriented matroids K Fukuda, S Saito, A Tamura Discrete applied mathematics 31 (2), 141-149, 1991 | 34 | 1991 |

EP theorems and linear complementarity problems K Fukuda, M Namiki, A Tamura Discrete Applied Mathematics 84 (1-3), 107-119, 1998 | 33 | 1998 |

Designing matching mechanisms under constraints: An approach from discrete convex analysis F Kojima, A Tamura, M Yokoo | 32 | 2014 |

Coordinatewise domain scaling algorithm for M-convex function minimization A Tamura Mathematical programming 102 (2), 339-354, 2005 | 31 | 2005 |