@article{Okamoto2008, 
     author = "Okamoto, Yoshio and Uno, Takeaki and Uehara, Ryuhei", 
     doi = "10.1016/j.jda.2006.07.006", 
     issn = "15708667", 
     journal = "Journal of Discrete Algorithms", 
     keyword = "chordal graph,counting,enumeration,independent set,np -completeness,p -completeness,polynomial time algorithm", 
     link = "http://linkinghub.elsevier.com/retrieve/pii/S1570866707000330", 
     month = "jun", 
     number = "2", 
     pages = "229--242", 
     title = "Counting the number of independent sets in chordal graphs", 
     uri = "http://linkinghub.elsevier.com/retrieve/pii/S1570866707000330", 
     volume = "6", 
     year = "2008", 
}

Problems: 26 27 28