On the Complexity of Minimum-Link Path Problems - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Irina Kostitsyna' in GoogleThis author has not been identified. Look up 'Maarten Löffler' in GoogleThis author has not been identified. Look up 'Valentin Polishchuk' in GoogleThis author has not been identified. Look up 'Frank Staals' in Google

runs on WebDSL