Hiroshi Narushima

According to our database, Hiroshi Narushima authored at least 9 papers between 1974 and 2004.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2004

Lattice-theoretic properties of MPR-posets in phylogeny.

Kampei Miyakawa, Hiroshi Narushima

Discret. Appl. Math., 2004

2002

On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization.

Hiroshi Narushima, Natalia Misheva

Discret. Appl. Math., 2002

1997

A More Efficient Algorithm for MPR Problems in Phylogeny.

Hiroshi Narushima, Masazumi Hanazawa

Discret. Appl. Math., 1997

1995

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

1988

A graph-theoretical characterization of the order complexes on the 2-sphere.

Takayuki Hibi, Hiroshi Narushima, Morimasa Tsuchiya, Kei-ichi Watanabe

Discret. Math., 1988

1982

Principle of inclusion-exclusion on partially ordered sets.

Hiroshi Narushima

Discret. Math., 1982

1978

A variant of inclusion-exclusion on semilattices.

Hiroshi Narushima, Hiroshi Era

Discret. Math., 1978

1976

A new normal form of Boolean functions.

Akio Odaka, Hiroaki Fujita, Susumu Nojima, Hiroshi Narushima

Discret. Math., 1976

1974

Principle of Inclusion-Exclusion on Semilattices.

Hiroshi Narushima

J. Comb. Theory A, 1974