| 期刊論文| 1. | Even, S.、Kariv, O.(1975)。An O (n2.5) algorithm for maximum matching in general graphs。System Symposium on Foundations of Computer Sciences，100-112。   | | 2. | Garey, M. R.、Johnson, D. S.(1975)。Complexity results for multiprocessor scheduling under resource constraint。SIAM Journal on Computing，4，397-411。 | 圖書| 1. | Kaufmann, A.、Gupta, M. M.(1985)。Introduction to Fuzzy Arithmetic。North-Holland, Amsterdam。 | |