I dont know if this question belong to this forum, but I will ask it anyway
To your opinions, what are the most recent fundamental results in the field of algorithms ? [Results that can be taught in an advanced undergrad or graduate algorithms course]
In here, I am talking about results with high applicability to computer science, a continuation to what is usually taught in a general algorithm course. For instance, if we were in 1995 I would call skiplists and randomized rounding as new fundamental results in CS.
My main goal: build material for an advanced course on algorithms [that does not get into specific research areas and applications]
(Let's restrict recent to papers published in the late 1990's).