Masao Iri - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2000

Topology-Oriented Implementation - An Approach to Robust Geometric AlgorithmsKokichi Sugihara, Masao Iri, Hiroshi Inagaki, T. Imai. algorithmica, 27(1):5-20, 2000. [doi]

1994

A robust Topology-Oriented Incremental algorithm for Voronoi diagramsKokichi Sugihara, Masao Iri. ijcga, 4(2):179-228, 1994.

1993

A Proof of the Polynomiality of the Iri-Imai MethodMasao Iri. jc, 9(2):269-290, 1993. [doi]

1992

How to Generate Realistic Sample Problems for Network OptimizationMasao Iri. isaac 1992: 342-350

Construction of the Voronoi diagram for 'one million' generators in single-precision arithmeticKokichi Sugihara, Masao Iri. pieee, 80(9):1471-1484, 1992. [doi]

1991

Integrability of vector and multivector fields associated with interior point methods for linear programmingMasao Iri. mp, 52:511-525, 1991.

1987

PrefaceToshihide Ibaraki, Masao Iri. DAM, 17(1-2):1-2, 1987. [doi]

A very personal reminiscence on the problem of computational complexityMasao Iri. DAM, 17(1-2):17-27, 1987. [doi]

1986

Computational-geometric methods for polygonal approximations of a curveHiroshi Imai, Masao Iri. cvgip, 36(1):31-41, 1986. [doi]

A Multiplicative Barrier Function Method for Linear ProgrammingMasao Iri, Hiroshi Imai. algorithmica, 1(4):455-482, 1986.

1985

Voronoi Diagram in the Laguerre Geometry and its ApplicationsHiroshi Imai, Masao Iri, Kazuo Murota. SICOMP, 14(1):93-105, 1985.

1984

A Fast Voronoi-Diagram Algorithm With Quaternary Tree BucketingTakao Ohya, Masao Iri, Kazuo Murota. ipl, 18(4):227-231, 1984.

1983

Heuristics for planar minimum-weight perfect metchingsMasao Iri, Kazuo Murota, Shouichi Matsui. networks, 13(1):67-92, 1983. [doi]

1981

Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a PlaneMasao Iri, Kazuo Murota, Shouichi Matsui. ipl, 12(4):206-209, 1981.

1980

Dualities in graph theory and the related fields viewed from the metatheoretical standpointMasao Iri. gta 1981: 124-136

Network theory and transversal matroidsAndrás Recski, Masao Iri. DAM, 2(4):311-326, 1980. [doi]

1977

Comments on F. Hadlock s Paper: Finding a Maximum Cut of a Planar Graph in Polynomial Time K. Aoshima, Masao Iri. SICOMP, 6(1):86-87, 1977.

1971

The Graphical Techniques Used for a Chemical Process Simulator JUSE GIFS Masao Iri, Junkichi Tsunekawa, Keiji Yajima. ifip 1971: 1150-1155

Sign in or sign up to see more results.

runs on WebDSL