Masao Iri

According to our database1, Masao Iri authored at least 18 papers between 1971 and 2009.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 1989, "For contributions to theory of networks and its applications to circuit and system design.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Automatic Differentiation: Introduction, History and Rounding Error Estimation.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2000
Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms.
Algorithmica, 2000

1994
A robust Topology-Oriented Incremental algorithm for Voronoi diagrams.
Int. J. Comput. Geometry Appl., 1994

1993
A Proof of the Polynomiality of the Iri-Imai Method.
J. Complexity, 1993

1992
How to Generate Realistic Sample Problems for Network Optimization.
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.
Math. Program., 1991

1987
A very personal reminiscence on the problem of computational complexity.
Discrete Applied Mathematics, 1987

Preface.
Discrete Applied Mathematics, 1987

1986
Computational-geometric methods for polygonal approximations of a curve.
Computer Vision, Graphics, and Image Processing, 1986

A Multiplicative Barrier Function Method for Linear Programming.
Algorithmica, 1986

1985
Voronoi Diagram in the Laguerre Geometry and its Applications.
SIAM J. Comput., 1985

1984
A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing.
Inf. Process. Lett., 1984

1983
Heuristics for planar minimum-weight perfect metchings.
Networks, 1983

1981
Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane.
Inf. Process. Lett., 1981

1980
Network theory and transversal matroids.
Discrete Applied Mathematics, 1980

"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint.
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".
SIAM J. Comput., 1977

1971
The Graphical Techniques Used for a Chemical Process Simulator "JUSE GIFS".
Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 2, 1971


  Loading...