Journal Article Edge-disjoint paths in expander graphs (vol 30. pg 1790, 2001) 2002 • SIAM journal on computing (Print) • 31(3):988-988 Frieze A
Journal Article Erratum: Avoiding a Giant Component (Random Structures and Algorithms (2001) 19 (75-85)) 2002 • Random structures & algorithms (Print) • 20(1):126-130 Bohman T, Frieze A
Journal Article Erratum: Edge-disjoint paths in expander graphs (SIAM Journal on Computing (2001) 30 (1790-1801)) 2002 • SIAM journal on computing (Print) • 31(3):988 Frieze A
Journal Article Hamilton cycles in random subgraphs of pseudo-random graphs 2002 • Discrete Mathematics • 256(1-2):137-150 Frieze A, Krivelevich M
Journal Article Multi-coloured Hamilton cycles in random edge-coloured graphs 2002 • Combinatorics Probability and Computing • 11(2):129-133 Cooper C, Frieze A
Journal Article On counting independent sets in sparse graphs 2002 • SIAM journal on computing (Print) • 31(5):1527-1541 Dyer M, Frieze A, Jerrum M
Journal Article On graph irregularity strength 2002 • Journal of Graph Theory • 41(2):120-137 Frieze A, Gould RJ, Karonski M, Pfender F
Conference On random symmetric travelling salesman problems 2002 • Annual Symposium on Foundations of Computer Science • 789-798 Frieze A
Journal Article Optimal Sequencing by hybridization in rounds 2002 • Journal of Computational Biology • 9(2):355-369 Frieze AM, Halldórsson BV
Journal Article Random regular graphs of non-constant degree: Connectivity and hamiltonicity 2002 • Combinatorics Probability and Computing • 11(3):249-261 Cooper C, Frieze A, Reed B
Journal Article Random regular graphs of non-constant degree: Independence and chromatic number 2002 • Combinatorics Probability and Computing • 11(4):323-341 Cooper C, Frieze A, Reed B, Riordan O
Journal Article <i>G</i>-intersecting families 2001 • Combinatorics Probability and Computing • 10(5):367-384 Bohman T, Frieze A, Ruszinkó M, Thoma L
Journal Article A general approach to dynamic packet routing with bounded buffers 2001 • Journal of the ACM • 48(2):324-349 Broder AZ, Frieze AM, Upfal E
Conference A general model of undirected web graphs 2001 • Lecture Notes in Computer Science • 2161:500-511 Cooper C, Frieze AM
Conference Arc-disjoint paths in expander digraphs 2001 • Annual Symposium on Foundations of Computer Science • 558-567 Bohman T, Frieze A
Journal Article Avoiding a giant component 2001 • Random structures & algorithms (Print) • 19(1):75-85 Bohman T, Frieze A
Journal Article Edge-disjoint paths in expander graphs 2001 • SIAM journal on computing (Print) • 30(6):1790-1801 Frieze AM
Journal Article Hamilton cycles in the union of random permutations 2001 • Random structures & algorithms (Print) • 18(1):83-94 Frieze A
Journal Article Hamilton cycles in the union of random permutations 2001 • Random structures & algorithms (Print) • 18(1):83-94 Frieze A
Journal Article On Markov chains for randomly <i>H</i>-coloring a graph 2001 • Journal of Algorithms in Cognition, Informatics and Logic • 39(1):117-134 Cooper C, Dyer M, Frieze A
Conference Optimal sequencing by hybridization in rounds 2001 • Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB • 141-148 Frieze AM, Halldórsson BV
Conference Randomly colouring graphs with lower bounds on girth and maximum degree 2001 • Annual Symposium on Foundations of Computer Science • 579-587 Dyer M, Frieze A
Conference The probabilistic relationship between the assignment and asymmetric traveling salesman problems 2001 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 652-660 Frieze A, Sorkin GB
Journal Article Vertex covers by edge disjoint cliques 2001 • Combinatorica • 21(2):171-197 Bohman T, Frieze A, Ruszinkó M, Thoma L
Journal Article A note on random minimum length spanning trees 2000 • Electronic Journal of Combinatorics • 7(1 R):1-5 Frieze A, Ruszinkó M, Thoma L
