معرفی
Jan Bok is a postdoctoral researcher in the ERC Synergy grant POCOCOP at the Department of Algebra, Faculty of Mathematics and Physics, Charles University. Previously, he held postdoctoral positions at LIMOS laboratory (University of Clermont Auvergne) and was a PhD student/researcher at the Computer Science Institute, Charles University under advisor Jaroslav Nešetřil. His research focuses on constraint satisfaction problems, graph homomorphisms, algorithms, complexity, and cooperative game theory. He has authored/co-authored over 30 publications, with recent work addressing multigraph covering, cooperative game extensions, and signed graph homomorphisms. His research also includes studies on universal algebra, combinatorial methods, and chemical graph theory. He collaborates widely and maintains active profiles on arXiv, Google Scholar, and zbMATH.
