Loading [Contrib]/a11y/accessibility-menu.js
@article{Yeh2010, 
     author = "Yeh, Li Pu and Wang, Biing Feng and Su, Hsin Hao", 
     doi = "10.1007/s00453-009-9284-5", 
     isbn = "0045300992", 
     issn = "01784617", 
     journal = "Algorithmica", 
     keyword = "Algorithms,Enumeration,Graphs,Maximum flows,Minimum cuts,Suboptimal cuts", 
     link = "http://link.springer.com/article/10.1007/s00453-009-9284-5", 
     number = "3", 
     pages = "297--312", 
     title = "Efficient algorithms for the problems of enumerating cuts by non-decreasing weights", 
     uri = "http://link.springer.com/article/10.1007/s00453-009-9284-5", 
     volume = "56", 
     year = "2010", 
}

Problems: 186 187