On the Complexity of Reconfiguration Problems (2009)
Takehiro Ito, Erik D. Demaine, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, ...
Abstract. Reconfiguration problems arise when we wish to find a stepby-step transformation between two feasible solutions of a problem such that all intermediate results are also feasible. We...
Design of laser interferometric measuring device of involute profile (2008)
Takeoka, Fumi, Komori, Masaharu, Kubo, Aizoh, Fujio, Hiroshige, Taniyama, Shigeaki, Ito, Takehiro, ...
Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size (2007)
ITO, Takehiro, GOTO, Kazuya, ZHOU, Xiao, NISHIZEKI, Takao
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 ≤ i ≤ q, are given. One wishes to...
Approximability of partitioning graphs with supply and demand (2006)
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
1 Introduction Consider a graph G such that each vertex is either a supply vertex or a de-mand vertex. Each vertex v is assigned a positive real number; the number iscalled the supply of v if v is a...
Approximability of partitioning graphs with supply and demand (2006)
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Nishizeki
Abstract. Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive...
Partitioning graphs of supply and demand (2005)
Abstract. Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can receive...