A cost function property for plant location problems. - Alan M. Frieze (Math. Program., 1974)

A bilinear programming formulation of the 3-dimensional assignment problem. - Alan M. Frieze (Math. Program., 1974)

Shortest path algorithms for knapsack type problems. - Alan M. Frieze (Math. Program., 1976)

An algorithm for algebraic assignment problems. - Alan M. Frieze (Discret. Appl. Math., 1979)

Probabilistic analysis of some euclidean clustering problems. - Alan M. Frieze (Discret. Appl. Math., 1980)

On the connectivity of random m-orientable graphs and digraphs. - Trevor I. Fenner; Alan M. Frieze (Comb., 1982)

Algebraic Linear Programming. - Alan M. Frieze (Math. Oper. Res., 1982)

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. - Alan M. Frieze; Giulia Galbiati; Francesco Maffioli (Networks, 1982)

An extension of Christofides heuristic to the k-person travelling salesman problem. - Alan M. Frieze (Discret. Appl. Math., 1983)

On the quadratic assignment problem. - Alan M. Frieze; J. Yadegar (Discret. Appl. Math., 1983)

On the existence of Hamiltonian cycles in a class of random graphs. - Trevor I. Fenner; Alan M. Frieze (Discret. Math., 1983)

Corrigendum: Algebraic Linear Programming. - Alan M. Frieze (Math. Oper. Res., 1983)

Linear Congruential Generators Do Not Produce Random Sequences - Alan M. Frieze; Ravi Kannan; J. C. Lagarias 001 (FOCS, 1984)

A Partitioning Algorithm for Minimum Weighted Euclidean Matching. - Martin E. Dyer; Alan M. Frieze (Inf. Process. Lett., 1984)

Hamiltonian cycles in random regular graphs. - Trevor I. Fenner; Alan M. Frieze (J. Comb. Theory B, 1984)

An Algorithm for Finding a Matroid Basis which Maximizes the Products of the Weights of the Elements. - Trevor I. Fenner; Alan M. Frieze (BIT, 1985)

On the complexity of partitioning graphs into connected subgraphs. - Martin E. Dyer; Alan M. Frieze (Discret. Appl. Math., 1985)

On the value of a random minimum spanning tree problem. - Alan M. Frieze (Discret. Appl. Math., 1985)

The shortest-path problem for graphs with random arc-lengths. - Alan M. Frieze; Geoffrey R. Grimmett (Discret. Appl. Math., 1985)

Limit Distribution for the Existence of Hamiltonian Cycles in Random Bipartite Graphs. - Alan M. Frieze (Eur. J. Comb., 1985)

Fast Solution of Some Random NP-Hard Problems - Martin E. Dyer; Alan M. Frieze (FOCS, 1986)

On large matchings and cycles in sparse random graphs. - Alan M. Frieze (Discret. Math., 1986)

Planar 3DM is NP-Complete. - Martin E. Dyer; Alan M. Frieze (J. Algorithms, 1986)

Maximum matchings in a class of random graphs. - Alan M. Frieze (J. Comb. Theory B, 1986)

On linear programs with random costs. - Martin E. Dyer; Alan M. Frieze; Colin J. H. McDiarmid (Math. Program., 1986)

On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem. - Alan M. Frieze (SIAM J. Comput., 1986)

An algorithm for finding Hamilton cycles in a random graph. - Béla Bollobás; Trevor I. Fenner; Alan M. Frieze (Comb., 1987)

Large holes in sparse random graphs. - Alan M. Frieze; Bill Jackson (Comb., 1987)

Parallel Algorithms for Finding Hamilton Cycles in Random Graphs. - Alan M. Frieze (Inf. Process. Lett., 1987)

Large induced trees in sparse random graphs. - Alan M. Frieze; Bill Jackson (J. Comb. Theory B, 1987)

On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients. - Alan M. Frieze (SIAM J. Comput., 1987)

Partitioning random graphs into large cycles. - Alan M. Frieze (Discret. Math., 1988)

On the Random Construction of Heaps. - Alan M. Frieze (Inf. Process. Lett., 1988)

An Algorithm for Finding Hamilton Cycles in Random Directed Graphs. - Alan M. Frieze (J. Algorithms, 1988)

Finding hamilton cycles in sparse random graphs. - Alan M. Frieze (J. Comb. Theory B, 1988)

Edge-colouring random graphs. - Alan M. Frieze; Bill Jackson; Colin J. H. McDiarmid; Bruce A. Reed (J. Comb. Theory B, 1988)

Probabilistic Analysis of a Relaxation for the k-Median Problem. - Sang Ahn; Colin Cooper; Gérard Cornuéjols; Alan M. Frieze (Math. Oper. Res., 1988)

On the Complexity of Computing the Volume of a Polyhedron. - Martin E. Dyer; Alan M. Frieze (SIAM J. Comput., 1988)

Reconstructing Truncated Integer Variables Satisfying Linear Congruences. - Alan M. Frieze; Johan Håstad; Ravi Kannan; J. C. Lagarias 001; Adi Shamir (SIAM J. Comput., 1988)

Survival time of a random graph. - Alan M. Frieze (Comb., 1989)

On random minimum lenght spanning trees. - Alan M. Frieze; Colin J. H. McDiarmid (Comb., 1989)

The Solution of Some Random NP-Hard Problems in Polynomial Expected Time. - Martin E. Dyer; Alan M. Frieze (J. Algorithms, 1989)

On the number of hamilton cycles in a random graph. - Colin Cooper; Alan M. Frieze (J. Graph Theory, 1989)

Probabilistic Analysis of the Multidimensional Knapsack Problem. - Martin E. Dyer; Alan M. Frieze (Math. Oper. Res., 1989)

A randomized algorithm for fixed-dimensional linear programming. - Martin E. Dyer; Alan M. Frieze (Math. Program., 1989)

Algorithms for assignment problems on an array processor. - Alan M. Frieze; J. Yadegar; S. El-Horbaty; Dennis Parkinson (Parallel Comput., 1989)

On an optimization problem with nested constraints. - Martin E. Dyer; Alan M. Frieze (Discret. Appl. Math., 1990)

On the independence number of random graphs. - Alan M. Frieze (Discret. Math., 1990)

The limiting probability that alpha-in, ß-out is strongly connected. - Colin Cooper; Alan M. Frieze (J. Comb. Theory B, 1990)

On Patching Algorithms for Random Asymmetric Travelling Salesman Problems. - Martin E. Dyer; Alan M. Frieze (Math. Program., 1990)

Probabilistic Analysis of a Parallel Algorithm for Finding Maximal Independent Sets. - Neil J. Calkin; Alan M. Frieze (Random Struct. Algorithms, 1990)

Greedy Matching on the Line. - Alan M. Frieze; Colin McDiarmid; Bruce A. Reed (SIAM J. Comput., 1990)

