E
Evangelos Kranakis
Researcher at Carleton University
Publications - 515
Citations - 10789
Evangelos Kranakis is an academic researcher from Carleton University. The author has contributed to research in topics: Robot & Mobile robot. The author has an hindex of 46, co-authored 502 publications receiving 10330 citations. Previous affiliations of Evangelos Kranakis include Purdue University & Carleton College.
Papers
More filters
Local PTAS for independent set and vertex cover in location aware unit disk graphs (Extended Abstract)
A Andreas,Evangelos Kranakis +1 more
TL;DR: The first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs are presented and it is shown that the processing time which is necessary in order to compute the status of a single vertex is bounded by a polynomial in the number of vertices.
Proceedings ArticleDOI
Location-free link state routing for underwater acoustic sensor networks
TL;DR: A location-free link state routing protocol for Underwater Acoustic Sensor Networks (UASNs) and the mathematical background for the theoretical capacity and transmission power metrics of an underwater acoustic channel is presented.
Journal ArticleDOI
Optimal coteries and voting schemes
TL;DR: The singleton coterie is always optimal on any network when the node reliability is p⩽ 1 2, and the resulting optimal coteries when restricted to a special subclass of complete bipartite networks are shown to exceed the availability of any voting scheme.
Book ChapterDOI
Complexity of Barrier Coverage with Relocatable Sensors in the Plane
Stefan Dobrev,Stephane Durocher,Mohsen Eftekhari,Konstantinos Georgiou,Evangelos Kranakis,Danny Krizanc,Lata Narayanan,Jaroslav Opatrny,Sunil M. Shende,Jorge Urrutia +9 more
TL;DR: This work considers several variations of the problems of covering a set of barriers using sensors that can detect any intruder crossing any of the barriers, and gives an O(n 3/2) algorithm for a natural special case of this last problem.
Journal Article
Local construction of planar spanners in unit disk graphs with irregular transmission ranges
Edgar Chávez,Stefan Dobrev,Evangelos Kranakis,Jaroslav Opatrny,Ladislav Stacho,Jorge Urrutia +5 more
TL;DR: In this paper, the authors give an algorithm for constructing a connected spanning subgraphs (panner) of a wireless network modelled as a unit disk graph with nodes of irregular transmission ranges, whereby for some parameter 0 2 each node needs only consider all the nodes at distance at most k hops from it.