Maria José Serna Iglesias (born 1959)[1] is a Spanish computer scientist and mathematician whose research includes work on parallel approximation, on algorithms for cutwidth and linear layout of graphs, on algorithmic game theory,[2] and on adversarial queueing networks.
Her dissertation, The Parallel Approximability of P-complete Problems, combined the ideas of parallel algorithms and approximation algorithms, and was jointly supervised by Spirakis and Joaquim Gabarró.
[7] While in Patras, she continued to hold an associate professor position at the Polytechnic University of Catalonia, in the department of applied mathematics.
[5] Serna is the coauthor of the book Paradigms for Fast Parallel Approximability (with Josep Díaz, Paul Spirakis, and Jacobo Torán, Cambridge University Press, 1997),[8] and of several Spanish and Catalan-language textbooks.
[5] In 2021, a special issue of the journal Computer Science Review was published as a festschrift in honor of Serna's 60th birthday.