11. Longest cycles in sparse random digraphs12. Issue 1 (28th May 2012) Authors: Krivelevich, Michael; Lubetzky, Eyal; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 43:Issue 1(2013) Page Start: 1 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
12. On covering expander graphs by hamilton cycles. Issue 2 (10th August 2012) Authors: Glebov, Roman; Krivelevich, Michael; Szabó, Tibor Journal: Random structures & algorithms Issue: Volume 44:Issue 2(2014) Page Start: 183 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
13. On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. Issue 4 (29th December 2017) Authors: Gishboliner, Lior; Krivelevich, Michael; Kronenberg, Gal Journal: Random structures & algorithms Issue: Volume 52:Issue 4(2018) Page Start: 545 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
14. The Kőnig graph process. Issue 4 (9th October 2020) Authors: Kamčev, Nina; Krivelevich, Michael; Morrison, Natasha; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 57:Issue 4(2020) Page Start: 1272 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
15. The largest hole in sparse random graphs. Issue 4 (25th February 2022) Authors: Draganić, Nemanja; Glock, Stefan; Krivelevich, Michael Journal: Random structures & algorithms Issue: Volume 61:Issue 4(2022) Page Start: 666 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
16. The phase transition in random graphs: A simple proof. Issue 2 (24th September 2012) Authors: Krivelevich, Michael; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 43:Issue 2(2013) Page Start: 131 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
17. The random k‐matching‐free process. Issue 4 (29th October 2018) Authors: Krivelevich, Michael; Kwan, Matthew; Loh, Po‐Shen; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 53:Issue 4(2018) Page Start: 692 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
18. The size‐Ramsey number of short subdivisions. Issue 1 (11th January 2021) Authors: Draganić, Nemanja; Krivelevich, Michael; Nenadov, Rajko Journal: Random structures & algorithms Issue: Volume 59:Issue 1(2021) Page Start: 68 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
19. Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process. Issue 4 (27th September 2020) Authors: Ben‐Eliezer, Omri; Gishboliner, Lior; Hefetz, Dan; Krivelevich, Michael Journal: Random structures & algorithms Issue: Volume 57:Issue 4(2020) Page Start: 892 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