Kazuo Iwama

	2012
182		Kazuo Iwama: Approximability of Stable Matching Problems. WALCOM 2012: 2
181		Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita: Reconstructing Strings from Substrings with Quantum Queries CoRR abs/1204.4691: (2012)
180		David Avis, Kazuo Iwama, Daichi Paku: Reputation Games for Undirected Graphs CoRR abs/1205.6683: (2012)
179		Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Improved approximation bounds for the Student-Project Allocation problem with preferences over projects. J. Discrete Algorithms 13: 59-66 (2012)
	2011
178		Koki Hamada, Kazuo Iwama, Shuichi Miyazaki: The Hospitals/Residents Problem with Quota Lower Bounds. ESA 2011: 180-191
177		David Avis, Kazuo Iwama, Daichi Paku: Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs. ISAAC 2011: 415-424
176		Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over Projects. TAMC 2011: 440-451
175		Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi: Average-case competitive analyses for one-way trading. J. Comb. Optim. 21(1): 83-107 (2011)
174		Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec: A randomized algorithm for two servers in cross polytope spaces. Theor. Comput. Sci. 412(7): 563-572 (2011)
	2010
173		Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties. ESA (2) 2010: 135-146
172		Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki: Improved Randomized Algorithms for 3-SAT. ISAAC (1) 2010: 73-84
171		Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama: Quantum Counterfeit Coin Problems. ISAAC (1) 2010: 85-96
170		Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Approximation algorithms for the sex-equal stable marriage problem. ACM Transactions on Algorithms 7(1): 2 (2010)
169		David Manlove, Robert W. Irving, Kazuo Iwama: Guest Editorial: Special Issue on Matching Under Preferences. Algorithmica 58(1): 1-4 (2010)
168		Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama: Quantum Counterfeit Coin Problems CoRR abs/1009.0416: (2010)
167		Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki: The Planar Hajós Calculus for Bounded Degree Graphs. IEICE Transactions 93-A(6): 1000-1007 (2010)
166		Kazuo Iwama, Guochuan Zhang: Online knapsack with resource augmentation. Inf. Process. Lett. 110(22): 1016-1020 (2010)
165		Kazuo Iwama, Kazuhisa Seto, Suguru Tamaki: The complexity of the Hajós calculus for planar graphs. Theor. Comput. Sci. 411(7-9): 1182-1191 (2010)
	2009
164		Rusins Freivalds, Kazuo Iwama: Quantum Queries on Permutations with a Promise. CIAA 2009: 208-216
163		Hiro Ito, Kazuo Iwama: Enumeration of isolated cliques and pseudo-cliques. ACM Transactions on Algorithms 5(4): (2009)
162		Kazuo Iwama, Hiroki Morizumi, Jun Tarui: Negation-Limited Complexity of Parity and Inverters. Algorithmica 54(2): 256-267 (2009)
161		Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita: Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size CoRR abs/0908.2468: (2009)
160		Koki Hamada, Kazuo Iwama, Shuichi Miyazaki: An improved approximation lower bound for finding almost stable maximum matchings. Inf. Process. Lett. 109(18): 1036-1040 (2009)
159		Kazuo Iwama, Eiji Miyano, Hirotaka Ono: Drawing Borders Efficiently. Theory Comput. Syst. 44(2): 230-244 (2009)
	2008
