Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Danil Sagunov"
download as .bib file
@article{DBLP:journals/tcs/BliznetsBS24,
author = {Ivan Bliznets and
Anton Bukov and
Danil Sagunov},
title = {Fair division with minimal withheld information in social networks},
journal = {Theor. Comput. Sci.},
volume = {991},
pages = {114446},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2024.114446},
doi = {10.1016/J.TCS.2024.114446},
timestamp = {Sat, 18 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BliznetsBS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FominGSS24,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
editor = {David P. Woodruff},
title = {Tree Containment Above Minimum Degree is {FPT}},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {366--376},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.15},
doi = {10.1137/1.9781611977912.15},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/FominGSS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-05943,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
title = {Hamiltonicity, Path Cover, and Independence Number: An {FPT} Perspective},
journal = {CoRR},
volume = {abs/2403.05943},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.05943},
doi = {10.48550/ARXIV.2403.05943},
eprinttype = {arXiv},
eprint = {2403.05943},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-05943.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BliznetsS23,
author = {Ivan Bliznets and
Danil Sagunov},
title = {Solving Target Set Selection with Bounded Thresholds Faster than 2\({}^{\mbox{n}}\)},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {384--405},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01031-w},
doi = {10.1007/S00453-022-01031-W},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BliznetsS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FominGLSSS23,
author = {Fedor V. Fomin and
Petr A. Golovach and
William Lochet and
Danil Sagunov and
Saket Saurabh and
Kirill Simonov},
title = {Detours in directed graphs},
journal = {J. Comput. Syst. Sci.},
volume = {137},
pages = {66--86},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.05.001},
doi = {10.1016/J.JCSS.2023.05.001},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FominGLSSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FominSS23,
author = {Fedor V. Fomin and
Danil Sagunov and
Kirill Simonov},
title = {Building large \emph{k}-cores from sparse graphs},
journal = {J. Comput. Syst. Sci.},
volume = {132},
pages = {68--88},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2022.10.002},
doi = {10.1016/J.JCSS.2022.10.002},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FominSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BliznetsST23,
author = {Ivan Bliznets and
Danil Sagunov and
Eugene Tagin},
editor = {Marios Mavronicolas},
title = {Enumeration of Minimal Tropical Connected Sets},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {127--141},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_10},
doi = {10.1007/978-3-031-30448-4\_10},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BliznetsST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FominGSS23,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Approximating Long Cycle Above Dirac's Guarantee},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {60:1--60:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.60},
doi = {10.4230/LIPICS.ICALP.2023.60},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/FominGSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FominGSS23,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Tur{\'{a}}n's Theorem Through Algorithmic Lens},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {348--362},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_25},
doi = {10.1007/978-3-031-43380-1\_25},
timestamp = {Wed, 27 Sep 2023 09:00:02 +0200},
biburl = {https://dblp.org/rec/conf/wg/FominGSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-02011,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
title = {Approximating Long Cycle Above Dirac's Guarantee},
journal = {CoRR},
volume = {abs/2305.02011},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.02011},
doi = {10.48550/ARXIV.2305.02011},
eprinttype = {arXiv},
eprint = {2305.02011},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-02011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-07456,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
title = {Tur{\'{a}}n's Theorem Through Algorithmic Lens},
journal = {CoRR},
volume = {abs/2307.07456},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.07456},
doi = {10.48550/ARXIV.2307.07456},
eprinttype = {arXiv},
eprint = {2307.07456},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-07456.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-09678,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
title = {Tree Containment Above Minimum Degree is {FPT}},
journal = {CoRR},
volume = {abs/2310.09678},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.09678},
doi = {10.48550/ARXIV.2310.09678},
eprinttype = {arXiv},
eprint = {2310.09678},
timestamp = {Wed, 25 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-09678.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BliznetsBS22,
author = {Ivan Bliznets and
Anton Bukov and
Danil Sagunov},
editor = {Yong Zhang and
Dongjing Miao and
Rolf H. M{\"{o}}hring},
title = {Fair Division with Minimal Withheld Information in Social Networks},
booktitle = {Computing and Combinatorics - 28th International Conference, {COCOON}
2022, Shenzhen, China, October 22-24, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13595},
pages = {126--137},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22105-7\_12},
doi = {10.1007/978-3-031-22105-7\_12},
timestamp = {Mon, 09 Jan 2023 17:58:31 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BliznetsBS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BliznetsS22,
author = {Ivan Bliznets and
Danil Sagunov},
editor = {Yong Zhang and
Dongjing Miao and
Rolf H. M{\"{o}}hring},
title = {Two Generalizations of Proper Coloring: Hardness and Approximability},
booktitle = {Computing and Combinatorics - 28th International Conference, {COCOON}
2022, Shenzhen, China, October 22-24, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13595},
pages = {82--93},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22105-7\_8},
doi = {10.1007/978-3-031-22105-7\_8},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BliznetsS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FominGSS22,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Longest Cycle Above Erd{\H{o}}s-Gallai Bound},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {55:1--55:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.55},
doi = {10.4230/LIPICS.ESA.2022.55},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/FominGSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BliznetsSS22,
author = {Ivan Bliznets and
Danil Sagunov and
Kirill Simonov},
editor = {Luc De Raedt},
title = {Fine-grained Complexity of Partial Minimum Satisfiability},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {1774--1780},
publisher = {ijcai.org},
year = {2022},
url = {https://doi.org/10.24963/ijcai.2022/247},
doi = {10.24963/IJCAI.2022/247},
timestamp = {Wed, 27 Jul 2022 16:43:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/BliznetsSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FominGSS22,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized
Algorithms (Invited Talk)},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {1:1--1:4},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.1},
doi = {10.4230/LIPICS.MFCS.2022.1},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FominGSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FominGSS22,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Algorithmic Extensions of Dirac's Theorem},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {406--416},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.20},
doi = {10.1137/1.9781611977073.20},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/FominGSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FominGLSS022,
author = {Fedor V. Fomin and
Petr A. Golovach and
William Lochet and
Danil Sagunov and
Kirill Simonov and
Saket Saurabh},
editor = {Petra Berenbrink and
Benjamin Monmege},
title = {Detours in Directed Graphs},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)},
series = {LIPIcs},
volume = {219},
pages = {29:1--29:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.STACS.2022.29},
doi = {10.4230/LIPICS.STACS.2022.29},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FominGLSS022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-03318,
author = {Fedor V. Fomin and
Petr A. Golovach and
William Lochet and
Danil Sagunov and
Kirill Simonov and
Saket Saurabh},
title = {Detours in Directed Graphs},
journal = {CoRR},
volume = {abs/2201.03318},
year = {2022},
url = {https://arxiv.org/abs/2201.03318},
eprinttype = {arXiv},
eprint = {2201.03318},
timestamp = {Thu, 20 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-03318.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-03061,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
title = {Longest Cycle above Erd{\H{o}}s-Gallai Bound},
journal = {CoRR},
volume = {abs/2202.03061},
year = {2022},
url = {https://arxiv.org/abs/2202.03061},
eprinttype = {arXiv},
eprint = {2202.03061},
timestamp = {Wed, 09 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-03061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ItsyksonRSS21,
author = {Dmitry Itsykson and
Artur Riazanov and
Danil Sagunov and
Petr Smirnov},
title = {Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin
Formulas for All Constant-Degree Graphs},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {13},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00213-2},
doi = {10.1007/S00037-021-00213-2},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ItsyksonRSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ItsyksonRSS21a,
author = {Dmitry Itsykson and
Artur Riazanov and
Danil Sagunov and
Petr Smirnov},
title = {Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations
of Tseitin Formulas for All Constant-Degree Graphs},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {16},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00216-z},
doi = {10.1007/S00037-021-00216-Z},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/ItsyksonRSS21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BliznetsS20,
author = {Ivan Bliznets and
Danil Sagunov},
title = {Lower bounds for the happy coloring problems},
journal = {Theor. Comput. Sci.},
volume = {838},
pages = {94--110},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.06.005},
doi = {10.1016/J.TCS.2020.06.005},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BliznetsS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FominGJPS20,
author = {Fedor V. Fomin and
Petr A. Golovach and
Lars Jaffke and
Geevarghese Philip and
Danil Sagunov},
editor = {Yixin Cao and
Siu{-}Wing Cheng and
Minming Li},
title = {Diverse Pairs of Matchings},
booktitle = {31st International Symposium on Algorithms and Computation, {ISAAC}
2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {181},
pages = {26:1--26:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.26},
doi = {10.4230/LIPICS.ISAAC.2020.26},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FominGJPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BliznetsS20,
author = {Ivan Bliznets and
Danil Sagunov},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Maximizing Happiness in Graphs of Bounded Clique-Width},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {91--103},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_8},
doi = {10.1007/978-3-030-61792-9\_8},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/BliznetsS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FominSS20,
author = {Fedor V. Fomin and
Danil Sagunov and
Kirill Simonov},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Building Large k-Cores from Sparse Graphs},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {35:1--35:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.35},
doi = {10.4230/LIPICS.MFCS.2020.35},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/FominSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07612,
author = {Fedor V. Fomin and
Danil Sagunov and
Kirill Simonov},
title = {Building large k-cores from sparse graphs},
journal = {CoRR},
volume = {abs/2002.07612},
year = {2020},
url = {https://arxiv.org/abs/2002.07612},
eprinttype = {arXiv},
eprint = {2002.07612},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07612.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-04605,
author = {Ivan Bliznets and
Danil Sagunov},
title = {Maximizing Happiness in Graphs of Bounded Clique-Width},
journal = {CoRR},
volume = {abs/2003.04605},
year = {2020},
url = {https://arxiv.org/abs/2003.04605},
eprinttype = {arXiv},
eprint = {2003.04605},
timestamp = {Tue, 17 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-04605.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-04567,
author = {Fedor V. Fomin and
Petr A. Golovach and
Lars Jaffke and
Geevarghese Philip and
Danil Sagunov},
title = {Diverse Pairs of Matchings},
journal = {CoRR},
volume = {abs/2009.04567},
year = {2020},
url = {https://arxiv.org/abs/2009.04567},
eprinttype = {arXiv},
eprint = {2009.04567},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-04567.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-03619,
author = {Fedor V. Fomin and
Petr A. Golovach and
Danil Sagunov and
Kirill Simonov},
title = {Algorithmic Extensions of Dirac's Theorem},
journal = {CoRR},
volume = {abs/2011.03619},
year = {2020},
url = {https://arxiv.org/abs/2011.03619},
eprinttype = {arXiv},
eprint = {2011.03619},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-03619.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BliznetsS19,
author = {Ivan Bliznets and
Danil Sagunov},
editor = {Ding{-}Zhu Du and
Zhenhua Duan and
Cong Tian},
title = {Lower Bounds for the Happy Coloring Problems},
booktitle = {Computing and Combinatorics - 25th International Conference, {COCOON}
2019, Xi'an, China, July 29-31, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11653},
pages = {490--502},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-26176-4\_41},
doi = {10.1007/978-3-030-26176-4\_41},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BliznetsS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BliznetsS19,
author = {Ivan Bliznets and
Danil Sagunov},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {On Happy Colorings, Cuts, and Structural Parameterizations},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {148--161},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_12},
doi = {10.1007/978-3-030-30786-8\_12},
timestamp = {Tue, 29 Dec 2020 18:38:49 +0100},
biburl = {https://dblp.org/rec/conf/wg/BliznetsS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-05422,
author = {Ivan Bliznets and
Danil Sagunov},
title = {Lower Bounds for the Happy Coloring Problems},
journal = {CoRR},
volume = {abs/1906.05422},
year = {2019},
url = {http://arxiv.org/abs/1906.05422},
eprinttype = {arXiv},
eprint = {1906.05422},
timestamp = {Mon, 24 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-05422.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-06172,
author = {Ivan Bliznets and
Danil Sagunov},
title = {On Happy Colorings, Cuts, and Structural Parameterizations},
journal = {CoRR},
volume = {abs/1907.06172},
year = {2019},
url = {http://arxiv.org/abs/1907.06172},
eprinttype = {arXiv},
eprint = {1907.06172},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-06172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ItsyksonRSS19,
author = {Dmitry Itsykson and
Artur Riazanov and
Danil Sagunov and
Petr Smirnov},
title = {Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin
Formulas for All Constant-Degree Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-178}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/178},
eprinttype = {ECCC},
eprint = {TR19-178},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ItsyksonRSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BliznetsS18,
author = {Ivan Bliznets and
Danil Sagunov},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {Solving Target Set Selection with Bounded Thresholds Faster than 2n},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.22},
doi = {10.4230/LIPICS.IPEC.2018.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BliznetsS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-10789,
author = {Ivan Bliznets and
Danil Sagunov},
title = {Solving Target Set Selection with Bounded Thresholds Faster than 2\({}^{\mbox{n}}\)},
journal = {CoRR},
volume = {abs/1807.10789},
year = {2018},
url = {http://arxiv.org/abs/1807.10789},
eprinttype = {arXiv},
eprint = {1807.10789},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-10789.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-28 15:18 CEST from data curated 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:
