Evrendilek, Cem
Loading...
Profile URL
Name Variants
Evrendilek, C
Evrendilek, Cem
Evrendilek, Cem
Job Title
Email Address
cem.evrendilek@ieu.edu.tr
Main Affiliation
05.05. Computer Engineering
Status
Current Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Files
Sustainable Development Goals
1NO POVERTY
0
Research Products
2ZERO HUNGER
0
Research Products
3GOOD HEALTH AND WELL-BEING
0
Research Products
4QUALITY EDUCATION
0
Research Products
5GENDER EQUALITY
0
Research Products
6CLEAN WATER AND SANITATION
0
Research Products
7AFFORDABLE AND CLEAN ENERGY
0
Research Products
8DECENT WORK AND ECONOMIC GROWTH
0
Research Products
9INDUSTRY, INNOVATION AND INFRASTRUCTURE
2
Research Products
10REDUCED INEQUALITIES
0
Research Products
11SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
12RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
13CLIMATE ACTION
0
Research Products
14LIFE BELOW WATER
0
Research Products
15LIFE ON LAND
0
Research Products
16PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
17PARTNERSHIPS FOR THE GOALS
0
Research Products
Documents
20
Citations
175
h-index
8
Documents
12
Citations
93
Scholarly Output
15
Articles
9
Views / Downloads
17/450
Supervised MSc Theses
3
Supervised PhD Theses
0
WoS Citation Count
67
Scopus Citation Count
97
Patents
0
Projects
0
WoS Citations per Publication
4.47
Scopus Citations per Publication
6.47
Open Access Source
9
Supervised Theses
3
| Journal | Count |
|---|---|
| Ieee Communıcatıons Letters | 2 |
| Computatıonal Geometry-Theory And Applıcatıons | 2 |
| Dıscrete Applıed Mathematıcs | 1 |
| Electronic Notes in Discrete Mathematics | 1 |
| Journal of Combınatorıal Optımızatıon | 1 |
Current Page: 1 / 2
Scopus Quartile Distribution
Competency Cloud
15 results
Scholarly Output Search Results
Now showing 1 - 10 of 15
Research Project Mobil Kablosuz Ağlarda Üç Boyutta Konum Tespiti Algoritmalarının Geliştirilmesi ve Analizi(2014) Evrendilek, Cem; Akcan, Hüseyin; Unay, Ali Teoman; Çağırıcı, Onur[Abstract Not Available]Master Thesis All Colors Shortest Path Problem on Trees [master Thesis](İzmir Ekonomi Üniversitesi, 2015) Akçay, Mehmet Berkehan; Akcan, Hüseyin; Evrendilek, CemAğaç Yapılarında Tüm Renkleri İçeren En Kısa Yolu Bulma (TREKY-a) problemi, V kümesi içinde bulunan r düğümünde kökleşmiş bir T = (V;E) ağacı verilip, ağaçtaki her bir düğüme C = {1,2,...,k} kümesinden bir renk atandığında, r düğümünden başlayarak, her bir farklı renkten en az bir düğüm içeren en kısa yolu bulma problemidir. Biz TREKY-a probleminin NP-Zor olduğunu gösteriyoruz. Ayrıca, TREKY-a için sabit faktörlü bir yakınsama algoritmasının olmadığını kanıtlıyoruz. TREKY-a problemi için tamsayı lineer programlama formülü veriyoruz. Bu formülün lineer programlama gevşetmesini temel alarak çeşitli sezgisel çözüm yöntemleri öneriliyor. Bu tez ayrıca TREKY-a için Genetik ve Tabu Arama algoritmalarını temel alan alternatif sezgisel çözüm yöntemleri de geliştirmektedir. Önerilen bütün sezgisel yöntemlerin performansı çeşitli parametrik tipte ağaçlarla deneysel olarak değerlendirilmektedir.Article Citation - WoS: 4Citation - Scopus: 5Covering Points With Orthogonally Convex Polygons(Elsevier, 2011) Genç, Burkay; Evrendilek, Cem; Hnich, BrahimIn this paper, we address the problem of covering points with orthogonally convex polygons. In particular, given a point set of size n on the plane, we aim at finding if there exists an orthogonally convex polygon such that each edge of the polygon covers exactly one point and each point is covered by exactly one edge. We show that if such a polygon exists, it may not be unique. We propose an O(n log n) algorithm to construct such a polygon if it exists, or else report the non-existence in the same time bound. We also extend our algorithm to count all such polygons without hindering the overall time complexity. Finally, we show how to construct all k such polygons in O(n log n + kn) time. All the proposed algorithms are fast and practical. (C) 2010 Elsevier B.V. All rights reserved.Article Citation - WoS: 11Citation - Scopus: 13Vertex Separators for Partitioning a Graph(Mdpi, 2008) Evrendilek, CemFinite Element Method (FEM) is a well known technique extensively studied for spatial and temporal modeling of environmental processes, weather prediction computations, and intelligent signal processing for wireless sensors. The need for huge computational power arising in such applications to simulate physical phenomenon correctly mandates the use of massively parallel computers to distribute the workload evenly. In this study, a novel heuristic algorithm called Line Graph Bisection which partitions a graph via vertex separators so as to balance the workload amongst the processors and to minimize the communication overhead is proposed. The proposed algorithm is proved to be computationally feasible and makes cost-effective parallel implementations possible to speed up the solution process.Article Citation - WoS: 8Citation - Scopus: 9Complexity of Energy Efficient Localization With the Aid of a Mobile Beacon(IEEE-Inst Electrical Electronics Engineers Inc, 2018) Akcan, Hüseyin; Evrendilek, CemLocalization is an essential service in wireless sensor networks. Trilateration is a commonly used solution to range-based localization for providing such services. It might be, however, impossible to localize the entire network at once using trilateration due to low connectivity on sparse deployments. In such scenarios, a mobile beacon with a known position is used to move among and locate the nodes with low connectivity to aid trilateration. Given a network graph, finding a minimum energy route traveled by the mobile beacon is a key problem in many real-world applications. We prove in this letter that this problem called mobile assisted trilateration based energy optimum localization is NP-hard. To the best of our knowledge, this is the first such result in an attempt to computationally classify this important problem. We also provide a compact integer linear programming formulation for the problem.Article Citation - WoS: 4Citation - Scopus: 4All Colors Shortest Path Problem on Trees(Springer, 2018) Akcay, Mehmet Berkehan; Akcan, Hüseyin; Evrendilek, CemGiven an edge weighted tree T(V, E), rooted at a designated base vertex , and a color from a set of colors assigned to every vertex , All Colors Shortest Path problem on trees (ACSP-t) seeks the shortest, possibly non-simple, path starting from r in T such that at least one node from every distinct color in C is visited. We show that ACSP-t is NP-hard, and also prove that it does not have a constant factor approximation. We give an integer linear programming formulation of ACSP-t. Based on a linear programming relaxation of this formulation, an iterative rounding heuristic is proposed. The paper also explores genetic algorithm and tabu search to develop alternative heuristic solutions for ACSP-t. The performance of all the proposed heuristics are evaluated experimentally for a wide range of trees that are generated parametrically.Article Task Assignment in Tree-Like Hierarchical Structures(Springer, 2017) Evrendilek, Cem; Toroslu, Ismail Hakki; Hashemikhabir, SeyedsasanMany large organizations, such as corporations, are hierarchical by nature. In hierarchical organizations, each entity, except the root, is a sub-part of another entity. In this paper, we study the task assignment problem to the entities of a tree-like hierarchical organization. The inherent tree structure introduces an interesting and challenging constraint to the standard assignment problem. Given a tree rooted at a designated node, a set of tasks, and a real-valued function denoting the weight of assigning a node to a task, the Maximum Weight Tree Matching (MWTM) problem aims at finding a maximum weight matching in such a way that no tasks are left unassigned, and none of the ancestors of an already assigned node is allowed to engage in an assignment. When a task is assigned to an entity in a hierarchical organization, the whole entity including its children becomes responsible from the execution of that particular task. In other words, if an entity has been assigned to a task, neither its descendants nor its ancestors can be assigned to any task. In the paper, we formally introduce MWTM, and prove its NP-hardness. We also propose and experimentally validate an effective heuristic solution based on iterative rounding of a linear programming relaxation for MWTM.Conference Object Citation - WoS: 1Citation - Scopus: 1Covering Points With Orthogonal Polygons(Elsevier, 2014) Evrendilek, Cem; Genc, Burkay; Hnich, BrahimWe address the problem of covering points with orthogonal polygons. Specifically, given a set of n points in the plane, we investigate the existence of an orthogonal polygon such that there is a one-to-one correspondence between the points and the edges of the polygon. In an earlier paper, we have shown that constructing such a covering with an orthogonally convex polygon, if any, can be done in O(n log n) time. In case an orthogonally convex polygon cannot cover the point set, we show in this paper that the problem of deciding whether such a point set can be covered with any orthogonal polygon is NP-complete. The problem remains NP-complete even if the orientations of the edges covering each point are specified in advance as part of the input. (C) 2012 Elsevier B.V. All rights reserved.Master Thesis Mobile Assisted Range-Based Localization in Multi-Storey Buildings(İzmir Ekonomi Üniversitesi, 2015) Unay, Ali Teoman; Akcan, Hüseyin; Evrendilek, CemKonumlama; sağlık hizmetleri, habitat gözlemleme, arama-kurtarma çalışmaları gibi bir çok uygulamada kullanılan bir hizmettir. Bu uygulamalarda konum bilgisi; toplanılan verinin sınıflandırılması, bina içi hareket planlarının ya da tahliye planlarının kurgulanması gibi amaçlar için kullanılır. Küresel konumlandırma sistemleri (GPS) konumlama hizmeti için genel tercih olsa da bu sistemler kapalı alanlarda çalışmaz. Bununla birlikte, kapalı ortam, quadrilaterasyon gibi konumlama algoritmaları için de pek çok sorun teşkil eder. Bu çalışmada, quadrilaterasyonun çok katlı binalardaki zayıflıklarının analizini yaptık ve quadrilaterasyon algoritmasını iyileştirmek için özgün metodlar geliştirdik. Bu metodlarda, ihtiyaç duyulan zamanlarda bir gezgin birimin yardımını aldık. Ayrıca, bu gezgin birimin kullanımını en aza indirirken, konumlanan birim sayısını maksimuma çıkarmayı da amaçladık. Bu tezde, spesifik olarak çok katlı binalar için tasarlanmış, özgün, uzaklık ölçümüne dayalı bir konumlama algoritması sunuyoruz. Algoritmamız, Pasif Konumlama ve Gezgin Yardımlı Konumlama safhalarından oluşuyor ve gezgin müdahalesinin gereksinimini olabildiğince en aza indirmeyi hedefliyor.Article Citation - Scopus: 4Covering Oriented Points in the Plane With Orthogonal Polygons Is Np-Complete(2010) Evrendilek C.; Genç B.; Hnich B.We address the problem of covering points with orthogonal polygons. Specifically, given a set of n grid-points in the plane each designated in advance with either a horizontal or vertical reading, we investigate the existence of an orthogonal polygon covering these n points in such a way that each edge of the polygon covers exactly one point and each point is covered by exactly one edge with the additional requirement that the reading associated with each point dictates whether the edge covering it is to be horizontal or vertical. We show that this problem is NP-complete. © 2010 Elsevier B.V.