Font size: Αα Αα Αα hide gadgets
You are here: Students » Iosif Salem

Iosif Salem: student profile


Enrolled in: November 2009
Stopped in: May 2014


Title: On the computability of obstruction sets for well-quasi-ordered graph classes.

Defended: Monday, 17 Sep 2012.


Web standards: XHTML1.0, CSS3.
© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.