Polynomial-Time Algorithm for Sliding Tokens on Trees.
Demaine, E. D.; Demaine, M. L.; Fox-Epstein, E.; Hoang, D. A.; Ito, T.; Ono, H.; Otachi, Y.; Uehara, R.; and Yamada, T.
In Ahn, H.; and Shin, C., editor(s),
Proceedings of ISAAC 2014, volume 8889, of
LNCS, pages 389–400, 2014. Springer
arxiv
hdl
slides
doi
link
bibtex
@inproceedings{conf/isaac/DemaineDFHIOOUY14,
title = {Polynomial-Time Algorithm for Sliding Tokens on Trees},
author = {Erik D. Demaine and Martin L. Demaine and Eli Fox-Epstein and Duc A. Hoang and Takehiro Ito and Hirotaka Ono and Yota Otachi and Ryuhei Uehara and Takeshi Yamada},
year = {2014},
booktitle = {Proceedings of <a href="http://tcs.postech.ac.kr/isaac2014/">ISAAC 2014</a>},
publisher = {Springer},
series = {LNCS},
volume = {8889},
pages = {389--400},
doi = {10.1007/978-3-319-13075-0_31},
editor = {Hee-Kap Ahn and Chan-Su Shin},
url_arxiv = {https://arxiv.org/abs/1406.6576v1},
url_hdl = {http://hdl.handle.net/10119/13765},
url_slides = {events/ISAAC2014/slides.pptx},
pubtype = {Refereed International Conference}
}