Jaroslav Nešetřil: Borůvka's name is perhaps the best-known Czech name in computer science
One hundred years ago, Professor Otakar Borůvka solved the minimum spanning tree problem, thereby running decades ahead of his time. "Much later, it became a major problem in computer science that is studied to this day," says Jaroslav Nešetřil, Professor of mathematics at Charles University.