Finding Hidden Hamiltonian Cycles (Extended Abstract) - Andrei Z. Broder; Alan M. Frieze; Eli Shamir 001 (STOC, 1991)

Occupancy problems and random algebras. - Michael H. Albert; Alan M. Frieze (Discret. Math., 1991)

A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. - Martin E. Dyer; Alan M. Frieze; Ravi Kannan (J. ACM, 1991)

Spanning Maximal Planar Subgraphs of Random Graphs. - Béla Bollobás; Alan M. Frieze (Random Struct. Algorithms, 1991)

Randomized Greedy Matching. - Martin E. Dyer; Alan M. Frieze (Random Struct. Algorithms, 1991)

Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph. - Martin E. Dyer; Alan M. Frieze (Random Struct. Algorithms, 1991)

Separator Based Parallel Divide and Conquer in Computational Geometry. - Alan M. Frieze; Gary L. Miller; Shang-Hua Teng (SPAA, 1992)

On Subgraph Sizes in Random Graphs. - Neil J. Calkin; Alan M. Frieze; Brendan D. McKay (Comb. Probab. Comput., 1992)

On the independence and chromatic numbers of random regular graphs. - Alan M. Frieze; Tomasz Luczak 001 (J. Comb. Theory B, 1992)

Probabilistic analysis of the generalised assignment problem. - Martin E. Dyer; Alan M. Frieze (Math. Program., 1992)

On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. - Neil J. Calkin; Alan M. Frieze; Ludek Kucera (Random Struct. Algorithms, 1992)

Counting the Number of Hamilton Cycles in Random Digraphs. - Alan M. Frieze; Stephen Suen (Random Struct. Algorithms, 1992)

On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas. - Andrei Z. Broder; Alan M. Frieze; Eli Upfal (SODA, 1993)

A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem. - Martin E. Dyer; Alan M. Frieze; Ravi Kannan; Ajai Kapoor; Ljubomir Perkovic; Umesh V. Vazirani (Comb. Probab. Comput., 1993)

Polychromatic Hamilton cycles. - Alan M. Frieze; Bruce A. Reed (Discret. Math., 1993)

Polynomial time randomised approxmiation schemes for the Tutte polynomial of dense graphs - Noga Alon; Alan M. Frieze; Dominic Welsh (FOCS, 1994)

On the Greedy Heuristic for Matchings. - Jonathan Aronson; Martin E. Dyer; Alan M. Frieze; Stephen Suen (SODA, 1994)

Approximately Counting Hamilton Cycles in Dense Graphs. - Martin E. Dyer; Alan M. Frieze; Mark Jerrum (SODA, 1994)

On the Complexity of Computing the Diameter of a Polytope. - Alan M. Frieze; Shang-Hua Teng (Comput. Complex., 1994)

Hamilton Cycles in Random Regular Digraphs. - Colin Cooper; Alan M. Frieze; Michael Molloy 001 (Comb. Probab. Comput., 1994)

Broadcasting in Random Graphs. - Alan M. Frieze; Michael Molloy 001 (Discret. Appl. Math., 1994)

Polynomial Time Randomised Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case - Noga Alon; Alan M. Frieze; Dominic Welsh (Electron. Colloquium Comput. Complex., 1994)

On the Problem of Approximating the Number of Bases of a Matroid. - Yossi Azar; Andrei Z. Broder; Alan M. Frieze (Inf. Process. Lett., 1994)

The Probability of Unique Solutions of Sequencing by Hybridization. - Martin E. Dyer; Alan M. Frieze; Stephen Suen (J. Comput. Biol., 1994)

Hamilton Cycles in a Class of Random Directed Graphs. - Colin Cooper; Alan M. Frieze (J. Comb. Theory B, 1994)

Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. - Martin E. Dyer; Alan M. Frieze (Math. Program., 1994)

Finding Hidden Hamiltonian Cycles. - Andrei Z. Broder; Alan M. Frieze; Eli Shamir 001 (Random Struct. Algorithms, 1994)

Near-perfect Token Distribution. - Andrei Z. Broder; Alan M. Frieze; Eli Shamir 001; Eli Upfal (Random Struct. Algorithms, 1994)

Introduction. - Alan M. Frieze; Svante Janson; Tomasz Luczak 001 (Random Struct. Algorithms, 1994)

Multicolored Trees in Random Graphs. - Alan M. Frieze; Brendan D. McKay (Random Struct. Algorithms, 1994)

On the Independence Number of Random Cubic Graphs. - Alan M. Frieze; Stephen Suen (Random Struct. Algorithms, 1994)

Existence and Construction of Edge-Disjoint Paths on Expander Graphs. - Andrei Z. Broder; Alan M. Frieze; Eli Upfal (SIAM J. Comput., 1994)

Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. - Alan M. Frieze; Mark Jerrum (IPCO, 1995)

An Analysis of a Monte Carlo Algorithm for Estimating the Permanent. - Alan M. Frieze; Mark Jerrum (Comb., 1995)

Covering the Edges of a Random Graph by Cliques. - Alan M. Frieze; Bruce A. Reed (Comb., 1995)

Multicoloured Hamilton Cycles. - Michael H. Albert; Alan M. Frieze; Bruce A. Reed (Electron. J. Comb., 1995)

Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold. - Colin Cooper; Alan M. Frieze (Electron. J. Comb., 1995)

On the Connectivity of Random k-th Nearest Neighbour Graphs. - Colin Cooper; Alan M. Frieze (Comb. Probab. Comput., 1995)

Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. - Alan M. Frieze; A. J. Radcliffe; Stephen Suen (Comb. Probab. Comput., 1995)

The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height. - Andrei Z. Broder; Martin E. Dyer; Alan M. Frieze; Prabhakar Raghavan; Eli Upfal (Inf. Process. Lett., 1995)

Balanced Allocations for Tree-Like Inputs. - Andrei Z. Broder; Alan M. Frieze; Carsten Lund; Steven J. Phillips; Nick Reingold (Inf. Process. Lett., 1995)

Ordering Clone Libraries in Computational Biology. - Martin E. Dyer; Alan M. Frieze; Stephen Suen (J. Comput. Biol., 1995)

On Key Storage in Secure Networks. - Martin E. Dyer; Trevor I. Fenner; Alan M. Frieze; Andrew Thomason 001 (J. Cryptol., 1995)

Polynomial Time Randomized Approximation Schemes for Tutte-Gröthendieck Invariants: The Dense Case. - Noga Alon; Alan M. Frieze; Dominic Welsh (Random Struct. Algorithms, 1995)

Randomized Greedy Matching II. - Jonathan Aronson; Martin E. Dyer; Alan M. Frieze; Stephen Suen (Random Struct. Algorithms, 1995)

Perfect Matchings in Random s-Uniform Hypergraphs. - Alan M. Frieze; Svante Janson (Random Struct. Algorithms, 1995)

When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? - Alan M. Frieze; Richard M. Karp; Bruce A. Reed (SIAM J. Comput., 1995)

Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. - Alan M. Frieze; Wojciech Szpankowski (ESA, 1996)

