Graph matching is one of the most well-studied problems in combinatorial optimization, with applications ranging from scheduling and object recognition to numerical analysis and computational chemistry. Nevertheless, until recently very little was unknown about this problem in real-life {dynamic networks}, which aim to model the constantly changing physical world.
In the first part of the talk I will discuss my work on the dynamic maximum matching problem. In the second part of the talk I will highlight some of my work on a few related fundamental problems in both centralized and distributed systems.
Dr. Shay Solomon is a post-doctoral researcher in the Department of Applied Mathematics and Computer Science at the Weizmann Institute of Science, hosted by Prof. David Peleg. Formerly he did his Ph.D. at the Ben-Gurion University under the supervision of Prof. Michael Elkin.
His main expertise is in graph algorithms, particularly for constructing spanners and trees, and in dynamic and geometric data structures. Additional research interests include combinatorial optimization, computational geometry, and distributed algorithms.
Shay has received several fellowships and awards, including the Charles Clore Foundation Fellowship for doctoral students, the Koshland Fellowship for post-doctoral students, and a best student paper award for his single-authored SODA'11 paper.