BibTeX record conf/cats/GebauerO07

download as .bib file

@inproceedings{DBLP:conf/cats/GebauerO07,
  author       = {Heidi Gebauer and
                  Yoshio Okamoto},
  editor       = {Joachim Gudmundsson and
                  C. Barry Jay},
  title        = {Fast Exponential-Time Algorithms for the Forest Counting in Graph
                  Classes},
  booktitle    = {Theory of Computing 2007. Proceedings of the Thirteenth Computing:
                  The Australasian Theory Symposium {(CATS2007).} January 30 - Febuary
                  2, 2007, Ballarat, Victoria, Australia, Proceedings},
  series       = {{CRPIT}},
  volume       = {65},
  pages        = {63--69},
  publisher    = {Australian Computer Society},
  year         = {2007},
  url          = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV65Gebauer.html},
  timestamp    = {Mon, 08 Feb 2021 13:26:49 +0100},
  biburl       = {https://dblp.org/rec/conf/cats/GebauerO07.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.