@InProceedings{l20-464-475,
  AUTHOR    = {Andrew Read{-}McFarland and Daniel Stefankovic},
  EDITOR    = {Yoshiharu Kohayakawa and Fl\'avio Keidi Miyazawa},
  TITLE     = {The Hardness of Sampling Connected Subgraphs},
  BOOKTITLE = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
               S\~ao Paulo, Brazil, January 5-8, 2021, Proceedings},
  SERIES    = {Lecture Notes in Computer Science},
  VOLUME    = {12118},
  PAGES     = {464--475},
  PUBLISHER = {Springer},
  YEAR      = {2020},
  URL       = {https://doi.org/10.1007/978-3-030-61792-9\_37},
  DOI       = {10.1007/978-3-030-61792-9\_37},
  TIMESTAMP = {Thu, 03 Dec 2020 00:00:00 +0100},
  BIBURL    = {https://dblp.org/rec/conf/latin/Read-McFarlandS20.bib},
  BIBSOURCE = {dblp computer science bibliography, https://dblp.org}
}