A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract). - Andrei Z. Broder; Alan M. Frieze; Eli Upfal (FOCS, 1996)

Learning Linear Transformations. - Alan M. Frieze; Mark Jerrum; Ravi Kannan (FOCS, 1996)

The Regularity Lemma and Approximation Schemes for Dense Problems. - Alan M. Frieze; Ravi Kannan (FOCS, 1996)

Coloring Bipartite Hypergraphs. - Hui Chen; Alan M. Frieze (IPCO, 1996)

An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. - Andrei Z. Broder; Alan M. Frieze; Stephen Suen; Eli Upfal (SODA, 1996)

Perfect Matchings in Random r-regular, s-uniform Hypergraphs. - Colin Cooper; Alan M. Frieze; Michael Molloy 001; Bruce A. Reed (Comb. Probab. Comput., 1996)

On the Best Case of Heapsort. - Béla Bollobás; Trevor I. Fenner; Alan M. Frieze (J. Algorithms, 1996)

Generating and Counting Hamilton Cycles in Random Regular Graphs. - Alan M. Frieze; Mark Jerrum; Michael Molloy 001; Robert W. Robinson; Nicholas C. Wormald (J. Algorithms, 1996)

Analysis of Two Simple Heuristics on a Random Instance of k-SAT. - Alan M. Frieze; Stephen Suen (J. Algorithms, 1996)

Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph. - Hui Chen; Alan M. Frieze (Random Struct. Algorithms, 1996)

Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version). - Andrei Z. Broder; Alan M. Frieze; Eli Upfal (STOC, 1997)

Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. - Alan M. Frieze; Mark Jerrum (Algorithmica, 1997)

Algorithmic theory of random graphs. - Alan M. Frieze; Colin McDiarmid (Random Struct. Algorithms, 1997)

Dynamic Packet Routing on Arrays with Bounded Buffers. - Andrei Z. Broder; Alan M. Frieze; Eli Upfal (LATIN, 1998)

On Balls and Bins with Deletions. - Richard Cole 001; Alan M. Frieze; Bruce M. Maggs; Michael Mitzenmacher; Andréa W. Richa; Ramesh K. Sitaraman; Eli Upfal (RANDOM, 1998)

Disjoint Paths in Expander Graphs via Random Walks: A Short Survey. - Alan M. Frieze (RANDOM, 1998)

Min-Wise Independent Permutations (Extended Abstract). - Andrei Z. Broder; Moses Charikar; Alan M. Frieze; Michael Mitzenmacher (STOC, 1998)

A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. - Avrim Blum; Alan M. Frieze; Ravi Kannan; Santosh S. Vempala (Algorithmica, 1998)

Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. - Alan M. Frieze; Wojciech Szpankowski (Algorithmica, 1998)

Average-Case Analysis of the Merging Algorithm of Hwang and Lin. - Wenceslas Fernandez de la Vega; Alan M. Frieze; Miklos Santha (Algorithmica, 1998)

Random Minimum Length Spanning Trees in Regular Graphs. - Andrew Beveridge; Alan M. Frieze; Colin McDiarmid (Comb., 1998)

Maximum matchings in sparse random graphs: Karp-Sipser revisited. - Jonathan Aronson; Alan M. Frieze; Boris G. Pittel (Random Struct. Algorithms, 1998)

Optimal Construction of Edge-Disjoint Paths in Random Graphs. - Andrei Z. Broder; Alan M. Frieze; Stephen Suen; Eli Upfal (SIAM J. Comput., 1998)

Approximately Counting Hamilton Paths and Cycles in Dense Graphs. - Martin E. Dyer; Alan M. Frieze; Mark Jerrum (SIAM J. Comput., 1998)

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. - Christian Borgs; Jennifer T. Chayes; Alan M. Frieze; Jeong Han Kim; Prasad Tetali; Eric Vigoda; Van H. Vu (FOCS, 1999)

On the power of universal bases in sequencing by hybridization. - Franco P. Preparata; Alan M. Frieze; Eli Upfal (RECOMB, 1999)

Clustering in Large Graphs and Matrices. - Petros Drineas; Alan M. Frieze; Ravi Kannan; Santosh S. Vempala; V. Vinay (SODA, 1999)

Quick Approximation to Matrices and Applications. - Alan M. Frieze; Ravi Kannan (Comb., 1999)

A Simple Algorithm for Constructing Szemere'di's Regularity Partition. - Alan M. Frieze; Ravi Kannan (Electron. J. Comb., 1999)

Splitting an Expander Graph. - Alan M. Frieze; Michael Molloy 001 (J. Algorithms, 1999)

Optimal Reconstruction of a Sequence from its Probes. - Alan M. Frieze; Franco P. Preparata; Eli Upfal (J. Comput. Biol., 1999)

Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach. - Andrei Z. Broder; Alan M. Frieze; Eli Upfal (Random Struct. Algorithms, 1999)

Mixing properties of the Swendsen-Wang process on classes of graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 1999)

On Perfect Matchings and Hamilton Cycles in Sums of Random Trees. - Alan M. Frieze; Michal Karonski; Lubos Thoma (SIAM J. Discret. Math., 1999)

Min-Wise Independent Linear Permutations. - Tom Bohman; Colin Cooper; Alan M. Frieze (Electron. J. Comb., 2000)

Note on Sparse Random Graphs and Cover Graphs. - Tom Bohman; Alan M. Frieze; Miklós Ruszinkó; Lubos Thoma (Electron. J. Comb., 2000)

On the Number of Perfect Matchings and Hamilton Cycles in e-Regular Non-bipartite Graphs. - Alan M. Frieze (Electron. J. Comb., 2000)

A Note on Random Minimum Length Spanning Trees. - Alan M. Frieze; Miklós Ruszinkó; Lubos Thoma (Electron. J. Comb., 2000)

Optimal Construction Of Edge-Disjoint Paths In Random Regular Graphs. - Alan M. Frieze; Lei Zhao (Comb. Probab. Comput., 2000)

Min-Wise Independent Permutations. - Andrei Z. Broder; Moses Charikar; Alan M. Frieze; Michael Mitzenmacher (J. Comput. Syst. Sci., 2000)

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k. - Béla Bollobás; Colin Cooper; Trevor I. Fenner; Alan M. Frieze (J. Graph Theory, 2000)

Hamilton cycles in random graphs and directed graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2000)

Average-case complexity of shortest-paths problems in the vertex-potential model. - Colin Cooper; Alan M. Frieze; Kurt Mehlhorn; Volker Priebe (Random Struct. Algorithms, 2000)

Edge-Disjoint Paths in Expander Graphs. - Alan M. Frieze (SIAM J. Comput., 2000)

A General Model of Undirected Web Graphs. - Colin Cooper; Alan M. Frieze (ESA, 2001)

Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree. - Martin E. Dyer; Alan M. Frieze (FOCS, 2001)

