Ovidiu Daescu, Hemant Malik. Does a Robot Path Have Clearance C?. In Donghyun Kim 0001, R. N. Uma, Alexander Zelikovsky, editors, Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings. Volume 11346 of Lecture Notes in Computer Science, pages 509-521, Springer, 2018. [doi]
@inproceedings{DaescuM18, title = {Does a Robot Path Have Clearance C?}, author = {Ovidiu Daescu and Hemant Malik}, year = {2018}, doi = {10.1007/978-3-030-04651-4_34}, url = {https://doi.org/10.1007/978-3-030-04651-4_34}, researchr = {https://researchr.org/publication/DaescuM18}, cites = {0}, citedby = {0}, pages = {509-521}, booktitle = {Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings}, editor = {Donghyun Kim 0001 and R. N. Uma and Alexander Zelikovsky}, volume = {11346}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-030-04651-4}, }