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

POLYNOMIAL ALGORITHM TO RECOGNIZE A MEYNIEL GRAPH = ALGORITHME POLYNOMIAL POUR RECONNAITRE UN GRAPHE DE MEYNIELBURLET M; FONLUPT J.1982; ; FRA; GRENOBLE: I.M.A.G.; DA. 1982; IMAG/RR-303; 35 P.; 30 CM; ABS. FRE; BIBL. 14 REF.;[RAPP. RECH.-LAB. INF. MATH. APPL. GRENOBLE; VOL. RR 303]Report

ALGEBRAIC EPSILON K-ASSIGNMENT PROBLEMSGRYGIEL G.1981; CONTROL CYBERN.; ISSN 0324-8569; POL; DA. 1981; VOL. 10; NO 3-4; PP. 155-165; ABS. POL/RUS; BIBL. 8 REF.Article

POLYNOMIAL ALGORITHMS FOR A CLASS OF LINEAR PROGRAMSMAURRAS JF; TRUEMPER K; AKGUEL M et al.1981; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1981; VOL. 21; NO 2; PP. 121-136; BIBL. 17 REF.Article

LOCATING CENTERS ON A TREE WITH DISCONTINUOUS SUPPLY AND DEMAND REGIONS = LOCALISATION DES CENTRES SUR UN ARBRE AVEC DES REGIONS D'OFFRE ET DE DEMANDE DISCONTINUESTAMIR A; ZEMEL E.1982; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1982; VOL. 7; NO 2; PP. 183-197; BIBL. 9 REF.Article

POLYNOMIAL ALGORITHMS FOR TOTALLY DUAL INTEGRAL SYSTEMS AND EXTENSIONSCHANDRASEKARAN R.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 39-51; BIBL. 5 REF.Conference Paper

POLYNOMIAL ALGORITHMS FOR COMPUTING THE SMITH AND HERMITE NORMAL FORMS OF AN INTEGER MATRIXRAVINDRAM KANNAN; ACHIM BACHEM.1979; S.I.A.M. J. COMPUTG; USA; DA. 1979; VOL. 8; NO 4; PP. 499-507; BIBL. 17 REF.Article

MINIMAL COST-RELIABILITY RATIO SPANNING TREECHANDRASEKARAN R; ANEJA YP; NAIR KPK et al.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 53-60; BIBL. 7 REF.Conference Paper

Domination, independent domination, and duality in strongly chordal graphsFARBER, M.Discrete applied mathematics. 1984, Vol 7, Num 2, pp 115-130, issn 0166-218XArticle

A two-phase algorithm for solving a class of hard satisfiability problemsWARNERS, J. P; VAN MAAREN, H.Operations research letters. 1998, Vol 23, Num 3-5, pp 81-88, issn 0167-6377Article

A generalized uniform processor systemISHII, H; MARTEL, C; MASUDA, T et al.Operations research. 1985, Vol 33, Num 2, pp 346-362, issn 0030-364XArticle

Fractional covers for forests and matchingsPADBERG, M. W; WOLSEY, L. A.Mathematical programming. 1984, Vol 29, Num 1, pp 1-14, issn 0025-5610Article

Polynomial testing of the query «is a^b>c^d?» with application to finding a minimal cost reliability ratio spanning treeCHANDRASEKARAN, R; TAMIR, A.Discrete applied mathematics. 1984, Vol 9, Num 2, pp 117-123, issn 0166-218XArticle

Minimum path basesHARTVIGSEN, D.Journal of algorithms (Print). 1993, Vol 15, Num 1, pp 125-142, issn 0196-6774Article

The travelling salesman problem in graphs with 3 edge cutsetsCORNUEJOLS, G; NADDEF, D; RULLEYBLANK, W et al.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 2, pp 383-410, issn 0004-5411Article

Heuristics for finding a maximum number of disjoint bounded pathsRONEN, D; PERL, Y.Networks (New York, NY). 1984, Vol 14, Num 4, pp 531-544, issn 0028-3045Article

Aspects quantitatifs de Stellensätze et algorithmes de multiplicativité des sommes de carrésSimon Hamon, Odile; Mahe, Louis.1987, 104 p.Thesis

An improvement to an alternate algorithm for computing Adomian polynomials in special casesBIAZAR, J; ILIE, M; KHOSHKENAR, A et al.Applied mathematics and computation. 2006, Vol 173, Num 1, pp 582-592, issn 0096-3003, 11 p.Article

A very elementary presentation of the Hannenhalli-Pevzner theoryBERGERON, Anne.Discrete applied mathematics. 2005, Vol 146, Num 2, pp 134-145, issn 0166-218X, 12 p.Conference Paper

Stable partitions with W-preferencesCECHLAROVA, Katarina; HAIDUKOVA, Jana.Discrete applied mathematics. 2004, Vol 138, Num 3, pp 333-347, issn 0166-218X, 15 p.Article

A shifting algorithm for continuous tree partitioningBECKER, Ronald; SIMEONE, Bruno; CHIANG, Yen-I et al.Theoretical computer science. 2002, Vol 282, Num 2, pp 353-380, issn 0304-3975Conference Paper

On the complexity of colouring by vertex-transitive and arc-transitive digraphsMACGILLIVRAY, G.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 3, pp 397-408, issn 0895-4801Article

Algorithms for long paths in graphsZHAO ZHANG; HAO LI.Theoretical computer science. 2007, Vol 377, Num 1-3, pp 25-34, issn 0304-3975, 10 p.Article

Sharp precision in hensel lifting for bivariate polynomial factorizationLECERF, Grégoire.Mathematics of computation. 2006, Vol 75, Num 254, pp 921-933, issn 0025-5718, 13 p.Article

Fractional packing of T-joinsBARAHONA, Francisco.SIAM journal on discrete mathematics (Print). 2004, Vol 17, Num 4, pp 661-669, issn 0895-4801, 9 p.Article