12/12/2017 – Talk by Euripides Markou

Title:Exploration and graph searching problems in networks
Time: 13:00
Location: Meeting room, Building Zeta
Type: Research Result
Speaker: Talk by Euripides Markou
Abstract: In this seminar we will discuss different problems in networks: The Black Hole Search problem in synchronous trees and graphs; the Black Hole Search problem and the rendezvous problem for weak agents (e.g., memoryless). We will show algorithms and discuss impossibility results, new directions and open problems.
Short bio: Euripides Markou is an Assistant Professor at the University of Thessaly. He got his Ph.D. in Computer Science in 2003 from the National University of Athens. His area of interest are in the field of distributed and geometric computing.