The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Masao Iri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Masao Iri
    "Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint. [Citation Graph (0, 0)][DBLP]
    Graph Theory and Algorithms, 1980, pp:124-136 [Conf]
  2. Masao Iri, Junkichi Tsunekawa, Keiji Yajima
    The Graphical Techniques Used for a Chemical Process Simulator "JUSE GIFS". [Citation Graph (0, 0)][DBLP]
    IFIP Congress (2), 1971, pp:1150-1155 [Conf]
  3. Masao Iri
    How to Generate Realistic Sample Problems for Network Optimization. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:342-350 [Conf]
  4. Masao Iri, Hiroshi Imai
    A Multiplicative Barrier Function Method for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:4, pp:455-482 [Journal]
  5. Kokichi Sugihara, Masao Iri, Hiroshi Inagaki, T. Imai
    Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:1, pp:5-20 [Journal]
  6. Hiroshi Imai, Masao Iri
    Computational-geometric methods for polygonal approximations of a curve. [Citation Graph (0, 0)][DBLP]
    Computer Vision, Graphics, and Image Processing, 1986, v:36, n:1, pp:31-41 [Journal]
  7. Kokichi Sugihara, Masao Iri
    A robust Topology-Oriented Incremental algorithm for Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:2, pp:179-228 [Journal]
  8. Masao Iri, Kazuo Murota, Shouichi Matsui
    Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:4, pp:206-209 [Journal]
  9. Takao Ohya, Masao Iri, Kazuo Murota
    A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:4, pp:227-231 [Journal]
  10. Masao Iri
    A Proof of the Polynomiality of the Iri-Imai Method. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:2, pp:269-290 [Journal]
  11. Masao Iri
    Integrability of vector and multivector fields associated with interior point methods for linear programming. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:52, n:, pp:511-525 [Journal]
  12. K. Aoshima, Masao Iri
    Comments on F. Hadlock's Paper: ``Finding a Maximum Cut of a Planar Graph in Polynomial Time''. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:86-87 [Journal]
  13. Hiroshi Imai, Masao Iri, Kazuo Murota
    Voronoi Diagram in the Laguerre Geometry and its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:93-105 [Journal]

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002