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
Proceedings ArticleDOI
Baked potatoes: deadlock prevention via scheduling
TL;DR: The equivalence of deadlock prevention in store-and-forward communication networks and simultaneous arrival of packets to a(n optical) switch of bufferless high-speed networks is identified.
Journal ArticleDOI
Counting problems relating to a theorem of Dirichlet
TL;DR: In this paper, the authors study weighted versions of Dirichlet's theorem on the probability that two integers, taken at random, are relatively prime and propose a uniform approach in the study of several counting problems in discrete and computational geometry relating to incidences between points and lines.
Proceedings ArticleDOI
Traversal of a quasi-planar subdivision without using mark bits
Edgar Chávez,Jaroslav Opatrny,Stefan Dobrev,Ladislav Stacho,Evangelos Kranakis,Jorge Urrutia +5 more
TL;DR: An algorithm to traverse any quasiplanar subdivision that satisfies a simple requirement is described and the worst case running time is O(|E| log |E|), which matches the running time of the traversal algorithm for planar subdivisions.
Book ChapterDOI
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs
TL;DR: Depending on certain conditions reflecting the knowledge of the robots, it is shown that a rendezvous algorithm is always possible on a general connected graph.
Proceedings ArticleDOI
Energy Consumption of Group Search on a Line
Jurek Czyzowicz,Konstantinos Georgiou,Ryan Killick,Evangelos Kranakis,Danny Krizanc,Manuel Lafond,Lata Narayanan,Jaroslav Opatrny,Sunil M. Shende +8 more
TL;DR: The result shows that two robots can search on the line in optimal time $9d$ while consuming less total energy than a single robot within the same search time.