default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasao Iri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[r1]Masao Iri, Koichi Kubota:
Automatic Differentiation: Introduction, History and Rounding Error Estimation. Encyclopedia of Optimization 2009: 153-159- 2000
- [j15]Kokichi Sugihara, Masao Iri, Hiroshi Inagaki, Toshiyuki Imai:
Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms. Algorithmica 27(1): 5-20 (2000)
1990 – 1999
- 1994
- [j14]Kokichi Sugihara, Masao Iri:
A robust Topology-Oriented Incremental algorithm for Voronoi diagrams. Int. J. Comput. Geom. Appl. 4(2): 179-228 (1994) - 1993
- [j13]Masao Iri:
A Proof of the Polynomiality of the Iri-Imai Method. J. Complex. 9(2): 269-290 (1993) - 1992
- [j12]Kokichi Sugihara, Masao Iri:
Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic. Proc. IEEE 80(9): 1471-1484 (1992) - [c3]Masao Iri:
How to Generate Realistic Sample Problems for Network Optimization. ISAAC 1992: 342-350 - 1991
- [j11]Masao Iri:
Integrability of vector and multivector fields associated with interior point methods for linear programming. Math. Program. 52: 511-525 (1991)
1980 – 1989
- 1987
- [j10]Toshihide Ibaraki, Masao Iri:
Preface. Discret. Appl. Math. 17(1-2): 1-2 (1987) - [j9]Masao Iri:
A very personal reminiscence on the problem of computational complexity. Discret. Appl. Math. 17(1-2): 17-27 (1987) - 1986
- [j8]Masao Iri, Hiroshi Imai:
A Multiplicative Barrier Function Method for Linear Programming. Algorithmica 1(4): 455-482 (1986) - [j7]Hiroshi Imai, Masao Iri:
Computational-geometric methods for polygonal approximations of a curve. Comput. Vis. Graph. Image Process. 36(1): 31-41 (1986) - 1985
- [j6]Hiroshi Imai, Masao Iri, Kazuo Murota:
Voronoi Diagram in the Laguerre Geometry and its Applications. SIAM J. Comput. 14(1): 93-105 (1985) - 1984
- [j5]Takao Ohya, Masao Iri, Kazuo Murota:
A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing. Inf. Process. Lett. 18(4): 227-231 (1984) - 1983
- [j4]Masao Iri, Kazuo Murota, Shouichi Matsui:
Heuristics for planar minimum-weight perfect metchings. Networks 13(1): 67-92 (1983) - 1981
- [j3]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
- [j2]András Recski, Masao Iri:
Network theory and transversal matroids. Discret. Appl. Math. 2(4): 311-326 (1980) - [c2]Masao Iri:
"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint. Graph Theory and Algorithms 1980: 124-136
1970 – 1979
- 1977
- [j1]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
- [c1]Masao Iri, Junkichi Tsunekawa, Keiji Yajima:
The Graphical Techniques Used for a Chemical Process Simulator "JUSE GIFS". IFIP Congress (2) 1971: 1150-1155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
