C. Evrendilek Et Al. , "Covering oriented points in the plane with orthogonal polygons is NP-complete," Electronic Notes in Discrete Mathematics , vol.36, pp.303-310, 2010
Evrendilek, C. Et Al. 2010. Covering oriented points in the plane with orthogonal polygons is NP-complete. Electronic Notes in Discrete Mathematics , vol.36 , 303-310.
Evrendilek, C., Genç, B., & Hnich, B., (2010). Covering oriented points in the plane with orthogonal polygons is NP-complete. Electronic Notes in Discrete Mathematics , vol.36, 303-310.
Evrendilek, Cem, BURKAY GENÇ, And Brahim Hnich. "Covering oriented points in the plane with orthogonal polygons is NP-complete," Electronic Notes in Discrete Mathematics , vol.36, 303-310, 2010
Evrendilek, Cem Et Al. "Covering oriented points in the plane with orthogonal polygons is NP-complete." Electronic Notes in Discrete Mathematics , vol.36, pp.303-310, 2010
Evrendilek, C. Genç, B. And Hnich, B. (2010) . "Covering oriented points in the plane with orthogonal polygons is NP-complete." Electronic Notes in Discrete Mathematics , vol.36, pp.303-310.
@article{article, author={Cem Evrendilek Et Al. }, title={Covering oriented points in the plane with orthogonal polygons is NP-complete}, journal={Electronic Notes in Discrete Mathematics}, year=2010, pages={303-310} }