Saint Petersburg, 199178, Russia, Line 14th (Vasilyevsky Island), 29
(812) 363-68-71, (812) 363-68-72
ru en
Danil Sagunov
Danil Sagunov
Assistant Professor

29B Line 14th (Vasilyevsky Island), 199178 Saint Petersburg, Russia

Reception hours:

By appointrment


06.2019 — M.Sc. in Mathematics
Institution: St. Petersburg Academic University

06.2017 — B.Sc. in Computer Science
Institution: Saratov State University

Scientific interests

My research interests include:

  • parameterized algorithms
  • exact algorithms
  • algorithms for NP-hard problems
  • kernelization
  • computational complexity
  • graph problems, algorithms and parameters



Selected publications

  1. Bliznets and D. Sagunov (2019). Lower Bounds for the Happy Coloring Problems. In proceedings of COCOON 2019. DOI:10.1007/978-3-030-26176-4_41
  2. Bliznets and D. Sagunov (2019). On Happy Colorings, Cuts, and Structural Parameterizations. In proceedings of WG 2019. DOI:10.1007/978-3-030-30786-8_12
  3.  Bliznets and D. Sagunov (2018). Solving Target Set Selection with Bounded Thresholds Faster than 2^n. In proceedings of IPEC 2018. DOI:10.4230/LIPIcs.IPEC.2018.22

Additional Information