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