158		Hiroshi Fujiwara, Kazuo Iwama, Yoshiyuki Sekiguchi: Average-Case Competitive Analyses for One-Way Trading. COCOON 2008: 41-51
157		Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara: Randomized Competitive Analysis for Two-Server Problems. ESA 2008: 161-172
156		Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita: Polynomial-Time Construction of Linear Network Coding. ICALP (1) 2008: 271-282
155		Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita: Quantum Query Complexity of Boolean Functions with Small On-Sets. ISAAC 2008: 907-918
154		Kazuo Iwama: SAT, UNSAT and Coloring. SAT 2008: 153
153		Kazuo Iwama: Local Search Algorithms for kSAT. Encyclopedia of Algorithms 2008
152		Kazuo Iwama, Shuichi Miyazaki: Stable Marriage with Ties and Incomplete Lists. Encyclopedia of Algorithms 2008
151		Kazuo Iwama, Andrzej Lingas, Masaki Okita: Max-Stretch Reduction for Tree Spanners. Algorithmica 50(2): 223-235 (2008)
150		Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi: A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. Algorithmica 51(3): 342-356 (2008)
149		Kazuo Iwama: Editor's Foreword. Algorithms 1(1): 1 (2008)
148		Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara: Randomized Competitive Analysis for Two Server Problems. Algorithms 1(1): 30-42 (2008)
147		Xin Han, Kazuo Iwama, Guochuan Zhang: On Two Dimensional Orthogonal Knapsack Problem CoRR abs/0803.4260: (2008)
146		Kazuo Iwama, Suguru Tamaki: The Complexity of the Hajos Calculus for Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 15(011): (2008)
145		Youichi Hanatani, Takashi Horiyama, Kazuo Iwama, Suguru Tamaki: New Graph Calculi for Planar Non-3-Colorable Graphs. IEICE Transactions 91-A(9): 2301-2307 (2008)
144		Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa: Online chasing problems for regular polygons. Inf. Process. Lett. 108(3): 155-159 (2008)
143		Kazuo Iwama, Hiroki Morizumi, Jun Tarui: Reductions for monotone Boolean circuits. Theor. Comput. Sci. 408(2-3): 208-212 (2008)
142		Xin Han, Kazuo Iwama, Guochuan Zhang: Online Removable Square Packing. Theory Comput. Syst. 43(1): 38-55 (2008)
	2007
141		Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas: Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. AAIM 2007: 337-345
140		Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang: Strip Packing vs. Bin Packing. AAIM 2007: 358-367
139		Kazuo Iwama, Guochuan Zhang: Optimal Resource Augmentations for Online Knapsack. APPROX-RANDOM 2007: 180-188
138		Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hsueh-I Lu: Flow Time Minimization under Energy Constraints. ASP-DAC 2007: 866-871
137		Kazuo Iwama, Takuya Nakashima: An Improved Exact Algorithm for Cubic Graph TSP. COCOON 2007: 108-117
136		Xiaotie Deng, Kazuo Iwama, Qi Qi, Aries Wei Sun, Toyotaka Tasaka: Properties of Symmetric Incentive Compatible Auctions. COCOON 2007: 264-273
135		Kazuo Iwama, Eiji Miyano, Hirotaka Ono: Drawing Borders Efficiently. FUN 2007: 213-226
134		Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita: Unbounded-Error One-Way Classical and Quantum Communication Complexity. ICALP 2007: 110-121
133		Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita: Unbounded-Error Classical and Quantum Communication Complexity. ISAAC 2007: 100-111
132		Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa: Online Chasing Problems for Regular n-Gons. RIVF 2007: 36-41
131		Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang: Harmonic algorithm for 3-dimensional strip packing problem. SODA 2007: 1197-1206
130		Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi: A 1.875: approximation algorithm for the stable marriage problem. SODA 2007: 288-297
129		Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita: Quantum Network Coding. STACS 2007: 610-621
128		Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Approximation Algorithms for the Sex-Equal Stable Marriage Problem. WADS 2007: 201-213
127		Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec: A Randomized Algorithm for Two Servers in Cross Polytope Spaces. WAOA 2007: 246-259
126		Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Improved approximation results for the stable marriage problem. ACM Transactions on Algorithms 3(3): (2007)
125		Kazuo Iwama, Suguru Tamaki: Exploiting partial knowledge of satisfying assignments. Discrete Applied Mathematics 155(12): 1596-1603 (2007)
124		Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita: Improved algorithms for quantum identification of Boolean oracles. Theor. Comput. Sci. 378(1): 41-53 (2007)
	2006
