| 2009 |
|---|
| 14 | EE | Masao Iri,
Koichi Kubota:
Automatic Differentiation: Introduction, History and Rounding Error Estimation.
Encyclopedia of Optimization 2009: 153-159 |
| 2000 |
|---|
| 13 | EE | Kokichi Sugihara,
Masao Iri,
Hiroshi Inagaki,
T. Imai:
Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms.
Algorithmica 27(1): 5-20 (2000) |
| 1994 |
|---|
| 12 | | Kokichi Sugihara,
Masao Iri:
A robust Topology-Oriented Incremental algorithm for Voronoi diagrams.
Int. J. Comput. Geometry Appl. 4(2): 179-228 (1994) |
| 1993 |
|---|
| 11 | EE | Masao Iri:
A Proof of the Polynomiality of the Iri-Imai Method.
J. Complexity 9(2): 269-290 (1993) |
| 1992 |
|---|
| 10 | | Masao Iri:
How to Generate Realistic Sample Problems for Network Optimization.
ISAAC 1992: 342-350 |
| 1991 |
|---|
| 9 | | Masao Iri:
Integrability of vector and multivector fields associated with interior point methods for linear programming.
Math. Program. 52: 511-525 (1991) |
| 1986 |
|---|
| 8 | | Masao Iri,
Hiroshi Imai:
A Multiplicative Barrier Function Method for Linear Programming.
Algorithmica 1(4): 455-482 (1986) |
| 7 | EE | Hiroshi Imai,
Masao Iri:
Computational-geometric methods for polygonal approximations of a curve.
Computer Vision, Graphics, and Image Processing 36(1): 31-41 (1986) |
| 1985 |
|---|
| 6 | | Hiroshi Imai,
Masao Iri,
Kazuo Murota:
Voronoi Diagram in the Laguerre Geometry and its Applications.
SIAM J. Comput. 14(1): 93-105 (1985) |
| 1984 |
|---|
| 5 | | Takao Ohya,
Masao Iri,
Kazuo Murota:
A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing.
Inf. Process. Lett. 18(4): 227-231 (1984) |
| 1981 |
|---|
| 4 | | 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): 206-209 (1981) |
| 1980 |
|---|
| 3 | | Masao Iri:
"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint.
Graph Theory and Algorithms 1980: 124-136 |
| 1977 |
|---|
| 2 | | 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): 86-87 (1977) |
| 1971 |
|---|
| 1 | | Masao Iri,
Junkichi Tsunekawa,
Keiji Yajima:
The Graphical Techniques Used for a Chemical Process Simulator "JUSE GIFS".
IFIP Congress (2) 1971: 1150-1155 |
