Shuji Kijima

Yukiko Yamauchi, Masafumi Yamashita, Hirotaka Ono, 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum.

A Polynomial-time Perfect Sampler for the Q-Ising with local fields (Mathematical Foundation of Algorithms and Computer Science)

Masaki Yamamoto, Yasuko Matsui, Shuji Kijima, 2010 .

Dominating Set Counting in Graph Classes

Yoshio Okamoto, Takeaki Uno, Shuji Kijima, 2011, COCOON.

A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise

Yasuko Matsui, Shuji Kijima, Masaki Yamamoto, 2011, J. Comb. Optim..

Online Linear Optimization for Job Scheduling Under Precedence Constraints

Takahiro Fujita, Shuji Kijima, Eiji Takimoto, 2015, ALT.

2014年度冬のLAシンポジウム Space Complexity of Self-Stabilizing Leader Election in Population Protocol on Hypernetworks (計算理論とアルゴリズムの新潮流 : RIMS研究集会報告集)

Yukiko Yamauchi, Shuji Kijima, Xiaoguang Xu, 2015 .

Online Combinatorial Optimization with Multiple Projections and Its Application to Scheduling Problem

Takahiro Fujita, Shuji Kijima, Eiji Takimoto, 2018, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

On space complexity of self-stabilizing leader election in mediated population protocol

Masafumi Yamashita, Hirotaka Ono, Shuji Kijima, 2012, Distributed Computing.

Online Linear Optimization over Permutations

Masayuki Takeda, Shuji Kijima, Eiji Takimoto, 2011, ISAAC.

Pattern Formation by Fully Asynchronous Mobile Robots (New Trends in Algorithms and Theory of Computation)

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2012 .

Foreword

Shuji Kijima, 2018, IEICE Trans. Inf. Syst..

Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2017, J. ACM.

An FPTAS for the Volume of a V-polytope - It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes pdf

Shuji Kijima, Ei Ando, 2017, COCOON.

Pattern Formation by Oblivious Asynchronous Mobile Robots

Yukiko Yamauchi, Masafumi Yamashita, Hirotaka Ono, 2015, SIAM J. Comput..

Mobile Byzantine Agreement on Arbitrary Network

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2013, OPODIS.

Online Prediction under Submodular Constraints

Shuji Kijima, Eiji Takimoto, Kohei Hatano, 2012, ALT.

Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2012, DISC.

Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers

Sébastien Tixeuil, Yukiko Yamauchi, Masafumi Yamashita, 2012, DISC.

L ∞ -Discrepancy Analysis of Polynomial-Time Deterministic Samplers Emulating Rapidly Mixing Chains

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2014, COCOON.

Listing Chordal Graphs and Interval Graphs

Takeaki Uno, Masashi Kiyomi, Shuji Kijima, 2006, WG.

Finding the Submodularity Hidden in Symmetric Difference

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2017, SIAM J. Discret. Math..

Approximating the path-distance-width for AT-free graphs and graphs in related classes

Yota Otachi, Koichi Yamazaki, Yoshio Okamoto, 2014, Discret. Appl. Math..

Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol

Masafumi Yamashita, Hirotaka Ono, Shuji Kijima, 2010, OPODIS.

Polynomial time perfect sampling algorithm for two-rowed contingency tables

Tomomi Matsui, Shuji Kijima, 2006, Random Struct. Algorithms.

An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes

Shuji Kijima, Ei Ando, 2020, Theor. Comput. Sci..

Online scheduling of precedence-constrained jobs on a single machine (システム数理と応用)

Takahiro Fujita, Shuji Kijima, Eiji Takimoto, 2014 .

A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise

Yasuko Matsui, Shuji Kijima, Masaki Yamamoto, 2009, COCOON.

The parity Hamiltonian cycle problem

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2015, Discret. Math..

Deterministic random walks on finite graphs

Kazuhisa Makino, Shuji Kijima, Kentaro Koga, 2015, Random Struct. Algorithms.

Approximating the path-distance-width for $k$-cocomparability graphs (Mathematical Foundations and Applications of Computer Science and Algorithms)

Yota Otachi, Koichi Yamazaki, Yoshio Okamoto, 2011 .

The Parity Hamiltonian Cycle Problem in Directed Graphs

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2016, ISCO.

On listing, sampling, and counting the chordal graphs with edge constraints

Yoshio Okamoto, Takeaki Uno, Masashi Kiyomi, 2008, Theor. Comput. Sci..

Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2013, SSS.

Foreword: Special section on foundations of computer science - Frontiers of theoretical computer science

Shuji Kijima, 2018 .

An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution

Shuji Kijima, Ei Ando, 2015, Algorithmica.

Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2016, SSS.

Approximability of the Path-Distance-Width for AT-free Graphs

Yota Otachi, Koichi Yamazaki, Yoshio Okamoto, 2011, WG.

A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2011, ISAAC.

Team assembling problem for asynchronous heterogeneous mobile robots

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2018, Theor. Comput. Sci..

Any Finite Distributive Lattice is Isomorphic to the Minimizer Set of an M♮-Concave Set Function

Shuji Kijima, Tomohito Fujii, 2021, Oper. Res. Lett..

Pattern Formation through Optimum Matching by Oblivious CORDA Robots

Masafumi Yamashita, Hirotaka Ono, Shuji Kijima, 2010, OPODIS.

A Fast Algorithm for Constructing Phylogenetic Trees with Application to IoT Malware Clustering

Ryoichi Isawa, Shuji Kijima, Jun'ichi Takeuchi, 2019, ICONIP.

Space Complexity of Self-Stabilizing Leader Election in Population Protocol on Hypernetworks (New Streams of Computation Theory and Algorithms)

Masafumi Yamashita, Shuji Kijima, Xiaoguang Xu, 2014 .

On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints

Yoshio Okamoto, Takeaki Uno, Masashi Kiyomi, 2008, COCOON.

Extended formulations for sparsity matroids

Yoshio Okamoto, Satoru Iwata, Shuji Kijima, 2014, Math. Program..

Any Finite Distributive Lattice is Isomorphic to the Minimizer Set of an ${\rm M}^{\natural}$-Concave Set Function

Shuji Kijima, Tomohito Fujii, S. Kijima, 2019, 1903.08343.

Approximate Counting Scheme for m X n Contingency Tables

Tomomi Matsui, Shuji Kijima, 2004, IEICE Trans. Inf. Syst..

An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral

Shuji Kijima, Ei Ando, 2014, ISAAC.

Can Walker Localize The Middle Point of A Line-segment?.

Yukiko Yamauchi, Shuji Kijima, Akihiro Monde, 2017 .

A Distributed Locomotion Algorithm for 3-dimensional Metamorphic Robotic System (New Streams of Computation Theory and Algorithms)

Masafumi Yamashita, Shuji Kijima, Yukiko Yamauchi, 2015 .

Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2015, DISC.

Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2021, Theor. Comput. Sci..

Search by a metamorphic robotic system in a finite 2D square Grid

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2021 .

How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?

Shuji Kijima, Takeharu Shiraga, Nobutaka Shimizu, 2020, SODA.

Can a Skywalker Localize the Midpoint of a Rope?

Yukiko Yamauchi, Masafumi Yamashita, Shuji Kijima, 2021, ACM Trans. Comput. Theory.

Randomized Approximation for Generalized Median Stable Matching

Shuji Kijima, S. Kijima, Toshio Nemoto, 2008 .