Principle of Inclusion-Exclusion on Semilattices. - Hiroshi Narushima (J. Comb. Theory A, 1974)

A new normal form of Boolean functions. - Akio Odaka; Hiroaki Fujita; Susumu Nojima; Hiroshi Narushima (Discret. Math., 1976)

A variant of inclusion-exclusion on semilattices. - Hiroshi Narushima; Hiroshi Era (Discret. Math., 1978)

Principle of inclusion-exclusion on partially ordered sets. - Hiroshi Narushima (Discret. Math., 1982)

A graph-theoretical characterization of the order complexes on the 2-sphere. - Takayuki Hibi; Hiroshi Narushima; Morimasa Tsuchiya; Kei-ichi Watanabe (Discret. Math., 1988)

Generating Most Parsimonious Reconstructions on a Tree: A Generalization of the Farris-Swofford-Maddison Method. - Masazumi Hanazawa; Hiroshi Narushima; Nobuhiro Minaka (Discret. Appl. Math., 1995)

A More Efficient Algorithm for MPR Problems in Phylogeny. - Hiroshi Narushima; Masazumi Hanazawa (Discret. Appl. Math., 1997)

On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization. - Hiroshi Narushima; Natalia Misheva (Discret. Appl. Math., 2002)

Lattice-theoretic properties of MPR-posets in phylogeny. - Kampei Miyakawa; Hiroshi Narushima (Discret. Appl. Math., 2004)