Journal Article Clustering large graphs via the Singular Value Decomposition 2004 • Machine Learning • 56(1-3):9-33 Drineas P, Frieze A, Kannan R, Vempala S, Vinay V
Journal Article Crawling on simple models of web graphs 2004 • Internet Mathematics • 1(1):57-90 Cooper C, Frieze A
Journal Article Efficient communication in an ad-hoc network 2004 • Journal of Algorithms in Cognition, Informatics and Logic • 52(1):1-7 Flaxman A, Frieze A, Upfal E
Journal Article Fast Monte-Carlo algorithms for finding low-rank approximations 2004 • Journal of the ACM • 51(6):1025-1041 Frieze A, Kannan R, Vempala S
Journal Article On random symmetric travelling salesman problems 2004 • Mathematics of Operations Research • 29(4):878-890 Frieze A
Journal Article On the <i>b</i>-independence number of sparse random graphs 2004 • Combinatorics Probability and Computing • 13(3):295-309 Atkinson G, Frieze A
Conference Perfect matchings in random graphs with prescribed minimal degree 2004 • Trends in Mathematics • 95-132 Frieze A, Pittel B
Journal Article Random deletion in a scale-free random graph process 2004 • Internet Mathematics • 1(4):463-483 Cooper C, Frieze A, Vera J
Conference Randomly coloring constant degree graphs 2004 • Annual Symposium on Foundations of Computer Science • 582-589 Dyer M, Frieze A, Hayes TP, Vigoda E
Journal Article The diameter of randomly perturbed digraphs and some applications 2004 • Lecture Notes in Computer Science • 3122:345-356 Flaxman AD, Frieze AM
Journal Article The emergence of a giant component in random subgraphs of Pseudo-random graphs 2004 • Random structures & algorithms (Print) • 24(1):42-50 Frieze A, Krivelevich M, Martin R
Journal Article The size of the largest strongly connected component of a random digraph with a given degree sequence 2004 • Combinatorics Probability and Computing • 13(3):319-337 Cooper C, Frieze A
Journal Article A general model of web graphs 2003 • Random structures & algorithms (Print) • 22(3):311-335 Cooper C, Frieze A
Journal Article A probabilistic analysis of randomly generated binary constraint satisfaction problems 2003 • Theoretical Computer Science • 290(3):1815-1828 Dyer M, Frieze A, Molloy M
Journal Article Arc-disjoint paths in expander digraphs 2003 • SIAM journal on computing (Print) • 32(2):326-344 Bohman T, Frieze A
Journal Article High degree vertices and eigenvalues in the preferential attachment graph 2003 • Lecture Notes in Computer Science • 2764:264-274 Flaxman A, Frieze A, Fenner T
Journal Article How many random edges make a dense graph hamiltonian? 2003 • Random structures & algorithms (Print) • 22(1):33-42 Bohman T, Frieze A, Martin R
Journal Article On randomly generated intersecting hypergraphs 2003 • Electronic Journal of Combinatorics • 10(1 R): Bohman T, Cooper C, Frieze A, Martin R, Ruszinkó M
Journal Article On randomly generated intersecting hypergraphs -: art. no. R29 2003 • Electronic Journal of Combinatorics • 10(1): Bohman T, Frieze A, Cooper C, Martin R, Ruszinkó M
Conference Perfect matchings in random graphs with prescribed minimal degree 2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 148-157 Frieze A, Pittel B
Journal Article Randomly coloring graphs with lower bounds on girth and maximum degree 2003 • Random structures & algorithms (Print) • 23(2):167-179 Dyer M, Frieze A
Conference Simulation using initial 4D beam particle distributions synthesized from experimental data 2003 • PROCEEDINGS OF THE 2003 PARTICLE ACCELERATOR CONFERENCE, VOLS 1-5 • 275-277 Friedman A, Bieniosek FM, Celata CM, Grote DP, Prost LR, Seidl PA
Conference The cover time of sparse random graphs. 2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 140-147 Cooper C, Frieze A
Conference The satisfiability threshold for randomly generated binary constraint satisfaction problems 2003 • Lecture Notes in Computer Science • 2764:275-289 Frieze A, Molloy M
Journal Article A new rounding procedure for the assignment problem with applications to dense graph arrangement problems 2002 • Mathematical programming • 92(1):1-36 Arora S, Frieze A, Kaplan H
