Danil Sagunov

Available identifiers

zbMath Open sagunov.danilMaRDI QIDQ1983327

List of research outcomes

Publication	Date of Publication	Type
Tree containment above minimum degree is FPT	2024-11-28	Paper
Approximating long cycle above Dirac's guarantee	2024-11-14	Paper
Longest cycle above Erdős-Gallai bound	2024-11-05	Paper
Approximating long cycle above Dirac's guarantee	2024-08-13	Paper
Long cycles in graphs: extremal combinatorics meets parameterized algorithms (invited talk)	2024-08-06	Paper
Algorithmic extensions of Dirac's theorem	2024-07-19	Paper
Diverse pairs of matchings	2024-05-30	Paper
Turán’s Theorem Through Algorithmic Lens	2024-05-03	Paper
Detours in directed graphs	2024-04-23	Paper
Fair division with minimal withheld information in social networks	2024-03-01	Paper
Diverse Pairs of Matchings	2023-11-14	Paper
Enumeration of minimal tropical connected sets	2023-10-04	Paper
Two generalizations of proper coloring: hardness and approximability	2023-08-10	Paper
Fair division with minimal withheld information in social networks	2023-08-10	Paper
Detours in directed graphs	2023-07-10	Paper
Solving target set selection with bounded thresholds faster than \(2^n\)	2023-02-16	Paper
Building large \(k\)-cores from sparse graphs	2023-01-09	Paper
Maximizing happiness in graphs of bounded clique-width	2022-10-13	Paper
Building large \(k\)-cores from sparse graphs	2022-07-18	Paper
Longest Cycle above Erd\H{o}s-Gallai Bound	2022-02-07	Paper
Correction to: ``Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs	2022-01-03	Paper
Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs	2021-09-10	Paper
Solving target set selection with bounded thresholds faster than \(2^n\)	2021-08-04	Paper
Lower bounds for the happy coloring problems	2020-09-01	Paper
On happy colorings, cuts, and structural parameterizations	2020-02-24	Paper
Lower bounds for the happy coloring problems	2020-02-24	Paper

Research outcomes over time

This page was built for person: Danil Sagunov