4 citations · 18 across the 22 of their papers we have counts for
5 papers · 1 filter
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…
Folding a Paper Strip to Minimize Thickness
Erik D. Demaine, David Eppstein, Adam Hesterberg +4
In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mo…
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
Zachary Abel, Erik D. Demaine, Martin L. Demaine +3
When can a plane graph with prescribed edge lengths and prescribed angles (from among \}) be folded flat to lie in an infinitesimally thin line, without c…
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…
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…