Masao Iri

According to our database, Masao Iri authored at least 19 papers between 1971 and 2009.

Collaborative distances:

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

2009

Automatic Differentiation: Introduction, History and Rounding Error Estimation.

Masao Iri, Koichi Kubota

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2000

Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms.

Kokichi Sugihara, Masao Iri, Hiroshi Inagaki, Toshiyuki Imai

Algorithmica, 2000

1994

A robust Topology-Oriented Incremental algorithm for Voronoi diagrams.

Kokichi Sugihara, Masao Iri

Int. J. Comput. Geom. Appl., 1994

1993

A Proof of the Polynomiality of the Iri-Imai Method.

Masao Iri

J. Complex., 1993

1992

Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic.

Kokichi Sugihara, Masao Iri

Proc. IEEE, 1992

How to Generate Realistic Sample Problems for Network Optimization.

Masao Iri

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Integrability of vector and multivector fields associated with interior point methods for linear programming.

Masao Iri

Math. Program., 1991

1987

A very personal reminiscence on the problem of computational complexity.

Masao Iri

Discret. Appl. Math., 1987

Preface.

Toshihide Ibaraki, Masao Iri

Discret. Appl. Math., 1987

1986

Computational-geometric methods for polygonal approximations of a curve.

Hiroshi Imai, Masao Iri

Comput. Vis. Graph. Image Process., 1986

A Multiplicative Barrier Function Method for Linear Programming.

Masao Iri, Hiroshi Imai

Algorithmica, 1986

1985

Voronoi Diagram in the Laguerre Geometry and its Applications.

Hiroshi Imai, Masao Iri, Kazuo Murota

SIAM J. Comput., 1985

1984

A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing.

Takao Ohya, Masao Iri, Kazuo Murota

Inf. Process. Lett., 1984

1983

Heuristics for planar minimum-weight perfect metchings.

Masao Iri, Kazuo Murota, Shouichi Matsui

Networks, 1983

1981

Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane.

Masao Iri, Kazuo Murota, Shouichi Matsui

Inf. Process. Lett., 1981

1980

Network theory and transversal matroids.

András Recski, Masao Iri

Discret. Appl. Math., 1980

"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint.

Masao Iri

Proceedings of the Graph Theory and Algorithms, 1980

1977

Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time".

K. Aoshima, Masao Iri

SIAM J. Comput., 1977

1971

The Graphical Techniques Used for a Chemical Process Simulator "JUSE GIFS".

Masao Iri, Junkichi Tsunekawa, Keiji Yajima

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 2, 1971