Irina Kostitsyna, Maarten Löffler, Valentin Polishchuk, Frank Staals. On the Complexity of Minimum-Link Path Problems. In Sándor P. Fekete, Anna Lubiw, editors, 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA. Volume 51 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{KostitsynaLPS16, title = {On the Complexity of Minimum-Link Path Problems}, author = {Irina Kostitsyna and Maarten Löffler and Valentin Polishchuk and Frank Staals}, year = {2016}, doi = {10.4230/LIPIcs.SoCG.2016.49}, url = {http://dx.doi.org/10.4230/LIPIcs.SoCG.2016.49}, researchr = {https://researchr.org/publication/KostitsynaLPS16}, cites = {0}, citedby = {0}, booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA}, editor = {Sándor P. Fekete and Anna Lubiw}, volume = {51}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, isbn = {978-3-95977-009-5}, }