> Top   >> Publicatinos (here)

Journal Papers / Proceedings / Preprints

Refereed Papers in Journals / in Books

13. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, and Koichi Yamazaki,
    Approximating the path-distance-width for AT-free graphs and graphs in related classes,
    Discrete Applied Mathematics, to appear.
    DOI:10.1016/j.dam.2012.11.015.
12. Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima and Masafumi Yamashita,
    On space complexity of self-stabilizing leader election in mediated population protocol,
    Distributed Computing, 25:6 (December 2012), 451--460.
    DOI:10.1007/s00446-012-0173-9.
11. Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno,
    Subgraph isomorphism in graph classes,
    Discrete Mathematics, 312:21 (6 November 2012), 3164--3173.
    DOI:10.1016/j.disc.2012.07.010.
10. Shuji Kijima and Shin-ichi Tanigawa,
    Sparsity and connectivity of medial graphs: concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits,
    Discrete Mathematics, 312:16 (28 August 2012), 2466--2472.
    DOI:10.1016/j.disc.2012.04.013.
9. Shuji Kijima and Toshio Nemoto,
   On randomized approximation for finding a level ideal of a poset and the generalized median stable matchings,
   Mathematics of Operations Research, 37:2, (May 2012), 356--371.
   DOI: 10.1287/moor.1110.0526.
8. Masaki Yamamoto, Shuji Kijima, and Yasuko Matsui,
   A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise,
   Journal of Combinatorial Optimization, 22:3 (2011), 392--408.
   DOI: 10.1007/s10878-010-9309-7.
7. Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani, and Shuji Kijima,
   Polynomial time approximate or perfect samplers for discretized Dirichlet distribution,
   Japan Journal of Industrial and Applied Mathematics, 27:1 (2010), 91--123.
   DOI: 10.1007/s13160-010-0002-0.
6. Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, and Takeaki Uno,
   On listing, sampling, and counting the chordal graphs with edge constraints,
   Theoretical Computer Science, 411:(26-28) (2010), 2591--2601.
   DOI: 10.1016/j.tcs.2010.03.024.
5. Shuji Kijima and Tomomi Matsui,
   Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers,
   Annals of Operations Research, 162 (2008), 35--55.
   DOI: 10.1007/s10479-008-0317-2.
4. Shuji Kijima and Tomomi Matsui,
   Approximation algorithm and perfect sampler for closed Jackson networks with single servers,
   SIAM Journal on Computing, 38:4 (2008), 1484--1503.
   DOI: 10.1137/06064980X.
3. Tomomi Matsui and Shuji Kijima,
   Polynomial time perfect sampler for discretized Dirichlet distribution,
   in Hiroe Tsubaki, Ken Nishina, and Shu Yamada (eds.),
   The Grammar of Technology Development, Springer, 2007, 179--199.
   DOI: 10.1007/978-4-431-75232-5_13.
2. Shuji Kijima and Tomomi Matsui,
   Polynomial time perfect sampling algorithm for two-rowed contingency tables,
   Random Structures & Algorithms, 29:2 (2006), 243--256.
   DOI: 10.1002/rsa.v29:2.
1. Shuji Kijima and Tomomi Matsui,
   Approximate counting scheme for mxn contingency tables,
   IEICE Transactions on Information and Systems, E87-D (2004), 308--314.

Papers in Refereed Conferences

17. Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Asynchronous pattern formation by anonymous oblivious mobile robots,
    in Proceedings of the 26th International Symposium on Distributed Computing (DISC 2012),
    Lecture Notes in Computer Science, 7611 (2012), 312--325.
    DOI: 10.1007/978-3-642-33651-5_22.
16. Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto and Kiyohito Nagano,
    Online prediction under submodular constraints,
    in Proceedings of the 23rd International Conference on Algorithmic Learning Theory (ALT 2012),
    Lecture Notes in Computer Science, 7568 (2012), 260--274.
    DOI: 10.1007/978-3-642-34106-9_22.
15. Shuji Kijima, Kentaro Koga and Kazuhisa Makino,
    Deterministic random walks on finite graphs,
    in Proceedings of the meeting of Analytic Algorithmics and Combinatorics (ANALCO 2012), 16--25.
    [ PDF file (located in ANLOC 2012 proceedings) ]
14. Masatora Ogata, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    A randomized algorithm for finding frequent elements in streams using O(loglog N) space,
    in Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011),
    Lecture Notes in Computer Science, 7074 (2011), 514--523.
    DOI: 10.1007/978-3-642-25591-5_53.
13. Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto and Masayuki Takeda,
    Online linear optimization over permutations,
    in Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011),
    Lecture Notes in Computer Science, 7074 (2011), 534--543.
    DOI: 10.1007/978-3-642-25591-5_55.
12. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno and Koichi Yamazaki,
    Approximability of the path-distance-width for AT-free graphs,
    in Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011),
    Lecture Notes in Computer Science, 6986 (2011), 271--282.
    DOI: 10.1007/978-3-642-25870-1_25.
11. Shuji Kijima, Yoshio Okamoto and Takeaki Uno,
    Dominating set counting in graph classes,
    in Proceedings of 17th Annual International Computing and Combinatorics Conference (COCOON 2011),
    Lecture Notes in Computer Science, 6842 (2011), 13--24.
    DOI: 10.1007/978-3-642-22685-4_2.
10. Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima and Masafumi Yamashita,
    How slow, or fast, are standard random walks? ---analysis of hitting and cover times on tree,
    in Proceedings of the 17th Computing: The Australasian Theory Symposium (CATS 2011),
    CRPIT, 119 (2011), 63--68.
    [ abstract / PDF file (located in CRPIT Series website) ]
