The following pages link to Akihisa Tamura (Q180364):
Displaying 50 items.
- Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope (Q412368) (← links)
- Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions (Q495853) (← links)
- Characterizations of *-families (Q583220) (← links)
- Construction of Hamilton path tournament designs (Q659734) (← links)
- A theorem on the average number of subfaces in arrangements and oriented matroids (Q685218) (← links)
- On the existence of sports schedules with multiple venues (Q944723) (← links)
- Combinatorial face enumeration in arrangements and oriented matroids (Q1175785) (← links)
- Bounding the number of \(k\)-faces in arrangements of hyperplanes (Q1175787) (← links)
- Degree constrained tree embedding into points in the plane (Q1208443) (← links)
- Adjacency of the best and second best valued solutions in combinatorial optimization problems (Q1314336) (← links)
- The rooted tree embedding problem into points in the plane (Q1314442) (← links)
- Algorithms for finding a \(K\)th best valued assignment (Q1327213) (← links)
- An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane (Q1342092) (← links)
- EP theorems and linear complementarity problems (Q1392569) (← links)
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. (Q1410697) (← links)
- Application of M-convex submodular flow problem to mathematical economics (Q1433504) (← links)
- Designing matching mechanisms under constraints: an approach from discrete convex analysis (Q1757595) (← links)
- Applications of discrete convex analysis to mathematical economics (Q1769600) (← links)
- Coordinatewise domain scaling algorithm for M-convex function minimization (Q1771308) (← links)
- Transformation from arbitrary matchings to stable matchings (Q1803876) (← links)
- Proximity theorems of discrete convex functions (Q1881049) (← links)
- Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
- Matching with partially ordered contracts (Q1926642) (← links)
- Directed discrete midpoint convexity (Q2024598) (← links)
- Discrete Fenchel duality for a pair of integrally convex and separable convex functions (Q2135548) (← links)
- Integrality of subgradients and biconjugates of integrally convex functions (Q2300646) (← links)
- Scaling, proximity, and optimization of integrally convex functions (Q2414902) (← links)
- A general two-sided matching market with discrete concave utility functions (Q2492196) (← links)
- Discrete fixed point theorem reconsidered (Q2581298) (← links)
- Strategyproof allocation mechanisms with endowments and M-convex distributional constraints (Q2680800) (← links)
- Stability in supply chain networks: an approach by discrete convex analysis (Q2793586) (← links)
- On convolution of<i>L</i>-convex functions (Q3046544) (← links)
- ON A LABOR ALLOCATION MODEL WITH POSSIBLY BOUNDED SALARIES (Q3535160) (← links)
- (Q3653180) (← links)
- (Q3789578) (← links)
- A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD (Q3807876) (← links)
- (Q3840348) (← links)
- (Q3970245) (← links)
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs (Q4337655) (← links)
- (Q4363259) (← links)
- THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS (Q4366150) (← links)
- (Q4474070) (← links)
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH (Q4483540) (← links)
- (Q4538172) (← links)
- (Q4548800) (← links)
- Scaling and proximity properties of integrally convex functions (Q4636541) (← links)
- (Q4705042) (← links)
- (Q4737514) (← links)
- ON GROTSCHEL-LOVASZ-SCHRIJVER'S RELAXATION OF STABLE SET POLYTOPES (Q4797033) (← links)
- Discrete Midpoint Convexity (Q5108259) (← links)
