معرفی
Jakub Kozik is a Professor in the Department of Algorithmics at the Faculty of Mathematics and Computer Science, Jagiellonian University. His research focuses on probabilistic methods, graph coloring, and analytical combinatorics, with notable contributions to hypergraph coloring algorithms and combinatorial optimization. He has authored over 30 peer-reviewed articles and led multiple research grants, including the National Science Centre-funded projects on hypergraph coloring and online graph coloring algorithms.
- Position: Professor, Department of Algorithmics
- University: Jagiellonian University (Kraków, Poland)
- Key Research Areas: Graph Theory, Combinatorics, Probabilistic Methods
His work bridges combinatorial mathematics and theoretical computer science, addressing problems in algorithm design, randomized algorithms, and structural graph theory. Recent research explores the Alon-Tarsi method, entropy compression techniques, and applications of probabilistic methods to hypergraphs.
Grants include leadership roles in projects like 'Random Greedy Hypergraph Coloring Algorithms' (2024–2027) and 'Online Coloring from Lists' (2017–2021). These projects address fundamental challenges in combinatorial optimization and algorithmic efficiency.
He collaborates with institutions globally and is part of the Algorithmics Research Group, contributing to the Foundations of Computer Science at his faculty.
حوزههای پژوهشی
