BOUNDING THE BANDWIDTH OF NP-COMPLETE PROBLEMSMONIEN B; SUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 279-292; BIBL. 15 REF.Conference Paper

THE COMPLEXITY OF THE PARTIAL ORDER DIMENSION PROBLEMYANNAKAKIS M.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 3; PP. 351-358; BIBL. 19 REF.Article

COMPLEXITE DE L'ARBORICITE LINEAIRE D'UN GRAPHEPEROCHE B.1982; R.A.I.R.O.; ISSN 0399-0559; FRA; DA. 1982; VOL. 16; NO 2; PP. 125-129; ABS. ENG; BIBL. 3 REF.Article

NP COMPLETENESS OF FINDING THE CHROMATIC INDEX OF REGULAR GRAPHSLEVEN D; GALIL Z.1983; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1983; VOL. 4; NO 1; PP. 35-44; BIBL. 5 REF.Article

ON THE COMPLEXITY OF FINDING DEGREE CONSTRAINED SUBGRAPHSPLESNIK J; WAWRUCH A.1982; ACTA MATH. UNIV. COMEN.; ISSN 0231-6986; CSK; DA. 1982; VOL. 40-41; PP. 215-218; ABS. SLO/RUS; BIBL. 9 REF.Article

COMPUTING THE MINIMUM FILL-IN IS NP-COMPLETEYANNAKAKIS M.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 1; PP. 77-79; BIBL. 6 REF.Article

THE NP-COMPLETENESS OF EDGE-COLORINGHOLYER I.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 718-720; BIBL. 4 REF.Article

A NOTE ON SPARSE COMPLETE SETSFORTUNE S.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 431-433; BIBL. 5 REF.Article

SOME NP-COMPLETE PROBLEMS SIMILAR TO GRAPH ISOMORPHISMLUBIW A.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 11-21; BIBL. 16 REF.Article

THE NP-COMPLETENESS COLUMN: AN ONGOING GUIDEJOHNSON DS.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 4; PP. 393-405; BIBL. 71 REF.Article

WIELOMIANOWE I PSEUDOWIELOMIANOWE ALGORYTMY ROZWIAZYWANIA PROBLEMOW KOMBINATORYCZNYCH = ALGORITHMES POLYNOMIAUX ET PSEUDOPOLYNOMIAUX POUR RESOUDRE DES PROBLEMES COMBINATOIRESBLAZEWICZ J.1980; ARCH. AUTOM. TELEMECH.; ISSN 0004-072X; POL; DA. 1980; VOL. 25; NO 3; PP. 355-366; ABS. RUS/ENG; BIBL. 14 REF.Article

GRAPH 2-ISOMORPHISM IS NP-COMPLETEYAO FF.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 2; PP. 68-72; BIBL. 4 REF.Article

NP-COMPLETENESS OF A FAMILY OF GRAPH-COLOURING PROBLEMSIRVING RW.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 111-117; BIBL. 11 REF.Conference Paper

ON THE HARMONIOUS COLORING OF GRAPHSHOPCROFT JE; KRISHNAMOORTHY MS.1983; SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1983; VOL. 4; NO 3; PP. 306-311; BIBL. 6 REF.Article

COLORING BLOCK DESIGNS IS NP-COMPLETECOLBOURN CJ; COLBOURN MJ; PHELPS KT et al.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 3; PP. 305-307; BIBL. 8 REF.Article

DEPTH-FIRST SEARCH AND THE VERTEX COVER PROBLEMSAVAGE C.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 233-235; BIBL. 6 REF.Article

CONNEXITE ET INDICES DE RECOUVREMENT DANS LES GRAPHES = CONNECTEDNESS AND OVERLAPPING INDICES IN GRAPHSPEROCHE BERNARD.1982; ; FRA; DA. 1982; 254 F.; 30 CM; BIBL. DISSEM.; TH.: SCI./PARIS 13/1982Thesis

THE NP-COMPLETENESS OF SOME EDGE-PARTITION PROBLEMSHOLYER I.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 713-717; BIBL. 3 REF.Article

A DEFINITION OF THE P=NP-PROBLEM IN CATEGORIESHUWIG H.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 146-153; BIBL. 14 REF.Conference Paper

PROBABILISTIC ANALYSIS FOR SIMPLE ONE- AND TWO-DIMENSIONAL BIN PACKING ALGORITHMSFREDERICKSON GN.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 4-5; PP. 156-161; BIBL. 13 REF.Article

NODE DELETION NP-COMPLETE PROBLEMSKRISHNAMOORTHY MS; NARSINGH DEO.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 619-625; BIBL. 11 REF.Article

EMBEDDING PARTIAL STEINER TRIPLE SYSTEMS IS NP-COMPLETECOLBOURN CJ.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES A; ISSN 0097-3165; USA; DA. 1983; VOL. 35; NO 1; PP. 100-105; BIBL. 11 REF.Article

OPTIMAL COCIRCUITS IN REGULAR MATROIDS AND APPLICATIONSHAMACHER H.1982; J. COMPUT. APPL. MATH.; ISSN 0377-0427; BEL; DA. 1982; VOL. 8; NO 3; PP. 171-177; BIBL. 24 REF.Article

A NOTE ON SPARSE ORACLES FOR NPLONG TJ.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 224-232; BIBL. 12 REF.Article

COMPUTING A PERFECT STRATEGY FOR N X N CHESS REQUIRES TIME EXPONENTIAL IN NFRAENKEL AS; LICHTENSTEIN D.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 278-293; BIBL. 10 REF.Conference Paper