Masao Iri

Publication Activity (10 Years)

Years Active: 1971-2000
Publications (10 Years): 0

Publications

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