| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 1981 | A polynomial algorithm for maximum weighted vertex packing on graphs without long odd cycles | Hsu, W. L.; Ikura, Y.; Nemhauser, G. L. | Math. 20 | | | |
| 1982 | A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs | Hsu, W. L.; Nemhauser, G. L. | Discrete Mathematics 38, 65-71 | | | |
| 1981 | Algorithm for minimum covering by cliques and maximum cliques in claw-free perfect graphs | Hsu, W. L.; Nemhauser, G. L. | Discrete Mathematics 37, 181-191 | | | |
| 1984 | Algorithms for maximum weight cliques, minimum weighted clique covers and cardinality colorings of claw-free perfect graphs | Hsu, W. L.; Nemhauser, G. L. | Annals of Discrete Mathematics 21 | | | |
| 1979 | Easy and hard bottleneck location problems | Hsu, W. L.; Nemhauser, G. L. | Discrete Applied Mathematics 1 | | | |
