Approximate Counting Scheme for m X n Contingency Tables. - Shuji Kijima; Tomomi Matsui (IEICE Trans. Inf. Syst., 2004)

Approximate/perfect samplers for closed Jackson networks. - Shuji Kijima; Tomomi Matsui (WSC, 2005)

Listing Chordal Graphs and Interval Graphs. - Masashi Kiyomi; Shuji Kijima; Takeaki Uno (WG, 2006)

Polynomial time perfect sampling algorithm for two-rowed contingency tables. - Shuji Kijima; Tomomi Matsui (Random Struct. Algorithms, 2006)

Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. - Shuji Kijima; Tomomi Matsui (Ann. Oper. Res., 2008)

Approximation Algorithm and Perfect Sampler for Closed Jackson Networks with Single Servers. - Shuji Kijima; Tomomi Matsui (SIAM J. Comput., 2008)

Finding a Level Ideal of a Poset. - Shuji Kijima; Toshio Nemoto (COCOON, 2009)

Pattern Formation through Optimum Matching by Oblivious CORDA Robots. - Nao Fujinaga; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (OPODIS, 2010)

Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol. - Ryu Mizoguchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (OPODIS, 2010)

On listing, sampling, and counting the chordal graphs with edge constraints. - Shuji Kijima; Masashi Kiyomi; Yoshio Okamoto; Takeaki Uno (Theor. Comput. Sci., 2010)

How Slow, or Fast, Are Standard Random Walks? - Analyses of Hitting and Cover Times on Tree. - Yoshiaki Nonaka; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (CATS, 2011)

Dominating Set Counting in Graph Classes. - Shuji Kijima; Yoshio Okamoto; Takeaki Uno (COCOON, 2011)

Probability and Computation. - Shuji Kijima (ICNC, 2011)

A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space. - Masatora Ogata; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (ISAAC, 2011)

Online Linear Optimization over Permutations. - Shota Yasutake; Kohei Hatano; Shuji Kijima; Eiji Takimoto; Masayuki Takeda (ISAAC, 2011)

Approximability of the Path-Distance-Width for AT-free Graphs. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (WG, 2011)

A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise. - Masaki Yamamoto 001; Shuji Kijima; Yasuko Matsui (J. Comb. Optim., 2011)

Online Prediction under Submodular Constraints. - Daiki Suehiro; Kohei Hatano; Shuji Kijima; Eiji Takimoto; Kiyohito Nagano (ALT, 2012)

An Extension of Matthews' Bound to Multiplex Random Walks. - Yusuke Hosaka; Yukiko Yamauchi; Shuji Kijima; Hirotaka Ono 001; Masafumi Yamashita (IPDPS Workshops, 2012)

Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. - Nao Fujinaga; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (DISC, 2012)

Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers. - Yukiko Yamauchi; Sébastien Tixeuil; Shuji Kijima; Masafumi Yamashita (DISC, 2012)

On space complexity of self-stabilizing leader election in mediated population protocol. - Ryu Mizoguchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (Distributed Comput., 2012)

Subgraph isomorphism in graph classes. - Shuji Kijima; Yota Otachi; Toshiki Saitoh; Takeaki Uno (Discret. Math., 2012)

Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits. - Shuji Kijima; Shin-ichi Tanigawa (Discret. Math., 2012)

On Randomized Approximation for Finding a Level Ideal of a Poset and the Generalized Median Stable Matchings. - Shuji Kijima; Toshio Nemoto (Math. Oper. Res., 2012)

Mobile Byzantine Agreement on Arbitrary Network. - Toru Sasaki; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (OPODIS, 2013)

Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction. - Xiaoguang Xu; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2013)

L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains. - Takeharu Shiraga; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (COCOON, 2014)

An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral. - Ei Ando; Shuji Kijima (ISAAC, 2014)

Locomotion of Metamorphic Robotic System Based on Local Information (Extended Abstract). - Fengqi Chen; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SRDS Workshops, 2014)

Approximating the path-distance-width for AT-free graphs and graphs in related classes. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (Discret. Appl. Math., 2014)

Online Linear Optimization for Job Scheduling Under Precedence Constraints. - Takahiro Fujita; Kohei Hatano; Shuji Kijima; Eiji Takimoto (ALT, 2015)

Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem. - Shuji Kijima; Ravi Montenegro (Public Key Cryptography, 2015)

Deterministic random walks on finite graphs. - Shuji Kijima; Kentaro Koga; Kazuhisa Makino (Random Struct. Algorithms, 2015)

Pattern Formation by Oblivious Asynchronous Mobile Robots. - Nao Fujinaga; Yukiko Yamauchi; Hirotaka Ono 001; Shuji Kijima; Masafumi Yamashita (SIAM J. Comput., 2015)

The Parity Hamiltonian Cycle Problem in Directed Graphs. - Hiroshi Nishiyama; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (ISCO, 2016)

Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space. - Taichi Uehara; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2016)

Searching for an Evader in an Unknown Graph by an Optimal Number of Searchers. - Takahiro Yakami; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2016)

