ON THE EXISTENCE OF GRAPHS WITH PRESCRIBED DEGREES AND CONNECTIVITY.HAKIMI SL.1974; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1974; VOL. 26; NO 1; PP. 154-164; BIBL. 11 REF.Article

STEINER'S PROBLEM IN GRAPHS AND ITS IMPLICATIONSHAKIMI SL.1972; NETWORKS; U.S.A.; DA. 1972; VOL. 1; NO 2; PP. 113-133; BIBL. 3 P.Serial Issue

ON LOCATING NEW FACILITIES IN A COMPETITIVE ENVIRONMENTHAKIMI SL.1981; ISOLDE 81. INTERNATIONAL CONFERENCE ON LOCATIONAL DECISIONS. 2/1981/SKODSBORG; DNK; LYNGBY: IMSOR; DA. 1981; PP. 147-162; BIBL. 25 REF.Conference Paper

ON THE COMPLEXITY OF SOME CODING PROBLEMSNTAFOS SC; HAKIMI SL.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 6; PP. 794-796; BIBL. 5 REF.Article

OPTIMUM LOCATIONS OF CENTERS IN NETWORKS = LOCALISATIONS OPTIMALES DES CENTRES DANS LES RESEAUXHAKIMI SL; MAHESHWARI SN.1972; OPER. RES.; U.S.A.; DA. 1972; VOL. 20; NO 5; PP. 967-973; BIBL. 12 REF.Serial Issue

BOUNDS ON THE NUMBER OF CYCLES OF LENGTH THREE IN A PLANAR GRAPHHAKIMI SL; SCHMEICHEL EF.1982; ISR. J. MATH.; ISSN 0021-2172; ISR; DA. 1982; VOL. 41; NO 1-2; PP. 161-180; BIBL. 7 REF.Article

ON THE NUMBER OF CYCLES OF LENGTH K IN A MAXIMAL PLANAR GRAPHHAKIMI SL; SCHMEICHEL EF.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 1; PP. 69-86; BIBL. 8 REF.Article

AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. II: THE P-MEDIANSKARIV O; HAKIMI SL.1979; S.I.A.M. J. APPL. MATH.; USA; DA. 1979; VOL. 37; NO 3; PP. 539-560; BIBL. 23 REF.Article

PANCYCLIC GRAPHS AND A CONJECTURE OF BONDY AND CHVATAL.SCHMEICHEL EF; HAKIMI SL.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 1; PP. 22-34; BIBL. 11 REF.Article

UPPER BOUNDS ON THE ORDER OF A CLIQUE OF A GRAPHAMIN AT; HAKIMI SL.1972; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1972; VOL. 22; NO 4; PP. 569-573; BIBL. 9 REF.Serial Issue

ON P-CENTERS IN NETWORKSHAKIMI SL; SCHMEICHEL EF.1978; TRANSPORT. SCI.; USA; DA. 1978; VOL. 12; NO 1; PP. 1-15; BIBL. 10 REF.Article

RELATIONS BETWEEN GRAPHS AND INTEGER-PAIR SEQUENCES.PATRINOS AN; HAKIMI SL.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 15; NO 4; PP. 347-358; BIBL. 7 REF.Article

GRAPHS WITH GIVEN CONNECTIVITY AND INDEPENDENCE NUMBER OR NETWORKS WITH GIVEN MEASURES OF VULNERABILITY AND SURVIVABILITYAMIN AT; HAKIMI SL.1973; I.E.E.E. TRANS. CIRCUIT THEORY; U.S.A.; DA. 1973; VOL. 20; NO 1; PP. 2-10; BIBL. 17 REF.Serial Issue

ON FAULT IDENTIFICATION IN DIAGNOSABLE SYSTEMSKYUNG YONG CHWA; HAKIMI SL.1981; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1981; VOL. 30; NO 6; PP. 414-422; BIBL. 14 REF.Article

SCHEMES FOR FAULT-TOLERANT COMPUTING: A COMPARISON OF MODULARLY REDUNDANT AND T-DIAGNOSABLE SYSTEMSKYUNG YONG CHWA; HAKIMI SL.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 49; NO 3; PP. 212-238; BIBL. 10 REF.Article

ON THE NUMBER OF HAMILTONIAN CYCLES IN A MAXIMAL PLANAR GRAPHHAKIMI SL; SCHMEICHEL EF; THOMASSEN C et al.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 4; PP. 365-370; BIBL. 4 REF.Article

COMPLEXITY RESULTS FOR SCHEDULING TASKS IN FIXED INTERVALS ON TWO TYPES OF MACHINESNAKAJIMA K; HAKIMI SL; LENSTRA JK et al.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 512-520; BIBL. 17 REF.Article