@inbook {IOPORT.05345293,
    author       = {F\"urer, Martin},
    title        = {A faster algorithm for finding maximum independent sets in sparse graphs.},
    year         = {2006},
    booktitle    = {LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20--24, 2006. Proceedings.},
    isbn         = {3-540-32755-X},
    pages        = {491-501},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/11682462_46},
    abstract     = {Summary: An algorithm is presented for finding a maximum independent set in a connected graph with $n$ vertices and $m$ edges in time $O(\text {poly}(n)1.2365^{m-n})$. As a consequence, we find a maximum independent set in a graph of degree 3 in time $O(\text {poly}(n)1.1120^n)$, which improves the currently best results of $O(1.1254^{n})$ of Chen, Kanj and Xia.},
    identifier   = {05345293},
}