Computing the Tutte polynomial in vertex-exponential time

Reference:

Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Computing the tutte polynomial in vertex-exponential time. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008, October 25–28, Philadelphia, PA), pages 677–686, Los Alamitos, CA, 2008. IEEE Computer Society.

Suggested BibTeX entry:

@inproceedings{bibdb-export-pkaski-2008-11,
    address = {Los Alamitos, CA},
    author = {Andreas Bj{\"o}rklund and Thore Husfeldt and Petteri Kaski and Mikko Koivisto},
    booktitle = {Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008, October 25--28, Philadelphia, PA)},
    pages = {677--686},
    publisher = {IEEE Computer Society},
    title = {Computing the Tutte polynomial in vertex-exponential time},
    year = {2008},
}