Journal Article On the random 2-stage minimum spanning tree 2006 • Random structures & algorithms (Print) • 28(1):24-36 Flaxman AD, Frieze A, Krivelevich M
Conference Random Graphs 2006 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 960-960 Frieze A
Journal Article Randomly coloring sparse random graphs with fewer colors than the maximum degree 2006 • Random structures & algorithms (Print) • 29(4):450-465 Dyer M, Flaxman AD, Frieze AM, Vigoda E
Journal Article The Influence of Search Engines on Preferential Attachment 2006 • Internet Mathematics • 3(3):361-381 Frieze A, Vera J, Chakrabarti S
Journal Article The satisfiability threshold for randomly generated binary constraint satisfaction problems 2006 • Random structures & algorithms (Print) • 28(3):323-339 Frieze A, Molloy M
Conference Adversarial Deletion in a Scale Free Random Graph Process 2005 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 287-292 Flaxman AD, Frieze AM, Vera J
Conference Analco workshop preface 2005 • Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics Chauvin B, Flajolet P, Frieze A, Mitzenmacher M, Panario D, Pippenger N, Prodinger H, Sedgewick R, Upfal E
Journal Article High degree vertices and eigenvalues in the preferential attachment graph 2005 • Internet Mathematics • 2(1):1-19 Flaxman A, Frieze A, Fenner T
Conference Identifying codes in random networks 2005 • IEEE International Symposium on Information Theory - Proceedings • 1464-1467 Frieze A, Martin R, Moncel J, Ruszinkó M, Smyth C
Journal Article On packing Hamilton cycles in ε-regular graphs 2005 • Journal of combinatorial theory. Series B (Print) • 94(1):159-172 Frieze A, Krivelevich M
Conference On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem 2005 • Annual ACM Symposium on Theory of Computing • 441-449 Flaxman AD, Frieze AM, Vera JC
Conference On the random 2-stage minimum spanning tree 2005 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 919-926 Flaxman AD, Frieze A, Krivelevich M
Journal Article Perfect matchings in random bipartite graphs with minimal degree at least 2 2005 • Random structures & algorithms (Print) • 26(3):319-358 Frieze A
Journal Article Random <i>k</i>-SAT:: A tight threshold for moderately growing <i>k</i> 2005 • Combinatorica • 25(3):297-305 Frieze A, Wormald NC
Journal Article The cover time of random regular graphs 2005 • SIAM Journal on Discrete Mathematics • 18(4):728-740 Cooper C, Frieze A
Conference The cover time of two classes of random graphs 2005 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 961-970 Cooper C, Frieze A
Journal Article The game of JumbleG 2005 • Combinatorics Probability and Computing • 14(5-6):783-793 Frieze A, Krivelevich M, Pikhurko O, Szabó T
Conference The influence of search engines on preferential attachment 2005 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 293-300 Chakrabarti S, Frieze A, Vera J
Journal Article The strong chromatic index of random graphs 2005 • SIAM Journal on Discrete Mathematics • 19(3):719-727 Frieze A, Krivelevich M, Sudakov B
Journal Article A geometric preferential attachment model of networks 2004 • Lecture Notes in Computer Science • 3243:44-55 Flaxman AD, Frieze AM, Vera J
Journal Article Adding random edges to dense graphs 2004 • Random structures & algorithms (Print) • 24(2):105-117 Bohman T, Frieze A, Krivelevich M, Martin R
Journal Article Avoidance of a giant component in half the edge set of a random graph 2004 • Random structures & algorithms (Print) • 25(4):432-449 Bohman T, Frieze A, Wormald NC
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