Bibtex of Hypergraph

@article{Boros2000a, 
     author = "Boros, E. and Gurvich, V. and Elbassioni, K. and Khachiyan, L.", 
     doi = "10.1142/S0129626400000251", 
     issn = "0129-6264", 
     journal = "Parallel Processing Letters", 
     link = "http://www.worldscientific.com/doi/abs/10.1142/S0129626400000251", 
     month = "dec", 
     number = "04", 
     pages = "253--266", 
     title = "An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension", 
     uri = "http://www.worldscientific.com/doi/abs/10.1142/S0129626400000251", 
     volume = "10", 
     year = "2000", 
}

@inproceedings{Boros2004, 
     address = "Aires, Argentina", 
     author = "Boros, Endre and Elbassioni, Khaled", 
     booktitle = "LATIN 2004: the 6th Latin American Symposium on Theoretical Informatics", 
     doi = "10.1007/978-3-540-24698-5_52", 
     editor = "Farach-Colton, Mart\'{\i}n", 
     link = "http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52", 
     month = "apr", 
     pages = "488--498", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "Generating maximal independent sets for hypergraphs with bounded edge-intersections", 
     uri = "http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52", 
     volume = "2976", 
     year = "2004", 
}

@inproceedings{Daigo2009, 
     address = "\v{S}pindlerův Ml\'{y}n, Czech Republic", 
     author = "Daigo, Taishin and Hirata, Kouichi", 
     booktitle = "SOFSEM 2009: the 35th Conference on Current Trends in Theory and Practice of Computer Science", 
     doi = "10.1007/978-3-540-95891-8_19", 
     editor = "Nielsen, Mogens and Ku\v{c}era, Anton\'{\i}n and Miltersen, Peter Bro and Palamidessi, Catuscia and Tůma, Petr and Valencia, Frank", 
     link = "http://link.springer.com/chapter/10.1007/978-3-540-95891-8_19", 
     month = "jan", 
     pages = "181--192", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay", 
     uri = "http://link.springer.com/chapter/10.1007/978-3-540-95891-8_19", 
     volume = "5404", 
     year = "2009", 
}

@inproceedings{Tamaki2000, 
     author = "Tamaki, Hisao", 
     booktitle = "SIGAL reports", 
     doi = "MY/Tamaki_2000_110002812417", 
     issn = "09196072", 
     jpnbooktitle = "アルゴリズム研究会報告", 
     jpnpublisher = "一般社団法人情報処理学会", 
     jpntitle = "極小横断列挙のメモリ効率の良いアルゴリズム", 
     link = "http://ci.nii.ac.jp/naid/110002812417/", 
     month = "nov", 
     number = "103", 
     pages = "29--36", 
     publisher = "Information Processing Society of Japan", 
     title = "Space-efficient enumeration of minimal transversals of a hypergraph (in Japanese)", 
     uri = "http://ci.nii.ac.jp/naid/110002812417/", 
     year = "2000", 
     zzzeditor = "-, -", 
}

@inproceedings{Wasa2013, 
     address = "Singapore", 
     author = "Wasa, Kunihiro and Uno, Takeaki and Hirata, Kouichi and Arimura, Hiroki", 
     booktitle = "DS 2013: the 16th International Conference on Discovery Science", 
     doi = "10.1007/978-3-642-40897-7_21", 
     editor = "F\"{u}rnkranz, Johannes and H\"{u}llermeier, Eyke and Higuchi, Tomoyuki", 
     isbn = "9783642408960", 
     issn = "16113349", 
     link = "http://link.springer.com/chapter/10.1007/978-3-642-40897-7_21", 
     month = "oct", 
     pages = "308--323", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "Polynomial delay and space discovery of connected and acyclic sub-hypergraphs in a hypergraph", 
     uri = "http://link.springer.com/chapter/10.1007/978-3-642-40897-7_21", 
     volume = "8140", 
     year = "2013", 
}