BibTeX record conf/approx/LieskovskySF23

download as .bib file

@inproceedings{DBLP:conf/approx/LieskovskySF23,
  author       = {Matej Lieskovsk{\'{y}} and
                  Jir{\'{\i}} Sgall and
                  Andreas Emil Feldmann},
  editor       = {Nicole Megow and
                  Adam D. Smith},
  title        = {Approximation Algorithms and Lower Bounds for Graph Burning},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
                  Georgia, {USA}},
  series       = {LIPIcs},
  volume       = {275},
  pages        = {9:1--9:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.9},
  doi          = {10.4230/LIPICS.APPROX/RANDOM.2023.9},
  timestamp    = {Tue, 07 May 2024 20:12:27 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/LieskovskySF23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.