4 citations · 11 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
Every property is testable on a natural class of scale-free multigraphs
Hiro Ito
In this paper, we introduce a natural class of multigraphs called hierarchical-scale-free (HSF) multigraphs, and consider constant-time testability on the class. We show that a ver…
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…
Constant-Time Algorithms for Sparsity Matroids
Hiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida
A graph is called -full if contains a subgraph of edges such that, for any non-empty , hol…