pdfformat: 

@InProceedings{ge_et_al:LIPIcs:2010:2867, author = {Qi Ge and Daniel Stefankovic}, title = {{A graph polynomial for independent sets of bipartite graphs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)}, pages = {240250}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897231}, ISSN = {18688969}, year = {2010}, volume = {8}, editor = {Kamal Lodaya and Meena Mahajan}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2867}, URN = {urn:nbn:de:0030drops28676}, doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2010.240}, annote = {Keywords: graph polynomials, #Pcomplete, independent sets, approximate counting problems, Markov chain Monte Carlo} }
Keywords:  graph polynomials, #Pcomplete, independent sets, approximate counting problems, Markov chain Monte Carlo  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)  
Issue date:  2010  
Date of publication:  14.12.2010 