12 citations · 29 across the 13 of their papers we have counts for
13 papers
An analysis of load-balancing algorithms on edge-Markovian evolving graphs
Takeharu Shiraga, Shuji Kijima
Analysis of algorithms on time-varying networks (often called evolving graphs) is a modern challenge in theoretical computer science. The edge-Markovian is a relatively simple and…
How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices?
Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga
Real networks are often dynamic. In response to it, analyses of algorithms on {\em dynamic networks} attract more and more attentions in network science and engineering. Random wal…
Any Finite Distributive Lattice is Isomorphic to the Minimizer Set of an -Concave Set Function
Tomohito Fujii, Shuji Kijima
Submodularity is an important concept in combinatorial optimization, and it is often regarded as a discrete analog of convexity. It is a fundamental fact that the set of minimizers…
Exploration of Finite 2D Square Grid by a Metamorphic Robotic System
Keisuke Doi, Yukiko Yamauchi, Shuji Kijima +1
We consider exploration of finite 2D square grid by a metamorphic robotic system consisting of anonymous oblivious modules. The number of possible shapes of a metamorphic robotic s…
Finding Submodularity Hidden in Symmetric Difference
Junpei Nakashima, Yukiko Yamauchi, Shuji Kijima +1
A set function on a finite set is submodular if for any pair . The symmetric difference transformation (SD-tr…
Can Walker Localize The Middle Point of A Line-segment?
Akihiro Monde, Yukiko Yamauchi, Shuji Kijima +1
This paper poses a question about a simple localization problem. The question is if an {\em oblivious} walker on a line-segment can localize the middle point of the line-segment in…