THE NP-COMPLETENESS COLUMN - AN ONGOING GUIDE

[1] ABELLO J, 1987, UNPUB SOME APPLICATI

[2] Arnborg S, 1984, TRITANA8404 ROYAL I

[3] ARNBORG S, 1984, TRITANA8407 ROYAL I

[4] AN APPROACH TO THE SUBGRAPH HOMEOMORPHISM PROBLEM [J]. THEORETICAL COMPUTER SCIENCE, 1985, 38 (2-3) : 249 - 267

[5] BIENSTOCK D, 1986, UNPUB COMPLEXITY COV

[6] O(N2.5) TIME ALGORITHMS FOR THE SUBGRAPH HOMEOMORPHISM PROBLEM ON TREES [J]. JOURNAL OF ALGORITHMS, 1987, 8 (01) : 106 - 112

[7] EXACT AND APPROXIMATE SOLUTIONS FOR THE GATE MATRIX LAYOUT PROBLEM [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1987, 6 (01) : 79 - 84

[8] SYSTEMS OF DISTINCT REPRESENTATIVES AND LINEAR ALGEBRA [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 241 - +

[9] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &

[10] FELLOWS MR, 1985, UNPUB TOPOLOGICAL PA

[1] ABELLO J, 1987, UNPUB SOME APPLICATI

[2] Arnborg S, 1984, TRITANA8404 ROYAL I

[3] ARNBORG S, 1984, TRITANA8407 ROYAL I

[4] AN APPROACH TO THE SUBGRAPH HOMEOMORPHISM PROBLEM [J]. THEORETICAL COMPUTER SCIENCE, 1985, 38 (2-3) : 249 - 267

[5] BIENSTOCK D, 1986, UNPUB COMPLEXITY COV

[6] O(N2.5) TIME ALGORITHMS FOR THE SUBGRAPH HOMEOMORPHISM PROBLEM ON TREES [J]. JOURNAL OF ALGORITHMS, 1987, 8 (01) : 106 - 112

[7] EXACT AND APPROXIMATE SOLUTIONS FOR THE GATE MATRIX LAYOUT PROBLEM [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1987, 6 (01) : 79 - 84

[8] SYSTEMS OF DISTINCT REPRESENTATIVES AND LINEAR ALGEBRA [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 241 - +

[9] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J]. JOURNAL OF THE ACM, 1972, 19 (02) : 248 - &

[10] FELLOWS MR, 1985, UNPUB TOPOLOGICAL PA