Shuji Kijima - RankMe

90 papers A* 2A 3B 11C 9Misc 8Journal 47Unranked 10

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	An analysis of load-balancing algorithms on edge-Markovian evolving graphs. J. Comput. Syst. Sci. Takeharu Shiraga, Shuji Kijima
2026	J	`jnl`	How Many Vertices Does a Random Walk Miss in a Network with a Moderately Increasing Number of Vertices? Math. Oper. Res. Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga
2026	—	`conf`	Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits. ICAART (4) Shang Lu, Shuji Kijima
2025	J	`jnl`	Identification of the Strongest Die in Dueling Bandits. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Shang Lu, Kohei Hatano, Shuji Kijima, Eiji Takimoto
2025	J	`jnl`	Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits. CoRR Shang Lu, Shuji Kijima
2024	J	`jnl`	A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence. CoRR Naoaki Okada, Shuji Kijima
2024	—	`conf`	An Analysis of the Recurrence/Transience of Random Walks on Growing Trees and Hypercubes. SAND Shuma Kumamoto, Shuji Kijima, Tomoyuki Shirai
2024	C	`conf`	The Recurrence/Transience of Random Walks on a Bounded Grid in an Increasing Dimension. AofA Shuma Kumamoto, Shuji Kijima, Tomoyuki Shirai
2024	C	`conf`	The Space Complexity of Generating Random Tent Codes. ISITA Naoaki Okada, Shuji Kijima
2023	J	`jnl`	Scalable and Fast Algorithm for Constructing Phylogenetic Trees With Application to IoT Malware Clustering. IEEE Access Tianxiang He, Chansu Han, Ryoichi Isawa, Takeshi Takahashi, Shuji Kijima, Jun'ichi Takeuchi
2023	J	`jnl`	The Space Complexity of Generating Tent Codes. CoRR Naoaki Okada, Shuji Kijima
2022	J	`jnl`	An analysis of load-balancing algorithms on edge-Markovian evolving graphs. CoRR Takeharu Shiraga, Shuji Kijima
2022	A*	`conf`	Is There a Strongest Die in a Set of Dice with the Same Mean Pips? AAAI Shang Lu, Shuji Kijima
2022	J	`jnl`	Search by a metamorphic robotic system in a finite 2D square Grid. Inf. Comput. Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2021	J	`jnl`	Can a Skywalker Localize the Midpoint of a Rope? ACM Trans. Comput. Theory Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2021	J	`jnl`	Every finite distributive lattice is isomorphic to the minimizer set of an M♮-concave set function. Oper. Res. Lett. Tomohito Fujii, Shuji Kijima
2021	A*	`conf`	How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? SODA Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga
2021	—	`conf`	Scalable and Fast Hierarchical Clustering of IoT Malware Using Active Data Selection. FMEC Tianxiang He, Chansu Han, Takeshi Takahashi, Shuji Kijima, Jun'ichi Takeuchi
2021	J	`jnl`	Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers. Theor. Comput. Sci. Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2020	J	`jnl`	An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes. Theor. Comput. Sci. Ei Ando, Shuji Kijima
2020	J	`jnl`	Finding Submodularity Hidden in Symmetric Difference. SIAM J. Discret. Math. Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2019	—	`conf`	A Fast Algorithm for Constructing Phylogenetic Trees with Application to IoT Malware Clustering. ICONIP (1) Tianxiang He, Chansu Han, Ryoichi Isawa, Takeshi Takahashi, Shuji Kijima, Jun'ichi Takeuchi, Koji Nakao
2019	J	`jnl`	Any Finite Distributive Lattice is Isomorphic to the Minimizer Set of an M CoRR Tomohito Fujii, Shuji Kijima
2018	J	`jnl`	Deterministic Random Walks for Rapidly Mixing Chains. SIAM J. Discret. Math. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	C	`conf`	Exploration of Finite 2D Square Grid by a Metamorphic Robotic System. SSS Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	J	`jnl`	Exploration of Finite 2D Square Grid by a Metamorphic Robotic System. CoRR Keisuke Doi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	J	`jnl`	Foreword. IEICE Trans. Inf. Syst. Shuji Kijima
2018	J	`jnl`	Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Takahiro Fujita, Kohei Hatano, Shuji Kijima, Eiji Takimoto
2018	C	`conf`	Searching with Increasing Speeds. SSS Leszek Gasieniec, Shuji Kijima, Jie Min
2018	J	`jnl`	Team assembling problem for asynchronous heterogeneous mobile robots. Theor. Comput. Sci. Zhiqiang Liu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2018	J	`jnl`	The parity Hamiltonian cycle problem. Discret. Math. Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	Misc	`conf`	An FPTAS for the Volume of Some COCOON Ei Ando, Shuji Kijima
2017	J	`jnl`	Finding the Submodularity Hidden in Symmetric Difference. CoRR Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space. J. ACM Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita
2017	B	`conf`	Plane Formation by Synchronous Mobile Robots without Chirality. OPODIS Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Plane Formation by Synchronous Mobile Robots without Chirality. CoRR Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	C	`conf`	Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. SSS Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. CoRR Akihiro Monde, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2017	J	`jnl`	Total variation discrepancy of deterministic random walks for ergodic Markov chains. Theor. Comput. Sci. Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	J	`jnl`	An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution. Algorithmica Ei Ando, Shuji Kijima
2016	J	`jnl`	An FPTAS for the Volume of a V-polytope - It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes. CoRR Ei Ando, Shuji Kijima
2016	J	`jnl`	Extended formulations for sparsity matroids. Math. Program. Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2016	C	`conf`	Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space. SSS Taichi Uehara, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	C	`conf`	Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers. SSS Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	C	`conf`	The Parity Hamiltonian Cycle Problem in Directed Graphs. ISCO Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2016	—	`conf`	Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. ANALCO Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2015	—	`conf`	Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem. Public Key Cryptography Shuji Kijima, Ravi Montenegro
2015	J	`jnl`	Deterministic random walks on finite graphs. Random Struct. Algorithms Shuji Kijima, Kentaro Koga, Kazuhisa Makino
2015	B	`conf`	Online Linear Optimization for Job Scheduling Under Precedence Constraints. ALT Takahiro Fujita, Kohei Hatano, Shuji Kijima, Eiji Takimoto
2015	J	`jnl`	Pattern Formation by Oblivious Asynchronous Mobile Robots. SIAM J. Comput. Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2015	A	`conf`	Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space. DISC Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita
2015	J	`jnl`	Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space. CoRR Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita
2015	J	`jnl`	The Parity Hamiltonian Cycle Problem. CoRR Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2015	J	`jnl`	Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. CoRR Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2014	B	`conf`	An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral. ISAAC Ei Ando, Shuji Kijima
2014	J	`jnl`	Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2014	J	`jnl`	Extended Formulations for Sparsity Matroids. CoRR Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2014	Misc	`conf`	L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. COCOON Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2014	—	`conf`	Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract). SRDS Workshops Fengqi Chen, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2013	J	`jnl`	Deterministic Random Walks for Rapidly Mixing Chains. CoRR Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2013	B	`conf`	Mobile Byzantine Agreement on Arbitrary Network. OPODIS Toru Sasaki, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2013	C	`conf`	Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction. SSS Xiaoguang Xu, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2012	—	`conf`	An Extension of Matthews' Bound to Multiplex Random Walks. IPDPS Workshops Yusuke Hosaka, Yukiko Yamauchi, Shuji Kijima, Hirotaka Ono, Masafumi Yamashita
2012	A	`conf`	Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. DISC Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2012	A	`conf`	Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers. DISC Yukiko Yamauchi, Sébastien Tixeuil, Shuji Kijima, Masafumi Yamashita
2012	—	`conf`	Deterministic Random Walks on Finite Graphs. ANALCO Shuji Kijima, Kentaro Koga, Kazuhisa Makino
2012	J	`jnl`	On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings. Math. Oper. Res. Shuji Kijima, Toshio Nemoto
2012	J	`jnl`	On space complexity of self-stabilizing leader election in mediated population protocol. Distributed Comput. Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2012	B	`conf`	Online Prediction under Submodular Constraints. ALT Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Kiyohito Nagano
2012	J	`jnl`	Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits. Discret. Math. Shuji Kijima, Shin-ichi Tanigawa
2012	J	`jnl`	Subgraph isomorphism in graph classes. Discret. Math. Shuji Kijima, Yota Otachi, Toshiki Saitoh, Takeaki Uno
2011	B	`conf`	A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space. ISAAC Masatora Ogata, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
2011	J	`jnl`	A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. J. Comb. Optim. Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
2011	B	`conf`	Approximability of the Path-Distance-Width for AT-free Graphs. WG Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
2011	Misc	`conf`	Dominating Set Counting in Graph Classes. COCOON Shuji Kijima, Yoshio Okamoto, Takeaki Uno
2011	—	`conf`	How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. CATS Yoshiaki Nonaka, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2011	B	`conf`	Online Linear Optimization over Permutations. ISAAC Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda
2011	Misc	`conf`	Probability and Computation. ICNC Shuji Kijima
2010	J	`jnl`	On listing, sampling, and counting the chordal graphs with edge constraints. Theor. Comput. Sci. Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
2010	B	`conf`	Pattern Formation through Optimum Matching by Oblivious CORDA Robots. OPODIS Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2010	B	`conf`	Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. OPODIS Ryu Mizoguchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
2009	Misc	`conf`	A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. COCOON Masaki Yamamoto, Shuji Kijima, Yasuko Matsui
2009	Misc	`conf`	Finding a Level Ideal of a Poset. COCOON Shuji Kijima, Toshio Nemoto
2008	J	`jnl`	Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers. SIAM J. Comput. Shuji Kijima, Tomomi Matsui
2008	Misc	`conf`	On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. COCOON Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
2008	J	`jnl`	Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. Ann. Oper. Res. Shuji Kijima, Tomomi Matsui
2006	B	`conf`	Listing Chordal Graphs and Interval Graphs. WG Masashi Kiyomi, Shuji Kijima, Takeaki Uno
2006	J	`jnl`	Polynomial time perfect sampling algorithm for two-rowed contingency tables. Random Struct. Algorithms Shuji Kijima, Tomomi Matsui
2005	Misc	`conf`	Approximate/perfect samplers for closed Jackson networks. WSC Shuji Kijima, Tomomi Matsui
2004	J	`jnl`	Approximate Counting Scheme for IEICE Trans. Inf. Syst. Shuji Kijima, Tomomi Matsui