January 23, 2013.
Matthijs Bomhoff succesfully defended his PhD thesis on bipartite graphs and the decomposition of systems of equations. Matthijs, who previously has done an MSc in both Applied Mathematics and Computer Science at the University of Twente, has been supervised by Georg Still, Marc Uetz being his promotor. In his thesis, he addresses theoretical questions that play a role while decomposing large linear systems, for example when performing Gaussian elimination. His results include, among other things, hardness proofs for bounded lock decompositions and for recognizing perfect partial elimination graphs, as well as new algorithms for recognizing perfect elimination bipartite graphs. Matthijs will continue to work as head of development at the company Quarantainenet, a company that he has co-founded already several years ago.
