BibTeX record conf/latin/GeS10

download as .bib file

@inproceedings{DBLP:conf/latin/GeS10,
  author       = {Qi Ge and
                  Daniel Stefankovic},
  editor       = {Alejandro L{\'{o}}pez{-}Ortiz},
  title        = {The Complexity of Counting Eulerian Tours in 4-Regular Graphs},
  booktitle    = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
                  Oaxaca, Mexico, April 19-23, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6034},
  pages        = {638--649},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-12200-2\_55},
  doi          = {10.1007/978-3-642-12200-2\_55},
  timestamp    = {Sat, 19 Oct 2019 20:12:41 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/GeS10.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.