Pattern formation by oblivious asynchronous mobile robots N Fujinaga, Y Yamauchi, H Ono, S Kijima, M Yamashita SIAM Journal on Computing 44 (3), 740-785, 2015 | 107 | 2015 |
Plane formation by synchronous mobile robots in the three-dimensional euclidean space Y Yamauchi, T Uehara, S Kijima, M Yamashita Journal of the ACM (JACM) 64 (3), 1-43, 2017 | 88 | 2017 |
Online prediction under submodular constraints D Suehiro, K Hatano, S Kijima, E Takimoto, K Nagano Algorithmic Learning Theory: 23rd International Conference, ALT 2012, Lyon …, 2012 | 58 | 2012 |
Online linear optimization over permutations S Yasutake, K Hatano, S Kijima, E Takimoto, M Takeda Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011 | 51 | 2011 |
Asynchronous pattern formation by anonymous oblivious mobile robots N Fujinaga, Y Yamauchi, S Kijima, M Yamashita International Symposium on Distributed Computing, 312-325, 2012 | 47 | 2012 |
Pattern formation through optimum matching by oblivious CORDA robots N Fujinaga, H Ono, S Kijima, M Yamashita Principles of Distributed Systems: 14th International Conference, OPODIS …, 2010 | 38 | 2010 |
Subgraph isomorphism in graph classes S Kijima, Y Otachi, T Saitoh, T Uno Discrete Mathematics 312 (21), 3164-3173, 2012 | 37 | 2012 |
Mobile byzantine agreement on arbitrary network T Sasaki, Y Yamauchi, S Kijima, M Yamashita Principles of Distributed Systems: 17th International Conference, OPODIS …, 2013 | 32 | 2013 |
Deterministic random walks on finite graphs S Kijima, K Koga, K Makino Random Structures & Algorithms 46 (4), 739-761, 2015 | 29 | 2015 |
On space complexity of self-stabilizing leader election in mediated population protocol R Mizoguchi, H Ono, S Kijima, M Yamashita Distributed Computing 25 (6), 451-460, 2012 | 28 | 2012 |
Polynomial time perfect sampling algorithm for two-rowed contingency tables S Kijima, T Matsui Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and …, 2004 | 28 | 2004 |
Team assembling problem for asynchronous heterogeneous mobile robots Z Liu, Y Yamauchi, S Kijima, M Yamashita Theoretical Computer Science 721, 27-41, 2018 | 27 | 2018 |
On the structure of popular matchings in the stable marriage problem-who can join a popular matching M Hirakawa, Y Yamauchi, S Kijima, M Yamashita the 3rd International Workshop on Matching under Preferences (MATCH-UP), 2015 | 22 | 2015 |
A fast algorithm for constructing phylogenetic trees with application to IoT malware clustering T He, C Han, R Isawa, T Takahashi, S Kijima, J Takeuchi, K Nakao International Conference on Neural Information Processing, 766-778, 2019 | 15 | 2019 |
Deterministic random walks for rapidly mixing chains T Shiraga, Y Yamauchi, S Kijima, M Yamashita arXiv preprint arXiv:1311.3749, 2013 | 15 | 2013 |
Dominating set counting in graph classes S Kijima, Y Okamoto, T Uno Computing and Combinatorics: 17th Annual International Conference, COCOON …, 2011 | 15 | 2011 |
Exploration of finite 2d square grid by a metamorphic robotic system K Doi, Y Yamauchi, S Kijima, M Yamashita Stabilization, Safety, and Security of Distributed Systems: 20th …, 2018 | 13 | 2018 |
Listing chordal graphs and interval graphs M Kiyomi, S Kijima, T Uno Graph-Theoretic Concepts in Computer Science: 32nd International Workshop …, 2006 | 13 | 2006 |
An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution E Ando, S Kijima Algorithmica 76, 1245-1263, 2016 | 12 | 2016 |
Plane formation by synchronous mobile robots without chirality Y Tomita, Y Yamauchi, S Kijima, M Yamashita arXiv preprint arXiv:1705.06521, 2017 | 11 | 2017 |