安藤和敏

发表

Representation of ultrametric minimum cost spanning tree games as cost allocation games on rooted trees (21世紀の数理計画--アルゴリズムとモデリング--RIMS研究集会報告集)

安藤和敏, 加藤慎士, 2010 .

Proper Bisubmodular Systems and Bidirected Flows

藤重悟, 内藤雄志, 安藤和敏, 1993 .

Extreme point axioms for closure spaces

安藤和敏, 安藤和敏, 2002 .

The greedy algorithm for a class of lattice polyhedra and its consequences

安藤和敏, 1999 .

closed Families and Signed Posets

藤重悟, 安藤和敏, 1994 .

A Greedy Algorithm for Minimizing a Separable Convex Function over an Integral Bisubmodular Polyhedron

藤重悟, 内藤雄志, 安藤和敏, 1993 .