Dynamic graph matching and related problems

01/01/2018 - 10:00

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 we'll discuss our work on dynamic graph matching, and in the second part we'll highlight our work on a few related problems.



Shay Solomon is currently a Herman Goldstine Postdoctoral Fellow at IBM T. J. Watson Research Center.

Prior to joining IBM, he was a Rothschild and Fulbright Postdoctoral Fellow at Stanford University, hosted by Prof. Moses Charikar and Prof. Virginia Vassilevska Williams.

Solomon received a Ph.D. degree in Computer Science from the Ben-Gurion University under the guidance of Prof. Michael Elkin.

Solomon's Ph.D. dissertation investigates several longstanding graph compression problems, and has received numerous awards, including a best student paper award for his single-authored SODA'11 paper.

His postdoctoral work focuses on fundamental computational challenges that arise when dealing with dynamic networks.