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

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

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 | 6 | 2019 |

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 | 5 | 2018 |

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

On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph A Frieze, T Johansson Combinatorics, Probability and Computing 27 (2), 228-244, 2018 | 4 | 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 | 3 | 2017 |

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

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

On Hamilton cycles in Erd\H {o} sR\'{e} nyi subgraphs of large graphs T Johansson arXiv preprint arXiv:1811.03501, 2018 | 1 | 2018 |

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

Sannolikhet, statistik och kombinatorik: Scaling limits of odometers in sandpile models T Johansson Uppsala University, Sweden, 2019 | | 2019 |

Sannolikhet, statistik och kombinatorik: Spectral asymptotics on random Sierpinski gaskets T Johansson Uppsala universitet, 2019 | | 2019 |

Probability, statistics and combinatorics: Spectral asymptotics on random Sierpinski gaskets T Johansson Uppsala University, Sweden, 2019 | | 2019 |

Embedding small digraphs and permutations in binary trees and split trees M Albert, C Holmgren, T Johansson, F Skerman Algorithmica, 1-27, 2019 | | 2019 |

Sannolikhet, statistik och kombinatorik: Cutting resilient networks T Johansson Uppsala universitet, 2018 | | 2018 |

The cover time of a biased random walk on a random regular graph of odd degree T Johansson arXiv preprint arXiv:1805.05780, 2018 | | 2018 |

Sannolikhets-och statistikseminarium: Colouring Hamilton Cycles Online T Johansson Uppsala universitet, 2018 | | 2018 |

En mångprofessionell samarbetsstig inom social-och hälsovården för papperslösa: Projekt Papperslösa 2018-de icke önskade? C Wikstrand, M Walldén, P Häggblom, M Andersson, T Johansson, ... Yrkeshögskolan Novia, 2018 | | 2018 |

Inversions in split trees and conditional Galton--Watson trees X Shi Cai, C Holmgren, S Janson, T Johansson, F Skerman arXiv preprint arXiv:1709.00216, 2017 | | 2017 |