In this presentation, I will talk about some recent work done on algorithms for maintaining topological ordering in an online setting. I will end this talk with discussions on an open combinatorial problem whose solution will help in better analysis of online topological ordering algorithms.