4 citations · 11 across the 8 of their papers we have counts for
10 papers
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains
Erik D. Demaine, Hiro Ito, Jayson Lynch +1
Planar/flat configurations of fixed-angle chains and trees are well studied in the context of polymer science, molecular biology, and puzzles. In this paper, we focus on a simple t…
On the Characterization of -sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix
Hiro Ito, Areej Khoury, Ilan Newman
We study property testing of (di)graph properties in bounded-degree graph models. The study of graph properties in bounded-degree models is one of the focal directions of research…
Cookie Clicker
Erik D. Demaine, Hiro Ito, Stefan Langerman +3
Cookie Clicker is a popular online incremental game where the goal of the game is to generate as many cookies as possible. In the game you start with an initial cookie generation r…
Helly Numbers of Polyominoes
Jean Cardinal, Hiro Ito, Matias Korman +1
We define the Helly number of a polyomino as the smallest number such that the -Helly property holds for the family of symmetric and translated copies of on the inte…
Single-Player and Two-Player Buttons & Scissors Games
Kyle Burke, Erik D. Demaine, Harrison Gregg +12
We study the computational complexity of the Buttons \& Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-compl…
How to solve the cake-cutting problem in sublinear time
Hiro Ito, Takahiro Ueda
In this paper, we show algorithms for solving the cake-cutting problem in sublinear-time. More specifically, we preassign (simple) fair portions to o(n) players in o(n)-time, and m…