My undergrad was in the Electrical and Computer Engineering department of the National Technical University of Athens where I completed my thesis on Minimum and Maximum Constraints in the Team Orienteering with Time Windows under the supervision of Dimitris Fotakis and Nikos Vathis.
During my PhD I am focusing on provable theory results in algorithms, convex optimization and graph theory. In the past year I have been working on hypergraphs and trying to lift known results in graph theory to hypergraphs.
While reachability and minimum distance admit the exact same solutions and problems like MST are NP-hard (reduction from Set Cover), problems like diffusion and sparsest cut require the proofs to be redone, as some properties no longer hold true (linearity).
