![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Cem Evrendilek
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j13]Mehmet Berkehan Akçay
, Hüseyin Akcan
, Cem Evrendilek:
All Colors Shortest Path problem on trees. J. Heuristics 24(4): 617-644 (2018) - [j12]Hüseyin Akcan
, Cem Evrendilek
:
Complexity of Energy Efficient Localization With the Aid of a Mobile Beacon. IEEE Commun. Lett. 22(2): 392-395 (2018) - 2017
- [j11]Cem Evrendilek
, Ismail Hakki Toroslu
, Seyedsasan Hashemikhabir:
Task assignment in tree-like hierarchical structures. J. Comb. Optim. 34(2): 631-655 (2017) - 2016
- [j10]Cem Evrendilek, Burkay Genç
, Brahim Hnich
:
Covering points with minimum/maximum area orthogonally convex polygons. Comput. Geom. 54: 32-44 (2016) - 2015
- [i2]Yunus Can Bilge, Dogukan Çagatay, Begüm Genç, Mecit Sari, Hüseyin Akcan, Cem Evrendilek:
All Colors Shortest Path Problem. CoRR abs/1507.06865 (2015) - 2014
- [j9]Cem Evrendilek, Burkay Genç
, Brahim Hnich
:
Covering points with orthogonal polygons. Discret. Appl. Math. 164: 92-99 (2014) - [i1]Cem Evrendilek, Ismail Hakki Toroslu, Sasan Hashemi:
Task Assignment in Tree-Like Hierarchical Structures. CoRR abs/1404.0783 (2014) - 2013
- [c11]Hüseyin Akcan, Cem Evrendilek:
Reducing the number of flips in trilateration with noisy range measurements. MobiDE 2013: 20-27 - 2012
- [j8]Hüseyin Akcan, Cem Evrendilek:
GPS-free directional localization via dual wireless radios. Comput. Commun. 35(9): 1151-1163 (2012) - 2011
- [j7]Burkay Genç
, Cem Evrendilek, Brahim Hnich
:
Covering points with orthogonally convex polygons. Comput. Geom. 44(5): 249-264 (2011) - [j6]Cem Evrendilek, Hüseyin Akcan:
On the Complexity of Trilateration with Noisy Range Measurements. IEEE Commun. Lett. 15(10): 1097-1099 (2011) - 2010
- [j5]Cem Evrendilek, Burkay Genç
, Brahim Hnich
:
Covering oriented points in the plane with orthogonal polygons is NP-complete. Electron. Notes Discret. Math. 36: 303-310 (2010)
1990 – 1999
- 1998
- [c10]Ismail H. Toroslu, Cem Evrendilek:
Lattice Structure for an Object-Oriented Data Model. IADT 1998: 296-303 - 1997
- [j4]Fatma Ozcan, Sena Nural, Pinar Koksal, Cem Evrendilek, Asuman Dogac:
Dynamic Query Optimization in Multidatabases. IEEE Data Eng. Bull. 20(3): 38-45 (1997) - [j3]Cem Evrendilek, Asuman Dogac, Sena Nural, Fatma Ozcan
:
Multidatabase Query Optimization. Distributed Parallel Databases 5(1): 77-113 (1997) - 1996
- [c9]Fatma Ozcan
, Sena Nural, Pinar Koksal, Cem Evrendilek, Asuman Dogac:
Dynamic Query Optimization on a Distributed Object Management Platform. CIKM 1996: 117-124 - [c8]Asuman Dogac, Cevdet Dengi, Ebru Kilic, Gökhan Özhan, Fatma Ozcan, Sena Nural, Cem Evrendilek, Ugur Halici, Ismailcem Budak Arpinar, Pinar Koksal, Sema Mancuhan:
A Multidatabase System Implementation on CORBA. RIDE-NDS 1996: 2-11 - [c7]Asuman Dogac, Ugur Halici
, Ebru Kilic, Gökhan Özhan, Fatma Ozcan
, Sena Nural, Cevdet Dengi, Sema Mancuhan, Ismailcem Budak Arpinar, Pinar Koksal, Cem Evrendilek:
METU Interoperable Database System. SIGMOD Conference 1996: 552 - 1995
- [j2]Asuman Dogac, Cevdet Dengi, Ebru Kilic, Gökhan Özhan, Fatma Ozcan
, Sena Nural, Cem Evrendilek, Ugur Halici
, Ismailcem Budak Arpinar, Pinar Koksal, N. Kesim, Sema Mancuhan:
METU Interoperable Database System. SIGMOD Rec. 24(3): 56-61 (1995) - [c6]Cem Evrendilek, Asuman Dogac, Tolga Gesli:
A Preprocessor Approach to Persistent C++. ADBIS 1995: 235-251 - [c5]Cetin Ozkan, Asuman Dogac, Cem Evrendilek:
A Heuristic Approach for Optimization of Path Expressions. DEXA 1995: 522-534 - [c4]Cem Evrendilek, Asuman Dogac:
Query Decomposition, Optimization and Processing in Multidatabase Systems. NGITS 1995 - 1994
- [c3]Kadir Koc, Asuman Dogac, Cem Evrendilek:
Comparison of Clustering Algorithms in a Single User Environment through OO7 Benchmark. East/West Database Workshop 1994: 77-89 - [c2]Asuman Dogac, Ismailcem Budak Arpinar, Cem Evrendilek, Cetin Ozkan, Ilker Altintas, Ilker Durusoy, Mehmet Altinel, Tansel Okay, Yuksel Saygin:
METU Object-Oriented DBMS. SIGMOD Conference 1994: 513 - 1993
- [j1]Ismailcem Budak Arpinar, Asuman Dogac, Cem Evrendilek:
MoodView: An Advanced Graphical User Interface for OODBMSs. SIGMOD Rec. 22(4): 11-18 (1993) - [c1]Asuman Dogac, Cetin Ozkan, Ismailcem Budak Arpinar, Tansel Okay, Cem Evrendilek:
METU Object-Oriented DBMS. NATO ASI OODBS 1993: 327-354
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint