Tony Johansson

MaRDI QIDQ2205122zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The cover time of a biased random walk on a random regular graph of odd degree (available as arXiv preprint)	2021-08-04	Paper
Permutations in binary trees and split trees (available as arXiv preprint)	2021-06-15	Paper
Inversions in split trees and conditional Galton-Watson trees (available as arXiv preprint)	2021-06-15	Paper
The cover time of a biased random walk on a random cubic graph (available as arXiv preprint)	2021-06-15	Paper
Hamilton cycles in weighted Erd\H{o}s-R\'enyi graphs	2020-12-22	Paper
The cover time of a biased random walk on a random regular graph of odd degree The Electronic Journal of Combinatorics	2020-10-20	Paper
On Hamilton cycles in Erdős-Rényi subgraphs of large graphs Random Structures & Algorithms	2020-09-16	Paper
Inversions in split trees and conditional Galton-Watson trees Combinatorics, Probability and Computing	2020-04-06	Paper
Embedding small digraphs and permutations in binary trees and split trees Algorithmica	2020-02-06	Paper
A condition for Hamiltonicity in Sparse Random Graphs with a Fixed Degree Sequence	2020-01-15	Paper
On the insertion time of random walk cuckoo hashing Random Structures & Algorithms	2019-08-14	Paper
On the insertion time of random walk cuckoo hashing Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph Combinatorics, Probability and Computing	2018-05-24	Paper
The cover time of a biased random walk on a random regular graph of odd degree (available as arXiv preprint)	2018-05-12	Paper
On random \(k\)-out subgraphs of large graphs Random Structures & Algorithms	2017-04-18	Paper
Minimum cost matching in a random graph with random costs SIAM Journal on Discrete Mathematics	2017-03-16	Paper
Deletion of oldest edges in a preferential attachment graph	2016-10-14	Paper

Research outcomes over time

This page was built for person: Tony Johansson