Research outputs
Selected research outputs
- Temporal Exploration of Random Spanning Tree Models (Conference Paper - 2025)
- Time-Biased Random Walks and Robustness of Expanders (Conference Paper - 2025)
- Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes (Journal article - 2024)
- Cover and Hitting Times of Hyperbolic Random Graphs (Journal article - 2024)
- Balanced Allocations with Heterogeneous Bins: The Power of Memory (Conference Paper - 2023)
2026
Capturing an Invisible Robber Using Separators
Potapov, I., Prokopenko, T., & Sylvester, J. (2026). Capturing an Invisible Robber Using Separators. In Unknown Conference (pp. 181-195). Springer Nature Switzerland. doi:10.1007/978-3-032-09120-8_13
2025
Temporal Exploration of Random Spanning Tree Models
Baguley, S., Göbel, A., Klodt, N., Skretas, G., Sylvester, J., & Zamaraev, V. (n.d.). Temporal Exploration of Random Spanning Tree Models. In 37th ACM-SIAM Symposium on Discrete Algorithms (SODA 2026). SIAM.
Time-Biased Random Walks and Robustness of Expanders
Olesker-Taylor, S., Sauerwald, T., & Sylvester, J. (n.d.). Time-Biased Random Walks and Robustness of Expanders. In 37th ACM-SIAM Symposium on Discrete Algorithms (SODA 2026). SIAM.
Tangled Paths: A Random Graph Model from Mallows Permutations
Enright, J., Meeks, K., Pettersson, W., & Sylvester, J. (2025). Tangled Paths: A Random Graph Model from Mallows Permutations. The Electronic Journal of Combinatorics, 32(2). doi:10.37236/11602
2024
Adjacency Labeling Schemes for Small Classes
Bonnet, É., Duron, J., Sylvester, J., & Zamaraev, V. (n.d.). Adjacency Labeling Schemes for Small Classes. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). doi:10.4230/LIPIcs.ITCS.2025.45
A New Temporal Interpretation of Cluster Editing
Bocci, C., Capresi, C., Meeks, K., & Sylvester, J. (2024). A New Temporal Interpretation of Cluster Editing. Journal of Computer and System Sciences.
Symmetric-Difference (Degeneracy) and Signed Tree Models
Bonnet, É., Duron, J., Sylvester, J., & Zamaraev, V. (2024). Symmetric-Difference (Degeneracy) and Signed Tree Models. In Leibniz International Proceedings in Informatics Vol. 306. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik. doi:10.4230/LIPIcs.MFCS.2024.24
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
Enright, J., Lee, D., Meeks, K., Pettersson, W., & Sylvester, J. (2024). The complexity of finding and enumerating optimal subgraphs to represent spatial correlation. Algorithmica.
Cover and Hitting Times of Hyperbolic Random Graphs
Kiwi, M., Schepers, M., & Sylvester, J. (2024). Cover and Hitting Times of Hyperbolic Random Graphs. Random structures & algorithms (Print).
Tight Bounds on Adjacency Labels for Monotone Graph Classes
Édouard, B., Julien, D., Sylvester, J., Viktor, Z., & Maksim, Z. (n.d.). Tight Bounds on Adjacency Labels for Monotone Graph Classes. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). doi:10.4230/LIPIcs.ICALP.2024.96
Rumors with changing credibility
Out, C., Rivera, N., Sauerwald, T., & Sylvester, J. (2024). Rumors with changing credibility. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 287. doi:10.4230/LIPIcs.ITCS.2024.86
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
Bonnet, E., Duron, J., Sylvester, J., Zamaraev, V., & Zhukovskii, M. (2024). Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. In Unknown Conference (pp. 1147-1165). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611977912.44
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
Bonnet, É., Duron, J., Sylvester, J., Zamaraev, V., & Zhukovskii, M. (2024). Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SIAM Journal on Computing, 53(5), 1578-1601. doi:10.1137/23m1618661
The Power of Filling in Balanced Allocations
Los, D., Sauerwald, T., & Sylvester, J. (2024). The Power of Filling in Balanced Allocations. SIAM Journal on Discrete Mathematics, 38(1), 529-565. doi:10.1137/23m1552231
2023
Cops and Robbers on Multi-Layer Graphs
Jessica, E., William, P., Kitty, M., & Sylvester, J. (2023). Cops and Robbers on Multi-Layer Graphs. In International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2023). doi:10.1007/978-3-031-43380-1_23
Multiple random walks on graphs: mixing few to cover many
Rivera, N., Sauerwald, T., & Sylvester, J. (2023). Multiple random walks on graphs: mixing few to cover many. COMBINATORICS PROBABILITY & COMPUTING. doi:10.1017/S0963548322000372
Balanced Allocations with Heterogeneous Bins: The Power of Memory
Los, D., Sauerwald, T., & Sylvester, J. (2023). Balanced Allocations with Heterogeneous Bins: The Power of Memory. In Unknown Conference (pp. 4448-4477). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611977554.ch169
Bounds on the Twin-Width of Product Graphs
Pettersson, W., & Sylvester, J. (2023). Bounds on the Twin-Width of Product Graphs. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 25(1). Retrieved from https://www.webofscience.com/
Tight bounds on adjacency labels for monotone graph classes.
2022
Cover and Hitting Times of Hyperbolic Random Graphs
Kiwi, M., Schepers, M., & Sylvester, J. (2022). Cover and Hitting Times of Hyperbolic Random Graphs. In Leibniz International Proceedings in Informatics Lipics Vol. 245. doi:10.4230/LIPIcs.APPROX/RANDOM.2022.30
The cover time of a (multiple) Markov chain with rational transition probabilities is rational
Sylvester, J. (2022). The cover time of a (multiple) Markov chain with rational transition probabilities is rational. STATISTICS & PROBABILITY LETTERS, 187. doi:10.1016/j.spl.2022.109534
Time Dependent Biased Random Walks
Haslegrave, J., Sauerwald, T., & Sylvester, J. (2022). Time Dependent Biased Random Walks. ACM TRANSACTIONS ON ALGORITHMS, 18(2). doi:10.1145/3498848
A New Temporal Interpretation of Cluster Editing
Bocci, C., Capresi, C., Meeks, K., & Sylvester, J. (2022). A New Temporal Interpretation of Cluster Editing. In Unknown Book (Vol. 13270, pp. 214-227). doi:10.1007/978-3-031-06678-8_16
Balanced Allocations: Caching and Packing, Twinning and Thinning
Los, D., Sauerwald, T., & Sylvester, J. (2022). Balanced Allocations: Caching and Packing, Twinning and Thinning. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1847-1874). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611977073.74
The power of two choices for random walks
Georgakopoulos, A., Haslegrave, J., Sauerwald, T., & Sylvester, J. (2022). The power of two choices for random walks. COMBINATORICS PROBABILITY & COMPUTING, 31(1), 73-100. doi:10.1017/S0963548321000183
2021
Multiple random walks on graphs: Mixing few to cover many
Rivera, N., Sauerwald, T., & Sylvester, J. (2021). Multiple random walks on graphs: Mixing few to cover many. In Leibniz International Proceedings in Informatics Lipics Vol. 198. doi:10.4230/LIPIcs.ICALP.2021.107
Random walk hitting times and effective resistance in sparsely connected Erdos-Renyi random graphs
Sylvester, J. (2021). Random walk hitting times and effective resistance in sparsely connected Erdos-Renyi random graphs. JOURNAL OF GRAPH THEORY, 96(1), 44-84. doi:10.1002/jgt.22551
The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation
Enright, J., Lee, D., Meeks, K., Pettersson, W., & Sylvester, J. (2021). The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. In Unknown Book (Vol. 13135, pp. 152-166). doi:10.1007/978-3-030-92681-6_13
2020
Choice and bias in random walks
Georgakopoulos, A., Haslegrave, J., Sauerwald, T., & Sylvester, J. (2020). Choice and bias in random walks. In Leibniz International Proceedings in Informatics Lipics Vol. 151. doi:10.4230/LIPIcs.ITCS.2020.76
2019
The Dispersion Time of RandomWalks on Finite Graphs
Rivera, N., Sauerwald, T., Stauffer, A., & Sylvester, J. (2019). The Dispersion Time of RandomWalks on Finite Graphs. In SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019 (pp. 103-113). doi:10.1145/3323165.3323204