Demaine, Erik D.; Demaine, Martin L.; Fox-Epstein, Eli; Hoang, Duc A.; Ito, Takehiro; Ono, Hirotaka; Otachi, Yota; Uehara, Ryuhei; Yamada, Takeshi Linear-time algorithm for sliding tokens on trees. (English) Zbl 1329.68135 Theor. Comput. Sci. 600, 132-142 (2015). MSC: 68Q25 05C05 05C69 05C85 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Theor. Comput. Sci. 600, 132--142 (2015; Zbl 1329.68135) Full Text: DOI arXiv
Yamanaka, Katsuhisa; Demaine, Erik D.; Ito, Takehiro; Kawahara, Jun; Kiyomi, Masashi; Okamoto, Yoshio; Saitoh, Toshiki; Suzuki, Akira; Uchizawa, Kei; Uno, Takeaki Swapping labeled tokens on graphs. (English) Zbl 1327.68336 Theor. Comput. Sci. 586, 81-94 (2015). MSC: 68W25 05C05 05C85 PDFBibTeX XMLCite \textit{K. Yamanaka} et al., Theor. Comput. Sci. 586, 81--94 (2015; Zbl 1327.68336) Full Text: DOI Link
Demaine, Erik D.; Demaine, Martin L.; Fox-Epstein, Eli; Hoang, Duc A.; Ito, Takehiro; Ono, Hirotaka; Otachi, Yota; Uehara, Ryuhei; Yamada, Takeshi Polynomial-time algorithm for sliding tokens on trees. (English) Zbl 1435.05189 Ahn, Hee-Kap (ed.) et al., Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15–17, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8889, 389-400 (2014). MSC: 05C85 05C05 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Lect. Notes Comput. Sci. 8889, 389--400 (2014; Zbl 1435.05189) Full Text: DOI Link
Ito, Takehiro; Demaine, Erik D. Approximability of the subset sum reconfiguration problem. (English) Zbl 1315.90036 J. Comb. Optim. 28, No. 3, 639-654 (2014). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{T. Ito} and \textit{E. D. Demaine}, J. Comb. Optim. 28, No. 3, 639--654 (2014; Zbl 1315.90036) Full Text: DOI
Ito, Takehiro; Kamiński, Marcin; Demaine, Erik D. Reconfiguration of list edge-colorings in a graph. (English) Zbl 1252.05064 Discrete Appl. Math. 160, No. 15, 2199-2207 (2012). MSC: 05C15 PDFBibTeX XMLCite \textit{T. Ito} et al., Discrete Appl. Math. 160, No. 15, 2199--2207 (2012; Zbl 1252.05064) Full Text: DOI
Ito, Takehiro; Demaine, Erik D. Approximability of the subset sum reconfiguration problem. (English) Zbl 1330.68094 Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 58-69 (2011). MSC: 68Q17 90C27 90C60 PDFBibTeX XMLCite \textit{T. Ito} and \textit{E. D. Demaine}, Lect. Notes Comput. Sci. 6648, 58--69 (2011; Zbl 1330.68094) Full Text: DOI
Ito, Takehiro; Demaine, Erik D.; Harvey, Nicholas J. A.; Papadimitriou, Christos H.; Sideri, Martha; Uehara, Ryuhei; Uno, Yushi On the complexity of reconfiguration problems. (English) Zbl 1207.68166 Theor. Comput. Sci. 412, No. 12-14, 1054-1065 (2011). MSC: 68Q25 68Q17 68R10 PDFBibTeX XMLCite \textit{T. Ito} et al., Theor. Comput. Sci. 412, No. 12--14, 1054--1065 (2011; Zbl 1207.68166) Full Text: DOI Link
Ito, Takehiro; Kamiński, Marcin; Demaine, Erik D. Reconfiguration of list edge-colorings in a graph. (English) Zbl 1253.68263 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 375-386 (2009). MSC: 68R10 05C15 05C85 PDFBibTeX XMLCite \textit{T. Ito} et al., Lect. Notes Comput. Sci. 5664, 375--386 (2009; Zbl 1253.68263) Full Text: DOI Link
Ito, Takehiro; Demaine, Erik D.; Zhou, Xiao; Nishizeki, Takao Approximability of partitioning graphs with supply and demand. (English) Zbl 1154.05328 J. Discrete Algorithms 6, No. 4, 627-650 (2008). MSC: 05C85 90C35 68Q17 68W25 91B42 PDFBibTeX XMLCite \textit{T. Ito} et al., J. Discrete Algorithms 6, No. 4, 627--650 (2008; Zbl 1154.05328) Full Text: DOI
Ito, Takehiro; Demaine, Erik D.; Harvey, Nicholas J. A.; Papadimitriou, Christos H.; Sideri, Martha; Uehara, Ryuhei; Uno, Yushi On the complexity of reconfiguration problems. (English) Zbl 1183.68310 Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 28-39 (2008). MSC: 68Q25 68Q17 PDFBibTeX XMLCite \textit{T. Ito} et al., Lect. Notes Comput. Sci. 5369, 28--39 (2008; Zbl 1183.68310) Full Text: DOI
Ito, Takehiro; Demaine, Erik D.; Zhou, Xiao; Nishizeki, Takao Approximability of partitioning graphs with supply and demand. Extended abstract. (English) Zbl 1135.90423 Asano, Tetsuo (ed.), Algorithms and computation. 17th international symposium, ISAAC 2006, Kolkata, India, December 18–20, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49694-6/pbk). Lecture Notes in Computer Science 4288, 121-130 (2006). MSC: 90C35 68Q25 68R10 68W25 90C59 PDFBibTeX XMLCite \textit{T. Ito} et al., Lect. Notes Comput. Sci. 4288, 121--130 (2006; Zbl 1135.90423) Full Text: DOI