activity
20112022
most citedOn the Characterization of -sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix

4 citations · 11 across the 8 of their papers we have counts for

collaborators
Showing cs.CCShow all

2 papers · 1 filter

cs.CC2019★ 4 cited

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…

cs.CC2016

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…