Mgr. Jan Kynčl, Ph.D.

Jan Kynčl is a leading expert in combinatorics and discrete geometry, in which he has made breakthrough discoveries. He has improved algorithms for drawing abstract topological graphs and obtained new estimates for the graph crossing number. Both are related, for example, to clear visualization of diagrams with many intersection points, such as diagrams of airline connections between cities or biological or social networks. With other co-authors, he obtained a superlinear lower bound on the number of empty convex pentagons in point sets, a frontier that had resisted for 30 years. He also achieved several important results on the structure of permutations that advanced the field. Jan Kynčl graduated from Charles University, where he is now an assistant professor at the Faculty of Mathematics and Physics.