Go to the corresponding LIPIcs Volume Portal 
Lieskovský, Matej ; Sgall, Jiří ; Feldmann, Andreas Emil
pdfformat: 

@InProceedings{lieskovsky_et_al:LIPIcs.APPROX/RANDOM.2023.9, author = {Lieskovsk\'{y}, Matej and Sgall, Ji\v{r}{\'\i} and Feldmann, Andreas Emil}, title = {{Approximation Algorithms and Lower Bounds for Graph Burning}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {9:19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772969}, ISSN = {18688969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18834}, URN = {urn:nbn:de:0030drops188345}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.9}, annote = {Keywords: Graph Algorithms, approximation Algorithms, randomized Algorithms} }
Keywords:  Graph Algorithms, approximation Algorithms, randomized Algorithms  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)  
Issue Date:  2023  
Date of publication:  04.09.2023 