Danil pursued his Bachelors Degree from Saratov State University. There he was mostly participating in programming competitions like ACM ICPC. He was also teaching high school students in programming and algorithms there.
Then he graduated with distinction from Saint Petersburg Academic University, pursuing Masters Degree in theoretical computer science. He presented the results of his first publication as a master thesis there. Now Danil is a PhD student at Saint Petersburg Department of Steklov Institue of Mathematics under supervision of Ivan Bliznets. Danil's research is focused mostly on parameterized algorithms and graph problems. His research interests include:
- parameterized algorithms
- exact algorithms
- algorithms for NP-hard problems
- computational complexity
- graph problems, algorithms and parameters
Additionally Danil teaches bachelor students in algorithms in Saint Petersburg State University.
ISAAC 2020: The 31st International Symposium on Algorithms and Computation
MFCS 2020: 45th International Symposium on Mathematical Foundations of Computer Science
Parameterized Algorithms Laboratory Researcher