123		Masahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita: Quantum Network Coding. Complexity of Boolean Functions 2006
122		Kazuo Iwama: Stable Matching Problems. ISAAC 2006: 1
121		Kazuo Iwama, Hiroki Morizumi, Jun Tarui: Negation-Limited Complexity of Parity and Inverters. ISAAC 2006: 223-232
120		Takashi Horiyama, Kazuo Iwama, Jun Kawahara: Finite-State Online Algorithms and Their Automated Competitive Analysis. ISAAC 2006: 71-80
119		Kazuo Iwama, Hiroki Morizumi: Reductions for Monotone Boolean Circuits. MFCS 2006: 540-548
118		Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita: Improved Algorithms for Quantum Identification of Boolean Oracles. SWAT 2006: 280-291
117		Kazuo Iwama: Classic and Quantum Network Coding. SWAT 2006: 3-4
116		Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang: Strip Packing vs. Bin Packing CoRR abs/cs/0607046: (2006)
115		Xin Han, Kazuo Iwama, Guochuan Zhang: New Upper Bounds on The Approximability of 3D Strip Packing CoRR abs/cs/0607100: (2006)
114		Youichi Hanatani, Takashi Horiyama, Kazuo Iwama: Density condensation of Boolean formulas. Discrete Applied Mathematics 154(16): 2263-2270 (2006)
113		Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang: Strip Packing vs. Bin Packing. Electronic Colloquium on Computational Complexity (ECCC) 13(112): (2006)
112		Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Efficient Methods for Determining DNA Probe Orders. IEICE Transactions 89-A(5): 1292-1298 (2006)
111		Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto: A (2 - clog N/N)-Approximation Algorithm for the Stable Marriage Problem. IEICE Transactions 89-D(8): 2380-2387 (2006)
110		Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji: Approximated Vertex Cover for Graphs with Perfect Matchings. IEICE Transactions 89-D(8): 2405-2410 (2006)
109		Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita: Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. 97(5): 208-211 (2006)
	2005
108		Hiroshi Fujiwara, Kazuo Iwama: Average-Case Competitive Analyses for Ski-Rental Problems. Algorithms for Optimization with Incomplete Information 2005
107		Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi: Linear-Time Enumeration of Isolated Cliques. ESA 2005: 119-130
106		Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga: The Delayed k-Server Problem. FCT 2005: 281-292
105		Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi: A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. ISAAC 2005: 902-914
104		Kazuo Iwama: Classic and Quantum Network Coding. ISPAN 2005: 10
103		Tomokazu Imamura, Kazuo Iwama: Approximating vertex cover on dense graphs. SODA 2005: 582-589
102		Kazuo Iwama, Andrzej Lingas, Masaki Okita: Max-stretch Reduction for Tree Spanners. WADS 2005: 122-133
101		Xin Han, Kazuo Iwama, Guochuan Zhang: Online Removable Square Packing. WAOA 2005: 216-229
100		Hiroshi Fujiwara, Kazuo Iwama: Average-Case Competitive Analyses for Ski-Rental Problems. Algorithmica 42(1): 95-107 (2005)
99		Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita: Quantum Sampling for Balanced Allocations. IEICE Transactions 88-D(1): 39-46 (2005)
98		Kazuo Iwama, Akinori Kawachi: Compact Routing with Stretch Factor of Less Than Three. IEICE Transactions 88-D(1): 47-52 (2005)
97		Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Single backup table schemes for shortest-path routing. Theor. Comput. Sci. 333(3): 347-353 (2005)
	2004
96		Tomokazu Imamura, Kazuo Iwama, Tatsuie Tsukiji: Approximated Vertex Cover for Graphs with Perfect Matchings. COCOON 2004: 132-142
95		Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Imperfectness of Data for STS-Based Physical Mapping. IFIP TCS 2004: 279-292
94		Kazuo Iwama, Akinori Kawachi: Approximated Two Choices in Randomized Load Balancing. ISAAC 2004: 545-557
93		Kazuo Iwama, Suguru Tamaki: Improved upper bounds for 3-SAT. SODA 2004: 328
92		Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita: Quantum Identification of Boolean Oracles. STACS 2004: 105-116
91		Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto: A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem. SWAT 2004: 349-361
90		Kazuo Iwama: Worst-Case Upper Bounds for kSAT (Column: Algorithmics). Bulletin of the EATCS 82: 61-71 (2004)
89		Kazuo Iwama, Kouki Yonezawa: The orthogonal CNN problem. Inf. Process. Lett. 90(3): 115-120 (2004)
88		Toshiyuki Fujiwara, Kazuo Iwama, Chuzo Iwamoto: Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs. J. Parallel Distrib. Comput. 64(3): 319-326 (2004)
87		Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Randomized approximation of the stable marriage problem. Theor. Comput. Sci. 325(3): 439-465 (2004)
	2003
