OPTIMAL PACKING AND COVERING IN THE PLANE ARE NP-COMPLETE

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 335 - 379

[3] ERLICH G, 1976, J COMBINATORIAL TH B, V21, P8

[4] FOWLER RJ, 1980, 800502 U WASH TECHN

[5] Gacril F., 1977, 11TH P C INF SCI SYS, P91

[6] Garey Michael R., 1979, COMPUTERS INTRACTABI

[7] Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

[8] Roberts F.S., 1969, RECENT PROGR COMBINA

[9] Rogers CA., 1964, PACKING COVERING

[10] Rose D. J., 1976, SIAM Journal on Computing, V5, P266, DOI 10.1137/0205021

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 335 - 379

[3] ERLICH G, 1976, J COMBINATORIAL TH B, V21, P8

[4] FOWLER RJ, 1980, 800502 U WASH TECHN

[5] Gacril F., 1977, 11TH P C INF SCI SYS, P91

[6] Garey Michael R., 1979, COMPUTERS INTRACTABI

[7] Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

[8] Roberts F.S., 1969, RECENT PROGR COMBINA

[9] Rogers CA., 1964, PACKING COVERING

[10] Rose D. J., 1976, SIAM Journal on Computing, V5, P266, DOI 10.1137/0205021