Masao Iri

19 papers B 1Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2009 — ch.
Automatic Differentiation: Introduction, History and Rounding Error Estimation.
Encyclopedia of Optimization
Masao Iri, Koichi Kubota
2000 J jnl
Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms.
Algorithmica
Kokichi Sugihara, Masao Iri, Hiroshi Inagaki, Toshiyuki Imai
1994 J jnl
A robust Topology-Oriented Incremental algorithm for Voronoi diagrams.
Int. J. Comput. Geom. Appl.
Kokichi Sugihara, Masao Iri
1993 J jnl
A Proof of the Polynomiality of the Iri-Imai Method.
J. Complex.
Masao Iri
1992 J jnl
Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic.
Proc. IEEE
Kokichi Sugihara, Masao Iri
1992 B conf
How to Generate Realistic Sample Problems for Network Optimization.
ISAAC
Masao Iri
1991 J jnl
Integrability of vector and multivector fields associated with interior point methods for linear programming.
Math. Program.
Masao Iri
1987 J jnl
A very personal reminiscence on the problem of computational complexity.
Discret. Appl. Math.
Masao Iri
1987 J jnl
Preface.
Discret. Appl. Math.
Toshihide Ibaraki, Masao Iri
1986 J jnl
A Multiplicative Barrier Function Method for Linear Programming.
Algorithmica
Masao Iri, Hiroshi Imai
1986 J jnl
Computational-geometric methods for polygonal approximations of a curve.
Comput. Vis. Graph. Image Process.
Hiroshi Imai, Masao Iri
1985 J jnl
Voronoi Diagram in the Laguerre Geometry and its Applications.
SIAM J. Comput.
Hiroshi Imai, Masao Iri, Kazuo Murota
1984 J jnl
A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing.
Inf. Process. Lett.
Takao Ohya, Masao Iri, Kazuo Murota
1983 J jnl
Heuristics for planar minimum-weight perfect metchings.
Networks
Masao Iri, Kazuo Murota, Shouichi Matsui
1981 J jnl
Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane.
Inf. Process. Lett.
Masao Iri, Kazuo Murota, Shouichi Matsui
1980 — conf
"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint.
Graph Theory and Algorithms
Masao Iri
1980 J jnl
Network theory and transversal matroids.
Discret. Appl. Math.
András Recski, Masao Iri
1977 J jnl
Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time".
SIAM J. Comput.
K. Aoshima, Masao Iri
1971 — conf
The Graphical Techniques Used for a Chemical Process Simulator "JUSE GIFS".
IFIP Congress (2)
Masao Iri, Junkichi Tsunekawa, Keiji Yajima