86		Kazuo Iwama, Akinori Kawachi, Shigeru Yamashita: Quantum Sampling for Balanced Allocations. COCOON 2003: 304-318
85		Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Randomized Approximation of the Stable Marriage Problem. COCOON 2003: 339-350
84		Kazuo Iwama, Masaki Okita: Compact Routing for Flat Networks. DISC 2003: 196-210
83		Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Improved Approximation of the Stable Marriage Problem. ESA 2003: 266-277
82		Youichi Hanatani, Takashi Horiyama, Kazuo Iwama: Density Condensation of Boolean Formulas. SAT 2003: 69-77
81		Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Polynomial-Time Computable Backup Tables for Shortest-Path Routing. SIROCCO 2003: 163-177
80		Kazuo Iwama, Suguru Tamaki: Improved Upper Bounds for 3-SAT Electronic Colloquium on Computational Complexity (ECCC)(053): (2003)
79		Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura: Inclusion-exclusion for k-CNF formulas. Inf. Process. Lett. 87(2): 111-117 (2003)
78		Kazuo Iwama, Shigeru Yamashita: Transformation Rules for CNOT-based Quantum Circuits and Their Applications. New Generation Comput. 21(4): 297-317 (2003)
77		Kazuo Iwama, Akinori Kawachi: A New Quantum Claw-finding Algorithm for Three Functions. New Generation Comput. 21(4): 319-327 (2003)
76		Kazuo Iwama, Akihiro Matsuura, Mike Paterson: A family of NFAs which need 2n- deterministic states. Theor. Comput. Sci. 1-3(301): 451-462 (2003)
75		Magnús M. Halldórsson, Robert W. Irving, Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita, Sandy Scott: Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1-3): 431-447 (2003)
74		Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. Theory Comput. Syst. 36(6): 597-609 (2003)
	2002
73		Kazuo Iwama, Yahiko Kambayashi, Shigeru Yamashita: Transformation rules for designing CNOT-based quantum circuits. DAC 2002: 419-424
72		Kazuo Iwama, Shiro Taketomi: Removable Online Knapsack Problems. ICALP 2002: 293-305
71		Hiroshi Fujiwara, Kazuo Iwama: Average-Case Competitive Analyses for Ski-Rental Problems. ISAAC 2002: 476-488
70		Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita: Inapproximability Results on Stable Marriage Problems. LATIN 2002: 554-568
69		Kazuo Iwama, Hiroki Morizumi: An Explicit Lower Bound of 5n - o(n) for Boolean Circuits. MFCS 2002: 353-364
68		Kazuo Iwama, Masaki Okita: Compact routing for average-case networks. PODC 2002: 255
67		Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro: Avoiding Routing Loops on the Internet. SIROCCO 2002: 197-210
66		Masami Amano, Kazuo Iwama, Raymond H. Putra: Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations. UMC 2002: 100-114
65		Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto: Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. ACM Journal of Experimental Algorithmics 7: 2 (2002)
64		Yuichi Asahiro, Refael Hassin, Kazuo Iwama: Complexity of finding dense subgraphs. Discrete Applied Mathematics 121(1-3): 15-26 (2002)
63		David Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita: Hard variants of stable marriage. Theor. Comput. Sci. 276(1-2): 261-279 (2002)
62		Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi: Online independent sets. Theor. Comput. Sci. 289(2): 953-962 (2002)
	2001
61		Kazuo Iwama, Suguru Tamaki: Exploiting Partial Knowledge of Satisfying Assignments. Algorithm Engineering 2001: 118-128
60		Kazuo Iwama, Yasuo Okabe, Toshiro Takase: Separating Oblivious and Non-oblivious BPs. COCOON 2001: 28-38
59		Kazuo Iwama, Eiji Miyano: A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. J. Algorithms 39(2): 145-161 (2001)
58		Kazuo Iwama, Eiji Miyano: An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. J. Algorithms 41(2): 262-279 (2001)
57		Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano: New Bounds for Oblivious Mesh Routing. J. Graph Algorithms Appl. 5(5): 17-38 (2001)
56		Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki: Efficient randomized routing algorithms on the two-dimensional mesh of buses. Theor. Comput. Sci. 261(2): 227-239 (2001)
	2000
55		Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto: Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. Algorithm Engineering 2000: 123-134
54		Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi: Online Independent Sets. COCOON 2000: 202-209
53		Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda: Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits. ISAAC 2000: 204-215
52		Kazuo Iwama, Akihiro Matsuura, Mike Paterson: A Family of NFA's Which Need 2n -alpha Deterministic States. MFCS 2000: 436-445
51		Kazuo Iwama, Akinori Kawachi: Compact routing with stretch factor of less than three (brief announcement). PODC 2000: 337
50		Kazuo Iwama, Eiji Miyano: A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. SPAA 2000: 186-195
49		Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama: Greedily Finding a Dense Subgraph. J. Algorithms 34(2): 203-221 (2000)
48		Kazuo Iwama, Eiji Miyano: Oblivious Routing Algorithms on the Mesh of Buses. J. Parallel Distrib. Comput. 60(2): 137-149 (2000)
47		Kazuo Iwama, Yahiko Kambayashi, Kazuya Takaki: Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs. Theor. Comput. Sci. 237(1-2): 485-494 (2000)
	1999
