Associate Professor in the Department of Computer Science
George Mertzios’ research interests lie in the algorithmic aspects of basic combinatorial and graph problems which are also motivated by practical applications. These include algorithmic problems on intersection graphs, tolerance intersection graphs, temporal (i.e. dynamic) graphs, as well as fine-grained (i.e. parameterized) polynomial-time algorithms for graph problems.