Bibtex of Graph / Matching

@inproceedings{Basavaraju2014, 
     address = "Nouan-le-Fuzelier, France", 
     author = "Basavaraju, Manu and Heggernes, Pinar and {van ’t Hof}, Pim and Saei, Reza and Villanger, Yngve", 
     booktitle = "WG 2014: the 40th International Workshop on Graph-Theoretic Concepts in Computer Science", 
     doi = "10.1007/978-3-319-12340-0_8", 
     editor = "Kratsch, Dieter and Todinca, Ioan", 
     isbn = "9783642114083", 
     link = "http://link.springer.com/10.1007/978-3-319-12340-0_8", 
     month = "jun", 
     pages = "93--104", 
     publisher = "Springer International Publishing", 
     series = "Lecture Notes in Computer Science", 
     title = "Maximal Induced Matchings in Triangle-Free Graphs", 
     uri = "http://link.springer.com/10.1007/978-3-319-12340-0_8", 
     volume = "8747", 
     year = "2014", 
}

@article{Boros2006, 
     author = "Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir", 
     doi = "10.1002/jgt.20180", 
     issn = "03649024", 
     journal = "Journal of Graph Theory", 
     keyword = "Bipartite graphs,Blockers,Generation algorithms,Matchable graphs,Perfect matchings", 
     link = "http://onlinelibrary.wiley.com/doi/10.1002/jgt.20180/abstract", 
     number = "3", 
     pages = "209--232", 
     title = "Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms", 
     uri = "http://onlinelibrary.wiley.com/doi/10.1002/jgt.20180/abstract", 
     volume = "53", 
     year = "2006", 
}

@article{Chegireddy1987, 
     author = "Chegireddy, Chandra R. and Hamacher, Horst W.", 
     doi = "10.1016/0166-218X(87)90017-5", 
     issn = "0166218X", 
     journal = "Discrete Applied Mathematics", 
     link = "http://linkinghub.elsevier.com/retrieve/pii/0166218X87900175", 
     number = "2", 
     pages = "155--165", 
     title = "Algorithms for finding K-best perfect matchings", 
     uri = "http://linkinghub.elsevier.com/retrieve/pii/0166218X87900175", 
     volume = "18", 
     year = "1987", 
}

@article{Fukuda1992, 
     author = "Fukuda, Komei and Matsui, Tomomi", 
     doi = "10.1002/net.3230220504", 
     issn = "00283045", 
     journal = "Networks", 
     link = "http://doi.wiley.com/10.1002/net.3230220504", 
     month = "aug", 
     number = "5", 
     pages = "461--468", 
     title = "Finding all minimum-cost perfect matchings in Bipartite graphs", 
     uri = "http://doi.wiley.com/10.1002/net.3230220504", 
     volume = "22", 
     year = "1992", 
}

@article{Fukuda1994, 
     author = "Fukuda, K. and Matsui, T.", 
     doi = "10.1016/0893-9659(94)90045-0", 
     issn = "08939659", 
     journal = "Applied Mathematics Letters", 
     keyword = "Bipartite graph,Enumeration.,Matching", 
     link = "http://www.sciencedirect.com/science/article/pii/0893965994900450 http://linkinghub.elsevier.com/retrieve/pii/0893965994900450", 
     month = "jan", 
     number = "1", 
     pages = "15--18", 
     title = "Finding All the Perfect Matchings in Bipartite Graphs", 
     uri = "http://www.sciencedirect.com/science/article/pii/0893965994900450", 
     volume = "7", 
     year = "1994", 
}

@book{Gusfield1989, 
     author = "Gusfield, Dan and Irving, Robert W.", 
     doi = "10.978.0262515/528", 
     isbn = "0-262-07118-5", 
     link = "http://dl.acm.org/citation.cfm?id=68392", 
     month = "sep", 
     publisher = "MIT Press", 
     title = "The Stable Marriage Problem: Structure and Algorithms", 
     uri = "http://dl.acm.org/citation.cfm?id=68392", 
     year = "1989", 
}

@article{Matsui1994, 
     author = "Matsui, Tomomi and Tamura, Akihisa and Ikebe, Yoshiko", 
     doi = "10.1016/0166-218X(92)00175-L", 
     issn = "0166218X", 
     journal = "Discrete Applied Mathematics", 
     link = "http://www.sciencedirect.com/science/article/pii/0166218X9200175L", 
     number = "3", 
     pages = "283--296", 
     title = "Algorithms for finding a Kth best valued assignment", 
     uri = "http://www.sciencedirect.com/science/article/pii/0166218X9200175L", 
     volume = "50", 
     year = "1994", 
}

@inproceedings{Uno1997, 
     address = "Singapore", 
     author = "Uno, Takeaki", 
     booktitle = "ISAAC 1997: the 8th International Symposium on Algorithms and Computation", 
     doi = "10.1007/3-540-63890-3_11", 
     editor = "Leong, Hon Wai and Imai, Hiroshi and Jain, Sanjay", 
     link = "http://link.springer.com/chapter/10.1007/3-540-63890-3_11", 
     month = "dec", 
     pages = "92--101", 
     publisher = "Springer Berlin Heidelberg", 
     series = "Lecture Notes in Computer Science", 
     title = "Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs", 
     uri = "http://link.springer.com/chapter/10.1007/3-540-63890-3_11", 
     volume = "1350", 
     year = "1997", 
}

@article{Uno2001, 
     author = "Uno, Takeaki", 
     journal = "Journal of National Institute of Informatics", 
     link = "http://research.nii.ac.jp/~uno/papers/enummat_nii.pdf", 
     number = "-", 
     pages = "89--97", 
     title = "A Fast Algorithm for Enumeration of Maximal Matchings in General Graphs", 
     uri = "http://research.nii.ac.jp/~uno/papers/enummat_nii.pdf", 
     volume = "3", 
     year = "2001", 
     zzzdoi = "MY/UNO_2001_Jounal_NII", 
}