BibTeX record conf/iwpec/HusfeldtT10

download as .bib file

@inproceedings{DBLP:conf/iwpec/HusfeldtT10,
  author       = {Thore Husfeldt and
                  Nina Taslaman},
  editor       = {Venkatesh Raman and
                  Saket Saurabh},
  title        = {The Exponential Time Complexity of Computing the Probability That
                  a Graph Is Connected},
  booktitle    = {Parameterized and Exact Computation - 5th International Symposium,
                  {IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6478},
  pages        = {192--203},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17493-3\_19},
  doi          = {10.1007/978-3-642-17493-3\_19},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/HusfeldtT10.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.