Time-power-area tradeoffs for the nMOS VLSI full-adder. - Kazuo Iwano; Kenneth Steiglitz (ICASSP, 1985)

Optimization of one-bit full adders embedded in regular structures. - Kazuo Iwano; Kenneth Steiglitz (IEEE Trans. Acoust. Speech Signal Process., 1986)

Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract) - Kazuo Iwano; Kenneth Steiglitz (STOC, 1987)

Planarity testing of doubly periodic infinite graphs. - Kazuo Iwano; Kenneth Steiglitz (Networks, 1988)

An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm. - Kazuo Iwano (Inf. Process. Lett., 1989)

Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. - Hiroshi Imai; Kazuo Iwano (SIGAL International Symposium on Algorithms, 1990)

An Efficient Algorithm for Optimal Loop Parallelization. - Kazuo Iwano; Susan Yeh (SIGAL International Symposium on Algorithms, 1990)

A Semiring on Convex Polygons and Zero-Sum Cycle Problems. - Kazuo Iwano; Kenneth Steiglitz (SIAM J. Comput., 1990)

A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm. - Satoru Fujishige; Kazuo Iwano; J. Nakano; Shu Tezuka (Network Flows And Matching, 1991)

Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). - Naoki Katoh; Kazuo Iwano (WADS, 1991)

Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane. - Naoki Katoh; Kazuo Iwano (SCG, 1992)

How to Treat Delete Requests in Semi-Online Problems. - Yang Dai; Hiroshi Imai; Kazuo Iwano; Naoki Katoh (ISAAC, 1993)

Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree. - Kazuo Iwano; Naoki Katoh (Inf. Process. Lett., 1993)

The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. - Kazuo Iwano; Prabhakar Raghavan; Hisao Tamaki (ISAAC, 1994)

A New Scaling Algorithm for the Maximum Mean Cut Problem. - Kazuo Iwano; Shinji Misono; Shu Tezuka; Satoru Fujishige (Algorithmica, 1994)

Efficient algorithms for minimum range cut problems. - Naoki Katoh; Kazuo Iwano (Networks, 1994)

On Minimum and Maximum Spanning Trees of Linearly Moving Points. - Naoki Katoh; Takeshi Tokuyama; Kazuo Iwano (Discret. Comput. Geom., 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)

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)

A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. - Yang Dai; Kazuo Iwano; Naoki Katoh (Inf. Process. Lett., 1997)

New TSP Construction Heuristics and Their Relationships to the 2-Opt. - Hiroyuki Okano; Shinji Misono; Kazuo Iwano (J. Heuristics, 1999)

Finding Subsets Maximizing Minimum Structures. - Magnús M. Halldórsson; Kazuo Iwano; Naoki Katoh; Takeshi Tokuyama (SIAM J. Discret. Math., 1999)

Preface. - Lorraine Herger; Kazuo Iwano; Pratap Pattnaik; John J. Ritsko; Alfred G. Davis (IBM Syst. J., 2003)

Self-Adaptable Autonomic Computing Systems: An Industry View. - Wolfgang Gentzsch; Kazuo Iwano; Duncan Johnston-Watt; Mughees A. Minhas; Mazin S. Yousif (DEXA Workshops, 2005)

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 (Integrated Network Management, 2007)

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 (UbiComp/ISWC Adjunct, 2015)

Wisdom Service Systems: Harmonious Interactions Between People and Machine. - Md. Abul Kalam Siddike; Kazuo Iwano; Kazuyoshi Hidaka; Youji Kohda; Jim Spohrer (AHFE (17), 2017)