Bibtex of Matroid

@article{Avis1996, 
     author = "Avis, David and Fukuda, Komei", 
     doi = "10.1016/0166-218X(95)00026-N", 
     issn = "0166218X", 
     journal = "Discrete Applied Mathematics", 
     link = "http://linkinghub.elsevier.com/retrieve/pii/0166218X9500026N", 
     month = "mar", 
     number = "1-3", 
     pages = "21--46", 
     title = "Reverse search for enumeration", 
     uri = "http://linkinghub.elsevier.com/retrieve/pii/0166218X9500026N", 
     volume = "65", 
     year = "1996", 
}

@article{Fukuda1995, 
     author = "Fukuda, Komei and Namiki, Makoto", 
     doi = "10.1016/0166-218X(94)00088-U", 
     issn = "0166218X", 
     journal = "Discrete Applied Mathematics", 
     keyword = "Common basis,Enumeration,Matroid,Pivot operation", 
     link = "http://www.sciencedirect.com/science/article/pii/0166218X9400088U http://linkinghub.elsevier.com/retrieve/pii/0166218X9400088U", 
     month = "jan", 
     number = "2-3", 
     pages = "231--243", 
     title = "Finding all common bases in two matroids", 
     uri = "http://www.sciencedirect.com/science/article/pii/0166218X9400088U", 
     volume = "56", 
     year = "1995", 
}

@inproceedings{Khachiyan2006a, 
     address = "Zurich, Switzerland", 
     author = "Khachiyan, L and Boros, E and Borys, K", 
     booktitle = "ESA 2006: the 14th Annual European Symposium on Algorithms", 
     doi = "10.1007/11841036_41", 
     editor = "Azar, Yossi and Erlebach, Thomas", 
     link = "http://link.springer.com/chapter/10.1007/11841036_41", 
     month = "sep", 
     pages = "444--455", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "Enumerating spanning and connected subsets in graphs and matroids", 
     uri = "http://link.springer.com/chapter/10.1007/11841036_41", 
     volume = "4168", 
     year = "2006", 
}

@article{Khachiyan2008a, 
     author = "Khachiyan, Leonid and Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa", 
     doi = "10.1007/s00453-007-9111-9", 
     issn = "01784617", 
     journal = "Algorithmica", 
     keyword = "Cut conjunction,Cut generation,Graph,Matroid,Multicut", 
     link = "http://link.springer.com/article/10.1007\%2Fs00453-007-9111-9", 
     number = "3", 
     pages = "239--263", 
     title = "Generating cut conjunctions in graphs and related problems", 
     uri = "http://link.springer.com/article/10.1007%2Fs00453-007-9111-9", 
     volume = "51", 
     year = "2008", 
}