Shuji Kijima

Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Computing 25(6): 451-460 (2012)

Shuji Kijima, Shin-ichi Tanigawa: Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits. Discrete Mathematics 312(16): 2466-2472 (2012)

Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno: Subgraph isomorphism in graph classes. Discrete Mathematics 312(21): 3164-3173 (2012)

Shuji Kijima, Toshio Nemoto: On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings. Math. Oper. Res. 37(2): 356-371 (2012)

Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Kiyohito Nagano: Online Prediction under Submodular Constraints. ALT 2012: 260-274

Shuji Kijima, Kentaro Koga, Kazuhisa Makino: Deterministic Random Walks on Finite Graphs. ANALCO 2012: 18-27

Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita: An Extension of Matthews' Bound to Multiplex Random Walks. IPDPS Workshops 2012: 872-877

Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita: Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. DISC 2012: 312-325

Yukiko Yamauchi, Sébastien Tixeuil, Shuji Kijima, Masafumi Yamashita: Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers. DISC 2012: 413-414

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)

Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. CATS 2011: 63-68

Shuji Kijima, Yoshio Okamoto, Takeaki Uno: Dominating Set Counting in Graph Classes. COCOON 2011: 13-24

Shuji Kijima: Probability and Computation. ICNC 2011: 345-346

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

Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda: Online Linear Optimization over Permutations. ISAAC 2011: 534-543

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

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)

Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita: Pattern Formation through Optimum Matching by Oblivious CORDA Robots. OPODIS 2010: 1-15

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

Shuji Kijima, Toshio Nemoto: Finding a Level Ideal of a Poset. COCOON 2009: 317-327

Masaki Yamamoto, Shuji Kijima, Yasuko Matsui: A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. COCOON 2009: 328-337

Shuji Kijima, Tomomi Matsui: Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. Annals OR 162(1): 35-55 (2008)

Shuji Kijima, Tomomi Matsui: Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers. SIAM J. Comput. 38(4): 1484-1503 (2008)

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno: On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON 2008: 458-467

Shuji Kijima, Tomomi Matsui: Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct. Algorithms 29(2): 243-256 (2006)

Masashi Kiyomi, Shuji Kijima, Takeaki Uno: Listing Chordal Graphs and Interval Graphs. WG 2006: 68-77

Shuji Kijima, Tomomi Matsui: Approximate/perfect samplers for closed Jackson networks. Winter Simulation Conference 2005: 862-868

Shuji Kijima, Tomomi Matsui: Approximate Counting Scheme for m X n Contingency Tables. IEICE Transactions 87-D(2): 308-314 (2004)