Shuji Kijima

	2011
18		Shuji Kijima, Yoshio Okamoto, Takeaki Uno: Dominating Set Counting in Graph Classes. COCOON 2011: 13-24
17		Shuji Kijima: Probability and Computation. ICNC 2011: 345-346
16		Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita: A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space. ISAAC 2011: 514-523
15		Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda: Online Linear Optimization over Permutations. ISAAC 2011: 534-543
14		Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki: Approximability of the Path-Distance-Width for AT-free Graphs. WG 2011: 271-282
13		Masaki Yamamoto, Shuji Kijima, Yasuko Matsui: A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. J. Comb. Optim. 22(3): 392-408 (2011)
	2010
12		Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: Pattern Formation through Optimum Matching by Oblivious CORDA Robots. OPODIS 2010: 1-15
11		Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. OPODIS 2010: 491-503
10		Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. 411(26-28): 2591-2601 (2010)
	2009
9		Shuji Kijima, Toshio Nemoto: Finding a Level Ideal of a Poset. COCOON 2009: 317-327
8		Masaki Yamamoto, Shuji Kijima, Yasuko Matsui: A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. COCOON 2009: 328-337
	2008
7		Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467
6		Shuji Kijima, Tomomi Matsui: Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. Annals OR 162(1): 35-55 (2008)
5		Shuji Kijima, Tomomi Matsui: Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers. SIAM J. Comput. 38(4): 1484-1503 (2008)
	2006
4		Masashi Kiyomi, Shuji Kijima, Takeaki Uno: Listing Chordal Graphs and Interval Graphs. WG 2006: 68-77
3		Shuji Kijima, Tomomi Matsui: Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct. Algorithms 29(2): 243-256 (2006)
	2005
2		Shuji Kijima, Tomomi Matsui: Approximate/perfect samplers for closed Jackson networks. Winter Simulation Conference 2005: 862-868
	2004
1		Shuji Kijima, Tomomi Matsui: Approximate Counting Scheme for m X n Contingency Tables. IEICE Transactions 87-D(2): 308-314 (2004)

Coauthor Index

1	Nao Fujinaga	[12]
2	Kohei Hatano	[15]
3	Masashi Kiyomi	[4] [7] [10]
4	Tomomi Matsui	[1] [2] [3] [5] [6]
5	Yasuko Matsui	[8] [13]
6	Ryu Mizoguchi	[11]
7	Toshio Nemoto	[9]
8	Masatora Ogata	[16]
9	Yoshio Okamoto	[7] [10] [14] [18]
10	Hirotaka Ono	[11] [12] [14]
11	Yota Otachi	[14]
12	Toshiki Saitoh	[14]
13	Masayuki Takeda	[15]
14	Eiji Takimoto	[15]
15	Takeaki Uno	[4] [7] [10] [18]
16	Yushi Uno	[14]
17	Masaki Yamamoto	[8] [13]
18	Katsuhisa Yamanaka	[14]
19	Masafumi Yamashita	[11] [12] [16]
20	Yukiko Yamauchi	[16]
21	Koichi Yamazaki	[14]
22	Shota Yasutake	[15]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page