Browse by People

Los, Dimitrios, Sauerwald, Thomas and Sylvester, John ORCID: 0000-0002-6543-2934 (2023) Balanced Allocations with Heterogeneous Bins: The Power of Memory. [Preprint]

Los, Dimitrios, Sauerwald, Thomas and Sylvester, John ORCID: 0000-0002-6543-2934 (2023) Balanced Allocations with Heterogeneous Bins: The Power of Memory. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

Los, Dimitrios, Sauerwald, Thomas and Sylvester, John ORCID: 0000-0002-6543-2934 (2022) Balanced Allocations: Caching and Packing, Twinning and Thinning. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, pp. 1847-1874. ISBN 9781611977073

Pettersson, William and Sylvester, John ORCID: 0000-0002-6543-2934 (2023) Bounds on the Twin-Width of Product Graphs. Discrete Mathematics & Theoretical Computer Science, vol. 2 (Graph ).

Pettersson, William and Sylvester, John ORCID: 0000-0002-6543-2934 (2023) Bounds on the Twin-Width of Product Graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 25 (1).

Enright, Jessica, Lee, Duncan, Meeks, Kitty, Pettersson, William and Sylvester, John ORCID: 0000-0002-6543-2934 (2021) The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. In: Combinatorial Optimization and Applications. Lecture Notes in Computer Science, 13135 . Springer International Publishing, pp. 152-166. ISBN 978-3-030-92680-9

Jessica, Enright, William, Pettersson, Kitty, Meeks and Sylvester, John ORCID: 0000-0002-6543-2934 (2023) Cops and Robbers on Multi-Layer Graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023).

Rivera, Nicolas, Sauerwald, Thomas, Stauffer, Alexandre and Sylvester, John ORCID: 0000-0002-6543-2934 (2019) The Dispersion Time of RandomWalks on Finite Graphs. In: SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures.

Rivera, Nicolas, Sauerwald, Thomas and Sylvester, John ORCID: 0000-0002-6543-2934 (2023) Multiple random walks on graphs: mixing few to cover many. COMBINATORICS PROBABILITY & COMPUTING, 32 (4). pp. 1-44.

Bocci, Cristiano, Capresi, Chiara, Meeks, Kitty and Sylvester, John ORCID: 0000-0002-6543-2934 (2022) A New Temporal Interpretation of Cluster Editing. [Preprint]

Los, Dimitrios, Sauerwald, Thomas and Sylvester, John ORCID: 0000-0002-6543-2934 (2024) The Power of Filling in Balanced Allocations. SIAM Journal on Discrete Mathematics, 38 (1). pp. 529-565.

Sylvester, John ORCID: 0000-0002-6543-2934 (2021) Random walk hitting times and effective resistance in sparsely connected Erdos-Renyi random graphs. JOURNAL OF GRAPH THEORY, 96 (1). pp. 44-84.

Out, Charlotte, Rivera, Nicolás, Sauerwald, Thomas and Sylvester, John ORCID: 0000-0002-6543-2934 (2023) Rumors with Changing Credibility. In: 15th Innovations in Theoretical Computer Science (ITCS24).

Bonnet, Édouard, Duron, Julien, Sylvester, John ORCID: 0000-0002-6543-2934, Zamaraev, Viktor and Zhukovskii, Maksim (2023) Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. In: ACM-SIAM Symposium on Discrete Algorithms (SODA24).

Haslegrave, John, Sauerwald, Thomas and Sylvester, John ORCID: 0000-0002-6543-2934 (2022) Time Dependent Biased Random Walks. ACM TRANSACTIONS ON ALGORITHMS, 18 (2). pp. 1-30.

Sylvester, John ORCID: 0000-0002-6543-2934 (2022) The cover time of a (multiple) Markov chain with rational transition probabilities is rational. STATISTICS & PROBABILITY LETTERS, 187. p. 109534.

Georgakopoulos, Agelos, Haslegrave, John, Sauerwald, Thomas and Sylvester, John ORCID: 0000-0002-6543-2934 (2022) The power of two choices for random walks. COMBINATORICS PROBABILITY & COMPUTING, 31 (1). pp. 73-100.