
Evrendilek, Cem


Results 1-9 of 9 (Search time: 0.007 seconds).
Issue Date | Title | Author(s) | |
---|---|---|---|
1 | 2018 | All Colors Shortest Path Problem on Trees | Akcay, Mehmet Berkehan; Akcan, Hüseyin ; Evrendilek, Cem |
2 | 2018 | Complexity of Energy Efficient Localization With the Aid of a Mobile Beacon | Akcan, Hüseyin ; Evrendilek, Cem |
3 | 2010 | Covering Oriented Points in the Plane With Orthogonal Polygons Is Np-Complete | Evrendilek C. ; Genç B.; Hnich B. |
4 | 2016 | Covering Points With Minimum/Maximum Area Orthogonally Convex Polygons | Evrendilek, Cem ; Genc, Burkay ; Hnich, Brahim |
5 | 2011 | Covering Points With Orthogonally Convex Polygons | Genç, Burkay ; Evrendilek, Cem ; Hnich, Brahim |
6 | 2012 | Gps-Free Directional Localization Via Dual Wireless Radios | Akcan, Hüseyin ; Evrendilek, Cem |
7 | 2011 | On the Complexity of Trilateration With Noisy Range Measurements | Evrendilek, Cem ; Akcan, Hüseyin |
8 | 2017 | Task Assignment in Tree-Like Hierarchical Structures | Evrendilek, Cem ; Toroslu, Ismail Hakki; Hashemikhabir, Seyedsasan |
9 | 2008 | Vertex Separators for Partitioning a Graph | Evrendilek, Cem |
Claim Researcher Page
Check the encrypted string of this email, put the correct string in the box below and click "Go" to validate the email and claim this profile.
Emails: c e m . * * * * * * * * * * @ * * * * * * u . t r