pdfformat: 

@InProceedings{fomin_et_al:LIPIcs.MFCS.2022.1, author = {Fomin, Fedor V. and Golovach, Petr A. and Sagunov, Danil and Simonov, Kirill}, title = {{Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {1:11:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772563}, ISSN = {18688969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16799}, URN = {urn:nbn:de:0030drops167999}, doi = {10.4230/LIPIcs.MFCS.2022.1}, annote = {Keywords: Longest path, longest cycle, fixedparameter tractability, above guarantee parameterization, average degree, dense graph, Dirac theorem, Erd\H{o}sGallai theorem} }
Keywords:  Longest path, longest cycle, fixedparameter tractability, above guarantee parameterization, average degree, dense graph, Dirac theorem, ErdősGallai theorem  
Seminar:  47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)  
Issue date:  2022  
Date of publication:  22.08.2022 