Danil Sagunov

发表

Algorithmic Extensions of Dirac's Theorem pdf

Petr A. Golovach, Fedor V. Fomin, Danil Sagunov, 2020, ArXiv.

On Happy Colorings, Cuts, and Structural Parameterizations

Danil Sagunov, Ivan Bliznets, Ivan A. Bliznets, 2019, WG.

Diverse Pairs of Matchings

Petr A. Golovach, Fedor V. Fomin, Geevarghese Philip, 2020, ISAAC.

Maximizing Happiness in Graphs of Bounded Clique-Width

Danil Sagunov, Ivan Bliznets, Ivan A. Bliznets, 2020, LATIN.

Lower Bounds for the Happy Coloring Problems

Danil Sagunov, Ivan Bliznets, Ivan A. Bliznets, 2019, COCOON.

Lower bounds for the happy coloring problems

Danil Sagunov, Ivan Bliznets, 2020, Theor. Comput. Sci..

Solving Target Set Selection with Bounded Thresholds Faster than 2n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^n

Danil Sagunov, Ivan Bliznets, Danil Sagunov, 2018, Algorithmica.

Building large k-cores from sparse graphs

Fedor V. Fomin, Danil Sagunov, Kirill Simonov, 2020, MFCS.

Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

Danil Sagunov, Dmitry Itsykson, Artur Riazanov, 2019, Electron. Colloquium Comput. Complex..

Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

Danil Sagunov, Dmitry Itsykson, Artur Riazanov, 2021, Comput. Complex..

Algorithmic Extensions of Dirac's Theorem pdf

Petr A. Golovach, Fedor V. Fomin, Danil Sagunov, 2020, SODA.

Detours in Directed Graphs pdf

Petr A. Golovach, Fedor V. Fomin, Saket Saurabh, 2022, STACS.

Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

Danil Sagunov, Dmitry Itsykson, Artur Riazanov, 2021, Comput. Complex..