Short Bio

Christos Pergaminelis holds an MEng in Computer Science and Engineering and is currently a PhD candidate in the School of Electrical and Computer Engineering at NTUA, as well as a member of the Archimedes Research Unit, Athena RC. His thesis focused on the efficient computation of partial Gomory–Hu trees, and he has publications in graph algorithms, approximation algorithms, and scheduling.

Research Interests

His research interests are primarily focused on algorithms for dynamic graphs, as well as on scheduling problems.

PhD research in "Finite Pinwheel Scheduling: the k-Visits problem"
Abstract: Pinwheel Scheduling is a fundamental scheduling problem, receiving as input n task deadlines and asking whether there exists an infinite sequence of task executions with no deadline ever being violated. We study a finite version of this problem, proving that it is strongly NP-complete even for two turns and identifying tractable special cases.