Journal Article THE DISTRIBUTION OF MINIMUM-WEIGHT CLIQUES AND OTHER SUBGRAPHS IN GRAPHS WITH RANDOM EDGE WEIGHTS 2018 • SIAM Journal on Discrete Mathematics • 32(3):2115-2133 Frieze A, Pegden W, Sorkin GB
Journal Article Assessing significance in a Markov chain without mixing 2017 • Proceedings of the National Academy of Sciences of the United States of America • 114(11):2860-2864 Chikina M, Frieze A, Pegden W
Journal Article Embedding the Erdos-Renyi hypergraph into the random regular hypergraph and Hamiltonicity 2017 • Journal of combinatorial theory. Series B (Print) • 122:719-740 Dudek A, Frieze A, Rucinski A, Sileikis M
Journal Article LOOKING FOR VERTEX NUMBER ONE 2017 • The Annals of Applied Probability • 27(1):582-630 Frieze A, Pegden W
Journal Article MINIMUM COST MATCHING IN A RANDOM GRAPH WITH RANDOM COSTS 2017 • SIAM Journal on Discrete Mathematics • 31(1):489-510 Frieze A, Johansson T
Journal Article On random k‐out subgraphs of large graphs 2017 • Random structures & algorithms (Print) • 50(2):143-157 Frieze A, Johansson T
Conference On the insertion time of random walk cuckoo hashing 2017 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1497-1502 Frieze A, Johansson T
Journal Article Randomly coloring simple hypergraphs with fewer colors 2017 • Information Processing Letters • 126:39-42 Frieze A, Anastos M
Journal Article Separating subadditive euclidean functionals 2017 • Random structures & algorithms (Print) • 51(3):375-403 Frieze A, Pegden W
Journal Article Traveling in randomly embedded random graphs 2017 • Leibniz International Proceedings in Informatics • 81: Frieze A, Pegden W
Conference Discordant voting processes on finite graphs 2016 • Leibniz International Proceedings in Informatics • 55: Cooper C, Dyer M, Frieze A, Rivera N
Journal Article On the Length of a Random Minimum Spanning Tree 2016 • Combinatorics Probability and Computing • 25(1):89-107 Cooper C, Frieze A, Ince N, Janson S, Spencer J
Journal Article Rainbow Arborescence in Random Digraphs 2016 • Journal of Graph Theory • 83(3):251-265 Bal D, Bennett P, Cooper C, Frieze A, Pralat P
Journal Article Rainbow Matchings and Hamilton Cycles in Random Graphs 2016 • Random structures & algorithms (Print) • 48(3):503-523 Bal D, Frieze A
Journal Article Separating Subadditive Euclidean Functionals 2016 • Annual ACM Symposium on Theory of Computing • 22-35 Frieze A, Pegden W
Journal Article VACANT SETS AND VACANT NETS: COMPONENT STRUCTURES INDUCED BY A RANDOM WALK 2016 • SIAM Journal on Discrete Mathematics • 30(1):166-205 Cooper C, Frieze A
Journal Article Weak and strong versions of the 1-2-3 conjecture uniform hypergraphs 2016 • Electronic Journal of Combinatorics • 23(2): Bennett P, Dudek A, Frieze A, Helenius L
Journal Article An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three 2015 • Random structures & algorithms (Print) • 47(1):73-98 Frieze A, Haber S
Journal Article Application-Ready Expedited MODIS Data for Operational Land Surface Monitoring of Vegetation Condition 2015 • Remote Sensing • 7(12):16226-16240 Brown JF, Howard D, Wylie B, Frieze A, Ji L, Gacke C
Journal Article Between 2-and 3-colorability 2015 • Electronic Journal of Combinatorics • 22(1): Frieze A, Pegden W
Journal Article Efficient Algorithms for Three-Dimensional Axial and Planar Random Assignment Problems 2015 • Random structures & algorithms (Print) • 46(1):160-196 Frieze A, Sorkin GB
Journal Article LONG PATHS IN RANDOM APOLLONIAN NETWORKS 2015 • Internet Mathematics • 11(4-5):308-318 Cooper C, Frieze A
Journal Article Loose Hamilton Cycles in Regular Hypergraphs 2015 • Combinatorics Probability and Computing • 24(1):179-194 Dudek A, Frieze A, Rucinski A, Sileikis M
Journal Article On the chromatic number of a random hypergraph 2015 • Journal of combinatorial theory. Series B (Print) • 113:68-122 Dyer M, Frieze A, Greenhill C
Journal Article On-line list colouring of random graphs 2015 • Electronic Journal of Combinatorics • 22(2): Frieze A, Mitsche D, Perez-Gimenez X, Pralat P
