J. Hershberger Et Al. , "A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE," SIAM Journal on Computing , vol.51, no.4, pp.1296-1340, 2022
Hershberger, J. Et Al. 2022. A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE. SIAM Journal on Computing , vol.51, no.4 , 1296-1340.
Hershberger, J., Suri, S., & YILDIZ, H., (2022). A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE. SIAM Journal on Computing , vol.51, no.4, 1296-1340.
Hershberger, John, Subhash Suri, And HAKAN YILDIZ. "A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE," SIAM Journal on Computing , vol.51, no.4, 1296-1340, 2022
Hershberger, John Et Al. "A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE." SIAM Journal on Computing , vol.51, no.4, pp.1296-1340, 2022
Hershberger, J. Suri, S. And YILDIZ, H. (2022) . "A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE." SIAM Journal on Computing , vol.51, no.4, pp.1296-1340.
@article{article, author={John Hershberger Et Al. }, title={A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE}, journal={SIAM Journal on Computing}, year=2022, pages={1296-1340} }