George Mertzios

Dr. George Mertzios is an Associate Professor in the Department of Computer Science at Durham University, UK, affiliated with the Algorithms and Complexity Research Group (ACiD). His academic journey includes postdoctoral research at RWTH Aachen University, Technion, and the University of Haifa, as well as a visiting role at the Laboratoire Bordelais de Recherche en Informatique (LaBRI), France. He holds a PhD in Computer Science (2009) and a Diplom in Mathematics with a minor in Computer Science (2005) from TU München.

His research focuses on algorithmic graph theory, temporal graphs, computational complexity, parameterized complexity, and combinatorial optimization. Notable contributions include advancements in temporal network optimization, evolutionary graph theory, and efficient graph algorithms. He has supervised numerous PhD students and has been involved in organizing international workshops and conferences on temporal graphs and algorithmic foundations.

Key awards include a Gold Medal in the 1998 Balkan Mathematical Olympiad. He has secured EPSRC grants, including leadership roles in projects on temporal graphs and intersection graph models. His work has been published in top venues like SODA, ICALP, and STACS, with over 150 peer-reviewed articles.

Dr. Mertzios has held academic and organizing roles in conferences such as ICALP, ALGOWIN, and MFCS, and has served on program committees for multiple international symposia. His research group collaborates on foundational aspects of dynamic networks and algorithmic complexity.