Jarnik was a Czech mathematician and who worked as a professor and administrator at Charles University. Jarnik's algorithm for minimal spanning trees is named after him.