Go to the corresponding LIPIcs Volume Portal 
Chalermsook, Parinya ; Fomin, Fedor ; Hamm, Thekla ; Korhonen, Tuukka ; Nederlof, Jesper ; Orgo, Ly
pdfformat: 

@InProceedings{chalermsook_et_al:LIPIcs.ESA.2023.33, author = {Chalermsook, Parinya and Fomin, Fedor and Hamm, Thekla and Korhonen, Tuukka and Nederlof, Jesper and Orgo, Ly}, title = {{PolynomialTime Approximation of Independent Set Parameterized by Treewidth}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {33:133:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772952}, ISSN = {18688969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and FarachColton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18686}, URN = {urn:nbn:de:0030drops186865}, doi = {10.4230/LIPIcs.ESA.2023.33}, annote = {Keywords: Maximum Independent Set, Treewidth, Approximation Algorithms, Parameterized Approximation} }
Keywords:  Maximum Independent Set, Treewidth, Approximation Algorithms, Parameterized Approximation  
Collection:  31st Annual European Symposium on Algorithms (ESA 2023)  
Issue Date:  2023  
Date of publication:  30.08.2023 