George B. Mertzios

Papers

Total Citations

H-Index

About

George B. Mertzios is a leading researcher in the theory of temporal graphs and algorithmic graph theory. His work focuses on understanding how time-dependent connectivity and pathfinding problems can be solved efficiently, with major contributions to the study of temporally disjoint paths—a fundamental concept for modeling interference-free communication in dynamic networks. In his highly cited 2021–2022 papers, Mertzios and his co-authors systematically investigate the computational complexity of finding paths or walks in temporal graphs that do not share any time steps, establishing key hardness and tractability results that have become foundational in the field. With over 15 citations on this work alone, his research has significant impact on both theoretical computer science and practical applications like routing in delay-tolerant networks and scheduling. Mertzios is also known for his broader contributions to graph algorithms, parameterized complexity, and temporal network analysis, making him a key figure for students and researchers interested in the algorithmic challenges of time-evolving systems.