1. A greedy algorithm for finding a large 2‐matching on a random cubic graph. Issue 3 (27th November 2017) Authors: Bal, Deepak; Bennett, Patrick; Bohman, Tom; Frieze, Alan Journal: Journal of graph theory Issue: Volume 88:Issue 3(2018) Page Start: 449 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A note on dispersing particles on a line. Issue 4 (29th October 2018) Authors: Frieze, Alan; Pegden, Wesley Journal: Random structures & algorithms Issue: Volume 53:Issue 4(2018) Page Start: 586 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. A scaling limit for the length of the longest cycle in a sparse random digraph. Issue 1 (14th June 2021) Authors: Anastos, Michael; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 60:Issue 1(2022) Page Start: 3 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three1. Issue 1 (10th April 2014) Authors: Frieze, Alan; Haber, Simi Journal: Random structures & algorithms Issue: Volume 47:Issue 1(2015) Page Start: 73 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Component structure of the vacant set induced by a random walk on a random graph. Issue 2 (8th February 2012) Authors: Cooper, Colin; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 42:Issue 2(2013) Page Start: 135 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. Cover time of a random graph with a degree sequence II: Allowing vertices of degree two1. Issue 4 (4th October 2014) Authors: Cooper, Colin; Frieze, Alan; Lubetzky, Eyal Journal: Random structures & algorithms Issue: Volume 45:Issue 4(2014) Page Start: 627 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. Cover time of a random graph with a degree sequence II: Allowing vertices of degree two1. Issue 4 (6th February 2015) Authors: Cooper, Colin; Frieze, Alan; Lubetzky, Eyal Journal: Random structures & algorithms Issue: Volume 45:Issue 4(2014) Page Start: 627 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. Efficient algorithms for three‐dimensional axial and planar random assignment problems1. Issue 1 (11th November 2013) Authors: Frieze, Alan; Sorkin, Gregory B. Journal: Random structures & algorithms Issue: Volume 46:Issue 1(2015) Page Start: 160 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Finding maximum matchings in random regular graphs in linear expected time. Issue 3 (24th November 2020) Authors: Anastos, Michael; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 58:Issue 3(2021) Page Start: 390 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. Giant descendant trees, matchings, and independent sets in age-biased attachment graphs. (25th June 2022) Authors: Acan, Hüseyin; Frieze, Alan; Pittel, Boris Journal: Journal of applied probability Issue: Volume 59:Number 2(2022) Page Start: 299 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