46		Kazuo Iwama, Kouki Yonezawa: Using Generalized Forecasts for Online Currency Conversion. COCOON 1999: 409-421
45		Kazuo Iwama, Eiji Miyano: Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. ESA 1999: 53-64
44		Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita: Stable Marriage with Incomplete Lists and Ties. ICALP 1999: 443-452
43		Kazuo Iwama, Shuichi Miyazaki: Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle. ISAAC 1999: 133-142
42		Kazuo Iwama, Eiji Miyano: An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size. SODA 1999: 466-475
41		Masami Amano, Kazuo Iwama: Undecidability on Quantum Finite Automata. STOC 1999: 368-375
40		Shuichi Miyazaki, Kazuo Iwama: Approximation of coNP sets by NP-complete sets and its applications. Systems and Computers in Japan 30(7): 47-54 (1999)
	1998
39		Kazuo Iwama, Eiji Miyano, Satoshi Tajima, Hisao Tamaki: Efficient Randomized Routing Algorithms on the Two-Dimensional Mesh of Buses. COCOON 1998: 229-240
38		Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano: New Bounds for Oblivious Mesh Routing. ESA 1998: 295-306
37		Kazuo Iwama, Chuzo Iwamoto: Improved Time and Space Hierarchies of One-Tape Off-Line TMs. MFCS 1998: 580-588
36		Kazuo Iwama, Mitsushi Nouzoe, Shuzo Yajima: Optimizing OBDDs Is Still Intractable for Monotone Functions. MFCS 1998: 625-635
35		Kazuo Iwama, Eiji Miyano: Better Approximations of Non-Hamiltonian Graphs. Discrete Applied Mathematics 81(1-3): 239-261 (1998)
34		Kazuo Iwama, Chuzo Iwamoto: A Canonical Form of Vector Machines. Inf. Comput. 141(1): 37-65 (1998)
	1997
33		Byungki Cha, Kazuo Iwama, Yahiko Kambayashi, Shuichi Miyazaki: Local Search Algorithms for Partial MAXSAT. AAAI/IAAI 1997: 263-268
32		Kazuo Iwama, Kazuya Takaki: Tight Bounds on the Number of States of DFA's That Are Equivalent to n-state NFA's. Developments in Language Theory 1997: 147-154
31		Kazuo Iwama, Kensuke Hino, Hiroyuki Kurokawa, Sunao Sawada: Random benchmark circuits with controlled attributes. ED&TC 1997: 90-97
30		Kazuo Iwama, Eiji Miyano: Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing. ESA 1997: 284-295
29		Kazuo Iwama, Eiji Miyano: Oblivious Routing Algorithms on the Mesh of Buses. IPPS 1997: 721-727
28		Kazuo Iwama: Complexity of Finding Short Resolution Proofs. MFCS 1997: 309-318
27		Kazuo Iwama, Chuzo Iwamoto, T. Ohsawa: A Faster Parallel Algorithm for k-Connectivity. Inf. Process. Lett. 61(5): 265-269 (1997)
	1996
26		Byungki Cha, Kazuo Iwama: Adding New Clauses for Faster Local Search. AAAI/IAAI, Vol. 1 1996: 332-337
25		Shuichi Miyazaki, Kazuo Iwama, Yahiko Kambayashi: Database Queries as Combinatorial Optimization Problems. CODAS 1996: 477-483
24		Kazuo Iwama, Chuzo Iwamoto: Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. IEEE Conference on Computational Complexity 1996: 24-32
23		Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama: Greedily Finding a Dense Subgraph. SWAT 1996: 136-148
22		Kazuo Iwama, Chuzo Iwamoto: alpha-Connectivity: A Gradually Nonparallel Graph Problem. J. Algorithms 20(3): 526-544 (1996)
21		Kazuo Iwama, Eiji Miyano, Yahiko Kambayashi: Routing Problems on the Mesh of Buses. J. Algorithms 20(3): 613-631 (1996)
20		Kazuo Iwama, Chuzo Iwamoto, Manzur Morshed: Time Lower Bounds do not Exist for CRCW PRAMs. Theor. Comput. Sci. 155(2): 411-424 (1996)
	1995
