Journal Article FINDING HAMILTON CYCLES IN SPARSE RANDOM GRAPHS 1988 • Journal of combinatorial theory. Series B (Print) • 44(2):230-250 FRIEZE AM
Journal Article ON THE COMPLEXITY OF COMPUTING THE VOLUME OF A POLYHEDRON 1988 • SIAM journal on computing (Print) • 17(5):967-974 DYER ME, FRIEZE AM
Journal Article ON THE RANDOM CONSTRUCTION OF HEAPS 1988 • Information Processing Letters • 27(2):103-109 FRIEZE AM
Journal Article PARTITIONING RANDOMAGRAPHS INTO LARGE CYCLES 1988 • Discrete Mathematics • 70(2):149-158 FRIEZE AM
Journal Article PROBABILISTIC ANALYSIS OF A RELAXATION FOR THE K-MEDIAN PROBLEM 1988 • Mathematics of Operations Research • 13(1):1-31 AHN S, COOPER C, CORNUEJOLS G, FRIEZE A
Journal Article RECONSTRUCTING TRUNCATED INTEGER VARIABLES SATISFYING LINEAR CONGRUENCES 1988 • SIAM journal on computing (Print) • 17(2):262-280 FRIEZE AM, HASTAD J, KANNAN R, LAGARIAS JC, SHAMIR A
Journal Article AN ALGORITHM FOR FINDING HAMILTON PATHS AND CYCLES IN RANDOM GRAPHS 1987 • Combinatorica • 7(4):327-341 BOLLOBAS B, FENNER TI, FRIEZE AM
Journal Article LARGE HOLES IN SPARSE RANDOM GRAPHS 1987 • Combinatorica • 7(3):265-274 FRIEZE AM, JACKSON B
Journal Article LARGE INDUCED TREES IN SPARSE RANDOM GRAPHS 1987 • Journal of combinatorial theory. Series B (Print) • 42(2):181-195 FRIEZE AM, JACKSON B
Journal Article ON THE EXACT SOLUTION OF RANDOM TRAVELING SALESMAN PROBLEMS WITH MEDIUM SIZE INTEGER COEFFICIENTS 1987 • SIAM journal on computing (Print) • 16(6):1052-1072 FRIEZE AM
Journal Article On the Strength of Connectivity of Random Subgraphs of the n-Cube 1987 • North Holland Mathematics Studies • 144:17-40 Dyer ME, Frieze AM, Foulds LR
Journal Article PARALLEL ALGORITHMS FOR FINDING HAMILTON CYCLES IN RANDOM GRAPHS 1987 • Information Processing Letters • 25(2):111-117 FRIEZE AM
Journal Article A PROBABILISTIC ANALYSIS OF THE NEXT FIT DECREASING BIN PACKING HEURISTIC 1986 • Operations Research Letters • 5(5):233-236 CSIRIK J, GALAMBOS G, FRENK JBG, FRIEZE AM, KAN A
Conference Fast solution of some random NP-hard problems 1986 • Annual Symposium on Foundations of Computer Science • 331-336 Dyer ME, Frieze AM
Journal Article MAXIMUM MATCHINGS IN A CLASS OF RANDOM GRAPHS 1986 • Journal of combinatorial theory. Series B (Print) • 40(2):196-212 FRIEZE AM
Journal Article ON LARGE MATCHINGS AND CYCLES IN SPARSE RANDOM GRAPHS 1986 • Discrete Mathematics • 59(3):243-256 FRIEZE AM
Journal Article ON LINEAR-PROGRAMS WITH RANDOM COSTS 1986 • Mathematical programming • 35(1):3-16 DYER ME, FRIEZE AM, MCDIARMID CJH
Journal Article ON THE LAGARIAS-ODLYZKO ALGORITHM FOR THE SUBSET SUM PROBLEM 1986 • SIAM journal on computing (Print) • 15(2):536-539 FRIEZE AM
Journal Article PLANAR 3DM IS NP-COMPLETE 1986 • Journal of Algorithms in Cognition, Informatics and Logic • 7(2):174-184 DYER ME, FRIEZE AM
Journal Article A SIMPLE HEURISTIC FOR THE P-CENTER PROBLEM 1985 • Operations Research Letters • 3(6):285-288 DYER ME, FRIEZE AM
Conference ALGORITHM FOR FINDING HAMILTON CYCLES IN A RANDOM GRAPH. 1985 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 430-439 Bollobas B, Fenner TI, Frieze AM
Journal Article An algorithm for finding a matroid basis which maximizes the product of the weights of the elements 1985 • BIT Numerical Mathematics • 25(3):433-438 Fenner TI, Frieze AM
Journal Article AN ALGORITHM FOR FINDING A MATROID BASIS WHICH MAXIMIZES THE PRODUCT OF THE WEIGHTS OF THE ELEMENTS 1985 • BIT Numerical Mathematics • 25(3):434-438 FENNER TI, FRIEZE AM
Journal Article ANALYSIS OF HEURISTICS FOR FINDING A MAXIMUM WEIGHT PLANAR SUBGRAPH 1985 • European Journal of Operational Research • 20(1):102-114 DYER ME, FOULDS LR, FRIEZE AM
Journal Article Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite Graphs 1985 • European Journal of Combinatorics • 6(4):327-334 Frieze AM
