25 citations · 29 across the 7 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.CC2014
Computational Complexity of Competitive Diffusion on (Un)weighted Graphs
Takehiro Ito, Yota Otachi, Toshiki Saitoh +6
Consider an undirected graph modeling a social network, where the vertices represent users, and the edges do connections among them. In the competitive diffusion game, each of a nu…
cs.CG2014★ 3 cited
The Convex Configurations of "Sei Shonagon Chie no Ita" and Other Dissection Puzzles
Eli Fox-Epstein, Ryuhei Uehara
The tangram and Sei Shonagon Chie no Ita are popular dissection puzzles consisting of seven pieces. Each puzzle can be formed by identifying edges from sixteen identical right isos…
cs.DM2014★ 1 cited
Linear-Time Algorithm for Sliding Tokens on Trees
Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein +6
Suppose that we are given two independent sets and of a graph such that , and imagine that a token is placed on each vertex in . Then, the sliding tok…