The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kazuo Iwano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Naoki Katoh, Kazuo Iwano
    Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:320-329 [Conf]
  2. Wolfgang Gentzsch, Kazuo Iwano, Duncan Johnston-Watt, Mughees A. Minhas, Mazin S. Yousif
    Self-Adaptable Autonomic Computing Systems: An Industry View. [Citation Graph (0, 0)][DBLP]
    DEXA Workshops, 2005, pp:201-205 [Conf]
  3. Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano
    On Minimum and Maximum Spanning Trees of Linearly Moving Points [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:396-405 [Conf]
  4. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh
    How to Treat Delete Requests in Semi-Online Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:48-57 [Conf]
  5. Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki
    The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:29-37 [Conf]
  6. Hiroshi Imai, Kazuo Iwano
    Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:21-30 [Conf]
  7. Kazuo Iwano, Susan Yeh
    An Efficient Algorithm for Optimal Loop Parallelization. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:201-210 [Conf]
  8. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:150-159 [Conf]
  9. Kazuo Iwano, Kenneth Steiglitz
    Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:46-55 [Conf]
  10. Naoki Katoh, Kazuo Iwano
    Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:80-91 [Conf]
  11. Hiroyuki Okano, Shinji Misono, Kazuo Iwano
    New TSP Construction Heuristics and Their Relationships to the 2-Opt. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:150-159 [Conf]
  12. Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige
    A New Scaling Algorithm for the Maximum Mean Cut Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:243-255 [Journal]
  13. Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura
    A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:167-190 [Journal]
  14. Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano
    On Minimum and Maximum Spanning Trees of Linearly Moving Points. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:161-176 [Journal]
  15. Hiroyuki Okano, Shinji Misono, Kazuo Iwano
    New TSP Construction Heuristics and Their Relationships to the 2-Opt. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1999, v:5, n:1, pp:71-88 [Journal]
  16. Lorraine Herger, Kazuo Iwano, Pratap Pattnaik, John J. Ritsko, Alfred G. Davis
    Preface. [Citation Graph (0, 0)][DBLP]
    IBM Systems Journal, 2003, v:42, n:1, pp:3-4 [Journal]
  17. Naoki Katoh, Kazuo Iwano
    Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:37-51 [Journal]
  18. Yang Dai, Kazuo Iwano, Naoki Katoh
    A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:5, pp:255-261 [Journal]
  19. Kazuo Iwano
    An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:1, pp:25-27 [Journal]
  20. Kazuo Iwano, Naoki Katoh
    Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:5, pp:211-213 [Journal]
  21. Kazuo Iwano, Kenneth Steiglitz
    A Semiring on Convex Polygons and Zero-Sum Cycle Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:5, pp:883-901 [Journal]
  22. Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama
    Finding Subsets Maximizing Minimum Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:342-359 [Journal]
  23. Yoshikazu Satoh, Yuhsuke Kaneyasu, Jung-Kook Hong, Yuhichi Komatsu, Kazuo Iwano, Satoshi Tutiya, Tsuneo Katsuyama, Hiroshi Yoshida
    Applying Autonomic Computing with Open Standardized Resource Interface WSDM to Managing Multi-vendor IT Systems. [Citation Graph (0, 0)][DBLP]
    Integrated Network Management, 2007, pp:655-669 [Conf]

Search in 0.003secs, Finished in 0.004secs
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