George B. Mertzios

George B. Mertzios is an Associate Professor in the Department of Computer Science at Durham University, affiliated with the Algorithms and Complexity Research Group (ACiD) within the School of Engineering and Computing Sciences. He has held academic positions at Durham since 2011, progressing from Lecturer to Senior Lecturer and then to Associate Professor since 2017. He has also held visiting positions at institutions including the University of Bordeaux/CNRS and the University of Haifa.

His research interests lie at the intersection of theoretical computer science and network science, with a strong focus on temporal graphs, algorithmic graph theory, parameterized complexity, and combinatorial optimization. He investigates efficient algorithms for dynamic and evolving networks, geometric graph models, and computational problems in network evolution and connectivity. His work often bridges foundational theory with applications in network design and distributed systems.

The recent publications and ongoing activities of George B. Mertzios demonstrate a consistent and impactful research trajectory centered on the algorithmic foundations of temporal and dynamic networks. His work spans complexity analysis, algorithm design, and structural graph theory, with a notable emphasis on temporal vertex cover, sliding window models, and connectivity in time-varying graphs. He frequently publishes in top-tier conferences such as ICALP, MFCS, AAAI, and STACS, as well as leading journals including the Journal of Computer and System Sciences and Algorithmica.

• Gold Medal, Balkan Mathematical Olympiad, 1998
• Distinguish Diploma, Bulgarian National Mathematical Competition 'Chernorizets Hrabar', 1998
• Certificate of Merit, Mediterranean Mathematics Competition, 1999
• Best paper award of Track C, ICALP 2010
• Best student paper award, SAND 2024

George B. Mertzios has been actively involved in research supervision and leadership. He has supervised multiple PhD students to completion and currently advises ongoing doctoral research. He has served as Principal Investigator for EPSRC grants on Algorithmic Aspects of Temporal Graphs and Algorithmic Aspects of Intersection Graph Models, and as a Co-Investigator on projects related to graph coloring. He is a frequent organizer of scientific workshops, including the Algorithmic Aspects of Temporal Graphs series at ICALP and Dagstuhl seminars, and serves on the program committees of numerous international conferences such as MFCS, IWOCA, and SAND.

He is a key member of the Network Engineering Science and Theory in Durham (NESTiD) research group, where he coordinates seminar series and fosters collaborative research in network algorithms and theory.