> Top   >> Publicatinos (here)

Journal Papers / Proceedings / Preprints

Refereed Papers in Journals / in Books

30. Tianxiang He, Chansu Han, Ryoichi Isawa, Takeshi Takahashi, Shuji Kijima and Jun’ichi Takeuchi,
    Scalable and Fast Algorithm for Constructing Phylogenetic Trees With Application to IoT Malware Clustering,
    IEEE Access, 11 (23 January 2023), 8240--8253.
    DOI: 10.1109/ACCESS.2023.3238711.
29. TakahiroYakami, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers,
    Theoretical Computer Science, in press.
    DOI: 10.1016/j.tcs.2021.06.042.
28. Keisuke Doi, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Search by a metamorphic robotic system in a finite 2D square grid,
    Information and Computation, in press.
    DOI: 10.1016/j.ic.2021.104695.
27. Akihiro Monde, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Can a skywalker localize the midpoint of a rope?,
    ACM Transactions on Computation Theory, 13:3 (July 2021), Article 17, 1--23.
    DOI: 10.1145/3460954.
26. Tomohito Fujii and Shuji Kijima,
    Every finite distributive lattice is isomorphic to the minimizer set of an M^♮-concave set function,
    Operations Research Letters, 49:1 (January 2021), 1--4.
    DOI: 10.1016/j.orl.2020.10.012.
25. Ei Ando and Shuji Kijima,
    An FPTAS for the volume of some V-polytopes --- It is hard to compute the volume of the intersection of two cross-polytopes,
    Theoretical Computer Science, 833:12 (September 2020), 87--106.
    DOI: 10.1016/j.tcs.2020.05.029.
24. Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Finding submodularity hidden in symmetric difference,
    SIAM Journal on Discrete Mathematics, 34:1 (2020), 571--585.
    DOI: 10.1137/19M1243361.
23. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Deterministic random walks for rapidly mixing chains,
    SIAM Journal on Discrete Mathematics, 32:3 (2018), 2180--2193.
    DOI: 10.1137/16M1087667.
22. Takahiro Fujita, Kohei Hatano, Shuji Kijima and Eiji Takimoto,
    Online combinatorial optimization with multiple projections and its application to scheduling problem,
    IEICE Transactions, 101-A:9 (1 September 2018), 1334--1343.
    DOI: 10.1587/transfun.E101.A.1334.
21. Zhiqiang Liu, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Team assembling problem for asynchronous heterogeneous mobile robots,
    Theoretical Computer Science, 721 (18 April 2018), 27--41.
    DOI: 10.1016/j.tcs.2018.01.009.
20. Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    The parity Hamiltonian cycle problem,
    Discrete Mathematics, 341:3 (March 2018), 606--626.
    DOI: 10.1016/j.disc.2017.10.025.
19. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Total variation discrepancy of deterministic random walks for ergodic Markov chains,
    Theoretical Computer Science, 699 (7 November 2017), 63--74.
    DOI: 10.1016/j.tcs.2016.11.017.
18. Yukiko Yamauchi, Taichi Uehara, Shuji Kijima and Masafumi Yamashita,
    Plane formation by synchronous mobile robots in the three dimensional Euclidean space,
    Journal of the ACM, 64:3 (June 2017), Article 16.
    DOI: 10.1145/3060272.
17. Ei Ando and Shuji Kijima,
    An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution,
    Algorithmica, 76:4 (December 2016), 1245--1263.
    DOI: 10.1007/s00453-015-0096-5.
16. Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima and Yoshio Okamoto,
    Extended formulations for sparsity matroids,
    Mathematical Programming Series A, 158:1-2 (July 2016), 565--574.
    DOI: 10.1007/s10107-015-0936-8.
15. Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima and Masafumi Yamashita,
    Pattern formation by oblivious asynchronous mobile robots,
    SIAM Journal on Computing, 44:3 (2015), 740--785.
    DOI: 10.1137/140958682.
    Erratum (pdf) Nov. 28, 2017.
14. Shuji Kijima, Kentaro Koga and Kazuhisa Makino,
    Deterministic random walks on finite graphs,
    Random Structures & Algorithms, 46:4 (July 2015), 739--761.
    DOI: 10.1002/rsa.20533.
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, 168 (May 2014), 69--77.
    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 and 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

37. Shang Lu, Shuji Kijima,
    Is there a strongest die in a set of dice with the same mean pips?,
    in Proceedings of the the 36th Conference on Artificial Intelligence (AAAI 2022).
    DOI: 10.1609/aaai.v36i5.20447 .
