Even in CS I'm always amazed that an "easy" algorithm problem we expect a new grad to solve was solved in the 70s by CS professors who published papers about the topic.
As a self taught developer with no formal education in CS, I'm amazed to know this. I'd love to read a paper outlining the solution of a rather simple algorithm (by today's standards). Sounds fascinating.
edmonds-karp, dijkstra search, kruskal mst, floyd-warshall, bellman-ford, tarjans least common ancestor, danzig's simplex method, etc. are all algos that were paper pubs throughout last century, covered in CLRS i.e. good undergrad algos class, and come up in interview style questions.
