The Dispersion Time of Random Walks on Finite Graphs. - Nicolás Rivera; Thomas Sauerwald; Alexandre Stauffer; John Sylvester 001 (SPAA, 2019)

Choice and Bias in Random Walks. - Agelos Georgakopoulos; John Haslegrave; Thomas Sauerwald; John Sylvester 001 (ITCS, 2020)

The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. - Jessica A. Enright; Duncan Lee; Kitty Meeks; William Pettersson; John Sylvester 001 (COCOA, 2021)

The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational. - John Sylvester 001 (CoRR, 2021)

Random walk hitting times and effective resistance in sparsely connected Erdős-Rényi random graphs. - John Sylvester 001 (J. Graph Theory, 2021)

Balanced Allocations: Caching and Packing, Twinning and Thinning. - Dimitrios Los; Thomas Sauerwald; John Sylvester 001 (SODA, 2022)

The power of two choices for random walks. - Agelos Georgakopoulos; John Haslegrave; Thomas Sauerwald; John Sylvester 001 (Comb. Probab. Comput., 2022)

Time Dependent Biased Random Walks. - John Haslegrave; Thomas Sauerwald; John Sylvester 001 (ACM Trans. Algorithms, 2022)

Balanced Allocations with Heterogeneous Bins: The Power of Memory. - Dimitrios Los; Thomas Sauerwald; John Sylvester 001 (SODA, 2023)

Cops and Robbers on Multi-Layer Graphs. - Jessica A. Enright; Kitty Meeks; William Pettersson; John Sylvester 001 (WG, 2023)

Small But Unwieldy. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (CoRR, 2023)

Mean-Biased Processes for Balanced Allocations. - Dimitrios Los; Thomas Sauerwald; John Sylvester 001 (CoRR, 2023)

Multiple random walks on graphs: mixing few to cover many. - Nicolás Rivera; Thomas Sauerwald; John Sylvester 001 (Comb. Probab. Comput., 2023)

Bounds on the Twin-Width of Product Graphs. - William Pettersson; John Sylvester 001 (Discret. Math. Theor. Comput. Sci., 2023)

Tight Bounds on Adjacency Labels for Monotone Graph Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (ICALP, 2024)

Rumors with Changing Credibility. - Charlotte Out; Nicolás Rivera; Thomas Sauerwald; John Sylvester 001 (ITCS, 2024)

Symmetric-Difference (Degeneracy) and Signed Tree Models. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev (MFCS, 2024)

Time-Biased Random Walks and Robustness of Expanders. - Sam Olesker-Taylor; Thomas Sauerwald; John Sylvester 001 (CoRR, 2024)

Boolean combinations of graphs. - Sarosh Adenwalla; Samuel Braunfeld; John Sylvester 001; Viktor Zamaraev (CoRR, 2024)

Functionality of Random Graphs. - John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (CoRR, 2024)

A new temporal interpretation of cluster editing. - Cristiano Bocci; Chiara Capresi; Kitty Meeks; John Sylvester 001 (J. Comput. Syst. Sci., 2024)

Cover and hitting times of hyperbolic random graphs. - Marcos Kiwi; Markus Schepers; John Sylvester 001 (Random Struct. Algorithms, 2024)

Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (SIAM J. Comput., 2024)

The Power of Filling in Balanced Allocations. - Dimitrios Los; Thomas Sauerwald; John Sylvester 001 (SIAM J. Discret. Math., 2024)

The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. - Jessica A. Enright; Duncan Lee; Kitty Meeks; William Pettersson; John Sylvester 001 (Algorithmica, 2024)

Adjacency Labeling Schemes for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev (ITCS, 2025)

Tangled Paths: A Random Graph Model from Mallows Permutations. - Jessica A. Enright; Kitty Meeks; William Pettersson; John Sylvester 001 (Electron. J. Comb., 2025)