36. Tianxiang He, Chansu Han, Takeshi Takahashi, Shuji Kijima, Jun'ichi Takeuchi,
    Scalable and fast hierarchical clustering of IoT malware using active data selection,
    in Proceedings of the 6th International Conference on Fog and Mobile Edge Computing (FMEC 2021), 1--6,
    DOI: 10.1109/FMEC54266.2021.9732550.
35. Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga,
    How many vertices does a random walk miss in a network with moderately increasing the number of vertices?,
    in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), 106--122,
    DOI: 10.1137/1.9781611976465.8.
34. Tianxiang He, Chansu Han, Ryoichi Isawa, Takeshi Takahashi, Shuji Kijima, Jun'ichi Takeuchi, Koji Nakao,
    A fast algorithm for constructing phylogenetic trees with application to IoT malware clustering,
    in Proceedings of the 26th International Conference on Neural Information Processing of the Asia-Pacific Neural Network Society (ICONIP 2019),
    Lecture Notes in Computer Science, 11953 (2019), 766--778.
    DOI: 10.1007/978-3-030-36708-4_63.
33. Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Exploration of finite 2D square grid by a metamorphic robotic system,
    in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
    Lecture Notes in Computer Science, 11201 (2018), 96--110.
    DOI: 10.1007/978-3-030-03232-6_7.
    [SSS 2018 Best Paper Award]
32. Leszek Gasieniec, Shuji Kijima, Jie Min,
    Searching with increasing speeds,
    in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
    Lecture Notes in Computer Science, 11201 (2018), 126--138.
    DOI: 10.1007/978-3-030-03232-6_9.
31. Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Plane formation by synchronous mobile robots without chirality,
    in Proceedings of the 21st International Conference on Principles of Distributed Systems (OPODIS 2017),
    Leibniz International Proceedings in Informatics (LIPIcs), 95 (December 2017), 13:1--13:17.
    DOI: 10.4230/LIPIcs.OPODIS.2017.13.
30. Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Self-stabilizing localization of the middle point of a line segment by an oblivious robot with limited visibility,
    in Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2017),
    Lecture Notes in Computer Science, 10616 (October 2017), 172--186.
    DOI: 10.1007/978-3-319-69084-1_12.
29. Ei Ando, Shuji Kijima,
    An FPTAS for the volume of a V-polytope - it is hard to compute the volume of the intersection of two cross-polytopes,
    in Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017),
    Lecture Notes in Computer Science, 10392 (July 2017), 13--24.
    DOI: 10.1007/978-3-319-62389-4_2.
28. Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Searching for an evader in an unknown graph by an optimal number of searchers,
    in Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016),
    Lecture Notes in Computer Science, 10083 (2016), 399--414.
    DOI: 10.1007/978-3-319-49259-9 31.
    [Takahiro Yakami won the SSS 2016 Best Student Paper Award]
27. Taichi Uehara, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Plane formation by semi-synchronous robots in the three dimensional Euclidean space,
    in Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016),
    Lecture Notes in Computer Science, 10083 (2016), 383--398.
    DOI: 10.1007/978-3-319-49259-9_30.
26. Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    The parity Hamiltonian cycle problem in directed graphs,
    in Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO 2016), 50--58.
    DOI: 10.1007/978-3-319-45587-7_5.
25. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Total variation discrepancy of deterministic random walks for ergodic Markov chains,
    in Proceedings of the 13th Workshop on Analytic Algorithmics and Combinatorics (ANALCO 2016), 138--148.
    DOI: 10.1137/1.9781611974324.13.
24. Yukiko Yamauchi, Taichi Uehara, Shuji Kijima and Masafumi Yamashita,
    Plane formation by synchronous mobile robots in the three dimensional Euclidean space,
    in Proceedings of the 29th International Symposium on Distributed Computing (DISC 2015),
    Lecture Notes in Computer Science, 9363 (2015), 92--106.
    DOI: 10.1007/978-3-662-48653-5_7.
23. Takahiro Fujita, Kohei Hatano, Shuji Kijima and Eiji Takimoto,
    Online linear optimization for job scheduling under precedence constraints,
    in Proceedings of the 26th International Conference on Algorithmic Learning Theory (ALT 2015),
    Lecture Notes in Computer Science, 9355 (2015), 332--346.
    DOI: 10.1007/978-3-319-24486-0_22.
