Kazuo Iwano

According to our database, Kazuo Iwano authored at least 27 papers between 1985 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Wisdom Service Systems: Harmonious Interactions Between People and Machine.

Md. Abul Kalam Siddike, Kazuo Iwano, Kazuyoshi Hidaka, Youji Kohda, Jim Spohrer

Proceedings of the Advances in The Human Side of Service Engineering, 2017

2015

Research area on intelligent systems creating co-experience knowledge and wisdom with human-machine "harmonious" collaboration.

Norihiro Hagita, Miwako Doi, Kazuo Iwano, Hideyuki Tokuda, Yukiko Horikawa

Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing and Proceedings of the 2015 ACM International Symposium on Wearable Computers, 2015

2007

Applying Autonomic Computing with Open Standardized Resource Interface WSDM to Managing Multi-vendor IT Systems.

Yoshikazu Satoh, Yuhsuke Kaneyasu, Jung-Kook Hong, Yuhichi Komatsu, Kazuo Iwano, Satoshi Tutiya, Tsuneo Katsuyama, Hiroshi Yoshida

Proceedings of the Integrated Network Management, 2007

2005

Self-Adaptable Autonomic Computing Systems: An Industry View.

Wolfgang Gentzsch, Kazuo Iwano, Duncan Johnston-Watt, Mughees A. Minhas, Mazin S. Yousif

Proceedings of the 16th International Workshop on Database and Expert Systems Applications (DEXA 2005), 2005

2003

Preface.

Lorraine Herger, Kazuo Iwano, Pratap Pattnaik, John J. Ritsko, Alfred G. Davis

IBM Syst. J., 2003

1999

Finding Subsets Maximizing Minimum Structures.

Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama

SIAM J. Discret. Math., 1999

New TSP Construction Heuristics and Their Relationships to the 2-Opt.

Hiroyuki Okano, Shinji Misono, Kazuo Iwano

J. Heuristics, 1999

1997

A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems.

Yang Dai, Kazuo Iwano, Naoki Katoh

Inf. Process. Lett., 1997

1996

A New Unifying Heuristic Algorithm for the Undirected Minimum Cut Problems Using Minimum Range Cut Algorithms.

Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh, Keiji Ohtsuka, Nobuhiko Yoshimura

Discret. Appl. Math., 1996

1995

Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane.

Naoki Katoh, Kazuo Iwano

Int. J. Comput. Geom. Appl., 1995

On Minimum and Maximum Spanning Trees of Linearly Moving Points.

Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano

Discret. Comput. Geom., 1995

1994

Efficient algorithms for minimum range cut problems.

Naoki Katoh, Kazuo Iwano

Networks, 1994

A New Scaling Algorithm for the Maximum Mean Cut Problem.

Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige

Algorithmica, 1994

The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection.

Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree.

Kazuo Iwano, Naoki Katoh

Inf. Process. Lett., 1993

How to Treat Delete Requests in Semi-Online Problems.

Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh

Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992

Finding <i>k</i> Farthest Pairs and <i>k</i> Closest/Farthest Bichromatic Pairs for Points in the Plane.

Naoki Katoh, Kazuo Iwano

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract).

Naoki Katoh, Kazuo Iwano

Proceedings of the Algorithms and Data Structures, 1991

A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm.

Satoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka

Proceedings of the Network Flows And Matching, 1991

1990

A Semiring on Convex Polygons and Zero-Sum Cycle Problems.

Kazuo Iwano, Kenneth Steiglitz

SIAM J. Comput., 1990

An Efficient Algorithm for Optimal Loop Parallelization.

Kazuo Iwano, Susan Yeh

Proceedings of the Algorithms, 1990

Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow.

Hiroshi Imai, Kazuo Iwano

Proceedings of the Algorithms, 1990

1989

An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm.

Kazuo Iwano

Inf. Process. Lett., 1989

1988

Planarity testing of doubly periodic infinite graphs.

Kazuo Iwano, Kenneth Steiglitz

Networks, 1988

1987

Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract)

Kazuo Iwano, Kenneth Steiglitz

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

Optimization of one-bit full adders embedded in regular structures.

Kazuo Iwano, Kenneth Steiglitz

IEEE Trans. Acoust. Speech Signal Process., 1986

1985

Time-power-area tradeoffs for the nMOS VLSI full-adder.

Kazuo Iwano, Kenneth Steiglitz

Proceedings of the IEEE International Conference on Acoustics, 1985