معرفی
Assoc. Prof. Petr Kolman is an academic at the Department of Applied Mathematics, Charles University, where he serves in advisory bodies of the faculty management. His research focuses on theoretical computer science, combinatorial optimization, and graph algorithms, particularly in approximation techniques and network flow problems. He has taught courses such as Linear Algebra 1/2 and Mathematical Programming and Polyhedral Combinatorics.
Recent publications highlight his work on spanning tree congestion (2025), length-bounded cuts (2020), and treewidth-based extended formulations (2020). His research spans algorithms, flow theory, and graph modification problems. He maintains contact through kolman@kam.mff.cuni.cz and office hours in Prague Malostranské nám. 2/25, 2nd floor, room S225.