Vertex Covers by Edge Disjoint Cliques. - Tom Bohman; Alan M. Frieze; Miklós Ruszinkó; Lubos Thoma (Comb., 2001)

G-Intersecting Families. - Tom Bohman; Alan M. Frieze; Miklós Ruszinkó; Lubos Thoma (Comb. Probab. Comput., 2001)

A general approach to dynamic packet routing with bounded buffers. - Andrei Z. Broder; Alan M. Frieze; Eli Upfal (J. ACM, 2001)

On Markov Chains for Randomly H-Coloring a Graph. - Colin Cooper; Martin E. Dyer; Alan M. Frieze (J. Algorithms, 2001)

Avoiding a giant component. - Tom Bohman; Alan M. Frieze (Random Struct. Algorithms, 2001)

Hamilton cycles in the union of random permutations. - Alan M. Frieze (Random Struct. Algorithms, 2001)

A note on random 2-SAT with prescribed literal degrees. - Colin Cooper; Alan M. Frieze; Gregory B. Sorkin (SODA, 2002)

Balls and bins models with feedback. - Eleni Drinea; Alan M. Frieze; Michael Mitzenmacher (SODA, 2002)

Crawling on web graphs. - Colin Cooper; Alan M. Frieze (STOC, 2002)

Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs. - Colin Cooper; Alan M. Frieze (Comb. Probab. Comput., 2002)

Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity. - Colin Cooper; Alan M. Frieze; Bruce A. Reed (Comb. Probab. Comput., 2002)

Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic Number. - Colin Cooper; Alan M. Frieze; Bruce A. Reed; Oliver Riordan (Comb. Probab. Comput., 2002)

Hamilton cycles in random subgraphs of pseudo-random graphs. - Alan M. Frieze; Michael Krivelevich (Discret. Math., 2002)

Optimal Sequencing by Hybridization in Rounds. - Alan M. Frieze; Bjarni V. Halldórsson (J. Comput. Biol., 2002)

On graph irregularity strength. - Alan M. Frieze; Ronald J. Gould; Michal Karonski; Florian Pfender (J. Graph Theory, 2002)

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. - Sanjeev Arora; Alan M. Frieze; Haim Kaplan (Math. Program., 2002)

Addendum to avoiding a giant component. - Tom Bohman; Alan M. Frieze (Random Struct. Algorithms, 2002)

On Counting Independent Sets in Sparse Graphs. - Martin E. Dyer; Alan M. Frieze; Mark Jerrum (SIAM J. Comput., 2002)

Analytic Graph Theory. - Béla Bollobás; Vladimir Nikiforov 001; Nicholas C. Wormald; Ralph J. Faudree; Alan M. Frieze (Handbook of Graph Theory, 2003)

Perfect matchings in random graphs with prescribed minimal degree. - Alan M. Frieze; Boris G. Pittel (SODA, 2003)

On Randomly Generated Intersecting Hypergraphs. - Tom Bohman; Colin Cooper; Alan M. Frieze; Ryan R. Martin; Miklós Ruszinkó (Electron. J. Comb., 2003)

Crawling on Simple Models of Web Graphs. - Colin Cooper; Alan M. Frieze (Internet Math., 2003)

Random Deletion in a Scale-Free Random Graph Process. - Colin Cooper; Alan M. Frieze; Juan Vera 001 (Internet Math., 2003)

How many random edges make a dense graph hamiltonian? - Tom Bohman; Alan M. Frieze; Ryan R. Martin (Random Struct. Algorithms, 2003)

A general model of web graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2003)

Randomly coloring graphs with lower bounds on girth and maximum degree. - Martin E. Dyer; Alan M. Frieze (Random Struct. Algorithms, 2003)

Arc-Disjoint Paths in Expander Digraphs. - Tom Bohman; Alan M. Frieze (SIAM J. Comput., 2003)

A probabilistic analysis of randomly generated binary constraint satisfaction problems. - Martin E. Dyer; Alan M. Frieze; Michael Molloy 001 (Theor. Comput. Sci., 2003)

On the b-Independence Number of Sparse Random Graphs. - Geoffrey Atkinson; Alan M. Frieze (Comb. Probab. Comput., 2004)

The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence. - Colin Cooper; Alan M. Frieze (Comb. Probab. Comput., 2004)

Randomly coloring constant degree graphs - Martin E. Dyer; Alan M. Frieze; Thomas P. Hayes; Eric Vigoda (Electron. Colloquium Comput. Complex., 2004)

Fast monte-carlo algorithms for finding low-rank approximations. - Alan M. Frieze; Ravi Kannan; Santosh S. Vempala (J. ACM, 2004)

Efficient communication in an ad-hoc network. - Abraham Flaxman; Alan M. Frieze; Eli Upfal (J. Algorithms, 2004)

Clustering Large Graphs via the Singular Value Decomposition. - Petros Drineas; Alan M. Frieze; Ravi Kannan; Santosh S. Vempala; V. Vinay (Mach. Learn., 2004)

On Random Symmetric Travelling Salesman Problems. - Alan M. Frieze (Math. Oper. Res., 2004)

Adding random edges to dense graphs. - Tom Bohman; Alan M. Frieze; Michael Krivelevich; Ryan R. Martin (Random Struct. Algorithms, 2004)

Avoidance of a giant component in half the edge set of a random graph. - Tom Bohman; Alan M. Frieze; Nicholas C. Wormald (Random Struct. Algorithms, 2004)

The emergence of a giant component in random subgraphs of pseudo-random graphs. - Alan M. Frieze; Michael Krivelevich; Ryan R. Martin (Random Struct. Algorithms, 2004)

Identifying codes in random networks. - Alan M. Frieze; Ryan R. Martin; Julien Moncel; Miklós Ruszinkó; Cliff Smyth 001 (ISIT, 2005)

The cover time of two classes of random graphs. - Colin Cooper; Alan M. Frieze (SODA, 2005)

Random k-Sat: A Tight Threshold For Moderately Growing k. - Alan M. Frieze; Nicholas C. Wormald (Comb., 2005)

High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. - Abraham Flaxman; Alan M. Frieze; Trevor I. Fenner (Internet Math., 2005)

On packing Hamilton cycles in ?-regular graphs. - Alan M. Frieze; Michael Krivelevich (J. Comb. Theory B, 2005)

Perfect matchings in random bipartite graphs with minimal degree at least 2. - Alan M. Frieze (Random Struct. Algorithms, 2005)

The Cover Time of Random Regular Graphs. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2005)

The Strong Chromatic Index of Random Graphs. - Alan M. Frieze; Michael Krivelevich; Benny Sudakov (SIAM J. Discret. Math., 2005)

Random graphs. - Alan M. Frieze (SODA, 2006)

On randomly colouring locally sparse graphs. - Alan M. Frieze; Juan Vera 001 (Discret. Math. Theor. Comput. Sci., 2006)

