Shuji Kijima

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 40

Top Topics

Dimensional Euclidean Space

Hamiltonian Cycle

Phylogenetic Trees

Top Venues

Theor. Comput. Sci.

SIAM J. Discret. Math.

Publications

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