22. Shuji Kijima, Ravi Montenegro,
    Collision of random walks and a refined analysis of attacks on the discrete logarithm problem,
    in Proceedings of the Public-Key Cryptography (PKC 2015),
    Lecture Notes in Computer Science, 9020 (2015), 127--149.
    DOI: 10.1007/978-3-662-46447-2_6.
21. Ei Ando, Shuji Kijima,
    An FPTAS for the volume computationof 0-1 knapsack polytopes based on approximate convolution integral,
    in Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC 2014),
    Lecture Notes in Computer Science, 8889 (2014), 376--386.
    DOI: 10.1007/978-3-319-13075-0_30.
20. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    L_∞-discrepancy analysis of polynomial-time deterministic samplers emulating rapidly mixing chains,
    in Proceedings of the 20th International Computing and Combinatorics Conference (COCOON 2014),
    Lecture Notes in Computer Science, 8591 (2014), 25--36.
    DOI: 10.1007/978-3-319-08783-2_3.
19. Toru Sasaki, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Mobile Byzantine agreement on arbitrary network,
    in Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS 2013),
    Lecture Notes in Computer Science, 8304 (2013), 236--250.
    DOI: 10.1007/978-3-319-03850-6_17.
18. Xiaoguang Xu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Space complexity of self-stabilizing leader election in population protocol based on k-interaction,
    in Proceedings of the 15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2013),
    Lecture Notes in Computer Science, 8255 (2013), 86--97.
    DOI: 10.1007/978-3-319-03089-0_7.
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 (survey, abstracts, etc.)

8. Shuji Kijima,
   Foreword,
   IEICE Transactions 101-D(3): 573 (March 1, 2018)
   IEICE.
7. Fengqi Chen, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
   Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract),
   in Proceedings of 2014 IEEE 33rd International Symposium on the Reliable Distributed Systems Workshops (SRDS workshop 2014), 40--45.
   DOI: 10.1109/SRDSW.2014.23.
6. Shuji Kijima,
   Randomness in algorithm design,
   in Proceedings of the ELC International Meeting on Inference, Computation, and Spin Glasses (ICSG2013),
   Journal of Physics: Conference Series, 473, 012014. (refereed post proceedings)
   DOI: 10.1088/1742-6596/473/1/012014.
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

21. Takeharu Shiraga and Shuji Kijima,
    An analysis of load-balancing algorithms on edge-Markovian evolving graphs,
    arXiv:2208.12130, 2022.
    [PDF file ]
20. Shuji Kijima, Nobutaka Shimizu and Takeharu Shiraga,
    How many vertices does a random walk miss in a network with moderately increasing the number of vertices?,
    arXiv:2008.10837, 2020.
    [ PS file / PDF file ]
19. Tomohito Fujii and Shuji Kijima,
    Any finite distributive lattice is isomorphic to the minimizer set of an M^♮-concave set function,
    arXiv:1903.08343, 2019.
    [ PS file / PDF file ]
18. Keisuke Doi, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Exploration of finite 2D square grid by a metamorphic robotic system,
    arXiv:1808.00214, 2018.
    [ PS file / PDF file ]
17. Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Finding submodularity hidden in symmetric difference,
    arXiv:1712.08721, 2017.
    [ PS file / PDF file ]
16. Akihiro Monde, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Can Walker localize the middle point of a line-segment?,
    arXiv:1707.06398, 2017.
    [ PS file / PDF file ]
15. Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita,
    Plane formation by synchronous mobile robots without chirality,
    arXiv:1705.06521, 2017.
    [ PS file / PDF file ]
14. Ei Ando, Shuji Kijima,
    An FPTAS for the volume of a V-polytope - it is hard to compute the volume of the intersection of two cross-polytopes,
    arXiv:1607.06173, 2016.
    [ PS file / PDF file ]
13. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    Total variation discrepancy of deterministic random walks for ergodic Markov chains,
    arXiv:1508.03458, 2015.
    [ PS file / PDF file ]
12. Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita,
    Plane formation by synchronous mobile robots in the three dimensional Euclidean space,
    arXiv:1505.04546, 2015.
    [ PS file / PDF file ]
11. Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
    The parity Hamiltonian cycle problem,
    arXiv:1501.06323, 2015.
    [ PS file / PDF file ]
10. Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto,
    Extended formulations for sparsity matroids,
    arXiv:1403.7272, 2014.
    [ PS file / PDF file ]
9. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita,
   Deterministic random walks for rapidly mixing chains,
   arXiv:1311.3749, 2013.
   [ PS file / PDF file ]
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 ]