Hamilton cycles in random lifts of graphs. - K. Burgin; Prasad Chebolu; Colin Cooper; Alan M. Frieze (Eur. J. Comb., 2006)

Randomly coloring sparse random graphs with fewer colors than the maximum degree. - Martin E. Dyer; Abraham D. Flaxman; Alan M. Frieze; Eric Vigoda (Random Struct. Algorithms, 2006)

On the random 2-stage minimum spanning tree. - Abraham D. Flaxman; Alan M. Frieze; Michael Krivelevich (Random Struct. Algorithms, 2006)

Almost universal graphs. - Alan M. Frieze; Michael Krivelevich (Random Struct. Algorithms, 2006)

The satisfiability threshold for randomly generated binary constraint satisfaction problems. - Alan M. Frieze; Michael Molloy 001 (Random Struct. Algorithms, 2006)

The Cover Time of Random Digraphs. - Colin Cooper; Alan M. Frieze (APPROX-RANDOM, 2007)

Separating Populations with Wide Data: A Spectral Analysis. - Avrim Blum; Amin Coja-Oghlan; Alan M. Frieze; Shuheng Zhou 002 (ISAAC, 2007)

Random 2-SAT with Prescribed Literal Degrees. - Colin Cooper; Alan M. Frieze; Gregory B. Sorkin (Algorithmica, 2007)

First-Order Definability of Trees and Sparse Random Graphs. - Tom Bohman; Alan M. Frieze; Tomasz Luczak 001; Oleg Pikhurko; Clifford D. Smyth; Joel Spencer; Oleg Verbitsky 001 (Comb. Probab. Comput., 2007)

Adversarial Deletion in a Scale-Free Random Graph Process. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Comb. Probab. Comput., 2007)

On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. - Abraham D. Flaxman; Alan M. Frieze; Juan Carlos Vera 001 (Comb. Probab. Comput., 2007)

On the Chromatic Number of Random Graphs with a Fixed Degree Sequence. - Alan M. Frieze; Michael Krivelevich; Cliff Smyth 001 (Comb. Probab. Comput., 2007)

Codes identifying sets of vertices in random networks. - Alan M. Frieze; Ryan R. Martin; Julien Moncel; Miklós Ruszinkó; Cliff Smyth 001 (Discret. Math., 2007)

A Geometric Preferential Attachment Model of Networks. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Internet Math., 2007)

A Geometric Preferential Attachment Model of Networks II. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Internet Math., 2007)

The Influence of Search Engines on Preferential Attachment. - Alan M. Frieze; Juan Vera 001; Soumen Chakrabarti (Internet Math., 2007)

The cover time of the preferential attachment graph. - Colin Cooper; Alan M. Frieze (J. Comb. Theory B, 2007)

Randomly generated intersecting hypergraphs II. - Tom Bohman; Alan M. Frieze; Ryan R. Martin; Miklós Ruszinkó; Cliff Smyth 001 (Random Struct. Algorithms, 2007)

The cover time of sparse random graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2007)

The diameter of randomly perturbed digraphs and some applications. - Abraham D. Flaxman; Alan M. Frieze (Random Struct. Algorithms, 2007)

The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. - Alan M. Frieze; Gregory B. Sorkin (SIAM J. Comput., 2007)

A new approach to the planted clique problem. - Alan M. Frieze; Ravi Kannan (FSTTCS, 2008)

Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. - Prasad Chebolu; Alan M. Frieze; Páll Melsted (ICALP (1), 2008)

Random Walks on Random Graphs. - Colin Cooper; Alan M. Frieze (NanoNet, 2008)

Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k. - Amin Coja-Oghlan; Alan M. Frieze (Electron. J. Comb., 2008)

On Rainbow Trees and Cycles. - Alan M. Frieze; Michael Krivelevich (Electron. J. Comb., 2008)

On the Chromatic Number of Simple Triangle-Free Triple Systems. - Alan M. Frieze; Dhruv Mubayi (Electron. J. Comb., 2008)

The game chromatic number of random graphs. - Tom Bohman; Alan M. Frieze; Benny Sudakov (Random Struct. Algorithms, 2008)

The cover time of the giant component of a random graph. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2008)

Hamilton Cycles in Random Lifts of Directed Graphs. - Prasad Chebolu; Alan M. Frieze (SIAM J. Discret. Math., 2008)

Game chromatic index of graphs with given restrictions on degrees. - Andrew Beveridge; Tom Bohman; Alan M. Frieze; Oleg Pikhurko (Theor. Comput. Sci., 2008)

Average-Case Analyses of Vickrey Costs. - Prasad Chebolu; Alan M. Frieze; Páll Melsted; Gregory B. Sorkin (APPROX-RANDOM, 2009)

Multiple Random Walks and Interacting Particle Systems. - Colin Cooper; Alan M. Frieze; Tomasz Radzik (ICALP (2), 2009)

On smoothed k-CNF formulas and the Walksat algorithm. - Amin Coja-Oghlan; Uriel Feige; Alan M. Frieze; Michael Krivelevich; Dan Vilenchik (SODA, 2009)

Randomly colouring simple hypergraphs - Alan M. Frieze; Páll Melsted (CoRR, 2009)

Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables - Alan M. Frieze; Páll Melsted (CoRR, 2009)

Line-of-Sight Networks. - Alan M. Frieze; Jon M. Kleinberg; R. Ravi 001; Warren Debany (Comb. Probab. Comput., 2009)

Hamilton cycles in 3-out. - Tom Bohman; Alan M. Frieze (Random Struct. Algorithms, 2009)

Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2009)

Memoryless Rules for Achlioptas Processes. - Andrew Beveridge; Tom Bohman; Alan M. Frieze; Oleg Pikhurko (SIAM J. Discret. Math., 2009)

Multiple Random Walks in Random Regular Graphs. - Colin Cooper; Alan M. Frieze; Tomasz Radzik (SIAM J. Discret. Math., 2009)

Hypergraphs with independent neighborhoods. - Tom Bohman; Alan M. Frieze; Dhruv Mubayi; Oleg Pikhurko (Comb., 2010)

Loose Hamilton Cycles in Random 3-Uniform Hypergraphs. - Alan M. Frieze (Electron. J. Comb., 2010)

Logconcave Random Graphs. - Alan M. Frieze; Santosh S. Vempala; Juan Vera 001 (Electron. J. Comb., 2010)

A note on the random greedy triangle-packing algorithm - Tom Bohman; Alan M. Frieze; Eyal Lubetzky (CoRR, 2010)

Average case performance of heuristics for multi-dimensional assignment problems - Alan M. Frieze; Gregory B. Sorkin (CoRR, 2010)

Component structure induced by a random walk on a random graph - Colin Cooper; Alan M. Frieze (CoRR, 2010)

Average-case performance of heuristics for three-dimensional assignment problems - Alan M. Frieze; Gregory B. Sorkin (CoRR, 2010)