19		Kazuo Iwama, Shuichi Miyazaki: Approximation of coNP Sets by NP-complete Sets. COCOON 1995: 11-20
18		Byungki Cha, Kazuo Iwama: Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas. IJCAI 1995: 304-311
17		Yuichi Asahiro, Kazuo Iwama: Finding Dense Subgraphs. ISAAC 1995: 102-111
16		Kazuo Iwama, Eiji Miyano: Intractability of Read-Once Resolution. Structure in Complexity Theory Conference 1995: 29-36
15		Kazuo Iwama, Toniann Pitassi: Exponential Lower Bounds for the Tree-Like Hajós Calculus. Inf. Process. Lett. 54(5): 289-294 (1995)
	1994
14		Kazuo Iwama, Kensuke Hino: Random Generation of Test Instances for Logic Optimizers. DAC 1994: 430-434
13		Kazuo Iwama, Shuichi Miyazaki: SAT-Varible Complexity of Hard Combinatorial Problems. IFIP Congress (1) 1994: 253-258
12		Chuzo Iwamoto, Kazuo Iwama: Extended Graph Connectivity and Its Gradually Increasing Parallel Complexity. ISAAC 1994: 478-486
11		Kazuo Iwama, Yahiko Kambayashi: A Simpler Parallel Algorithm for Graph Conectivity. J. Algorithms 16(2): 190-217 (1994)
	1993
10		Kazuo Iwama: Low-Level Tradeoffs between Reversals and Alternations. Developments in Language Theory 1993: 326-341
9		Kazuo Iwama: ASPACE(o(log log n)) is Regular. SIAM J. Comput. 22(1): 136-146 (1993)
	1992
8		Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings Springer 1992
7		Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano: Random Generation of Satisfiable and Unsatisfiable CNF Predicates. IFIP Congress (1) 1992: 322-328
6		Kazuo Iwama, Eiji Miyano: Routing Problems on the Mesh of Buses. ISAAC 1992: 155-164
	1989
5		Kazuo Iwama, Yahiko Kambayashi: An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses. IFIP Congress 1989: 305-310
4		Kazuo Iwama: CNF Satisfiability Test by Counting and Polynomial Average Time. SIAM J. Comput. 18(2): 385-391 (1989)
	1983
3		Kazuo Iwama: Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication STOC 1983: 374-381
2		Kazuo Iwama: The Universe Problem for Unrestricted Flow Languages. Acta Inf. 19: 85-96 (1983)
	1982
1		Kazuo Iwama: On Equations Including String Variables FOCS 1982: 226-235

Coauthor Index

