41. A unified view of graph regularity via matrix decompositions. Issue 1 (11th October 2021) Authors: Bodwin, Greg; Vempala, Santosh Journal: Random structures & algorithms Issue: Volume 61:Issue 1(2022) Page Start: 62 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
42. A universal result for consecutive random subdivision of polygons. Issue 2 (4th November 2016) Authors: Nguyen, Tuan‐Minh; Volkov, Stanislav Journal: Random structures & algorithms Issue: Volume 51:Issue 2(2017) Page Start: 341 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
43. Absence of percolation in graphs based on stationary point processes with degrees bounded by two. Issue 1 (30th March 2022) Authors: Jahnel, Benedikt; Tóbiás, András Journal: Random structures & algorithms Issue: Volume 62:Issue 1(2023) Page Start: 240 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
44. Absorption time of the Moran process1. Issue 1 (12th January 2016) Authors: Díaz, Josep; Goldberg, Leslie Ann; Richerby, David; Serna, Maria Journal: Random structures & algorithms Issue: Volume 49:Issue 1(2016) Page Start: 137 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
45. Acyclic edge colourings of graphs with large girth. Issue 4 (3rd November 2016) Authors: Cai, X. S.; Perarnau, G.; Reed, B.; Watts, A. B. Journal: Random structures & algorithms Issue: Volume 50:Issue 4(2017) Page Start: 511 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
46. Aggregation models with limited choice and the multiplicative coalescent1. Issue 1 (13th March 2013) Authors: Bhamidi, Shankar; Budhiraja, Amarjit; Wang, Xuan Journal: Random structures & algorithms Issue: Volume 46:Issue 1(2015) Page Start: 55 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
47. Algebraic and combinatorial expansion in random simplicial complexes. Issue 3 (16th July 2021) Authors: Fountoulakis, Nikolaos; Przykucki, Michał Journal: Random structures & algorithms Issue: Volume 60:Issue 3(2022) Page Start: 339 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
48. Almost all trees are almost graceful. Issue 4 (19th February 2020) Authors: Adamaszek, Anna; Allen, Peter; Grosu, Codruţ; Hladký, Jan Journal: Random structures & algorithms Issue: Volume 56:Issue 4(2020) Page Start: 948 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
49. Almost‐spanning universality in random graphs1. Issue 3 (28th April 2016) Authors: Conlon, David; Ferber, Asaf; Nenadov, Rajko; Škorić, Nemanja Journal: Random structures & algorithms Issue: Volume 50:Issue 3(2017) Page Start: 380 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
50. An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sample. Issue 1 (14th August 2017) Authors: Arlotto, Alessandro; Wei, Yehua; Xie, Xinchang Journal: Random structures & algorithms Issue: Volume 52:Issue 1(2018) Page Start: 41 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