An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution. - Ei Ando; Shuji Kijima (Algorithmica, 2016)

An FPTAS for the Volume of a V-polytope - It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes. - Ei Ando; Shuji Kijima (CoRR, 2016)

Extended formulations for sparsity matroids. - Satoru Iwata 001; Naoyuki Kamiyama; Naoki Katoh; Shuji Kijima; Yoshio Okamoto (Math. Program., 2016)

An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes. - Ei Ando; Shuji Kijima (COCOON, 2017)

Plane Formation by Synchronous Mobile Robots without Chirality. - Yusaku Tomita; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (OPODIS, 2017)

Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Limited Visibility. - Akihiro Monde; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2017)

Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space. - Yukiko Yamauchi; Taichi Uehara; Shuji Kijima; Masafumi Yamashita (J. ACM, 2017)

Total variation discrepancy of deterministic random walks for ergodic Markov chains. - Takeharu Shiraga; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Theor. Comput. Sci., 2017)

Exploration of Finite 2D Square Grid by a Metamorphic Robotic System. - Keisuke Doi; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SSS, 2018)

Searching with Increasing Speeds. - Leszek Gasieniec; Shuji Kijima; Jie Min (SSS, 2018)

The parity Hamiltonian cycle problem. - Hiroshi Nishiyama; Yusuke Kobayashi 001; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Discret. Math., 2018)

Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem. - Takahiro Fujita; Kohei Hatano; Shuji Kijima; Eiji Takimoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Foreword. - Shuji Kijima (IEICE Trans. Inf. Syst., 2018)

Deterministic Random Walks for Rapidly Mixing Chains. - Takeharu Shiraga; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SIAM J. Discret. Math., 2018)

Team assembling problem for asynchronous heterogeneous mobile robots. - Zhiqiang Liu; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Theor. Comput. Sci., 2018)

A Fast Algorithm for Constructing Phylogenetic Trees with Application to IoT Malware Clustering. - Tianxiang He; Chansu Han; Ryoichi Isawa; Takeshi Takahashi 001; Shuji Kijima; Jun'ichi Takeuchi; Koji Nakao (ICONIP (1), 2019)

Any Finite Distributive Lattice is Isomorphic to the Minimizer Set of an M♮-Concave Set Function. - Tomohito Fujii; Shuji Kijima (CoRR, 2019)

Finding Submodularity Hidden in Symmetric Difference. - Junpei Nakashima; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (SIAM J. Discret. Math., 2020)

An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes. - Ei Ando; Shuji Kijima (Theor. Comput. Sci., 2020)

Scalable and Fast Hierarchical Clustering of IoT Malware Using Active Data Selection. - Tianxiang He; Chansu Han; Takeshi Takahashi 001; Shuji Kijima; Jun'ichi Takeuchi (FMEC, 2021)

How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? - Shuji Kijima; Nobutaka Shimizu; Takeharu Shiraga (SODA, 2021)

Every finite distributive lattice is isomorphic to the minimizer set of an M♮-concave set function. - Tomohito Fujii; Shuji Kijima (Oper. Res. Lett., 2021)

Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers. - Takahiro Yakami; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Theor. Comput. Sci., 2021)

Can a Skywalker Localize the Midpoint of a Rope? - Akihiro Monde; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (ACM Trans. Comput. Theory, 2021)

Is There a Strongest Die in a Set of Dice with the Same Mean Pips? - Shang Lu; Shuji Kijima (AAAI, 2022)

An analysis of load-balancing algorithms on edge-Markovian evolving graphs. - Takeharu Shiraga; Shuji Kijima (CoRR, 2022)

Search by a metamorphic robotic system in a finite 2D square Grid. - Keisuke Doi; Yukiko Yamauchi; Shuji Kijima; Masafumi Yamashita (Inf. Comput., 2022)

Scalable and Fast Algorithm for Constructing Phylogenetic Trees With Application to IoT Malware Clustering. - Tianxiang He; Chansu Han; Ryoichi Isawa; Takeshi Takahashi 001; Shuji Kijima; Jun'ichi Takeuchi (IEEE Access, 2023)

The Space Complexity of Generating Tent Codes. - Naoaki Okada; Shuji Kijima (CoRR, 2023)

The Recurrence/Transience of Random Walks on a Bounded Grid in an Increasing Dimension. - Shuma Kumamoto; Shuji Kijima; Tomoyuki Shirai (AofA, 2024)

The Space Complexity of Generating Random Tent Codes. - Naoaki Okada; Shuji Kijima (ISITA, 2024)

An Analysis of the Recurrence/Transience of Random Walks on Growing Trees and Hypercubes. - Shuma Kumamoto; Shuji Kijima; Tomoyuki Shirai (SAND, 2024)

A Smoothed Analysis of the Space Complexity of Computing a Chaotic Sequence. - Naoaki Okada; Shuji Kijima (CoRR, 2024)

Identification of the Strongest Die in Dueling Bandits. - Shang Lu; Kohei Hatano; Shuji Kijima; Eiji Takimoto (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2025)

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits. - Shang Lu; Shuji Kijima (CoRR, 2025)