On random *k*‐out subgraphs of large graphsA Frieze, T Johansson Random Structures & Algorithms 50 (2), 143-157, 2017 | 15 | 2017 |

On the insertion time of random walk cuckoo hashing A Frieze, T Johansson Random Structures & Algorithms 54 (4), 721-729, 2019 | 13 | 2019 |

The giant component of the random bipartite graph T Johansson Chalmers University of Technology, 2012 | 13 | 2012 |

On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs T Johansson Random Structures & Algorithms 57 (1), 132-149, 2020 | 10 | 2020 |

Inversions in split trees and conditional Galton–Watson trees XS Cai, C Holmgren, S Janson, T Johansson, F Skerman Combinatorics, Probability and Computing 28 (3), 335-364, 2019 | 7 | 2019 |

On edge-disjoint spanning trees in a randomly weighted complete graph A Frieze, T Johansson Combinatorics, Probability and Computing 27 (2), 228-244, 2018 | 7 | 2018 |

The cover time of a biased random walk on a random cubic graph C Cooper, A Frieze, T Johansson arXiv preprint arXiv:1801.00760, 2018 | 6 | 2018 |

Minimum Cost Matching in a Random Graph with Random Costs A Frieze, T Johansson SIAM Journal on Discrete Mathematics 31 (1), 489-510, 2017 | 6 | 2017 |

Embedding small digraphs and permutations in binary trees and split trees M Albert, C Holmgren, T Johansson, F Skerman Algorithmica 82 (3), 589-615, 2020 | 3 | 2020 |

Permutations in binary trees and split trees M Albert, C Holmgren, T Johansson, F Skerman 29th International Conference on Probabilistic, Combinatorial and Asymptotic …, 2018 | 3 | 2018 |

Deletion of oldest edges in a preferential attachment graph T Johansson arXiv preprint arXiv:1610.04588, 2016 | 2 | 2016 |

Hamilton cycles in weighted Erd\H {o} sR\'enyi graphs T Johansson arXiv preprint arXiv:2012.11953, 2020 | | 2020 |

A condition for Hamiltonicity in Sparse Random Graphs with a Fixed Degree Sequence T Johansson arXiv preprint arXiv:2001.05258, 2020 | | 2020 |

Random Graphs and Algorithms T Johansson Carnegie Mellon University, 2017 | | 2017 |