Polynomial-Time Algorithm for Sliding Tokens on Trees. Demaine, E. D.; Demaine, M. L.; Fox-Epstein, E.; Hoang</u>, <. A.; Ito, T.; Ono, H.; Otachi, Y.; Uehara, R.; and Yamada, T. In Ahn, H. and Shin, C., editors, Proceedings of <a href="http://tcs.postech.ac.kr/isaac2014/">the 25th International Symposium on Algorithms and Computation, ISAAC 2014, Jeonju, Korea, December 15-17, 2014</a>, volume 8889, of Lecture Notes in Computer Science, pages 389–400, 2014. Springer.
doi  bibtex   
@inproceedings{conf-isaac-DemaineDFHIOOUY14,
author = {Erik D. Demaine and Martin L. Demaine and Eli Fox-Epstein and <u>Duc A. Hoang</u> and Takehiro Ito and Hirotaka Ono and Yota Otachi and Ryuhei Uehara and Takeshi Yamada},
editor = {Hee-Kap Ahn and Chan-Su Shin},
title = {Polynomial-Time Algorithm for Sliding Tokens on Trees},
booktitle = {Proceedings of <a href="http://tcs.postech.ac.kr/isaac2014/">the 25th International Symposium on Algorithms and Computation, ISAAC 2014, Jeonju, Korea, December 15-17, 2014</a>},
series = {Lecture Notes in Computer Science},
volume = {8889},
year = {2014},
publisher = {Springer},
pages = {389--400},
doi = {10.1007/978-3-319-13075-0_31},
hdl = {10119/13765},
eprint = {1406.6576v1},
slides = {events/ISAAC2014/slides.pptx},
pubtype = {Refereed International Conference}
}
Downloads: 0