@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", 
}

Problems: 32