Danil Sagunov

danilka.pro [at] gmail.com

My CV

[dblp] [rg] [scholar] [orcid]

Danil Sagunov

About

I graduated from St. Petersburg Academic University and I am now a researcher and a PhD student in Steklov Institute of Mathematics at St. Petersburg.

Research interests

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

Publications

  • Ivan Bliznets, Danil Sagunov.
    Lower Bounds for the Happy Coloring Problems
    COCOON 2019 [w]
    doi:10.1007/978-3-030-26176-4_41
    [arXiv] [LNCS]
  • Ivan Bliznets, Danil Sagunov.
    On Happy Colorings, Cuts, and Structural Parameterizations
    WG 2019 [w]
    [arXiv]
  • Ivan Bliznets, Danil Sagunov.
    Solving Target Set Selection with Bounded Thresholds Faster than 2^n
    IPEC 2018 [w]
    doi:10.4230/LIPIcs.IPEC.2018.22
    [arXiv] [LIPIcs]