معرفی
Grzegorz Gutowski is a researcher at the Department of Algorithmics, Faculty of Mathematics and Computer Science, Jagiellonian University. His research focuses on algorithms, graph theory, combinatorics, and computational complexity. He holds a Ph.D. in Computer Science from Jagiellonian University (2012). His work includes studies on graph coloring, online algorithms, combinatorial optimization, and algorithmic game theory.
Key Research Themes:
- Graph coloring problems (e.g., online coloring, group coloring, interval coloring)
- Algorithmic complexity analysis
- Combinatorial game theory (e.g., slow-coloring games)
- Transportation network algorithms (e.g., Dial-a-Ride problems)
Recent Publications Trends: Recent work emphasizes applications in graph theory, particularly in coloring and structural graph analysis. Notable contributions include studies on treewidth in planar graphs, mixed interval graphs, and combinatorial problems posed by Steinhaus.
Awards & Grants:
- Principal Investigator for grants on algorithmic Nullstellensatz (2020-2025), smart transportation systems, and colonoscopy diagnostics
Academic Activities:
- Supervises graduate research in algorithmics
- Active in organizing workshops and conferences on theoretical computer science
- Member of the Algorithmics Research Group at Jagiellonian University