Finding a maximum matching in a sparse random graph in O(n) expected time. - Prasad Chebolu; Alan M. Frieze; Páll Melsted (J. ACM, 2010)

Anti-Ramsey properties of random graphs. - Tom Bohman; Alan M. Frieze; Oleg Pikhurko; Cliff Smyth 001 (J. Comb. Theory B, 2010)

Coloring H-free hypergraphs. - Tom Bohman; Alan M. Frieze; Dhruv Mubayi (Random Struct. Algorithms, 2010)

Randomly coloring random graphs. - Martin E. Dyer; Alan M. Frieze (Random Struct. Algorithms, 2010)

Flips in Graphs. - Tom Bohman; Andrzej Dudek; Alan M. Frieze; Oleg Pikhurko (SIAM J. Discret. Math., 2010)

An Efficient Sparse Regularity Concept. - Amin Coja-Oghlan; Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2010)

Random Walks with Look-Ahead in Scale-Free Random Graphs. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2010)

Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. - Colin Cooper; Alan M. Frieze; Michael Krivelevich (SIAM J. Discret. Math., 2010)

The Cover Times of Random Walks on Hypergraphs. - Colin Cooper; Alan M. Frieze; Tomasz Radzik (SIROCCO, 2011)

Loose Hamilton Cycles in Random Uniform Hypergraphs. - Andrzej Dudek; Alan M. Frieze (Electron. J. Comb., 2011)

High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks - Alan M. Frieze; Charalampos E. Tsourakakis (CoRR, 2011)

Random greedy triangle-packing beyond the 7/4 barrier - Tom Bohman; Alan M. Frieze; Eyal Lubetzky (CoRR, 2011)

Karp-Sipser on Random Graphs with a Fixed Degree Sequence. - Tom Bohman; Alan M. Frieze (Comb. Probab. Comput., 2011)

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). - Martin E. Dyer; Uriel Feige; Alan M. Frieze; Marek Karpinski (Dagstuhl Reports, 2011)

Randomly coloring simple hypergraphs. - Alan M. Frieze; Páll Melsted (Inf. Process. Lett., 2011)

Ramsey games with giants. - Tom Bohman; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh; Benny Sudakov (Random Struct. Algorithms, 2011)

The cover time of random geometric graphs. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2011)

An Analysis of Random-Walk Cuckoo Hashing. - Alan M. Frieze; Páll Melsted; Michael Mitzenmacher (SIAM J. Comput., 2011)

Rainbow Connectivity of Sparse Random Graphs. - Alan M. Frieze; Charalampos E. Tsourakakis (APPROX-RANDOM, 2012)

On Certain Properties of Random Apollonian Networks. - Alan M. Frieze; Charalampos E. Tsourakakis (WAW, 2012)

Rainbow Hamilton Cycles in Uniform Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001 (Electron. J. Comb., 2012)

Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Po-Shen Loh; Shelley Speiss (Electron. J. Comb., 2012)

Rainbow Connection of Sparse Random Graphs. - Alan M. Frieze; Charalampos E. Tsourakakis (Electron. J. Comb., 2012)

Cops and Robbers on Geometric Graphs. - Andrew Beveridge; Andrzej Dudek; Alan M. Frieze; Tobias Müller 001 (Comb. Probab. Comput., 2012)

Cover time of a random graph with given degree sequence. - Mohammed Amin Abdullah 001; Colin Cooper; Alan M. Frieze (Discret. Math., 2012)

Stationary distribution and cover time of random walks on random digraphs. - Colin Cooper; Alan M. Frieze (J. Comb. Theory B, 2012)

Variations on cops and robbers. - Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (J. Graph Theory, 2012)

Packing hamilton cycles in random and pseudo-random hypergraphs. - Alan M. Frieze; Michael Krivelevich (Random Struct. Algorithms, 2012)

Packing tight Hamilton cycles in 3-uniform hypergraphs. - Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Random Struct. Algorithms, 2012)

Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables. - Alan M. Frieze; Páll Melsted (Random Struct. Algorithms, 2012)

Packing Tight Hamilton Cycles in Uniform Hypergraphs. - Deepak Bal; Alan M. Frieze (SIAM J. Discret. Math., 2012)

Algorithmic techniques for modeling and mining large graphs (AMAzING). - Alan M. Frieze; Aristides Gionis; Charalampos E. Tsourakakis (KDD, 2013)

On the Non-Planarity of a Random Subgraph. - Alan M. Frieze; Michael Krivelevich (Comb. Probab. Comput., 2013)

Special Issue on Algorithms and Models for the Web Graph. - Alan M. Frieze; Paul Horn; Pawel Pralat (Internet Math., 2013)

Approximate counting of regular hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (Inf. Process. Lett., 2013)

Coloring simple hypergraphs. - Alan M. Frieze; Dhruv Mubayi (J. Comb. Theory B, 2013)

Component structure of the vacant set induced by a random walk on a random graph. - Colin Cooper; Alan M. Frieze (Random Struct. Algorithms, 2013)

Tight Hamilton cycles in random uniform hypergraphs. - Andrzej Dudek; Alan M. Frieze (Random Struct. Algorithms, 2013)

Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010). - Chris Peikert; Robert Kleinberg; Aravind Srinivasan; Alan M. Frieze; Alexander Russell; Leonard J. Schulman (SIAM J. Comput., 2013)

On the Game Chromatic Number of Sparse Random Graphs. - Alan M. Frieze; Simcha Haber; Mikhail Lavrov (SIAM J. Discret. Math., 2013)

The cover times of random walks on random uniform hypergraphs. - Colin Cooper; Alan M. Frieze; Tomasz Radzik (Theor. Comput. Sci., 2013)

Packing Tree Factors in Random and Pseudo-random Graphs. - Deepak Bal; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Electron. J. Comb., 2014)

The Topology of Competitively Constructed Graphs. - Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2014)

Looking for vertex number one. - Alan M. Frieze; Wesley Pegden (CoRR, 2014)

The t-Tone Chromatic Number of Random Graphs. - Deepak Bal; Patrick Bennett; Andrzej Dudek; Alan M. Frieze (Graphs Comb., 2014)

Some Typical Properties of the Spatial Preferred Attachment Model. - Colin Cooper; Alan M. Frieze; Pawel Pralat (Internet Math., 2014)

Some Properties of Random Apollonian Networks. - Alan M. Frieze; Charalampos E. Tsourakakis (Internet Math., 2014)

Maker-breaker games on random geometric graphs. - Andrew Beveridge; Andrzej Dudek; Alan M. Frieze; Tobias Müller 001; Milos Stojakovic (Random Struct. Algorithms, 2014)

Cover time of a random graph with a degree sequence II: Allowing vertices of degree two. - Colin Cooper; Alan M. Frieze; Eyal Lubetzky (Random Struct. Algorithms, 2014)

The height of random k-trees and related branching processes. - Colin Cooper; Alan M. Frieze; Ryuhei Uehara (Random Struct. Algorithms, 2014)

