BibTeX record journals/algorithmica/GeS12

download as .bib file

@article{DBLP:journals/algorithmica/GeS12,
  author       = {Qi Ge and
                  Daniel Stefankovic},
  title        = {The Complexity of Counting Eulerian Tours in 4-regular Graphs},
  journal      = {Algorithmica},
  volume       = {63},
  number       = {3},
  pages        = {588--601},
  year         = {2012},
  url          = {https://doi.org/10.1007/s00453-010-9463-4},
  doi          = {10.1007/S00453-010-9463-4},
  timestamp    = {Sat, 19 Oct 2019 19:53:59 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GeS12.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.