1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2021★ 1 cited
A 1+O(1/N) approximation algorithm for TTP(2)
Shinji Imahori
The traveling tournament problem is a well-known benchmark problem of the sports scheduling. We propose an approximation algorithm for the traveling tournament problem with the con…
cs.CG2020★ 1 cited
Escherization with Generalized Distance Functions Focusing on Local Structural Similarity
Yuichi Nagata, Shinji Imahori
The Escherization problem involves finding a closed figure that tiles the plane that is most similar to a given goal figure. In Koizumi and Sugihara's formulation of the Escherizat…
cs.CG2019
An Efficient Algorithm for the Escherization Problem in the Polygon Representation
Yuichi Nagata, Shinji Imahori
In the Escherization problem, given a closed figure in a plane, the objective is to find a closed figure that is as close as possible to the input figure and tiles the plane. Koizu…