George B. Mertzios

Dr. George B. Mertzios is an Associate Professor at the Department of Computer Science, Durham University, UK. His career spans roles including Senior Lecturer (2015-2017) and Lecturer (2011-2015) at Durham, with additional positions as an Invited Assistant Professor at LaBRI, University of Bordeaux/CNRS, France (2012), and postdoctoral research fellowships at the University of Haifa and Technion, Israel (2010-2011). He earned his PhD in Computer Science from RWTH Aachen University (2009) and a Diplom in Mathematics from Technische Universität München (2005).

• Education
  • PhD in Computer Science, RWTH Aachen University, 2009
  • Diplom in Mathematics (minor in Computer Science), Technische Universität München, 2005

Research Interests focus on efficient algorithms and computational complexity in temporal graphs, with significant contributions to dynamic network optimization, evolutionary graph theory, and parameterized complexity. His work bridges combinatorial optimization, algorithmic game theory, and intersection graph models.

Scientific Activities include organizing

• Co-Chair of the PC for SAND 2026
• Co-Organizer of Dagstuhl Seminar 26251 (2026)
• Organizer of the Algorithmic Aspects of Temporal Graphs workshops (2018-2025)

His 15 most recent articles (2025-2021) address problems in temporal graph realization, dynamic network optimization, Hamiltonian cycles, and epidemic control on temporal networks, published in top venues like Theoretical Computer Science, Journal of Computer and System Sciences, and Algorithmica.

Scientific Awards include a Gold Medal in the 1998 Balkan Mathematical Olympiad, Distinguished Diploma in the 1998 Bulgarian National Mathematical Competition, and Best Paper Awards at ALGOWIN 2025 and ICALP 2010 Track C.

Research Supervision includes advising

• PhD students: David Fairbairn (in progress), David Kutner (2025), Nina Klobas (2024), Charles Murray (2021), Sepehr Meshkinfamfard (2016), Ioannis Lignos (2016)
• Postdoctoral researchers: Christoforos Raptopoulos (2020), Viktor Zamaraev (2017-2019), André Nichterlein (2016-2017), Archontia Giannopoulou (2014-2015), Konrad Dabrowski (2012-2013)

Grants led include EPSRC grants EP/P020372/1 (2017-2020) on algorithmic aspects of temporal graphs and EP/K022660/1 (2013-2015) on intersection graph models. He also contributed to the EU IP MULTIPLEX (2012-2016).