Danil Sagunov

danilka.pro [at] gmail.com

Branching factor utility

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

Danil Sagunov


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 (PDMI RAS) under supervision of Ivan Bliznets.

Research interests

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


  • Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov.
    Algorithmic Extensions of Dirac's Theorem
  • Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov.
    Diverse Pairs of Matchings
    Accepted to ISAAC 2020 [w]
  • Fedor V. Fomin, Danil Sagunov, Kirill Simonov.
    Building large k-cores from sparse graphs
    MFCS 2020 [w]
    [arXiv] [LIPIcs]
  • Ivan Bliznets, Danil Sagunov.
    Maximizing Happiness in Graphs of Bounded Clique-Width
    LATIN 2020 [w]
    [arXiv] [LNCS]
  • Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov.
    Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
  • Ivan Bliznets, Danil Sagunov.
    Lower Bounds for the Happy Coloring Problems
    COCOON 2019 [w]
    [arXiv] [LNCS] [TCS]
  • Ivan Bliznets, Danil Sagunov.
    On Happy Colorings, Cuts, and Structural Parameterizations
    WG 2019 [w]
    [arXiv] [LNCS]
  • Ivan Bliznets, Danil Sagunov.
    Solving Target Set Selection with Bounded Thresholds Faster than 2^n
    IPEC 2018 [w]
    [arXiv] [LIPIcs]