Font size: Αα Αα Αα hide gadgets
You are here: Students » Iosif Salem Anonymously browsing from at 15:05:24, 25-04-2019. login

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.


Page updates

No recent updates.

Feeds RSS and Atom feeds

all posts RSS
news RSS
announcements RSS
website news RSS
all events RSS
defenses RSS
exams RSS
seminars RSS
graduations RSS
Web standards: XHTML1.0, CSS3.
© 1996 – 2019 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.