Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. - Kazutoshi Ando; Satoru Fujishige; Toshio Nemoto (Discret. Appl. Math., 1996)

A characterization of bisubmodular functions. - Kazutoshi Ando; Satoru Fujishige; Takeshi Naitoh (Discret. Math., 1996)

On structures of bisubmodular polyhedra. - Kazutoshi Ando; Satoru Fujishige (Math. Program., 1996)

K-submodular functions and convexity of their Lovász extension. - Kazutoshi Ando (Discret. Appl. Math., 2002)

Mobius Functions of Rooted Forests and Faigle-Kern's Dual Greedy Polyhedra. - Kazutoshi Ando (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Extreme point axioms for closure spaces. - Kazutoshi Ando (Discret. Math., 2006)

Strategy-proof and symmetric allocation of an indivisible good. - Kazutoshi Ando; Miki Kato; Shinji Ohseto (Math. Soc. Sci., 2008)

Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions. - Kazutoshi Ando; Ryosuke Inagaki; Kazuya Shoji (Discret. Appl. Math., 2017)

Monotonicity of minimum distance inefficiency measures for Data Envelopment Analysis. - Kazutoshi Ando; Masato Minamide; Kazuyuki Sekitani; Jianming Shi (Eur. J. Oper. Res., 2017)

Characterizing Cycle-Complete Dissimilarities in Terms of Associated Indexed 2-Hierarchies. - Kazutoshi Ando; Kazuya Shoji (COCOA, 2018)

An algorithm for finding a representation of a subtree distance. - Kazutoshi Ando; Koki Sato (J. Comb. Optim., 2018)

Optimal Algorithm to Reconstruct a Tree from a Subtree Distance. - Takanori Maehara; Kazutoshi Ando (CoRR, 2019)

Signed ring families and signed posets. - Kazutoshi Ando; Satoru Fujishige (Optim. Methods Softw., 2021)

Optimal Algorithm for Finding Representation of Subtree Distance. - Takanori Maehara; Kazutoshi Ando (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)