On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three. - Alan M. Frieze (Random Struct. Algorithms, 2014)

Rainbow hamilton cycles in random graphs. - Alan M. Frieze; Po-Shen Loh (Random Struct. Algorithms, 2014)

Analyzing Walksat on Random Formulas. - Amin Coja-Oghlan; Alan M. Frieze (SIAM J. Comput., 2014)

Expanders via Random Spanning Trees. - Alan M. Frieze; Navin Goyal; Luis Rademacher; Santosh S. Vempala (SIAM J. Comput., 2014)

Power of k Choices and Rainbow Spanning Trees in Random Graphs. - Deepak Bal; Patrick Bennett; Alan M. Frieze; Pawel Pralat (Electron. J. Comb., 2015)

On-line List Colouring of Random Graphs. - Alan M. Frieze; Dieter Mitsche; Xavier Pérez-Giménez; Pawel Pralat (Electron. J. Comb., 2015)

Between 2- and 3-Colorability. - Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2015)

Loose Hamilton Cycles in Regular Hypergraphs. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (Comb. Probab. Comput., 2015)

Long Paths in Random Apollonian Networks. - Colin Cooper; Alan M. Frieze (Internet Math., 2015)

On the chromatic number of a random hypergraph. - Martin E. Dyer; Alan M. Frieze; Catherine S. Greenhill (J. Comb. Theory B, 2015)

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three. - Alan M. Frieze; Simi Haber (Random Struct. Algorithms, 2015)

Efficient algorithms for three-dimensional axial and planar random assignment problems. - Alan M. Frieze; Gregory B. Sorkin (Random Struct. Algorithms, 2015)

Rainbow Connection of Random Regular Graphs. - Andrzej Dudek; Alan M. Frieze; Charalampos E. Tsourakakis (SIAM J. Discret. Math., 2015)

Walker-Breaker Games. - Lisa Espig; Alan M. Frieze; Michael Krivelevich; Wesley Pegden (SIAM J. Discret. Math., 2015)

Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs. - Patrick Bennett; Andrzej Dudek; Alan M. Frieze; Laars Helenius (Electron. J. Comb., 2016)

Scalefree hardness of average-case Euclidean TSP approximation. - Alan M. Frieze; Wesley Pegden (CoRR, 2016)

On the Length of a Random Minimum Spanning Tree. - Colin Cooper; Alan M. Frieze; Nate Ince; Svante Janson; Joel Spencer (Comb. Probab. Comput., 2016)

Rainbow Arborescence in Random Digraphs. - Deepak Bal; Patrick Bennett; Colin Cooper; Alan M. Frieze; Pawel Pralat (J. Graph Theory, 2016)

Rainbow matchings and Hamilton cycles in random graphs. - Deepak Bal; Alan M. Frieze (Random Struct. Algorithms, 2016)

Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2016)

The covertime of a biased random walk on Gn, p. - Colin Cooper; Alan M. Frieze; Samantha Petti (CoRR, 2017)

Randomly coloring simple hypergraphs with fewer colors. - Alan M. Frieze; Michael Anastos (Inf. Process. Lett., 2017)

Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity. - Andrzej Dudek; Alan M. Frieze; Andrzej Rucinski 001; Matas Sileikis (J. Comb. Theory B, 2017)

On random k-out subgraphs of large graphs. - Alan M. Frieze; Tony Johansson (Random Struct. Algorithms, 2017)

Separating subadditive euclidean functionals. - Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2017)

Minimum Cost Matching in a Random Graph with Random Costs. - Alan M. Frieze; Tony Johansson (SIAM J. Discret. Math., 2017)

The cover time of a biased random walk on Gn, p. - Colin Cooper; Alan M. Frieze; Samantha Petti (ANALCO, 2018)

The Cover Time of a Biased Random Walk on a Random Cubic Graph. - Colin Cooper; Alan M. Frieze; Tony Johansson (AofA, 2018)

Constraining the Clustering Transition for Colorings of Sparse Random Graphs. - Michael Anastos; Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2018)

On Rainbow Hamilton Cycles in Random Hypergraphs. - Andrzej Dudek; Sean English; Alan M. Frieze (Electron. J. Comb., 2018)

Packing Hamilton Cycles Online. - Joseph Briggs; Alan M. Frieze; Michael Krivelevich; Po-Shen Loh (Comb. Probab. Comput., 2018)

On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph. - Alan M. Frieze; Tony Johansson (Comb. Probab. Comput., 2018)

Balanced allocation through random walk. - Alan M. Frieze; Samantha Petti (Inf. Process. Lett., 2018)

A greedy algorithm for finding a large 2-matching on a random cubic graph. - Deepak Bal; Patrick Bennett; Tom Bohman; Alan M. Frieze (J. Graph Theory, 2018)

Online purchasing under uncertainty. - Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2018)

A note on dispersing particles on a line. - Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2018)

Discordant Voting Processes on Finite Graphs. - Colin Cooper; Martin E. Dyer; Alan M. Frieze; Nicolás Rivera (SIAM J. Discret. Math., 2018)

Elegantly Colored Paths and Cycles in Edge Colored Random Graphs. - Lisa Espig; Alan M. Frieze; Michael Krivelevich (SIAM J. Discret. Math., 2018)

The Distribution of Minimum-Weight Cliques and Other Subgraphs in Graphs with Random Edge Weights. - Alan M. Frieze; Wesley Pegden; Gregory B. Sorkin (SIAM J. Discret. Math., 2018)

On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs. - Michael Anastos; Alan M. Frieze (APPROX-RANDOM, 2019)

On the Rank of a Random Binary Matrix. - Colin Cooper; Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2019)

A Note on Log-Concave Random Graphs. - Alan M. Frieze; Tomasz Tkocz (Electron. J. Comb., 2019)

A note on the localization number of random graphs: Diameter two case. - Andrzej Dudek; Alan M. Frieze; Wesley Pegden (Discret. Appl. Math., 2019)

How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? - Michael Anastos; Alan M. Frieze (J. Graph Theory, 2019)

Minors of a random binary matroid. - Colin Cooper; Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2019)

Notes on growing a tree in a graph. - Luc Devroye; Vida Dujmovic; Alan M. Frieze; Abbas Mehrabian; Pat Morin; Bruce A. Reed (Random Struct. Algorithms, 2019)

On the insertion time of random walk cuckoo hashing. - Alan M. Frieze; Tony Johansson (Random Struct. Algorithms, 2019)

Traveling in randomly embedded random graphs. - Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2019)

Perfect matchings and Hamiltonian cycles in the preferential attachment model. - Alan M. Frieze; Xavier Pérez-Giménez; Pawel Pralat; Benjamin Reiniger (Random Struct. Algorithms, 2019)

Pattern Colored Hamilton Cycles in Random Graphs. - Michael Anastos; Alan M. Frieze (SIAM J. Discret. Math., 2019)