9. Nao Fujinaga, Hirotaka Ono, Shuji Kijima and Masafumi Yamashita,
   Pattern formation through optimum matching by CORDA oblivious robots,
   in Proceedings of 14th International Conference On Principles Of Distributed Systems (OPODIS 2010),
   Lecture Notes in Computer Science, 6490 (2010), 1--15.
   DOI: 10.1007/978-3-642-17653-1_1.
8. Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima and Masafumi Yamashita,
   Upper and lower bounds of space complexity of self-stabilizing leader election in mediated population protocol,
   in Proceedings of 14th International Conference On Principles Of Distributed Systems (OPODIS 2010),
   Lecture Notes in Computer Science, 6490 (2010), 491--503.
   DOI: 10.1007/978-3-642-17653-1_35.
7. Shuji Kijima and Toshio Nemoto,
   Finding a level ideal of a poset,
   in Proceedings of 15th International Computing and Combinatorics Conference (COCOON 2009),
   Lecture Notes in Computer Science, 5609 (2009), 317--327.
   DOI: 10.1007/978-3-642-02882-3_32.
6. Masaki Yamamoto, Shuji Kijima, and Yasuko Matsui,
   A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise,
   in Proceedings of 15th International Computing and Combinatorics Conference (COCOON 2009),
   Lecture Notes in Computer Science, 5609 (2009), 328--337.
   DOI: 10.1007/978-3-642-02882-3_33.
5. Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, and Takeaki Uno,
   On listing, sampling, and counting the chordal graphs with edge constraints,
   in Proceedings of 14th Annual International Computing and Combinatorics Conference (COCOON 2008),
   Lecture Notes in Computer Science, 5092 (2008), 458--467.
   DOI: 10.1007/978-3-540-69733-6_45.
4. Masashi Kiyomi, Shuji Kijima, and Takeaki Uno,
   Listing chordal graphs and interval graphs,
   in Proceedings of 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006),
   Lecture Notes in Computer Science, 4271 (2006), 68--77.
   DOI: 10.1007/11917496_7.
3. Shuji Kijima and Tomomi Matsui,
   Approximate/perfect samplers for closed Jackson networks,
   in Proceedings of the 2005 Winter Simulation Conference (2005), 862--868.
2. Shuji Kijima and Tomomi Matsui,
   Rapidly mixing chain and perfect sampler for logarithmic separable concave distributions on simplex,
   in Proceedings of the 2005 International Conference on the Analysis of Algorithms, Discrete Mathematics and Computer Science (AofA 2005),
   DMTCS Proceedings Series Volume AD (2005), 371--382.
   [ abstract / PS file / PDF file (located in DMTCS) ]
1. Shuji Kijima and Tomomi Matsui,
   Polynomial time perfect sampling algorithm for two-rowed contingency tables,
   in M. Drmota, P. Flajolet, D. Gardy, and B. Gittenberger (eds.),
   Mathematics and Computer Science III, Algorithms Trees, Combinatorics and Probabilities, Birkhaeuser, 2004, 175--186.

Others

5. Yukiko Yamauchi, Sebastien Tixeuil, Shuji Kijima, Masafumi Yamashita,
   Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers,
   in Proceedings of the 26th International Symposium on Distributed Computing (DISC 2012),
   Lecture Notes in Computer Science, 7611 (2012), 413--414.
   DOI: 10.1007/978-3-642-33651-5_34.
4. Shuji Kijima,
   Probability and computation,
   in Proceedings of the Second International Conference on Networking and Computing (ICNC 2011), 345--346.
3. Shuji Kijima,
   Sampling from log-super/submodular distributions,
   in Proceedings of the 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (2011), 227--236.
2. Shuji Kijima,
   Enumeration of graph sandwiches,
   in Hiroshi Nagamochi (ed), Acceleration and Visualization of Computation for Enumeration Problems,
   RIMS Kokyuroku, 1644 (2009), 63--72.
1. Shuji Kijima and Tomomi Matsui,
   Polynomial-time perfect sampler for closed Jackson networks with single servers,
   Lecture Notes in Operations Research, 5 (2005), 227--240.

Preprints / Technical Reports

8. Shuji Kijima and Toshio Nemoto,
   Randomized approximation for generalized median stable matching,
   RIMS-1648, 2008.
   [ PS file / PDF file ]
7. Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, and Takeaki Uno,
   On listing, sampling, and counting the chordal graphs with edge constraints,
   RIMS-1610, 2007.
   [ PS file / PDF file ]
6. Shuji Kijima and Tomomi Matsui,
   Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers,
   METR 2006-34, 2006.
   [ PS file / PDF file ]
5. Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani, and Shuji Kijima,
   Polynomial time approximate/perfect samplers for discretized Dirichlet distribution,
   METR 2006-09, 2006.
   [ PS file / PDF file ]
4. Shuji Kijima and Tomomi Matsui,
   Polynomial-time randomized approximation and perfect sampler for closed Jackson networks with single servers,
   METR 2005-12, 2005.
   [ PS file / PDF file ]
3. Tomomi Matsui and Shuji Kijima,
   Polynomial time perfect sampler for discretized Dirichlet distribution,
   METR 2003-17, 2003.
   [ PS file / PDF file ]
2. Shuji Kijima and Tomomi Matsui,
   Polynomial time perfect sampling algorithm for two-rowed contingency tables,
   METR 2003-15, 2003.
   [ PS file / PDF file ]
1. Shuji Kijima and Tomomi Matsui,
   Approximate counting scheme for m x n contingency tables,
   METR 2003-01, 2003.
   [ PS file / PDF file ]