Journal: Random Struct. Algorithms

Volume 53, Issue 4

559 -- 560. Issue information
561 -- 585Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga. Dispersion processes
586 -- 591Alan M. Frieze, Wesley Pegden. A note on dispersing particles on a line
592 -- 603Asaf Ferber, Matthew Kwan, Benny Sudakov. Counting Hamilton cycles in sparse random directed graphs
604 -- 637Asaf Ferber, Rajko Nenadov. Spanning universality in random graphs
638 -- 651Frederik Garbe, Richard Mycroft, Andrew McDowell. Contagious sets in a degree-proportional bootstrap percolation process
652 -- 666Pawel Hitczenko, Amanda Lohss. Probabilistic consequences of some polynomial recurrences
667 -- 691Dániel Korándi, Frank Mousset, Rajko Nenadov, Nemanja Skoric, Benny Sudakov. Monochromatic cycle covers in random graphs
692 -- 716Michael Krivelevich, Matthew Kwan, Po-Shen Loh, Benny Sudakov. The random k-matching-free process
717 -- 727Tobias Müller 0001, Marc Noy. The first order convergence law fails for random perfect graphs
728 -- 751Nemanja Skoric, Angelika Steger, Milos Trujic. Local resilience of an almost spanning k-cycle in random graphs