On the Cover Time of Dense Graphs. - Colin Cooper; Alan M. Frieze; Wesley Pegden (SIAM J. Discret. Math., 2019)

A Random Variant of the Game of Plates and Olives. - Andrzej Dudek; Sean English; Alan M. Frieze (SIAM J. Discret. Math., 2019)

Degree Distribution for Duplication-Divergence Graphs: Large Deviations. - Alan M. Frieze; Krzysztof Turowski; Wojciech Szpankowski (WG, 2020)

On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph. - Alan M. Frieze; Xavier Pérez-Giménez; Pawel Pralat (Electron. J. Comb., 2020)

On random multi-dimensional assignment problems. - Alan M. Frieze; Wesley Pegden; Tomasz Tkocz (Discret. Appl. Math., 2020)

Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. - Michael Anastos; Alan M. Frieze (Random Struct. Algorithms, 2020)

Random Graphs with a Fixed Maximum Degree. - Alan M. Frieze; Tomasz Tkocz (SIAM J. Discret. Math., 2020)

On the connectivity of proper colorings of random graphs and hypergraphs. - Michael Anastos; Alan M. Frieze (Random Struct. Algorithms, 2020)

Minimum-Weight Combinatorial Structures Under Random Cost-Constraints. - Alan M. Frieze; Wesley Pegden; Gregory B. Sorkin; Tomasz Tkocz (Electron. J. Comb., 2021)

A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint. - Alan M. Frieze; Tomasz Tkocz (Electron. J. Comb., 2021)

Shortest paths with a cost constraint: A probabilistic analysis. - Alan M. Frieze; Tomasz Tkocz (Discret. Appl. Math., 2021)

Isomorphism for random k-uniform hypergraphs. - Debsoumya Chakraborti; Alan M. Frieze; Simi Haber; Mihir Hasabnis (Inf. Process. Lett., 2021)

A scaling limit for the length of the longest cycle in a sparse random graph. - Michael Anastos; Alan M. Frieze (J. Comb. Theory B, 2021)

Maker Breaker on digraphs. - Alan M. Frieze; Wesley Pegden (J. Graph Theory, 2021)

Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects. - Alan M. Frieze; Tomasz Tkocz (Oper. Res. Lett., 2021)

Finding maximum matchings in random regular graphs in linear expected time. - Michael Anastos; Alan M. Frieze (Random Struct. Algorithms, 2021)

Hamiltonicity of Random Graphs in the Stochastic Block Model. - Michael Anastos; Alan M. Frieze; Pu Gao (SIAM J. Discret. Math., 2021)

The Effect of Adding Randomly Weighted Edges. - Alan M. Frieze (SIAM J. Discret. Math., 2021)

Learning from a Sample in Online Algorithms. - C. J. Argue; Alan M. Frieze; Anupam Gupta 001; Christopher Seiler (NeurIPS, 2022)

Rainbow spanning trees in randomly coloured Gk-out. - Deepak Bal; Alan M. Frieze; Pawel Pralat (CoRR, 2022)

Localization game for random graphs. - Andrzej Dudek; Sean English; Alan M. Frieze; Calum MacRury; Pawel Pralat (Discret. Appl. Math., 2022)

Spanners in randomly weighted graphs: Independent edge lengths. - Alan M. Frieze; Wesley Pegden (Discret. Appl. Math., 2022)

Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. - Hüseyin Acan; Alan M. Frieze; Boris G. Pittel (J. Appl. Probab., 2022)

A Randomly Weighted Minimum Arborescence with a Random Cost Constraint. - Alan M. Frieze; Tomasz Tkocz (Math. Oper. Res., 2022)

A scaling limit for the length of the longest cycle in a sparse random digraph. - Michael Anastos; Alan M. Frieze (Random Struct. Algorithms, 2022)

On the Cover Time of the Emerging Giant. - Alan M. Frieze; Wesley Pegden; Tomasz Tkocz (SIAM J. Discret. Math., 2022)

Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2022)

Subexponential mixing for partition chains on grid-like graphs. - Alan M. Frieze; Wesley Pegden (SODA, 2023)

Multitrees in Random Graphs. - Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2023)

Colorful Hamilton Cycles in Random Graphs. - Debsoumya Chakraborti; Alan M. Frieze; Mihir Hasabnis (SIAM J. Discret. Math., 2023)

Spanners in randomly weighted graphs: Euclidean case. - Alan M. Frieze; Wesley Pegden (J. Graph Theory, 2023)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold. - Tolson Bell; Alan M. Frieze (FOCS, 2024)

On the Intersecting Family Process. - Alan M. Frieze; Patrick Bennett; Andrew Newman; Wesley Pegden (Electron. J. Comb., 2024)

The Bright Side of Simple Heuristics for the TSP. - Alan M. Frieze; Wesley Pegden (Electron. J. Comb., 2024)

Rainbow Thresholds. - Tolson Bell; Alan M. Frieze; Trent G. Marbach (SIAM J. Discret. Math., 2024)

On the Chromatic Number of Random Regular Hypergraphs. - Patrick Bennett; Alan M. Frieze (SIAM J. Discret. Math., 2024)

Rainbow Spanning Trees in Randomly Colored ( boldsymbol{G}_{ boldsymbol{k}- boldsymbol{out}} ). - Deepak Bal; Alan M. Frieze; Pawel Pralat (SIAM J. Discret. Math., 2024)

On the Concentration of the Maximum Degree in the Duplication-Divergence Models. - Alan M. Frieze; Krzysztof Turowski; Wojciech Szpankowski (SIAM J. Discret. Math., 2024)

Rainbow powers of a Hamilton cycle in Gn,p. - Tolson Bell; Alan M. Frieze (J. Graph Theory, 2024)

Rainbow Hamilton cycles in random geometric graphs. - Alan M. Frieze; Xavier Pérez-Giménez (Random Struct. Algorithms, 2024)

Weighted Tree Games. - Patrick Bennett; Alan M. Frieze (Electron. J. Comb., 2025)

Some online Maker-Breaker games. - Patrick Bennett; Alan M. Frieze (Discret. Math., 2025)

Giant rainbow trees in sparse random graphs. - Tolson Bell; Alan M. Frieze (Eur. J. Comb., 2025)

Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds. - Alan M. Frieze; Pu Gao; Calum MacRury; Pawel Pralat; Gregory B. Sorkin (Eur. J. Comb., 2025)

The Moran Process on a Random Graph. - Alan M. Frieze; Wesley Pegden (Random Struct. Algorithms, 2025)

Hamilton Cycles in Random Digraphs with Minimum Degree at Least One. - Colin Cooper; Alan M. Frieze (SIAM J. Discret. Math., 2025)

Karp's patching algorithm on dense digraph. - Alan M. Frieze (CoRR, 2025)

Cover time of random subgraphs of the hypercube. - Colin Cooper; Alan M. Frieze; Wesley Pegden (CoRR, 2025)