1	Hidetoshi Abeta	[7]
2	Mark Adcock	[109]
3	Kazuyuki Amano	[79]
4	Masami Amano	[41] [66]
5	Andris Ambainis	[92] [118] [124] [155] [161]
6	Yuichi Asahiro	[17] [23] [49] [64]
7	Takao Asano	[53]
8	David Avis	[177] [180]
9	Nikhil Bansal	[131]
10	Wolfgang W. Bein	[106] [127] [148] [157] [174]
11	Byungki Cha	[18] [26] [33]
12	Jian-Jia Chen	[138]
13	Richard Cleve	[109] [181]
14	Xiaotie Deng	[136]
15	Rusins Freivalds	[164]
16	Hiroshi Fujiwara	[71] [100] [108] [132] [144] [158] [175]
17	Toshiyuki Fujiwara	[88]
18	François Le Gall (Francois Le Gall)	[181]
19	Magnús M. Halldórsson	[53] [54] [62] [70] [75] [83] [85] [87] [126]
20	Koki Hamada	[160] [178]
21	Xin Han	[101] [113] [115] [116] [131] [140] [141] [142] [147]
22	Youichi Hanatani	[82] [114] [145]
23	Refael Hassin	[64]
24	Masahito Hayashi	[123] [129]
25	Kensuke Hino	[14] [31]
26	Takashi Horiyama	[82] [114] [120] [145]
27	Toshihide Ibaraki	[8]
28	Tomokazu Imamura	[96] [103] [110]
29	Yasuyoshi Inagaki	[8]
30	Robert W. Irving	[63] [75] [169]
31	Hiro Ito	[67] [74] [81] [95] [97] [107] [112] [163]
32	Chuzo Iwamoto	[12] [20] [22] [24] [27] [34] [37] [88]
33	Yahiko Kambayashi	[5] [11] [21] [25] [33] [38] [47] [57] [73]
34	Akinori Kawachi	[51] [77] [86] [92] [94] [98] [99] [118] [124]
35	Jun Kawahara	[120] [127] [148] [157] [174]
36	Daisuke Kawai	[55] [65]
37	Rolf Klein	[141]
38	Tei-Wei Kuo	[138]
39	Hiroyuki Kurokawa	[31]
40	Lawrence L. Larmore	[106] [127] [174]
41	Andrzej Lingas	[102] [141] [151]
42	Hsueh-I Lu	[138]
43	David Manlove	[44] [63] [75] [169]
44	Akira Maruoka	[79]
45	Hiroyuki Masuda	[92]
46	Takeshi Matsuda	[53]
47	Kenshi Matsuo	[79]
48	Akihiro Matsuura	[52] [76] [79]
49	Eiji Miyano	[6] [7] [16] [21] [29] [30] [35] [38] [39] [42] [45] [48] [50] [56] [57] [58] [59] [135] [159]
50	Shuichi Miyazaki	[13] [19] [25] [33] [40] [43] [44] [54] [55] [62] [63] [65] [70] [75] [83] [85] [87] [91] [105] [111] [126] [128] [130] [150] [152] [160] [170] [173] [176] [178] [179]
51	Yasufumi Morita	[44] [63] [70] [75]
52	Hiroki Morizumi	[69] [119] [121] [143] [162]
53	Manzur Morshed	[20]
54	Masaki Nakanishi	[155] [161]
55	Takuya Nakashima	[137]
56	Harumichi Nishimura	[123] [129] [133] [134] [155] [156] [161] [168] [171] [181]
57	Takao Nishizeki	[8]
58	John Noga	[106]
59	Mitsushi Nouzoe	[36]
60	T. Ohsawa	[27]
61	Yasuo Okabe	[55] [60] [65] [67] [74] [81] [97]
62	Kazuya Okamoto	[91] [111]
63	Masaki Okita	[68] [84] [102] [151]
64	Hirotaka Ono	[135] [159]
65	James A. Oravec	[127] [174]
66	Tsuyoshi Osumi	[107]
67	Daichi Paku	[177] [180]
68	Mike Paterson	[52] [76] [156]
69	Toniann Pitassi	[15]
70	Raymond H. Putra (Rudy Raymond Harry Putra)	[66] [92] [109] [118] [129]
71	Qi Qi	[136]
72	Rudy Raymond	[123] [124] [133] [134] [155] [156] [161] [168] [171]
73	Sunao Sawada	[31]
74	Sandy Scott	[75]
75	Yoshiyuki Sekiguchi	[158] [175]
76	Kazuhisa Seto	[165] [167] [172]
77	Aries Wei Sun	[136]
78	Maxim Sviridenko	[131]
79	Satoshi Tajima	[39] [56]
80	Tadashi Takai	[172]
81	Kazuya Takaki	[32] [47]
82	Toshiro Takase	[60]
83	Shiro Taketomi	[54] [62] [72]
84	Hisao Tamaki	[23] [39] [49] [56]
85	Suguru Tamaki	[61] [80] [93] [125] [145] [146] [165] [167] [172]
86	Takeyuki Tamura	[95] [112]
87	Seiichiro Tani	[155] [161] [181]
88	Jun Tarui	[121] [143] [162]
89	Toyotaka Tasaka	[136]
90	Junichi Teruyama	[168] [171] [181]
91	Takeshi Tokuyama	[23] [49]
92	Tatsuie Tsukiji	[96] [110]
93	Jun Umemoto	[55] [65]
94	Shuzo Yajima	[36]
95	Masafumi Yamashita	[8]
96	Shigeru Yamashita	[73] [78] [86] [92] [99] [109] [118] [123] [124] [129] [133] [134] [155] [156] [161] [181]
97	Naoya Yamauchi	[105] [130] [150]
98	Hiroki Yanagisawa	[83] [85] [87] [126] [128] [170] [173] [176] [179]
99	Deshi Ye	[113] [116] [140]
100	Kouki Yonezawa	[46] [89] [132] [144]
101	Takuya Yoshihiro	[67] [74] [81] [97]
102	Guochuan Zhang	[101] [113] [115] [116] [131] [139] [140] [142] [147] [166]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page