معرفی
Kirill Simonov is an Associate Professor in the Department of Informatics at the University of Bergen. His research focuses on parameterized complexity, algorithm design, and graph theory, with particular emphasis on clustering algorithms, graph modification problems, and algorithmic graph theory. He has contributed to foundational work in fair clustering, approximate algorithms for graph cycles, and structural analysis of sparse graphs.
His notable contributions include studies on coresets for fair clustering, algorithmic extensions of Dirac's theorem, and techniques for building large k-cores from sparse graphs. His work is supported by the Research Council of Norway (Project 314528). He frequently collaborates with leading researchers like Fedor Fomin and Petr Golovach on topics such as parameterized algorithms and combinatorial optimization.
Simonov's publications span venues like the Journal of Computer and System Sciences and Leibniz International Proceedings in Informatics. His research bridges theoretical computer science with practical algorithmic solutions for graph problems and data clustering challenges.
