John Sylvester

54 papers A* 7A 4B 3C 2Journal 37Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Capturing an invisible robber using separators. Theor. Comput. Sci. Igor Potapov, Tymofii Prokopenko, John Sylvester
2026	J	`jnl`	Cops and robbers on multi-layer graphs. Discret. Appl. Math. Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2026	A*	`conf`	Temporal Exploration of Random Spanning Tree Models. SODA Samuel Baguley, Andreas Göbel, Nicolas Klodt, George Skretas, John Sylvester, Viktor Zamaraev
2026	A*	`conf`	Time-Biased Random Walks and Robustness of Expanders. SODA Sam Olesker-Taylor, Thomas Sauerwald, John Sylvester
2025	A	`conf`	Adjacency Labeling Schemes for Small Classes. ITCS Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2025	—	`conf`	Capturing an Invisible Robber Using Separators. ALGOWIN Igor Potapov, Tymofii Prokopenko, John Sylvester
2025	J	`jnl`	Capturing an Invisible Robber using Separators. CoRR Igor Potapov, Tymofii Prokopenko, John Sylvester
2025	J	`jnl`	Tangled Paths: A Random Graph Model from Mallows Permutations. Electron. J. Comb. Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2025	J	`jnl`	Temporal Exploration of Random Spanning Tree Models. CoRR Samuel Baguley, Andreas Göbel, Nicolas Klodt, George Skretas, John Sylvester, Viktor Zamaraev
2024	J	`jnl`	A new temporal interpretation of cluster editing. J. Comput. Syst. Sci. Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
2024	J	`jnl`	Adjacency Labeling Schemes for Small Classes. CoRR Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024	J	`jnl`	Boolean combinations of graphs. CoRR Sarosh Adenwalla, Samuel Braunfeld, John Sylvester, Viktor Zamaraev
2024	J	`jnl`	Cover and hitting times of hyperbolic random graphs. Random Struct. Algorithms Marcos Kiwi, Markus Schepers, John Sylvester
2024	J	`jnl`	Functionality of Random Graphs. CoRR John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024	A	`conf`	Rumors with Changing Credibility. ITCS Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester
2024	A*	`conf`	Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024	J	`jnl`	Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SIAM J. Comput. Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024	B	`conf`	Symmetric-Difference (Degeneracy) and Signed Tree Models. MFCS Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024	J	`jnl`	Symmetric-Difference (Degeneracy) and Signed Tree Models. CoRR Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
2024	J	`jnl`	The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. Algorithmica Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester
2024	J	`jnl`	The Power of Filling in Balanced Allocations. SIAM J. Discret. Math. Dimitrios Los, Thomas Sauerwald, John Sylvester
2024	A*	`conf`	Tight Bounds on Adjacency Labels for Monotone Graph Classes. ICALP Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024	J	`jnl`	Time-Biased Random Walks and Robustness of Expanders. CoRR Sam Olesker-Taylor, Thomas Sauerwald, John Sylvester
2023	A*	`conf`	Balanced Allocations with Heterogeneous Bins: The Power of Memory. SODA Dimitrios Los, Thomas Sauerwald, John Sylvester
2023	J	`jnl`	Balanced Allocations with Heterogeneous Bins: The Power of Memory. CoRR Dimitrios Los, Thomas Sauerwald, John Sylvester
2023	J	`jnl`	Bounds on the Twin-Width of Product Graphs. Discret. Math. Theor. Comput. Sci. William Pettersson, John Sylvester
2023	B	`conf`	Cops and Robbers on Multi-Layer Graphs. WG Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2023	J	`jnl`	Cops and Robbers on Multi-Layer Graphs. CoRR Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2023	J	`jnl`	Mean-Biased Processes for Balanced Allocations. CoRR Dimitrios Los, Thomas Sauerwald, John Sylvester
2023	J	`jnl`	Multiple random walks on graphs: mixing few to cover many. Comb. Probab. Comput. Nicolás Rivera, Thomas Sauerwald, John Sylvester
2023	J	`jnl`	Rumors with Changing Credibility. CoRR Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester
2023	J	`jnl`	Small But Unwieldy. CoRR Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2023	J	`jnl`	Tight bounds on adjacency labels for monotone graph classes. CoRR Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2022	C	`conf`	A New Temporal Interpretation of Cluster Editing. IWOCA Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
2022	J	`jnl`	A New Temporal Interpretation of Cluster Editing. CoRR Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
2022	A*	`conf`	Balanced Allocations: Caching and Packing, Twinning and Thinning. SODA Dimitrios Los, Thomas Sauerwald, John Sylvester
2022	J	`jnl`	Bounds on the Twin-Width of Product Graphs. CoRR William Pettersson, John Sylvester
2022	A	`conf`	Cover and Hitting Times of Hyperbolic Random Graphs. APPROX/RANDOM Marcos Kiwi, Markus Schepers, John Sylvester
2022	J	`jnl`	Cover and Hitting Times of Hyperbolic Random Graphs. CoRR Marcos Kiwi, Markus Schepers, John Sylvester
2022	J	`jnl`	The Power of Filling in Balanced Allocations. CoRR Dimitrios Los, Thomas Sauerwald, John Sylvester
2022	J	`jnl`	The power of two choices for random walks. Comb. Probab. Comput. Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
2022	J	`jnl`	Time Dependent Biased Random Walks. ACM Trans. Algorithms John Haslegrave, Thomas Sauerwald, John Sylvester
2021	J	`jnl`	Balanced Allocations: Caching and Packing, Twinning and Thinning. CoRR Dimitrios Los, Thomas Sauerwald, John Sylvester
2021	A*	`conf`	Multiple Random Walks on Graphs: Mixing Few to Cover Many. ICALP Nicolás Rivera, Thomas Sauerwald, John Sylvester
2021	J	`jnl`	Random walk hitting times and effective resistance in sparsely connected Erdős-Rényi random graphs. J. Graph Theory John Sylvester
2021	J	`jnl`	Tangled Paths: A Random Graph Model from Mallows Permutations. CoRR Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2021	C	`conf`	The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. COCOA Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester
2021	J	`jnl`	The Cover Time of a (Multiple) Markov Chain with Rational Transition Probabilities is Rational. CoRR John Sylvester
2020	A	`conf`	Choice and Bias in Random Walks. ITCS Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
2020	J	`jnl`	Multiple Random Walks on Graphs: Mixing Few to Cover Many. CoRR Nicolás Rivera, Thomas Sauerwald, John Sylvester
2020	J	`jnl`	Time Dependent Biased Random Walks. CoRR John Haslegrave, Thomas Sauerwald, John Sylvester
2019	B	`conf`	The Dispersion Time of Random Walks on Finite Graphs. SPAA Nicolás Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester
2019	J	`jnl`	The Power of Two Choices for Random Walks. CoRR Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
2018	J	`jnl`	The dispersion time of random walks on finite graphs. CoRR Nicolas Rivera, Alexandre Stauffer, Thomas Sauerwald, John Sylvester