default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuo Iwano
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c16]Md. Abul Kalam Siddike
, Kazuo Iwano, Kazuyoshi Hidaka, Youji Kohda, Jim Spohrer:
Wisdom Service Systems: Harmonious Interactions Between People and Machine. AHFE (17) 2017: 115-127- 2015
- [c15]Norihiro Hagita, Miwako Doi, Kazuo Iwano, Hideyuki Tokuda, Yukiko Horikawa:
Research area on intelligent systems creating co-experience knowledge and wisdom with human-machine "harmonious" collaboration. UbiComp/ISWC Adjunct 2015: 897-898
2000 – 2009
- 2007
- [c14]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
- [c13]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
- [j14]Lorraine Herger, Kazuo Iwano, Pratap Pattnaik, John J. Ritsko, Alfred G. Davis:
Preface. IBM Syst. J. 42(1): 3-4 (2003)
1990 – 1999
- 1999
- [j13]Hiroyuki Okano, Shinji Misono, Kazuo Iwano:
New TSP Construction Heuristics and Their Relationships to the 2-Opt. J. Heuristics 5(1): 71-88 (1999) - [j12]Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures. SIAM J. Discret. Math. 12(3): 342-359 (1999) - 1997
- [j11]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) - [c12]Hiroyuki Okano, Shinji Misono, Kazuo Iwano:
New TSP Construction Heuristics and Their Relationships to the 2-Opt. WADS 1997: 150-159 - 1996
- [j10]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. Discret. Appl. Math. 65(1-3): 167-190 (1996) - 1995
- [j9]Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano:
On Minimum and Maximum Spanning Trees of Linearly Moving Points. Discret. Comput. Geom. 13: 161-176 (1995) - [j8]Naoki Katoh, Kazuo Iwano:
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane. Int. J. Comput. Geom. Appl. 5: 37-51 (1995) - [c11]Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures. SODA 1995: 150-159 - 1994
- [j7]Kazuo Iwano, Shinji Misono, Shu Tezuka, Satoru Fujishige:
A New Scaling Algorithm for the Maximum Mean Cut Problem. Algorithmica 11(3): 243-255 (1994) - [j6]Naoki Katoh, Kazuo Iwano:
Efficient algorithms for minimum range cut problems. Networks 24(7): 395-407 (1994) - [c10]Kazuo Iwano, Prabhakar Raghavan, Hisao Tamaki:
The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection. ISAAC 1994: 29-37 - 1993
- [j5]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) - [c9]Yang Dai, Hiroshi Imai, Kazuo Iwano, Naoki Katoh:
How to Treat Delete Requests in Semi-Online Problems. ISAAC 1993: 48-57 - 1992
- [c8]Naoki Katoh, Kazuo Iwano:
Finding k Farthest Pairs and k Closest/Farthest Bichromatic Pairs for Points in the Plane. SCG 1992: 320-329 - [c7]Naoki Katoh, Takeshi Tokuyama, Kazuo Iwano:
On Minimum and Maximum Spanning Trees of Linearly Moving Points. FOCS 1992: 396-405 - 1991
- [c6]Satoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka:
A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm. Network Flows And Matching 1991: 219-245 - [c5]Naoki Katoh, Kazuo Iwano:
Efficient Algorithms for the Minimum Range Cut Problem (Extended Abstract). WADS 1991: 80-91 - 1990
- [j4]Kazuo Iwano, Kenneth Steiglitz:
A Semiring on Convex Polygons and Zero-Sum Cycle Problems. SIAM J. Comput. 19(5): 883-901 (1990) - [c4]Hiroshi Imai, Kazuo Iwano:
Efficient Sequential and Parallel Algorithms for Planar Minimum Cost Flow. SIGAL International Symposium on Algorithms 1990: 21-30 - [c3]Kazuo Iwano, Susan Yeh:
An Efficient Algorithm for Optimal Loop Parallelization. SIGAL International Symposium on Algorithms 1990: 201-210
1980 – 1989
- 1989
- [j3]Kazuo Iwano:
An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm. Inf. Process. Lett. 32(1): 25-27 (1989) - 1988
- [j2]Kazuo Iwano, Kenneth Steiglitz:
Planarity testing of doubly periodic infinite graphs. Networks 18(3): 205-222 (1988) - 1987
- [c2]Kazuo Iwano, Kenneth Steiglitz:
Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract). STOC 1987: 46-55 - 1986
- [j1]Kazuo Iwano, Kenneth Steiglitz:
Optimization of one-bit full adders embedded in regular structures. IEEE Trans. Acoust. Speech Signal Process. 34(5): 1289-1300 (1986) - 1985
- [c1]Kazuo Iwano, Kenneth Steiglitz:
Time-power-area tradeoffs for the nMOS VLSI full-adder. ICASSP 1985: 1453-1456
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
