Scholar
Jan Bok
Google Scholar ID: N-YMakMAAAAJ
Charles University
Citations & Impact
Citations
170
H-index
7
i10-index
5
Publications
20
Co-authors
20
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Published multiple papers in journals such as Algorithmica, Theory and Decision, and conference proceedings, covering topics like list covering of regular multigraphs, 1-convex extensions of incomplete cooperative games, computational complexity, etc.
Research Experience
- Currently a postdoctoral researcher in ERC Synergy grant POCOCOP, hosted by Libor Barto at the Department of Algebra, Faculty of Mathematics and Physics, Charles University; previously (February 2023--May 2024) was a postdoctoral researcher at LIMOS laboratory, University of Clermont Auvergne, hosted by Florent Foucaud.
Education
- PhD from the Computer Science Institute, Faculty of Mathematics and Physics, Charles University, advised by Jaroslav Nešetřil.
Background
- Research interests include constraint satisfaction problems, graph homomorphisms and algebraic graph theory, algorithms and complexity, cooperative game theory. Also interested in universal algebra, linear-algebraic methods in combinatorics, and graph classes. Has worked on problems in chemical graph theory.
Miscellany
- Contact: jan.bok@matfyz.cuni.cz
