| Publication | Date of Publication | Type |
|---|
Approval Ballot Triangles and Strict-Sense Ballots
(available as arXiv preprint) | 2026-01-01 | Paper |
(32-1)-Avoiding Permutations with Maximum Inversion Number
(available as arXiv preprint) | 2026-01-01 | Paper |
Lehmer Codes and the Reverse-Complement Mapping from (32-1)-Avoiding Permutations to (3-21)-Avoiding Permutations
(available as arXiv preprint) | 2026-01-01 | Paper |
Maximal Lehmer Codes for Permutations with Classical and Consecutive 321-Avoidance
(available as arXiv preprint) | 2026-01-01 | Paper |
Random Walks and the Meeting Time for Trees
(available as arXiv preprint) | 2025-01-01 | Paper |
Random Walks and the Best Meeting Time for Trees
(available as arXiv preprint) | 2025-01-01 | Paper |
The Exact Mixing Time for Trees of Fixed Order and Diameter
(available as arXiv preprint) | 2024-01-01 | Paper |
The voter basis and the admissibility of tree characters
Order | 2021-11-19 | Paper |
De Finetti lattices and magog triangles
The Electronic Journal of Combinatorics | 2021-02-16 | Paper |
Line-of-sight pursuit in monotone and scallop polygons
International Journal of Computational Geometry & Applications | 2021-02-11 | Paper |
Rendezvous in planar environments with obstacles and unknown initial distance
Artificial Intelligence | 2019-08-28 | Paper |
Network of Thrones
Math Horizons | 2018-10-29 | Paper |
Pursuit-evasion in a two-dimensional domain
Ars Mathematica Contemporanea | 2017-12-13 | Paper |
A hitting time formula for the discrete Green's function
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
The best mixing time for random walks on trees
Graphs and Combinatorics | 2017-01-13 | Paper |
The sorting hat goes to college
Mathematics Magazine | 2015-11-23 | Paper |
A leapfrog strategy for pursuit-evasion in a polygonal environment
International Journal of Computational Geometry & Applications | 2015-11-03 | Paper |
On the minimum order of k-cop-win graphs
(available as arXiv preprint) | 2015-08-05 | Paper |
| On the minimum order of k-cop-win graphs | 2015-08-05 | Paper |
Maker-breaker games on random geometric graphs
Random Structures & Algorithms | 2015-06-22 | Paper |
Visibility number of directed graphs
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Exact mixing times for random walks on trees
Graphs and Combinatorics | 2013-07-19 | Paper |
Cops and robbers on geometric graphs
Combinatorics, Probability and Computing | 2012-10-31 | Paper |
On the mixing time of geographical threshold graphs
Discrete Mathematics | 2012-04-13 | Paper |
| The Petersen graph is the smallest 3-cop-win graph | 2011-10-04 | Paper |
Connectivity of random cubic sum graphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
The Petersen graph is the smallest 3-cop-win graph
(available as arXiv preprint) | 2011-01-01 | Paper |
Exit frequency matrices for finite Markov chains
Combinatorics, Probability and Computing | 2010-10-14 | Paper |
Memoryless rules for Achlioptas processes
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Centers for random walks on trees
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Game chromatic index of graphs with given restrictions on degrees
Theoretical Computer Science | 2008-11-18 | Paper |
| On the connectivity of extremal Ramsey graphs | 2008-08-12 | Paper |
Product rule wins a competitive game
Proceedings of the American Mathematical Society | 2007-07-27 | Paper |
| scientific article; zbMATH DE number 1286465 (Why is no real title available?) | 1999-11-08 | Paper |
Random minimum length spanning trees in regular graphs
Combinatorica | 1999-05-18 | Paper |
