default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanil Sagunov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. Algorithmica 86(6): 2026-2040 (2024)- [j8]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. Algorithmica 86(8): 2676-2713 (2024) - [j7]Ivan Bliznets, Anton Bukov, Danil Sagunov:
Fair division with minimal withheld information in social networks. Theor. Comput. Sci. 991: 114446 (2024) - [c17]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Tree Containment Above Minimum Degree is FPT. SODA 2024: 366-376 - [i14]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective. CoRR abs/2403.05943 (2024) - 2023
- [j6]Ivan Bliznets
, Danil Sagunov:
Solving Target Set Selection with Bounded Thresholds Faster than 2n. Algorithmica 85(2): 384-405 (2023) - [j5]Fedor V. Fomin, Danil Sagunov, Kirill Simonov:
Building large k-cores from sparse graphs. J. Comput. Syst. Sci. 132: 68-88 (2023) - [j4]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov:
Detours in directed graphs. J. Comput. Syst. Sci. 137: 66-86 (2023) - [c16]Ivan Bliznets, Danil Sagunov, Eugene Tagin:
Enumeration of Minimal Tropical Connected Sets. CIAC 2023: 127-141 - [c15]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. ICALP 2023: 60:1-60:18 - [c14]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Turán's Theorem Through Algorithmic Lens. WG 2023: 348-362 - [i13]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Approximating Long Cycle Above Dirac's Guarantee. CoRR abs/2305.02011 (2023) - [i12]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Turán's Theorem Through Algorithmic Lens. CoRR abs/2307.07456 (2023) - [i11]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Tree Containment Above Minimum Degree is FPT. CoRR abs/2310.09678 (2023) - 2022
- [c13]Ivan Bliznets, Danil Sagunov:
Two Generalizations of Proper Coloring: Hardness and Approximability. COCOON 2022: 82-93 - [c12]Ivan Bliznets, Anton Bukov, Danil Sagunov:
Fair Division with Minimal Withheld Information in Social Networks. COCOON 2022: 126-137 - [c11]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle Above Erdős-Gallai Bound. ESA 2022: 55:1-55:15 - [c10]Ivan Bliznets, Danil Sagunov, Kirill Simonov:
Fine-grained Complexity of Partial Minimum Satisfiability. IJCAI 2022: 1774-1780 - [c9]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). MFCS 2022: 1:1-1:4 - [c8]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Algorithmic Extensions of Dirac's Theorem. SODA 2022: 406-416 - [c7]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. STACS 2022: 29:1-29:16 - [i10]Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Kirill Simonov, Saket Saurabh:
Detours in Directed Graphs. CoRR abs/2201.03318 (2022) - [i9]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle above Erdős-Gallai Bound. CoRR abs/2202.03061 (2022) - 2021
- [j3]Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30(2): 13 (2021) - [j2]Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30(2): 16 (2021) - 2020
- [j1]Ivan Bliznets, Danil Sagunov:
Lower bounds for the happy coloring problems. Theor. Comput. Sci. 838: 94-110 (2020) - [c6]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. ISAAC 2020: 26:1-26:12 - [c5]Ivan Bliznets, Danil Sagunov:
Maximizing Happiness in Graphs of Bounded Clique-Width. LATIN 2020: 91-103 - [c4]Fedor V. Fomin, Danil Sagunov, Kirill Simonov:
Building Large k-Cores from Sparse Graphs. MFCS 2020: 35:1-35:14 - [i8]Fedor V. Fomin, Danil Sagunov, Kirill Simonov:
Building large k-cores from sparse graphs. CoRR abs/2002.07612 (2020) - [i7]Ivan Bliznets, Danil Sagunov:
Maximizing Happiness in Graphs of Bounded Clique-Width. CoRR abs/2003.04605 (2020) - [i6]Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, Danil Sagunov:
Diverse Pairs of Matchings. CoRR abs/2009.04567 (2020) - [i5]Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Algorithmic Extensions of Dirac's Theorem. CoRR abs/2011.03619 (2020)
2010 – 2019
- 2019
- [c3]Ivan Bliznets, Danil Sagunov:
Lower Bounds for the Happy Coloring Problems. COCOON 2019: 490-502 - [c2]Ivan Bliznets, Danil Sagunov:
On Happy Colorings, Cuts, and Structural Parameterizations. WG 2019: 148-161 - [i4]Ivan Bliznets, Danil Sagunov:
Lower Bounds for the Happy Coloring Problems. CoRR abs/1906.05422 (2019) - [i3]Ivan Bliznets, Danil Sagunov:
On Happy Colorings, Cuts, and Structural Parameterizations. CoRR abs/1907.06172 (2019) - [i2]Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c1]Ivan Bliznets, Danil Sagunov:
Solving Target Set Selection with Bounded Thresholds Faster than 2^n. IPEC 2018: 22:1-22:14 - [i1]Ivan Bliznets, Danil Sagunov:
Solving Target Set Selection with Bounded Thresholds Faster than 2n. CoRR abs/1807.10789 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-31 21:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
