BibTeX record conf/esa/GibneyT19

download as .bib file

@inproceedings{DBLP:conf/esa/GibneyT19,
  author       = {Daniel Gibney and
                  Sharma V. Thankachan},
  editor       = {Michael A. Bender and
                  Ola Svensson and
                  Grzegorz Herman},
  title        = {On the Hardness and Inapproximability of Recognizing Wheeler Graphs},
  booktitle    = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
                  9-11, 2019, Munich/Garching, Germany},
  series       = {LIPIcs},
  volume       = {144},
  pages        = {51:1--51:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2019.51},
  doi          = {10.4230/LIPICS.ESA.2019.51},
  timestamp    = {Mon, 23 Sep 2019 17:27:06 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/GibneyT19.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.