External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Approximation Algorithms and Lower Bounds for Graph Burning

Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann. Approximation Algorithms and Lower Bounds for Graph Burning. In Nicole Megow, Adam Smith, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA. Volume 275 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]

Authors

Matej Lieskovský

This author has not been identified. Look up 'Matej Lieskovský' in Google

Jirí Sgall

This author has not been identified. Look up 'Jirí Sgall' in Google

Andreas Emil Feldmann

This author has not been identified. Look up 'Andreas Emil Feldmann' in Google
runs on