Shuichi Miyazaki

2008
27	EE	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)
2007
26	EE	Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi: A 1.875: approximation algorithm for the stable marriage problem. SODA 2007: 288-297
25	EE	Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta: Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) 2007: 164-175
24	EE	Koji Kobayashi, Shuichi Miyazaki, Yasuo Okabe: A tight bound on online buffer management for two-port shared-memory switches. SPAA 2007: 358-364
23	EE	Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Approximation Algorithms for the Sex-Equal Stable Marriage Problem. WADS 2007: 201-213
22	EE	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)
2006
21	EE	Shunsaku Kato, Shuichi Miyazaki, Yusuke Nishimura, Yasuo Okabe: Cheat-Proof Serverless Network Games. Computers and Games 2006: 234-243
20	EE	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)
2005
19	EE	Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi: A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. ISAAC 2005: 902-914
2004
18	EE	Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto: A (2-c(log N/N))-Approximation Algorithm for the Stable Marriage Problem. SWAT 2004: 349-361
17	EE	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
16	EE	Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Randomized Approximation of the Stable Marriage Problem. COCOON 2003: 339-350
15	EE	Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa: Improved Approximation of the Stable Marriage Problem. ESA 2003: 266-277
14	EE	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)
2002
13	EE	Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita: Inapproximability Results on Stable Marriage Problems. LATIN 2002: 554-568
12	EE	Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto: Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. ACM Journal of Experimental Algorithms 7: 2 (2002)
11	EE	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)
10		Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi: Online independent sets. Theor. Comput. Sci. 289(2): 953-962 (2002)
2000
9	EE	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
8	EE	Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Shiro Taketomi: Online Independent Sets. COCOON 2000: 202-209
1999
7	EE	Kazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita: Stable Marriage with Incomplete Lists and Ties. ICALP 1999: 443-452
6	EE	Kazuo Iwama, Shuichi Miyazaki: Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle. ISAAC 1999: 133-142
5	EE	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)
1997
4		Byungki Cha, Kazuo Iwama, Yahiko Kambayashi, Shuichi Miyazaki: Local Search Algorithms for Partial MAXSAT. AAAI/IAAI 1997: 263-268
1996
3		Shuichi Miyazaki, Kazuo Iwama, Yahiko Kambayashi: Database Queries as Combinatorial Optimization Problems. CODAS 1996: 477-483
1995
2		Kazuo Iwama, Shuichi Miyazaki: Approximation of coNP Sets by NP-complete Sets. COCOON 1995: 11-20
1994
1		Kazuo Iwama, Shuichi Miyazaki: SAT-Varible Complexity of Hard Combinatorial Problems. IFIP Congress (1) 1994: 253-258

Coauthor Index

1	Yuichi Asahiro	[25]
2	Byungki Cha	[4]
3	Magnús M. Halldórsson	[8] [10] [13] [14] [15] [16] [17] [22]
4	Robert W. Irving	[11] [14]
5	Kazuo Iwama	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [22] [23] [26] [27]
6	Yahiko Kambayashi	[3] [4]
7	Shunsaku Kato	[21]
8	Daisuke Kawai	[9] [12]
9	Koji Kobayashi	[24]
10	David Manlove	[7] [11] [14]
11	Eiji Miyano	[25]
12	Yasufumi Morita	[7] [11] [13] [14]
13	Yusuke Nishimura	[21]
14	Yasuo Okabe	[9] [12] [21] [24]
15	Kazuya Okamoto	[18] [20]
16	Sandy Scott	[14]
17	Shiro Taketomi	[8] [10]
18	Jun Umemoto	[9] [12]
19	Naoya Yamauchi	[19] [26] [27]
20	Hiroki Yanagisawa	[15] [16] [17] [22] [23]
21	Takuro Yoshimuta	[25]