BibTeX record conf/stacs/GarbeM16

download as .bib file

@inproceedings{DBLP:conf/stacs/GarbeM16,
  author       = {Frederik Garbe and
                  Richard Mycroft},
  editor       = {Nicolas Ollinger and
                  Heribert Vollmer},
  title        = {The Complexity of the Hamilton Cycle Problem in Hypergraphs of High
                  Minimum Codegree},
  booktitle    = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2016, February 17-20, 2016, Orl{\'{e}}ans, France},
  series       = {LIPIcs},
  volume       = {47},
  pages        = {38:1--38:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2016.38},
  doi          = {10.4230/LIPICS.STACS.2016.38},
  timestamp    = {Sun, 02 Oct 2022 16:16:10 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GarbeM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.