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
Book ChapterDOI
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
Jurek Czyzowicz,Evangelos Kranakis,Danny Krizanc,Ioannis Lambadaris,Lata Narayanan,Jaroslav Opatrny,Ladislav Stacho,Jorge Urrutia,Mohammadreza Yazdani +8 more
TL;DR: It is shown that the problem of finding final positions of sensors which establish a barrier coverage of I so that the sum of the distances traveled by all sensors from initial to final positions is minimized.
Proceedings ArticleDOI
Communication in wireless networks with directional antennas
TL;DR: Algorithms for simple polynomial-time-solvable cases of the problem of maintaining connectivity in a wireless network where the network nodes are equipped with directional antennas are presented and it is shown that the problem is NP-complete in the $2$-dimensional case when the sector angle is small.
Book ChapterDOI
Evacuating Robots via Unknown Exit in a Disk
Jurek Czyzowicz,Leszek Gąsieniec,Thomas Gorry,Evangelos Kranakis,Russell Martin,Dominik Pajak +5 more
TL;DR: Consider k mobile robots inside a circular disk of unit radius required to evacuate the disk through an unknown exit point situated on its boundary and all robots having the same (unit) maximal speed.
Journal Article
Asynchronous deterministic rendezvous in graphs
TL;DR: In this article, the authors considered the asynchronous rendezvous problem and gave a deterministic rendezvous algorithm with cost O(D|L min | 2 ) when D is known and O((D + |L max |) 3 ) if D is unknown, where L is the length of the shorter and longer label of the agents.
Book ChapterDOI
Towards a General Theory
TL;DR: A closer look at the proofs in subsections 4.8 and 4.10 will reveal the basic principles needed to construct secure pseudo randomgenerators.